Cutpoints and resistance of random walk paths (Q533749)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5885405
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cutpoints and resistance of random walk paths |
scientific article; zbMATH DE number 5885405 |
Statements
Cutpoints and resistance of random walk paths (English)
0 references
6 May 2011
0 references
A simple random walk on the vertices of a graph has uniform transition distributions among the neighbours of the current state. It is shown that there exist bounded degree graphs such that the subgraph traversed by the walk has almost surely only finitely many cutpoints. Various problems related to the paths of such walks are discussed. In particular, an application is given to resistance in electrical networks.
0 references
graph cutpoints
0 references
random walk
0 references
paths of a random walk
0 references
electrical network
0 references
0.7840039134025574
0 references
0.7726810574531555
0 references
0.7717292904853821
0 references
0.7695692181587219
0 references
