Maximum hitting time for random walks on graphs
From MaRDI portal
Publication:3970909
DOI10.1002/RSA.3240010303zbMATH Open0744.05044OpenAlexW1968695868MaRDI QIDQ3970909FDOQ3970909
Authors: Peter Winkler, Graham Brightwell 
Publication date: 25 June 1992
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240010303
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Paths and cycles (05C38)
Cites Work
Cited In (50)
- The mixing time of the Newman-Watts small world
- A model of self-avoiding random walks for searching complex networks
- The hitting time of random walk on unicyclic graphs
- Cop vs. gambler
- Some further results on the maximal hitting times of trees with some given parameters
- Unexpected advantages of exploitation for target searches in complex networks
- The hitting and cover times of Metropolis walks
- A stochastic process on a network with connections to Laplacian systems of equations
- Bounds on expected hitting times for a random walk on a connected graph
- Capturing the drunk robber on a graph
- On the expected time for Herman's probabilistic self-stabilizing algorithm
- Title not available (Why is that?)
- Extremal hitting times of trees with some given parameters
- How to Design a Linear Cover Time Random Walk on a Finite Graph
- The Mixing Time of the Newman-Watts Small-World Model
- Cover time in edge-uniform stochastically-evolving graphs
- A permuted random walk exits faster
- Forest formulas of discrete Green's functions
- The hitting times of random walks on bicyclic graphs
- Tight inequalities among set hitting times in Markov chains
- The access time of random walks on trees with given partition
- Comparison of mean hitting times for a degree-biased random walk
- Hitting times for random walks on tricyclic graphs
- Laplace eigenvalues of graphs---a survey
- Decomposing hitting times of walks on graphs into simpler ones
- Three conjectures in extremal spectral graph theory
- Characterizing graphs of maximum principal ratio
- Reversible random walks on dynamic graphs
- Comparing eigenvector and degree dispersion with the principal ratio of a graph
- A new probabilistic molecular index
- Chromatic posets
- Exact mixing times for random walks on trees
- Permuted random walk exits typically in linear time
- Slowdown for the geodesic-biased random walk
- The maximum relaxation time of a random walk
- Containment: a variation of cops and robber
- The hitting and cover times of random walks on finite graphs using local degree information
- The best mixing time for random walks on trees
- Computing Kemeny's constant for a barbell graph
- Expected hitting times for a random walk on a connected graph
- Walker-Breaker Games
- Hitting times for random walks on subdivision and triangulation graphs
- A central limit theorem for the mean starting hitting time for a random walk on a random graph
- New bounds for edge-cover by random walk
- Finding hitting times in various graphs
- TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS
- Distributed protocols against mobile eavesdroppers
- A tight upper bound on the cover time for random walks on graphs
- Lollipop and lariat symmetric functions
- A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees
This page was built for publication: Maximum hitting time for random walks on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3970909)
