How universal are asymptotics of disconnection times in discrete cylinders? (Q2468420)
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: How universal are asymptotics of disconnection times in discrete cylinders? |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How universal are asymptotics of disconnection times in discrete cylinders? |
scientific article |
Statements
How universal are asymptotics of disconnection times in discrete cylinders? (English)
0 references
22 January 2008
0 references
For large connected graphs \((G, \mathcal E)\) of uniformly bounded degree, the disconnection time of \(G\times \mathbb Z\) has rough order \(| G| ^2\) for large \(| G| \).
0 references
disconnection time
0 references
random walk
0 references
graph
0 references
discrete cylinder
0 references
0 references
0 references
0.8921435475349426
0 references
0.8877704739570618
0 references
0.8865055441856384
0 references
0.8608641028404236
0 references
0.8396846652030945
0 references
