Random walks on edge transitive graphs (Q1382191): Difference between revisions

The authors find explicit values for the expected hitting times between neighboring vertices of random walks on edge-transitive graphs, extending some results obtained by van Slijpe (1986), Aldous (1989), Devroye and Sbihi (1990) and Palacios (1992).

0 references

Mathematics Subject Classification ID

60G50

0 references

0 references

0 references

edge-transitive graphs

0 references

cover times

0 references

effective resistance

0 references

expected hitting times

0 references

reviewed by

Wen Liu

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Hitting times for random walks on vertex-transitive graphs

0 references

Vertex and Edge Transitive, but not 1-Transitive, Graphs

0 references

Q4692391

0 references

Random walks on highly symmetric graphs

0 references

Q3706275

0 references

A tight upper bound on the cover time for random walks on graphs

0 references

Regular line-symmetric graphs

0 references

Random walks on graphs

0 references

On the cover time of random walks on graphs

0 references

Covering problems for Markov chains

0 references

On a Result of Aleliunas <i>et al.</i> Concerning Random Walks on Graphs

0 references

Expected cover times of random walks on symmetric graphs

0 references

Random walks and the effective resistance of networks

0 references

Random walks on the triangular prism and other vertex-transitive graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1382191

@@ Property / reviewed by @@
+Wen Liu
@@ Property / reviewed by: Wen Liu / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Hitting times for random walks on vertex-transitive graphs
+Normal rank
@@ Property / cites work @@
+Vertex and Edge Transitive, but not 1-Transitive, Graphs
+Normal rank
@@ Property / cites work @@
+Q4692391
@@ Property / cites work: Q4692391 / rank @@
+Normal rank
@@ Property / cites work @@
+Random walks on highly symmetric graphs
@@ Property / cites work: Random walks on highly symmetric graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3706275
@@ Property / cites work: Q3706275 / rank @@
+Normal rank
@@ Property / cites work @@
+A tight upper bound on the cover time for random walks on graphs
+Normal rank
@@ Property / cites work @@
+Regular line-symmetric graphs
@@ Property / cites work: Regular line-symmetric graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Random walks on graphs
@@ Property / cites work: Random walks on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the cover time of random walks on graphs
@@ Property / cites work: On the cover time of random walks on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Covering problems for Markov chains
@@ Property / cites work: Covering problems for Markov chains / rank @@
+Normal rank
@@ Property / cites work @@
+On a Result of Aleliunas <i>et al.</i> Concerning Random Walks on Graphs
+Normal rank
@@ Property / cites work @@
+Expected cover times of random walks on symmetric graphs
+Normal rank
@@ Property / cites work @@
+Random walks and the effective resistance of networks
+Normal rank
@@ Property / cites work @@
+Random walks on the triangular prism and other vertex-transitive graphs
+Normal rank