Related papers: Large deviations for marked sparse random graphs w…
Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…
We extend the classical edge-triangle Exponential Random Graph Model (ERGM) to an inhomogeneous setting in which vertices carry types determined by an underlying partition. This leads to a block-structured ERGM where interaction parameters…
Inference and optimization of real-value edge variables in sparse graphs are studied using the Bethe approximation and replica method of statistical physics. Equilibrium states of general energy functions involving a large set of real…
In this paper we describe a triple correspondence between graph limits, information theory and group theory. We put forward a new graph limit concept called log-convergence that is closely connected to dense graph limits but its main…
We prove a large deviations principle for the total spin and the number of edges under the annealed Ising measure on generalized random graphs. We also give detailed results on how the annealing over the Ising model changes the degrees of…
Viral spread on large graphs has many real-life applications such as malware propagation in computer networks and rumor (or misinformation) spread in Twitter-like online social networks. Although viral spread on large graphs has been…
We study diffusion-type equations supported on structures that are randomly varying in time. After settling the issue of well-posedness, we focus on the asymptotic behavior of solutions: our main result gives sufficient conditions for…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
Motivated by the community detection problem in Bayesian inference, as well as the recent explosion of interest in spin glasses from statistical physics, we study the classical Glauber dynamics for sampling from Ising models with sparse…
We consider supercritical branching random walks on transitive graphs and we prove a law of large numbers for the mean displacement of the ensemble of particles, and a Stam-type central limit theorem for the empirical distributions, thus…
Population cross-diffusion systems of Shigesada-Kawasaki-Teramoto type are derived in a mean-field-type limit from stochastic, moderately interacting many-particle systems for multiple population species in the whole space. The diffusion…
In this paper, we consider the Ising model on random $d$-regular graphs (with $d\ge3$) and Erd\"os-R\'enyi graphs $G(n,d/n)$ (with $d>1$) at the critical temperature. We prove that the \textit{magnetization}, i.e.\ the sum of the spins of a…
The distributionally robust optimization (DRO)-based graph neural network methods improve recommendation systems' out-of-distribution (OOD) generalization by optimizing the model's worst-case performance. However, these studies fail to…
Using the replica method, we develop an analytical approach to compute the characteristic function for the probability $\mathcal{P}_N(K,\lambda)$ that a large $N \times N$ adjacency matrix of sparse random graphs has $K$ eigenvalues below a…
How can we approximate sparse graphs and sequences of sparse graphs (with unbounded average degree)? We consider convergence in the first $k$ moments of the graph spectrum (equivalent to the numbers of closed $k$-walks) appropriately…
We investigate the SIR epidemic on a dynamic inhomogeneous Erd\H{o}s-R\'enyi random graph, in which vertices are of one of $k$ types and in which edges appear and disappear independently of each other. We establish a functional law of large…
In the classical Erd\"os-R\'enyi random graph G(n,p) there are n vertices and each of the possible edges is independently present with probability p. The random graph G(n,p) is homogeneous in the sense that all vertices have the same…
We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $\{1, \ldots, n\}$. The dynamics of this…
This paper examines a model involving two dynamic Erd\H{o}s-R\'enyi random graphs that evolve in parallel, with edges in each graph alternating between being present and absent according to specified on- and off-time distributions. A key…
We consider extended slow-fast systems of N interacting diffusions. The typical behavior of the empirical density is described by a nonlinear McKean-Vlasov equation depending on , the scaling parameter separating the time scale of the slow…