Related papers: Large deviations for the leaves in some random tre…
An extension of non-deterministic processes driven by the random telegraph signal is introduced in the framework of "piecewise deterministic Markov processes" [Davis], including a broader category of random systems. The corresponding…
In this paper we propagate a large deviations approach for proving limit theory for (generally) multivariate time series with heavy tails. We make this notion precise by introducing regularly varying time series. We provide general large…
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…
We provide the large deviation principle for higher dimensional piecewise expanding maps and by using the functional approach of Hennion and Herv\'e, slightly modified.
We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…
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…
In this work, we study the color discrepancy of spanning trees in random graphs. We show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ with $p$ above the connectivity threshold, the following holds with high probability: in every…
We derive a large deviation principle for random permutations induced by probability measures of the unit square, called permutons. These permutations are called $\mu$-random permutations. We also introduce and study a new general class of…
We first rephrase and unify known bijections between bipartite plane maps and labelled trees with the formalism of looptrees, which we argue to be both more relevant and technically simpler since the geometry of a looptree is explicitly…
Bayesian networks can be used to extract explanations about the observed state of a subset of variables. In this paper, we explicate the desiderata of an explanation and confront them with the concept of explanation proposed by existing…
We obtain sample-path large deviations for a class of one-dimensional stochastic differential equations with bounded drifts and heavy-tailed L\'evy processes. These heavy-tailed L\'evy processes do not satisfy the exponential integrability…
In this article we consider an extension of the classical Curie-Weiss model in which the global and deterministic external magnetic field is replaced by local and random external fields which interact with each spin of the system. We prove…
Let $W$ be a nonnegative random variable with expectation $1$. For all $r \geqslant 2$, we consider the total mass $Z_r^\infty$ of the associated Mandelbrot multiplicative cascade in the $r$-ary tree. For all $n \geqslant 1$, we also…
The large deviations theory for heavy-tailed processes has seen significant advances in the recent past. In particular, Rhee et al. (2019) and Bazhba et al. (2020) established large deviation asymptotics at the sample-path level for L\'evy…
As a generalization of random recursive trees and preferential attachment trees, we consider random recursive metric spaces. These spaces are constructed from random blocks, each a metric space equipped with a probability measure,…
Understanding the flow dynamics of yield stress fluids in porous media presents a substantial challenge. Both experiments and extensive numerical simulations frequently show a non-linear relationship between the flow rate and the pressure…
We describe a simple method of umbrella trajectory sampling for Markov chains. The method allows the estimation of large-deviation rate functions, for path-extensive dynamic observables, for an arbitrary number of models within a certain…
We obtain large deviations for a class of dependent random variables in the domain of attraction of an $\alpha$-stable law, $\alpha\in (0, 1)\cup (1, 2]$. This class includes ergodic sums of observables in the domain of attraction of an…
We prove a Large Deviation Principle for {\color{blue} jump-Markov } Processes on sparse large disordered network with disordered connectivity. The network is embedded in a geometric space, with the probability of a connection a (scaled)…
Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring edges. The major challenge is to find the right number of…