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

Let $\mathcal{T}_n$ be the set of all mappings $T:[n]\to[n]$, where $[n]=\{1,2,\ldots,n\}$. The corresponding graph $G_T$ of $T$, called a functional digraph, is a union of disjoint connected components. Each component is a directed cycle…

We consider real-valued branching random walks and prove a large deviation result for the position of the rightmost particle. The position of the rightmost particle is the maximum of a collection of a random number of dependent random…

In this paper, we introduce a mathematical apparatus that is relevant for understanding a dynamical system with small random perturbations and coupled with the so-called transmutation process -- where the latter jumps from one mode to…

In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by "decorating" the nodes of the graph…

The $W$-random graphs provide a flexible framework for modeling large random networks. Using the Large Deviation Principle (LDP) for $W$-random graphs from [9], we prove the LDP for the corresponding class of random symmetric…

We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…

We apply the large-deviation method to study trajectories in dissipative quantum systems. We show that in the long time limit the statistics of quantum jumps can be understood from thermodynamic arguments by exploiting the analogy between…

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…

In this paper we introduce and study a higher-dimensional analogue of the giant component in continuum percolation. Using the language of algebraic topology, we define the notion of giant k-dimensional cycles (with 0-cycles being connected…

A large deviation function mathematically characterizes the statistical property of atypical events. Recently, in non-equilibrium statistical mechanics, large deviation functions have been used to describe universal laws such as the…

We consider a version of continuum long-range percolation on finite boxes of $\mathbb{R}^d$ in which the vertex set is given by the points of a Poisson point process and each pair of two vertices at distance $r$ is connected with…

We develop the connection between large deviation theory and more applied approaches to stochastic hybrid systems by highlighting a common underlying Hamiltonian structure. A stochastic hybrid system involves the coupling between a…

We consider (annealed) large deviation principles for component empirical measures of several families of marked sparse random graphs, including (i) uniform graphs on $n$ vertices with a fixed degree distribution; (ii) uniform graphs on $n$…

We study site percolation on a sequence of graphs $\{G_n\}_{n\geq1}$ on $n$ vertices where degree of each vertex is in the interval $(np -a_n, np+a_n)$ and the co-degree of every pair of vertices is at most ${n}p^2+ b_n$, where $p \in…

We study a random graph $G$ with given degree sequence $\boldsymbol{d}$, with the aim of characterising the degree sequence of the subgraph induced on a given set $S$ of vertices. For suitable $\boldsymbol{d}$ and $S$, we show that the…

In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…

We consider a collection of weakly interacting diffusion processes moving in a two-scale locally periodic environment. We study the large deviations principle of the empirical distribution of the particles' positions in the combined limit…

Much work in the study of large deviations for random graph models is focused on the dense regime where the theory of graphons has emerged as a principal tool. These tools do not give a good approach to large deviation problems for random…

We consider a generic diffusion on the 1D torus and give a simple representation formula for the large deviation rate functional of its invariant probability measure, in the limit of vanishing noise. Previously, this rate functional had…

In this work we investigate the problem of estimating the percolation centrality of every vertex in a graph. This centrality measure quantifies the importance of each vertex in a graph going through a contagious process. It is an open…