Related papers: Large-deviations/thermodynamic approach to percola…

We compute the joint large deviation rate functional in the limit of large time for the current flowing through the edges of a finite graph on which a boundary-driven system of stochastic particles evolves with zero-range dynamics.This…

What does an Erdos-Renyi graph look like when a rare event happens? This paper answers this question when p is fixed and n tends to infinity by establishing a large deviation principle under an appropriate topology. The formulation and…

We introduce a numerical procedure to evaluate directly the probabilities of large deviations of physical quantities, such as current or density, that are local in time. The large-deviation functions are given in terms of the typical…

We study the stochastic block model which is often used to model community structures and study community-detection algorithms. We consider the case of two blocks in regard to its largest connected component and largest biconnected…

Understanding transport processes in complex nanoscale systems, like ionic conductivities in nanofluidic devices or heat conduction in low dimensional solids, poses the problem of examining fluctuations of currents within nonequilibrium…

We show that for all $d\in \{3,\ldots,n-1\}$ the size of the largest component of a random $d$-regular graph on $n$ vertices around the percolation threshold $p=1/(d-1)$ is $\Theta(n^{2/3})$, with high probability. This extends known…

We study probabilities of rare events in the general coalescence process, $kA\rightarrow \ell A$, where $k>\ell$. For arbitrary $k, \ell$, by rewriting these probabilities in terms of an effective action, we derive the large deviation…

Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Principle (LDP) for these random graphs, viewed as elements of…

Using the weak convergence approach to large deviations, we formulate and prove the large deviation principle (LDP) for W-random graphs in the cut-norm topology. This generalizes the LDP for Erd\H{o}s-R{\' e}nyi random graphs by Chatterjee…

For a fixed degree sequence $\mathcal{D}=(d_1,...,d_n)$, let $G(\mathcal{D})$ be a uniformly chosen (simple) graph on $\{1,...,n\}$ where the vertex $i$ has degree $d_i$. In this paper we determine whether $G(\mathcal{D})$ has a giant…

Consider a 2-dimensional soft random geometric graph $G(\lambda,s,\phi)$, obtained by placing a Poisson($\lambda s^2$) number of vertices uniformly at random in a square of side $s$, with edges placed between each pair $x,y$ of vertices…

We consider the Erd\"{o}s--R\'{e}nyi random graph $G_{n,p}$ and we analyze the simple irreversible epidemic process on the graph, known in the literature as bootstrap percolation. We give a quantitative version of some results by Janson et…

We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for…

We present an efficient approach, based on a number-conditioned master equation, for large-deviation analysis in mesoscopic transports. Beyond the conventional full-counting-statistics study, the large-deviation approach encodes complete…

The theory of large deviations is concerned with the exponential decay of probabilities of large fluctuations in random systems. These probabilities are important in many fields of study, including statistics, finance, and engineering, as…

We investigate large deviations for the empirical measure of the position and momentum of a particle traveling in a box with hot walls. The particle travels with uniform speed from left to right, until it hits the right boundary. Then it is…

We consider a two-dimensional Hamiltonian system perturbed by a small diffusion term, whose coefficient is state-dependent and non-degenerate. As a result, the process consists of the fast motion along the level curves and slow motion…

We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…

We study the appearance of the giant component in random subgraphs of a given large finite graph G=(V,E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then…

We consider a one-dimensional XX spin chain in a nonequilibrium setting with a Lindblad-type boundary driving. By calculating large deviation rate function in the thermodynamic limit, being a generalization of free energy to a…