Related papers: Nonlinear Graphon mean-field systems

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…

We establish a connection between tagged particles and size-biased empirical processes in interacting particle systems, in analogy to classical results on the propagation of chaos. In a mean-field scaling limit, the evolution of the…

We use probabilistic methods to study properties of mean-field models, arising as large-scale limits of certain particle systems with mean-field interaction. The underlying particle system is such that $n$ particles move forward on the real…

This paper considers the family of invariant measures of Markovian mean-field interacting particle systems on a countably infinite state space and studies its large deviation asymptotics. The Freidlin-Wentzell quasipotential is the usual…

We consider a many particle quantum system, in which each particle interacts only with its nearest neighbours. Provided that the energy per particle has an upper bound, we show, that the energy distribution of almost every product state…

Graphons are analytic objects representing convergent sequences of large graphs. A graphon is said to be finitely forcible if it is determined by finitely many subgraph densities, i.e., if the asymptotic structure of graphs represented by…

In this article we study a system of $N$ particles, each of them being defined by the couple of a position (in $\mathbb{R}^d$) and a so-called orientation which is an element of a compact Riemannian manifold. This orientation can be seen as…

We study the asymptotics of the point process induced by an interacting particle system with mean-field drift interaction. Under suitable assumptions, we establish propagation of chaos for this point process: it has the same weak limit as…

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

We prove a Poisson limit theorem in the total variation distance of functionals of a general Poisson point process using the Malliavin-Stein method. Our estimates only involve first and second order difference operators and are closely…

Intense efforts have been made in recent years to realize nonlinear optical interactions at the single-photon level. Much of this work has focused on achieving strong third-order nonlinearities, such as by using single atoms or other…

We consider a quantum system constituted by $N$ identical particles interacting by means of a mean-field Hamiltonian. It is well known that, in the limit $N\to\infty$, the one-particle state obeys to the Hartree equation. Moreover,…

In the theory of dense graph limits, a graphon is a symmetric measurable function $W:[0,1]^2\to [0,1]$. Each graphon gives rise naturally to a random graph distribution, denoted $\mathbb{G}(n,W)$, that can be viewed as a generalization of…

We study fluctuations of mean-field interacting particle systems around their McKean--Vlasov limit. Our main result provides a uniform-in-time quantitative central limit theorem for the fluctuation process, with convergence rate of order…

Networks of coupled nonlinear oscillators have been used to model circadian rhythms, flashing fireflies, Josephson junction arrays, high-voltage electric grids, and many other kinds of self-organizing systems. Recently, several authors have…

To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in…

We consider finite and infinite systems of particles on the real line and half-line evolving in continuous time. Hereby, the particles are driven by i.i.d. L\'{e}vy processes endowed with rank-dependent drift and diffusion coefficients. In…

L. Lov\'asz and B. Szegedy proved in 2006 that the limits of convergent graph sequences can be described by measurable symmetric functions $W: [0, 1]\times [0, 1]\to [0, 1]$ called graphons. In our present paper we investigate the structure…

Graphons are limit objects of sequences of graphs and are used to analyze the behavior of large graphs. Recently, graphon signal processing has been developed to study signal processing on large graphs. A major limitation of this approach…