EUVIMEDEUVIMED entdecken
Crossref

Local weak convergence for sparse networks of interacting processes

Daniel Lacker, Kavita Ramanan, Ruoyu Wu

The Annals of Applied Probability · 01.04.2023 · 33 (2) · 843-888

DOI: 10.1214/22-aap1830 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Annals of Applied Probability, erschienen am 01.04.2023. Verfasst von Daniel Lacker und 2 weiteren Autor:innen. Die Arbeit wurde bisher 30-mal zitiert (Crossref) und nennt 41 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study the limiting behavior of interacting particle systems indexed by large sparse graphs, which evolve either according to a discrete time Markov chain or a diffusion, in which particles interact directly only with their nearest neighbors in the graph. To encode sparsity we work in the framework of local weak convergence of marked (random) graphs. We show that the joint law of the particle system varies continuously with respect to local weak convergence of the underlying graph marked with the initial conditions. In addition, we show that the global empirical measure converges to a nonrandom limit for a large class of graph sequences including sparse Erdős–Rényi graphs and configuration models, whereas the empirical measure of the connected component of a uniformly random vertex converges to a random limit. Along the way, we develop some related results on the time-propagation of ergodicity and empirical field convergence, as well as some general results on local weak convergence of Gibbs measures in the uniqueness regime which appear to be new. The results obtained here are also useful for obtaining autonomous descriptions of marginal dynamics of interacting diffusions and Markov chains on sparse graphs. While limits of interacting particle systems on dense graphs have been extensively studied, there are relatively few works that have studied the sparse regime in generality.

Zitieren

APA

Lacker, D., Ramanan, K., & Wu, R. (2023). Local weak convergence for sparse networks of interacting processes. The Annals of Applied Probability, 33(2), 843-888. https://doi.org/10.1214/22-aap1830

Vancouver

Lacker D, Ramanan K, Wu R. Local weak convergence for sparse networks of interacting processes. The Annals of Applied Probability. 2023;33(2):843-888. doi:10.1214/22-aap1830

BibTeX
@article{Lacker2023,
  author = {Lacker, Daniel and Ramanan, Kavita and Wu, Ruoyu},
  title = {Local weak convergence for sparse networks of interacting processes},
  journal = {The Annals of Applied Probability},
  year = {2023},
  volume = {33},
  number = {2},
  pages = {843--888},
  doi = {10.1214/22-aap1830}
}
Kostenlos starten →