相关论文: Large-deviations/thermodynamic approach to percola…

The Horton-Strahler analysis is a graph-theoretic method to measure the bifurcation complexity of branching patterns, by defining a number called the order to each branch. The main result of this paper is a large deviation theorem for the…

On a large finite connected graph let edges $e$ become "open" at independent random Exponential times of arbitrary rates $w_e$. Under minimal assumptions, the time at which a giant component starts to emerge is weakly concentrated around…

We study large deviations of a ratio observable in discrete-time reset processes. The ratio takes the form of a current divided by the number of reset steps and as such it is not extensive in time. A large deviation rate function can be…

We consider a class of slow-fast processes on a connected complete Riemannian manifold $M$.The limiting dynamics as the scale separation goes to $\infty$ is governed by the averaging principle. Around this limit, we prove large deviation…

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…

Using the large-deviation formalism, we study the statistics of current fluctuations in a diffusive nonequilibrium quantum spin chain. The boundary-driven XX chain with dephasing consists of a coherent bulk hopping and a local dissipative…

We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…

The distribution of unicyclic components in a random graph is obtained analytically. The number of unicyclic components of a given size approaches a self-similar form in the vicinity of the gelation transition. At the gelation point, this…

We prove a moderate deviations principles for the size of the largest connected component in a random $d$-uniform hypergraph. The key tool is a version of the exploration process, that is also used to investigate the giant component of an…

We conjecture an explicit expression for the lower tail large deviation rate function of the partition function of the log-Gamma polymer. We rigorously prove our result, except for one step for which we only provide heuristic evidence. We…

Consider the complete graph on \(n\) vertices where each edge is independently open with probability \(p,\) or closed otherwise. Phase transitions for such graphs for \(p = \frac{C}{n}\) have previously been studied using techniques like…

In the standard formulation of the occupancy problem one considers the distribution of r balls in n cells, with each ball assigned independently to a given cell with probability 1/n. Although closed form expressions can be given for the…

Large deviation theory offers a powerful and general statistical framework to study the asymptotic dynamical properties of rare events. The application of the formalism to concrete experimental situations is, however, often restricted by…

We study simple models of intermittency, involving switching between two states, within the dynamical large-deviation formalism. Singularities appear in the formalism when switching is cooperative, or when its basic timescale diverges. In…

Local convergence techniques have become a key methodology to study sparse random graphs. However, convergence of many random graph properties does not directly follow from local convergence. A notable, and important, such random graph…

We obtain large deviation results for a two time-scale model of jump-diffusion processes. The processes on the two time scales are fully inter-dependent, the slow process has small perturbative noise and the fast process is ergodic. Our…

In this note we study the geometry of the largest component C_1 of critical percolation on a finite graph G which satisfies the finite triangle condition, defined by Borgs et al. There it is shown that this component is of size n^{2/3}, and…

We calculate the large deviations for the length of the longest alternating subsequence and for the length of the longest increasing subsequence in a uniformly random permutation that avoids a pattern of length three. We treat all six…

We prove a large deviation principle for a greedy exploration process on an Erd\"os-R\'enyi (ER) graph when the number of nodes goes to infinity. To prove our main result, we use the general strategy to study large deviations of processes…

We apply a PDE-based method to deduce the critical time and the size of the giant component of the ``triangle percolation'' on the Erd\H{o}s-R\'enyi random graph process investigated by Palla, Der\'enyi and Vicsek