Random walks on a finite graph with congestion points

DOI10.1016/S0096-3003(03)00660-XzbMATH Open1043.60010MaRDI QIDQ1827003FDOQ1827003

Authors: Mihyun Kang 

Publication date: 6 August 2004

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

Recommendations

• First hitting times of simple random walks on graphs with congestion points
• First hitting times for some random walks on finite groups
• Finite range random walk on free groups and homogeneous trees
• scientific article
• Enumeration and random walks on finite groups

zbMATH Keywords

Generating functionsRandom walksGroup representationsCongestionsHitting times

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Markov Chains
• Title not available (Why is that?)
• Shuffling Cards and Stopping Times
• On the notion of recurrence in discrete stochastic processes
• Title not available (Why is that?)
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Geometric bounds for eigenvalues of Markov chains
• Random walks on weighted graphs and applications to on-line algorithms
• Title not available (Why is that?)
• Improved bounds for sampling colorings
• Title not available (Why is that?)
• Random shuffles and group representations
• A note on expected hitting times for birth and death chains
• Random walks and the effective resistance of networks
• Hitting times for random walks on vertex-transitive graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Design of On-Line Algorithms Using Hitting Times
• Shuffling biological sequences
• 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

Cited In (3)

• First hitting times of simple random walks on graphs with congestion points
• Efficiency test of pseudorandom number generators using random walks
• Constrained minimum passage time in random geometric graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827003)