Related papers: A sample-path large deviation principle for dynami…
This article gives an overview of the emerging literature on large deviations for random graphs. Written for the general mathematical audience, the article begins with a short introduction to the theory of large deviations. This is followed…
We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…
We consider a continuous time Markov chain on a countable state space. We prove a joint large deviation principle (LDP) of the empirical measure and current in the limit of large time interval. The proof is based on results on the joint…
Motivated by the Beck-Fiala conjecture, we study the discrepancy problem in two related models of random hypergraphs on $n$ vertices and $m$ edges. In the first (edge-independent) model, a random hypergraph $H_1$ is constructed by fixing a…
The aim of the paper is to establish a large deviation principle (LDP) for the empirical measure of mean-field interacting diffusions in a random environment. The point is to derive such a result once the environment has been frozen…
The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…
We extend the Erd\H os-R\' enyi law of large numbers to the averaging setup both in discrete and continuous time cases. We consider both stochastic processes and dynamical systems as fast motions whenever they are fast mixing and satisfy…
Computing the maximum size of an independent set in a graph is a famously hard combinatorial problem that has been well-studied for various classes of graphs. When it comes to random graphs, only the classical Erd\H{o}s-R\'enyi-Gilbert…
This paper deals with rare events in a general {interacting gas} at high temperature, by means of Large Deviations Principles. The main result is an LDP for the tagged empirical field, which features the competition of an energy term and an…
We take the point of view of a particle performing random walk with bounded jumps on $\mathbb{Z}^d$ in a stationary and ergodic random environment. We prove the quenched large deviation principle (LDP) for the pair empirical measure of the…
We consider the stationary measure of the asymmetric simple exclusion process (ASEP) on a finite interval in $\mathbb{Z}$ with open boundaries. Fixing all the jump rates and letting the system size approach infinity, the height profile of…
We investigate the large deviation principle (LDP) of the stationary solutions of stochastic functional differential equations (SFDEs) with infinite delay under small random perturbation. First, we demonstrate the existence and uniqueness…
We study the spectral gap of the Erd\H{o}s--R\'enyi random graph through the connectivity threshold. In particular, we show that for any fixed $\delta > 0$ if $$p \ge \frac{(1/2 + \delta) \log n}{n},$$ then the normalized graph Laplacian of…
We study Turing bifurcations on one-dimensional random ring networks where the probability of a connection between two nodes depends on the distance between the two nodes. Our approach uses the theory of graphons to approximate the graph…
In this paper we consider a dynamic Erd\H{o}s-R\'enyi graph in which edges, according to an alternating renewal process, change from present to absent and vice versa. The objective is to estimate the on- and off-time distributions while…
We establish a large deviation principle for the empirical measure process associated with a general class of finite-state mean field interacting particle systems with Lipschitz continuous transition rates that satisfy a certain ergodicity…
Random graphs with latent geometric structure are popular models of social and biological networks, with applications ranging from network user profiling to circuit design. These graphs are also of purely theoretical interest within…
The classical random graph model $G(n,\lambda/n)$ satisfies a `duality principle', in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved…
We study high-dimensional random geometric graphs (RGGs) of edge-density $p$ with vertices uniformly distributed on the $d$-dimensional torus and edges inserted between sufficiently close vertices with respect to an $L_q$-norm. We focus on…
This paper shows the equivalence class definition of graphons hinders a direct development of dynamics on the graphon space, and hence proposes a state-driven approach to obtain dynamic graphons. The state-driven dynamic graphon model…