Random walks on Galton-Watson trees with random conductances (Q424494): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
A random walk is considered from the root of an infinite supercritical Galton-Watson tree with independent random conductances having distributions that may depend on the degrees of incident vertices. If the mean conductance is finite, it is proved that the speed of the random walk has almost surely a deterministic positive limit. By finding a reversible measure for the environment, the limiting speed is determined in terms of certain effective conductance distributions of subtrees. The limiting speed is also compared to the speed of a simple random walk on Galton-Watson trees. Explicit results for binary trees are used to illustrate the influence of the random environment on the speed of the random walk. | |||
Property / review text: A random walk is considered from the root of an infinite supercritical Galton-Watson tree with independent random conductances having distributions that may depend on the degrees of incident vertices. If the mean conductance is finite, it is proved that the speed of the random walk has almost surely a deterministic positive limit. By finding a reversible measure for the environment, the limiting speed is determined in terms of certain effective conductance distributions of subtrees. The limiting speed is also compared to the speed of a simple random walk on Galton-Watson trees. Explicit results for binary trees are used to illustrate the influence of the random environment on the speed of the random walk. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60K37 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C81 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60J80 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6040298 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random walk | |||
Property / zbMATH Keywords: random walk / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random environment | |||
Property / zbMATH Keywords: random environment / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
rate of escape | |||
Property / zbMATH Keywords: rate of escape / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
effective conductance | |||
Property / zbMATH Keywords: effective conductance / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
reversibility | |||
Property / zbMATH Keywords: reversibility / rank | |||
Normal rank |
Revision as of 22:26, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Random walks on Galton-Watson trees with random conductances |
scientific article |
Statements
Random walks on Galton-Watson trees with random conductances (English)
0 references
1 June 2012
0 references
A random walk is considered from the root of an infinite supercritical Galton-Watson tree with independent random conductances having distributions that may depend on the degrees of incident vertices. If the mean conductance is finite, it is proved that the speed of the random walk has almost surely a deterministic positive limit. By finding a reversible measure for the environment, the limiting speed is determined in terms of certain effective conductance distributions of subtrees. The limiting speed is also compared to the speed of a simple random walk on Galton-Watson trees. Explicit results for binary trees are used to illustrate the influence of the random environment on the speed of the random walk.
0 references
random walk
0 references
random environment
0 references
rate of escape
0 references
effective conductance
0 references
reversibility
0 references