Random walks on edge-transitive graphs. II (Q1284583): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting pure \(k\)-cycles in sequences of Cayley graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4692391 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex and Edge Transitive, but not 1-Transitive, Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Random walks on highly symmetric graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Random walks on edge transitive graphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0167-7152(98)00241-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4232812283 / rank | |||
Normal rank |
Latest revision as of 10:43, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Random walks on edge-transitive graphs. II |
scientific article |
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