相关论文: A Law of Large Numbers and Large Deviations for in…

This paper concerns the large deviations of a system of interacting particles on a random graph. There is no stochasticity, and the only sources of disorder are the random graph connections, and the initial condition. The average number of…

Let $\mathcal{G}(N,\frac 1Nt_N)$ be the Erd\H{o}s-R\'enyi graph with connection probability $\frac 1Nt_N\sim t/N$ as $N\to\infty$ for a fixed $t\in(0,\infty)$. We derive a large-deviations principle for the empirical measure of the sizes of…

We address the issue of the proximity of interacting diffusion models on large graphs with a uniform degree property and a corresponding mean field model, i.e. a model on the complete graph with a suitably renormalized interaction…

We consider a mean-field system of path-dependent stochastic interacting diffusions in random media over a finite time window. The interaction term is given as a function of the empirical measure and is allowed to be non-linear and path…

We consider a class of weakly interacting particle systems of mean-field type. The interactions between the particles are encoded in a graph sequence, i.e., two particles are interacting if and only if they are connected in the underlying…

We consider systems of mean-field interacting diffusions, where the pairwise interaction structure is described by a sparse (and potentially inhomogeneous) random graph. Examples include the stochastic Kuramoto model with pairwise…

We prove a Large Deviations Principle (LDP) for systems of diffusions (particles) interacting through their ranks, when the number of particles tends to infinity. We show that the limiting particle density is given by the unique solution of…

Starting with the large deviation principle (LDP) for the Erd\H{o}s-R\'enyi binomial random graph $\mathcal{G}(n,p)$ (edge indicators are i.i.d.), due to Chatterjee and Varadhan (2011), we derive the LDP for the uniform random graph…

Fokker-Planck equations represent a suitable description of the finite-time behavior for a large class of particle systems as the size of the population tends to infinity. Recently, the theory of graph limits has been introduced in the…

We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph $G_N$ with vertex set $[N] = \{1,\dots,N\}$ for which the pair of vertices $i,j \in [N]$, $i\neq j$, is connected by an edge with probability $r(\tfrac{i}{N},\tfrac{j}{N})$,…

We consider a general interacting particle system with interactions on a random graph, and study the large population limit of this system. When the sequence of underlying graphs converges to a graphon, we show convergence of the…

We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…

Consider the inhomogeneous Erd\H{o}s-R\'enyi random graph (ERRG) on $n$ vertices for which each pair $i,j\in\{1,\ldots,n\}$, $i\neq j$ is connected independently by an edge with probability $r_n(\frac{i-1}{n},\frac{j-1}{n})$, where…

Consider a system of $n$ weakly interacting particles driven by independent Brownian motions. In many instances, it is well known that the empirical measure converges to the solution of a partial differential equation, usually called…

Almost all network research has been focused on the properties of a single network that does not interact and depends on other networks. In reality, many real-world networks interact with other networks. Here we develop an analytical…

We study the near-critical behavior of the sparse Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$ on $n\gg1$ vertices, where the connection probability $p$ satisfies $np = 1+\theta(b_n^2/n)^{1/3}$, with $n^{3/10}\ll {b_n}\ll n^{1/2}$, and…

We establish a large deviation principle for time dependent trajectories (paths) of the empirical density of $N$ particles with long range interactions, for homogeneous systems. This result extends the classical kinetic theory that leads to…

Focusing on stochastic systems arising in mean-field models, the systems under consideration belong to the class of switching diffusions, in which continuous dynamics and discrete events coexist and interact. The discrete events are modeled…

There is an extensive literature on the dynamic law of large numbers for systems of quantum particles, that is, on the derivation of an equation describing the limiting individual behavior of particles inside a large ensemble of identical…

Using the weak convergence approach to large deviations, we formulate and prove the large deviation principle (LDP) for W-random graphs in the cut-norm topology. This generalizes the LDP for Erd\H{o}s-R{\' e}nyi random graphs by Chatterjee…