On the easiest way to connect $k$ points in the Random Interlacements process
From MaRDI portal
Publication:2866817
zbMath1277.60177arXiv1206.4216MaRDI QIDQ2866817
Hubert Lacoin, Johan Tykesson Pages
Publication date: 9 December 2013
Full work available at URL: https://arxiv.org/abs/1206.4216
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30)
Related Items (5)
Visibility in the vacant set of the Brownian interlacements and the Brownian excursion process ⋮ On chemical distances and shape theorems in percolation models with long-range correlations ⋮ On scaling limits and Brownian interlacements ⋮ The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\) ⋮ Transience of the vacant set for near-critical random interlacements in high dimensions
This page was built for publication: On the easiest way to connect $k$ points in the Random Interlacements process
