Pages that link to "Item:Q923511"

The following pages link to Random walks on highly symmetric graphs (Q923511):

Displaying 25 items.

• Cover levels and random interlacements (Q417070) (← links)
• One-dimensional random walks, decreasing rearrangements and discrete Steiner symmetrization (Q677674) (← links)
• Random walk covering of some special trees (Q809480) (← links)
• Some further results on the maximal hitting times of trees with some given parameters (Q833005) (← links)
• A collection of results concerning electric resistance and simple random walk on distance-regular graphs (Q898134) (← links)
• The expected hitting times for finite Markov chains (Q924349) (← links)
• Random walks on the triangular prism and other vertex-transitive graphs (Q1075340) (← links)
• Expected cover times of random walks on symmetric graphs (Q1194485) (← links)
• Random walks on edge-transitive graphs. II (Q1284583) (← links)
• Covering with blocks in the non-symmetric case (Q1345083) (← links)
• On the mean and variance of cover times for random walks on graphs (Q1353782) (← links)
• Random walks on edge transitive graphs (Q1382191) (← links)
• The expected hitting times for graphs with cutpoints. (Q1423039) (← links)
• Recurrent random walks and the absence of continuous symmetry breaking on graphs (Q1897060) (← links)
• Random walks and orthogonal functions associated with highly symmetric graphs (Q1901043) (← links)
• Quantum operators in classical probability theory. I: ``Quantum spin'' techniques and the exclusion model of diffusion (Q1915832) (← links)
• Cover times for words in symmetric and nonsymmetric cases: A comparison (Q1917614) (← links)
• Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost (Q2032849) (← links)
• Kemeny's constant and Kirchhoffian indices for conjoined highly symmetric graphs (Q2043378) (← links)
• On the (reverse) cover cost of trees with some given parameters (Q2214070) (← links)
• Extremal cover cost and reverse cover cost of trees with given segment sequence (Q2297740) (← links)
• A note on the last new vertex visited by a random walk (Q4271615) (← links)
• (Q4713751) (← links)
• Extremal hitting times of trees with some given parameters (Q5089351) (← links)
• Calculating effective resistances on underlying networks of association schemes (Q5504981) (← links)