Random walks on a finite graph with congestion points

DOI10.1016/S0096-3003(03)00660-XzbMath1043.60010MaRDI QIDQ1827003

Mihyun Kang

Publication date: 6 August 2004

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

Generating functionsRandom walksGroup representationsCongestionsHitting times

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05)

Related Items (1)

Efficiency test of pseudorandom number generators using random walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random walks and the effective resistance of networks
• Geometric bounds for eigenvalues of Markov chains
• Random shuffles and group representations
• A note on expected hitting times for birth and death chains
• Expected hitting times for random walks on weak products of graphs
• First hitting times for some random walks on finite groups
• Some thoughts about random walks on figure eight
• Improved bounds for sampling colorings
• Random walks on weighted graphs and applications to on-line algorithms
• Shuffling Cards and Stopping Times
• Hitting times for random walks on vertex-transitive graphs
• Design of On-Line Algorithms Using Hitting Times
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Markov Chains
• On the notion of recurrence in discrete stochastic processes
• Shuffling biological sequences

This page was built for publication: Random walks on a finite graph with congestion points