Commute times of random walks on trees (Q1949106): Difference between revisions

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

Mathematics Subject Classification ID

05C81

0 references

0 references

0 references

0 references

0 references

0 references

random walk

0 references

commute time

0 references

spherically symmetric tree

0 references

resistance

0 references

random weighted tree

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2012.10.006

0 references

OpenAlex ID

W2054061723

0 references

cites work

COMMUTE TIMES AND THE EFFECTIVE RESISTANCES OF RANDOM TREES

0 references

Random walk covering of some special trees

0 references

0 references

0 references

0 references

0 references

Machine Learning: ECML 2004

0 references

Q5302080

0 references

Random walks and the effective resistance of networks

0 references

Reconstruction of graphs based on random walks

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1949106

@@ Property / author @@
-Mokhtar H. Konsowa
@@ Property / author: Mokhtar H. Konsowa / rank @@
-Normal rank
@@ Property / author @@
-Andras Telcs
@@ Property / author: Andras Telcs / rank @@
-Normal rank
@@ Property / author @@
+Mokhtar H. Konsowa
@@ Property / author: Mokhtar H. Konsowa / rank @@
+Normal rank
@@ Property / author @@
+Andras Telcs
@@ Property / author: Andras Telcs / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2012.10.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2054061723
@@ Property / OpenAlex ID: W2054061723 / rank @@
+Normal rank
@@ Property / cites work @@
+COMMUTE TIMES AND THE EFFECTIVE RESISTANCES OF RANDOM TREES
+Normal rank
@@ Property / cites work @@
+Random walk covering of some special trees
@@ Property / cites work: Random walk covering of some special trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633810
@@ Property / cites work: Q4633810 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5538132
@@ Property / cites work: Q5538132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3231324
@@ Property / cites work: Q3231324 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4878667
@@ Property / cites work: Q4878667 / rank @@
+Normal rank
@@ Property / cites work @@
+Machine Learning: ECML 2004
@@ Property / cites work: Machine Learning: ECML 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5302080
@@ Property / cites work: Q5302080 / rank @@
+Normal rank
@@ Property / cites work @@
+Random walks and the effective resistance of networks
+Normal rank
@@ Property / cites work @@
+Reconstruction of graphs based on random walks
@@ Property / cites work: Reconstruction of graphs based on random walks / rank @@
+Normal rank