Related papers: Interacting diffusions on sparse graphs: hydrodyna…
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…
We consider interacting particle systems with unbounded interaction range on general countably infinite graphs $S$ and prove explicit non-asymptotic error bounds for approximations of the infinite-volume dynamics by systems of finitely many…
The Kuramoto model with higher-order interactions has recently been shown to exhibit bistability, explosive synchronization transitions, and rich collective dynamics. Existing analytical approaches, however, typically rely on all-to-all…
We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs…
We study a system of reaction-diffusion equations posed on a bounded domain composed of subdomains separated by a connected network with a metric graph structure. The reaction-diffusion dynamics with anisotropic diffusion on the graph edges…
We investigate energy diffusion in long-range interacting spin systems, where the interaction decays algebraically as $V(r) \propto r^{-\alpha}$ with the distance $r$ between the sites. We consider prototypical spin systems, the transverse…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…
We study a nonlocal adhesion model for two interacting tumor cell phenotypes, combining diffusion, pairwise interactions, and random phenotypic switching. The system admits a microscopic diffusion--jump particle description whose mean-field…
The mean-field limit of systems of rank-based interacting diffusions is known to be described by a nonlinear diffusion process. We obtain a similar description at the level of stationary distributions. Our proof is based on explicit…
We obtain the hydrodynamic limit of one-dimensional interacting particle systems describing the macroscopic evolution of the density of mass in infinite volume from the microscopic dynamics. The processes are weak pertubations of the…
Dynamics of interacting cold atomic gases have recently become a focus of both experimental and theoretical studies. Often cold atom systems show hydrodynamic behavior and support the propagation of nonlinear dispersive waves. Although this…
We introduce a framework to prove propagation of chaos for interacting particle systems with singular, density-dependent interactions, a classical challenge in mean-field theory. Our approach is to define the dynamics implicitly via a…
Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…
A finite range interacting particle system on a transitive graph is considered. Assuming that the dynamics and the initial measure are invariant, the normalized empirical distribution process converges in distribution to a centered…
We prove a scaling limit theorem for discrete Galton-Watson processes in varying environments. A simple sufficient condition for the weak convergence in the Skorokhod space is given in terms of probability generating functions. The limit…
We consider stochastic gradient descents on the space of large symmetric matrices of suitable functions that are invariant under permuting the rows and columns using the same permutation. We establish deterministic limits of these random…
We study topological and geometric functionals of $l_\infty$-random geometric graphs on the high-dimensional torus in a sparse regime, where the expected number of neighbors decays exponentially in the dimension. More precisely, we…
In Hazra, den Hollander and Parvaneh (2025) we analysed the friendship paradox for sparse random graphs. For four classes of random graphs we characterised the empirical distribution of the friendship biases between vertices and their…