Commute times of random walks on trees (Q1949106): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.10.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054061723 / rank | |||
Normal rank | |||
Revision as of 19:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Commute times of random walks on trees |
scientific article |
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
