Related papers: Cover levels and random interlacements
This article proves that, in terms of local times, the rescaled and recentered cover times of finite subsets of the discrete cylinder by simple random walk converge in law to the Gumbel distribution, as the cardinality of the set goes to…
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested…
This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one…
We consider the model of Branching Interlacements, introduced by Zhu, which is a natural analogue of Sznitman's Random Interlacements model, where the random walk trajectories are replaced by ranges of some suitable tree-indexed random…
In this paper we establish some properties of percolation for the vacant set of random interlacements, for d at least 5 and small intensity u. The model of random interlacements was first introduced by A.S. Sznitman in arXiv:0704.2560. It…
We consider the model of random interlacements on $\mathbb{Z}^d$ introduced in Sznitman [Vacant set of random interlacements and percolation (2007) preprint]. For this model, we prove the uniqueness of the infinite component of the vacant…
We introduce the coverage correlation coefficient, a novel nonparametric measure of statistical association designed to quantifies the extent to which two random variables have a joint distribution concentrated on a singular subset with…
A discrete version of the Gumbel (Type I) extreme value distribution has been derived by using the general approach of discretization of a continuous distribution. Important distributional and reliability properties have been explored. It…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
We present an algebraic description of the sets of local correlations in arbitrary networks, when the parties have finite inputs and outputs. We consider networks generalizing the usual Bell scenarios by the presence of multiple…
We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…
Let $\{B(\xi_n,r_n)\}_{n\ge1}$ be a sequence of random balls whose centers $\{\xi_n\}_{n\ge1}$ is a stationary process, and $\{r_n\}_{n\ge1}$ is a sequence of positive numbers decreasing to 0. Our object is the random covering set…
We study the joint degree counts in proportional attachment random graphs and find a simple representation for the limit distribution in infinite sequence space. We show weak convergence with respect to the p-norm topology for appropriate p…
For the model of two-dimensional random interlacements in the critical regime (i.e., $\alpha=1$), we prove that the vacant set is a.s.\ infinite, thus solving an open problem from arXiv:1502.03470. Also, we prove that the entrance measure…
This paper introduces a new approach to the study of rates of convergence for posterior distributions. It is a natural extension of a recent approach to the study of Bayesian consistency. In particular, we improve on current rates of…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
In the framework of Cramer's probabilistic model of primes, we explore the exact and asymptotic distributions of maximal prime gaps. We show that the Gumbel extreme value distribution exp(-exp(-x)) is the limit law for maximal gaps between…
This work proves that the fluctuations of the cover time of simple random walk in the discrete torus of dimension at least three with large side-length are governed by the Gumbel extreme value distribution. This result was conjectured for…
We study the percolative properties of random interlacements on the product of G with the integer line Z, when G is a weighted graph satisfying certain sub-Gaussian estimates attached to the parameters alpha > 1, measuring the volume growth…
We consider an infinite spatial inhomogeneous random graph model with an integrable connection kernel that interpolates nicely between existing spatial random graph models. Key examples are versions of the weight-dependent random connection…