On the easiest way to connect \(k\) points in the random interlacements process (Q2866817)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the easiest way to connect \(k\) points in the random interlacements process |
scientific article; zbMATH DE number 6236543
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the easiest way to connect \(k\) points in the random interlacements process |
scientific article; zbMATH DE number 6236543 |
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
0.86929864
0 references
0.8689405
0 references
0.8669379
0 references
0.86414003
0 references
0.8621007
0 references
0 references
0.8500447
0 references
On the easiest way to connect \(k\) points in the random interlacements process (English)
0 references
