Cover levels and random interlacements (Q417070): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the disconnection of a discrete cylinder by a random walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on highly symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3101597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Walks in Multidimensional Spaces, Especially on Periodic Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3881651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting crossing probabilities of random fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation for the vacant set of random interlacements / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the domination of a random walk on a discrete cylinder by random interlacements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on discrete cylinders and random interlacements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bound on the disconnection time of discrete cylinders and random interlacements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vacant set of random interlacements and percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlacement percolation on transient weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: THREE TRIPLE INTEGRALS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walk on a discrete torus and random interlacements / rank
 
Normal rank

Revision as of 05:25, 5 July 2024

scientific article
Language Label Description Also known as
English
Cover levels and random interlacements
scientific article

    Statements

    Cover levels and random interlacements (English)
    0 references
    0 references
    0 references
    13 May 2012
    0 references
    The random interlacements model was introduced by \textit{A.-S. Sznitman} [Ann. Math. (2) 171, No. 3, 2039--2087 (2010; Zbl 1202.60160)]. It is a certain Poisson point process indexed by time \(u\) and taking values in the set of doubly infinite random walk paths (modulo time shift) on the \(d\)-dimensional integer lattice (\(d \geq 3\)). Denote by \(I^u\) the union of paths of this process up to time \(u\). For any finite subset \(A\) of the integer lattice, denote by \(M(A)\) the cover time of this process, that is, the smallest \(u\) such that \(A\subset I^u\). Finally, let \(g\) denote the Green function of a random walk on the \(d\)-dimensional integer lattice. The author shows that \(M(A)/g(0)\log|A|\) converges to \(1\) as the cardinality of \(A\) increases to infinity. More precisely, he shows that, for all finite \(A\), \[ \sup_{z\in\mathbb{R}}\left|\operatorname{P}\left[\frac{M(A)}{g(0)}-\log(|A|)\,\leq z\right]-\exp\big(-e^{-z}\big)\right|\leq c|A|^{-c_1} \] for some \(c_1>0\) which is given more or less explicitly. Presumably, \(c\) denotes a constant that is independent of \(A\). In particular, \(M(A)/g(0)-\log(|A|)\) converges to the Gumbel distribution as \(|A|\to\infty\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    cover level
    0 references
    random interlacements
    0 references
    cover time
    0 references
    uncovered sets
    0 references
    Gumbel distributional limit
    0 references
    0 references