arXiv (All)
open access
Mean Field Games and Control on Large Expander Graphs
This paper investigates mean field games on sparse networks. In the case of large expander graphs, the limit topologies are analyzed using the graphexon framework, which characterizes sparse connections. We prove that the associated sequence of discrete averaging operators converges strongly to a co
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries#1064362
- The minimum spectral radius of maximal outerplanar graphs#1118045
- General Leader-Follower Linear-Quadratic Stochastic Graphon Games with Indefinite Control Weights#1050370
- On the Greedoid Tutte Polynomial for simple rooted graphs#660989
- Long Cycles in 2-Connected Tough Graphs#1000101
Record · ID 1131501
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive