Random walks on edge-transitive graphs. II (Q1284583)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1278991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random walks on edge-transitive graphs. II |
scientific article; zbMATH DE number 1278991 |
Statements
Random walks on edge-transitive graphs. II (English)
0 references
31 May 1999
0 references
[For part I (by the first and second author) see ibid. 37, No. 1, 29-34 (1998; Zbl 0901.60044).] The authors give formulas, in terms of the number of pure \(k\)-cycles, for the expected hitting times between vertices at distances greater than 1 for random walks on edge-transitive graphs. They apply these formulas to a class of Cayley graphs and give explicit values for the expected hitting times.
0 references
edge-transitive graphs
0 references
hitting times
0 references
Cayley graphs
0 references
0.927757441997528
0 references
0.8247097134590149
0 references
0.8146770000457764
0 references
0.8137513995170593
0 references
