Related papers: Large Deviation Principle for the Exploration Proc…
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…
A large deviation principle is established for a general class of stochastic flows in the small noise limit. This result is then applied to a Bayesian formulation of an image matching problem, and an approximate maximum likelihood property…
A Markov network characterizes the conditional independence structure, or Markov property, among a set of random variables. Existing work focuses on specific families of distributions (e.g., exponential families) and/or certain structures…
A graphon is a limiting object used to describe the behaviour of large networks through a function that captures the probability of edge formation between nodes. Although the merits of graphons to describe large and unlabelled networks are…
Extensive time-series encoding the position of particles such as viruses, vesicles, or individual proteins are routinely garnered in single-particle tracking experiments or supercomputing studies. They contain vital clues on how viruses…
Motivated by the occurrence in rate functions of time-dependent large-deviation principles, we study a class of non-negative functions $\mathscr L$ that induce a flow, given by $\mathscr L(\rho_t,\dot\rho_t)=0$. We derive necessary and…
We study the emergence of a giant component in a spatial network where the distribution of the metric distances between the nodes is scale-invariant, and the interaction between the nodes has a long-range power-law behavior. The nodes are…
The Whittaker 2d growth model is a triangular continuous Markov diffusion process that appears in many scientific contexts. It has been theoretically intriguing to establish a large deviation principle for this 2d process with a scaling…
The so-called 'Level 2.5' general result for the large deviations of the joint probability of the density and of the currents for Markov Jump processes is applied to the case of $N$ independent particles on a ring with random transition…
Complex systems are often driven by higher-order interactions among multiple units, naturally represented as hypergraphs. Understanding dependency structures within these hypergraphs is crucial for understanding and predicting the behavior…
The configuration model is one of the most successful models for generating uncorrelated random networks. We analyze its behavior when the expected degree sequence follows a power law with exponent smaller than two. In this situation, the…
We study the problem of exponential mixing and large deviations for discrete-time Markov processes associated with a class of random dynamical systems. Under some dissipativity and regularisation hypotheses for the underlying deterministic…
This paper is devoted to the problem of sample path large deviations for multidimensional queueing models with feedback. We derive a new version of the contraction principle where the continuous map is not well-defined on the whole space:…
Large deviation principles and related results are given for a class of Markov chains associated to the "leaves" in random recursive trees and preferential attachment random graphs, as well as the "cherries" in Yule trees. In particular,…
We present a framework to calculate the cascade size evolution for a large class of cascade models on random network ensembles in the limit of infinite network size. Our method is exact and applies to network ensembles with almost arbitrary…
Graphs are widely used for describing systems made up of many interacting components and for understanding the structure of their interactions. Various statistical models exist, which describe this structure as the result of a combination…
We consider the problem of estimating the expected time to find a maximum degree node on a graph using a (parameterized) biased random walk. For assortative graphs the positive degree correlation serves as a local gradient for which a bias…
We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs…
A large deviations principle is established for the joint law of the empirical measure and the flow measure of a renewal Markov process on a finite graph. We do not assume any bound on the arrival times, allowing heavy tailed distributions.…
The theme of this paper is the derivation of analytic formulae for certain large combinatorial structures. The formulae are obtained via fluid limits of pure jump type Markov processes, established under simple conditions on the Laplace…