Maximum hitting time for random walks on graphs
From MaRDI portal
Publication:3970909
Recommendations
Cites work
Cited in
(50)- Lollipop and lariat symmetric functions
- The mixing time of the Newman-Watts small world
- A model of self-avoiding random walks for searching complex networks
- Cop vs. gambler
- Some further results on the maximal hitting times of trees with some given parameters
- The hitting time of random walk on unicyclic graphs
- The hitting and cover times of Metropolis walks
- Bounds on expected hitting times for a random walk on a connected graph
- Capturing the drunk robber on a graph
- A stochastic process on a network with connections to Laplacian systems of equations
- Unexpected advantages of exploitation for target searches in complex networks
- On the expected time for Herman's probabilistic self-stabilizing algorithm
- scientific article; zbMATH DE number 38158 (Why is no real title available?)
- How to Design a Linear Cover Time Random Walk on a Finite Graph
- Extremal hitting times of trees with some given parameters
- The Mixing Time of the Newman-Watts Small-World Model
- Cover time in edge-uniform stochastically-evolving graphs
- A permuted random walk exits faster
- The hitting times of random walks on bicyclic graphs
- Forest formulas of discrete Green's functions
- 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
- Laplace eigenvalues of graphs---a survey
- Decomposing hitting times of walks on graphs into simpler ones
- Hitting times for random walks on tricyclic graphs
- Three conjectures in extremal spectral graph theory
- Characterizing graphs of maximum principal ratio
- Exact mixing times for random walks on trees
- Chromatic posets
- Reversible random walks on dynamic graphs
- Walker-breaker games
- Comparing eigenvector and degree dispersion with the principal ratio of a graph
- A new probabilistic molecular index
- 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
- A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees
- The best mixing time for random walks on trees
- The hitting and cover times of random walks on finite graphs using local degree information
- Expected hitting times for a random walk on a connected graph
- Computing Kemeny's constant for a barbell graph
- 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
- Finding hitting times in various graphs
- New bounds for edge-cover by random walk
- 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
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)
