On the easiest way to connect $k$ points in the Random Interlacements process (Q2866817)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the easiest way to connect $k$ points in the Random Interlacements process |
scientific article |
Statements
9 December 2013
0 references
random interlacement
0 references
connectivity
0 references
percolation
0 references
random walk
0 references
math.PR
0 references
math-ph
0 references
math.MP
0 references
