Commute times of random walks on trees (Q1949106)
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: Commute times of random walks on trees |
scientific article; zbMATH DE number 6157663
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Commute times of random walks on trees |
scientific article; zbMATH DE number 6157663 |
Statements
Commute times of random walks on trees (English)
0 references
25 April 2013
0 references
A random weighted tree is considered in which every vertex at the same distance from the root has the same degree. The commute time is investigated for a random walk from the root to level n in the tree and back. Asymptotic results for large \(n\) are given when the random outdegree of each vertex is either 1 or 2 according to various probability distributions.
0 references
random walk
0 references
commute time
0 references
spherically symmetric tree
0 references
resistance
0 references
random weighted tree
0 references
0.93157864
0 references
0.91384673
0 references
0.91288596
0 references
0.90839887
0 references
0.90452266
0 references
0.89881814
0 references
0.8978362
0 references
