Disconnection, random walks, and random interlacements (Q510256): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Importer (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3105423332 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1412.3960 / rank
 
Normal rank

Revision as of 15:31, 18 April 2024

scientific article
Language Label Description Also known as
English
Disconnection, random walks, and random interlacements
scientific article

    Statements

    Disconnection, random walks, and random interlacements (English)
    0 references
    0 references
    17 February 2017
    0 references
    Random interlacements were introduced in [Ann. Math. (2) 171, No. 3, 2039--2087 (2010; Zbl 1202.60160)] by the author of the present paper. Subsequently, the topic has been broadly investigated by many probabilists. Recall that random interlacements are defined as the range of a countable space of doubly-infinite labeled trajectories in \(\mathbb Z^d\), on which a Poisson point process with a given intensity measure is defined (random interlacements point process). In the present paper, the author derives an asymptotic upper bound on the probability that the random interlacements disconnect a box of a large side-length from the boundary, which is a larger box.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    random interlacements
    0 references
    random walks
    0 references
    percolation
    0 references
    Poisson point process
    0 references
    0 references
    0 references