Related papers: Large deviations for the greedy exploration proces…

In 2000, Cohn, Kenyon and Propp studied uniformly random perfect matchings of large induced subgraphs of $\mathbb Z^2$ (a.k.a. dimer configurations or domino tilings) and developed a large deviation theory for the associated height…

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…

We analyze greedy routing in a random graph G_n constructed on the vertex set V = {1, 2, ..., n} embedded in Z. Vertices are inserted according to a uniform random permutation pi, and each newly inserted vertex connects to its nearest…

We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…

We introduce an algorithm that constructs a random uniform graph with prescribed degree sequence together with a depth first exploration of it. In the so-called supercritical regime where the graph contains a giant component, we prove that…

The aim of this paper is to develop greedy algorithms which generate uniformly distributed sequences in the $d$-dimensional unit cube $[0,1]^d$. The figures of merit are three different variants of $L_2$ discrepancy. Theoretical results…

We study the large deviation behaviour of the trajectories of empirical distributions of independent copies of time-homogeneous Feller processes on locally compact metric spaces. Under the condition that we can find a suitable core for the…

We initiate a study of large deviations for block model random graphs in the dense regime. Following Chatterjee-Varadhan(2011), we establish an LDP for dense block models, viewed as random graphons. As an application of our result, we study…

The Kaczmarz method is an iterative algorithm for solving systems of linear equalities and inequalities, that iteratively projects onto these constraints. Recently, Strohmer and Vershynin [J. Fourier Anal. Appl., 15(2):262-278, 2009] gave a…

In this paper, we address the problem of learning the structure of a pairwise graphical model from samples in a high-dimensional setting. Our first main result studies the sparsistency, or consistency in sparsity pattern recovery,…

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…

This paper investigate the sparse multi-type Erd\H{o}s R\'enyi random graphs studied in S\"{o}derberg~\cite{soderberg2002general} and also Bollob\'as et al.~\cite{bollobas2007phase}. Although the corresponding central limit results are…

We prove by counterexample that a large deviation principle established by Chen and Feng [{\em Comm. Statist. Theory Methods} {\bf 45} (2016), 400--412] in the framework of sublinear expectations is incorrect. That implies that the rate…

Let $(g_n)_{n\geq 1}$ be a sequence of independent and identically distributed elements of the general linear group $GL(d, \mathbb R)$. Consider the random walk $G_n: = g_n \ldots g_1$. Under suitable conditions, we establish…

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)…

Let $r\ge 3$ be a fixed constant and let $ {\mathcal H}$ be an $r$-uniform, $D$-regular hypergraph on $N$ vertices. Assume further that $ D > N^\varepsilon $ for some $ \varepsilon>0 $. Consider the random greedy algorithm for forming an…

Letting~$N=\left\{N(t), t\geq0\right\}$ be a standard Poisson process, Stroock~ \cite{Stroock-1981} constructed a family of continuous processes by $$\Theta_{\epsilon}(t)=\int_0^t\theta_{\epsilon}(r)dr, \ \ \ \ \ 0 \le t \le 1,$$ where…

We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…

We establish a sharp large deviation principle for renewal-reward processes, supposing that each renewal involves a broad-sense reward taking values in a real separable Banach space. In fact, we demonstrate a weak large deviation principle…

In this work, we study large deviation properties of the covariance process in fully connected Gaussian deep neural networks. More precisely, we establish a large deviation principle (LDP) for the covariance process in a functional…