Related papers: Large deviations for marked sparse random graphs w…
We study using large deviation theory the fluctuations of time-integrated functionals or observables of the unbiased random walk evolving on Erd\"os-R\'enyi random graphs, and construct a modified, biased random walk that explains how these…
Consider an interacting particle system indexed by the vertices of a (possibly random) locally finite graph whose vertices and edges are equipped with marks representing parameters of the model such as the environment and initial…
Diffusion models over discrete spaces have recently shown striking empirical success, yet their theoretical foundations remain incomplete. In this paper, we study the sampling efficiency of score-based discrete diffusion models under a…
A $\delta$ once-reinforced random walk ($\delta$-ORRW) on connected graph is a self-interacting random walk which moves to its neighbors at each step according to the weights of the edges at that time, where the weights are $1$ on edges…
In this paper we consider the problem of estimating the joint upper and lower tail large deviations of the edge eigenvalues of an Erd\H{o}s-R\'enyi random graph $\mathcal{G}_{n,p}$, in the regime of $p$ where the edge of the spectrum is no…
In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
In the evolving voter model, when an individual interacts with a neighbor having an opinion different from theirs, they will with probability $1-\alpha$ imitate the neighbor but with probability $ \alpha$ will sever the connection and…
We establish a process level large deviation principle for systems of interacting Bessel-like diffusion processes. By establishing weak uniqueness for the limiting non-local SDE of McKean-Vlasov type, we conclude that the latter describes…
The problem of aligning Erd\"os-R\'enyi random graphs is a noisy, average-case version of the graph isomorphism problem, in which a pair of correlated random graphs is observed through a random permutation of their vertices. We study a…
For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\em discrepancy} between the maximum and minimum loads among all vertices. For this problem, this…
We consider a system of $N^{d}$ spins in random environment with a random local mean field type interaction. Each spin has a fixed spatial position on the torus $\mathbb{T}^{d}$, an attached random environment and a spin value in…
We consider the Ising model for two interacting groups of spins embedded in an Erd\"{o}s-R\'{e}nyi random graph. The critical properties of the system are investigated by means of extensive Monte Carlo simulations. Our results evidence the…
In this article, we develop a framework to study the large deviation principle for matrix models and their quantized versions, by tilting the measures using the limits of spherical integrals obtained in [46,47]. As examples, we obtain 1. a…
We consider two Ito equations that evolve on different time scales. The equations are fully coupled in the sense that all coefficients may depend on both the "slow" and the "fast" processes and the diffusion terms may be correlated. The…
We prove a large deviation principle for the point process associated to $k$-element connected components in $\mathbb R^d$ with respect to the connectivity radii $r_n\to\infty$. The random points are generated from a homogeneous Poisson…
We present an algorithm to estimate fast and accurate depth maps from light fields via a sparse set of depth edges and gradients. Our proposed approach is based around the idea that true depth edges are more sensitive than texture edges to…
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_N(\tfrac{i}{N},\tfrac{j}{N})$,…
For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t =…
The configuration model is a sequence of random graphs constructed such that in the large network limit the degree distribution converges to a pre-specified probability distribution. The component structure of such random graphs can be…