The Hitting Time of Multiple Random Walks

No abstract is available for this paper.

• Publication year

  2016

• Venue

  SIAM Journal on Matrix Analysis and Applications

• Publication date

  2016-07-21

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1137/15M1010737
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Robotic Surveillance and Markov Chains With Minimal Weighted Kemeny Constant

  2015cited by this paper
• Improving the scalability of search in networks through multiple random walks

  2014cited by this paper
• On the Kemeny constant and stationary distribution vector for a Markov chain

  2014cited by this paper
• Markov chains and mixing times

  2013cited by this paper
• The role of social networks in information diffusion

  2012cited by this paper
• The Role of Kemeny's Constant in Properties of Markov Chains

  2012cited by this paper
• Stochastic surveillance strategies for spatial quickest detection

  2011cited by this paper
• An in-depth analysis of stochastic Kronecker graphs

  2011cited by this paper
• On Cooperative Patrolling: Optimal Trajectories, Complexity Analysis, and Approximation Algorithms

  2011cited by this paper
• The Kemeny Constant for Finite Homogeneous Ergodic Markov Chains

  2010cited by this paper
• Fastest expected time to mixing for a Markov chain on a directed graph

  2010cited by this paper
• The hitting and cover times of Metropolis walks

  2010cited by this paper
• Tight bounds for the cover time of multiple random walks

  2009cited by this paper
• Multiple Random Walks in Random Regular Graphs

  2009cited by this paper
• On hitting times of random walks on trees

  2009cited by this paper
• How Well Do Random Walks Parallelize?

  2009cited by this paper
• Multiple Random Walks and Interacting Particle Systems

  2009cited by this paper
• Non-negative Matrices and Markov Chains

  2008cited by this paper
• A realistic model of frequency-based multi-robot polyline patrolling

  2008cited by this paper
• How community structure influences epidemic spread in social networks

  2008cited by this paper
• Scalable modeling of real graphs using Kronecker multiplication

  2007cited by this paper
• Many random walks are faster than one

  2007cited by this paper
• Stochastic kronecker graphs

  2007cited by this paper
• Monitoring Environmental Boundaries With a Robotic Sensor Network

  2006cited by this paper
• FINITE MARKOV CHAINS

  2005cited by this paper
• Random walks in peer-to-peer networks

  2004cited by this paper
• Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks

  2002cited by this paper
• Response time effectiveness: comparison of response time and survival in an urban emergency medical services system.

  2002cited by this paper
• Matrix Analysis and Applied Linear Algebra

  2000cited by this paper
• Algebraic complexity theory

  1997cited by this paper
• A note on expected hitting times for birth and death chains

  1996cited by this paper
• A Tight Upper Bound on the Cover Time for Random Walks on Graphs

  1995cited by this paper
• Random walks and the effective resistance of networks

  1991cited by this paper
• Algebraic Complexity Theory

  1991cited by this paper
• Topics in Matrix Analysis

  1991cited by this paper
• Bounds on the cover time

  1988cited by this paper
• Random Walks and Electric Networks: REFERENCES

  1987cited by this paper
• THE KRONECKER PRODUCT OF GRAPHS

  1962cited by this paper

• Random walks and consensus problem on tree network with an identical degree distribution

  2026cites this paper
• Growing Well-Connected Networks for Entropy Rate Maximization

  2025cites this paper
• Continuous-time process for human contact dynamics.

  2025cites this paper
• Multirobot Stochastic Patrolling via Graph Partitioning

  2025cites this paper
• Estimating Hitting Times Locally At Scale

  2025cites this paper
• On the Trade-Off Between Efficiency and Unpredictability in Stochastic Robotic Surveillance

  2024cites this paper
• Determining Mean First-Passage Time for Random Walks on Stochastic Uniform Growth Tree Networks

  2024cites this paper
• Survivable Payment Channel Networks

  2024cites this paper
• Comparative study of random walks with one-step memory on complex networks

  2024cites this paper
• Collaboration of random walks on graphs

  2023cites this paper
• RoSSO: A High-Performance Python Package for Robotic Surveillance Strategy Optimization Using JAX

  2023cites this paper
• Distributed Markov Chain-Based Strategies for Multi-Agent Robotic Surveillance

  2023cites this paper
• How do robot swarms behave? What graphs can tell us

  2023cites this paper
• A Correlated Random Walk Model to Rapidly Approximate Hitting Time Distributions in Multi-robot Systems

  2022cites this paper
• Exploration and Coverage with Swarms of Settling Agents

  2022cites this paper
• Spatio-temporal dynamics of random transmission events: from information sharing to epidemic spread

  2022cites this paper
• Dumbbell Graphs with Extremal (Reverse) Cover Cost

  2022cites this paper
• Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters

  2021cites this paper
• On the (reverse) cover cost of trees with some given parameters

  2021cites this paper
• Analytic formulae for random walks on stochastic uniform growth trees

  2020cites this paper
• On the robustness of a synchronized multi-robot system

  2020cites this paper
• Graph Degree Heterogeneity Facilitates Random Walker Meetings

  2020cites this paper
• First Exit-Time Analysis for an Approximate Barndorff-Nielsen and Shephard Model with Stationary Self-Decomposable Variance Process

  2020cites this paper
• Markov Chain-Based Stochastic Strategies for Robotic Surveillance

  2020influential citation
• Mean encounter times for multiple random walkers on networks.

  2020cites this paper
• Extremal hitting times of trees with some given parameters

  2020cites this paper
• Multiple random walks on graphs: mixing few to cover many

  2020cites this paper
• Random walks on stochastic uniform growth trees: Analytical formula for mean first-passage time

  2020cites this paper
• Robotic Surveillance Based on the Meeting Time of Random Walks

  2019cites this paper
• A Method for Geodesic Distance on Subdivision of Trees With Arbitrary Orders and Their Applications

  2019cites this paper
• Multiple and replicated random walkers analysis for service discovery in fog computing IoT environments

  2019cites this paper
• Low complexity landmark-node tracing in WSNs using multi-agent random walks

  2019cites this paper
• Markov Chains With Maximum Entropy for Robotic Surveillance

  2019cites this paper
• Expected hitting times for random walks on quadrilateral graphs and their applications

  2018cites this paper
• Markov Chains with Maximum Return Time Entropy for Robotic Surveillance

  2018cites this paper
• Expected hitting times for random walks on the k-triangle graph and their applications

  2018cites this paper
• Analysis of Multiple Random Walkers for Service Discovery in Fog Computing Network Environments

  2018cites this paper
• The Meeting Time of Multiple Random Walks

  2018influential citation
• A Theory of Collective Cell Migration and the Design of Stochastic Surveillance Strategies

  2018influential citation
• Markov Chains With Maximum Return Time Entropy for Robotic Surveillance

  2018cites this paper
• Lower bounds for in-network computation of arbitrary functions

  2017cites this paper
• Further results on the expected hitting time, the cover cost and the related invariants of graphs

  2017cites this paper
• First Meeting Time Formula of Two Random Walkers toward Understanding Epidemic Information Dissemination

  2017cites this paper
• Hitting time for doubly-weighted graphs with application to robotic surveillance

  2016cites this paper
• Robotic Surveillance and Deployment Strategies

  2015cites this paper