Weakly interacting oscillators on dense random graphs
DOI10.1017/jpr.2023.34arXiv2006.07670MaRDI QIDQ6198976
Francesca R. Nardi, Gianmarco Bet, Fabio Coppini
Publication date: 23 February 2024
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.07670
Fokker-Planck equationmean-field systemsinteracting oscillatorsMcKean-Vlasovexchangeable graphsrandom graphons
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Stochastic integral equations (60H20) Fokker-Planck equations (35Q84)
Cites Work
- Unnamed Item
- Unnamed Item
- The Kuramoto model in complex networks
- A note on dynamical models on random graphs and Fokker-Planck equations
- Mean field limit for disordered diffusions with singular interactions
- A martingale approach to the law of large numbers for weakly interacting stochastic processes
- Dynamical aspects of mean field plane rotators and the Kuramoto model
- Gibbsianness versus non-Gibbsianness of time-evolved planar rotor models
- The mean field analysis of the Kuramoto model on graphs. I: The mean field equation and transition point formulas
- Weakly interacting particle systems on inhomogeneous random graphs
- Long time dynamics for interacting oscillators on graphs
- Quenched asymptotics for interacting diffusions on inhomogeneous random graphs
- Cliques in rank-1 random graphs: the role of inhomogeneity
- Interacting diffusions on random graphs with diverging average degrees: hydrodynamics and large deviations
- The continuum limit of the Kuramoto model on sparse random graphs
- Graph limits and exchangeable random graphs
- Stochastic Graphon Games: I. The Static Case
- Big Jobs Arrive Early: From Critical Queues to Random Graphs
- A law of large numbers and large deviations for interacting diffusions on Erdős–Rényi graphs
- Approximating the Cut-Norm via Grothendieck's Inequality
- Quasi-random graphs
This page was built for publication: Weakly interacting oscillators on dense random graphs
