On the public citation graph
Collisions Among Random Walks on a Graph
0 signed · 155 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.3240010303openalex-snapshot
Maximum hitting time for random walks on graphs
inferredcites →https://doi.org/10.1007/bf01046996openalex-snapshot
Random walks and the effective resistance of networks
inferredcites →https://doi.org/10.1016/0304-4149(91)90090-yopenalex-snapshot
Meeting times for independent Markov chains
inferredcites →https://doi.org/10.1109/sfcs.1979.34openalex-snapshot
Random walks, universal traversal sequences, and the complexity of maze problems
inferredcites →https://doi.org/10.5948/upo9781614440222openalex-snapshot
Random Walks and Electric Networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199810)29:2<57::aid-jgt1>3.0.co;2-bopenalex-snapshot
Random walks and the regeneration time
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(200001)16:1<58::aid-rsa5>3.0.co;2-eopenalex-snapshot
Dependent percolation and colliding random walks
inferred← citeshttps://doi.org/10.1002/ange.202014275openalex-snapshot
Growth of Colloidal Nanocrystals by Liquid‐Like Coalescence**
inferred← citeshttps://doi.org/10.1002/anie.202014275openalex-snapshot
Growth of Colloidal Nanocrystals by Liquid‐Like Coalescence**
inferred← citeshttps://doi.org/10.1002/jgt.22029openalex-snapshot
Hitting Times, Cover Cost, and the Wiener Index of a Tree
inferred← citeshttps://doi.org/10.1002/rsa.10083openalex-snapshot
Deterministic approximation of the cover time
inferred← citeshttps://doi.org/10.1002/rsa.20368openalex-snapshot
Clairvoyant scheduling of random walks
inferred← citeshttps://doi.org/10.1002/rsa.20999openalex-snapshot
Avoidance couplings on non‐complete graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240060106openalex-snapshot
A tight upper bound on the cover time for random walks on graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240060406openalex-snapshot
A tight lower bound on the cover time for random walks on graphs
inferred← citeshttps://doi.org/10.1002/rsa.999openalex-snapshot
Evasive random walks and the clairvoyant demon
inferred← citeshttps://doi.org/10.1002/rsa.999.absopenalex-snapshot
Evasive random walks and the clairvoyant demon
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1831openalex-snapshot
Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon
inferred← citeshttps://doi.org/10.1007/11549345_24openalex-snapshot
Asynchronous Deterministic Rendezvous in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_81openalex-snapshot
Impact of Local Topological Information on Random Walks on Finite Graphs
inferred← citeshttps://doi.org/10.1007/978-0-8176-4904-3_13openalex-snapshot
Fair and Biased Random Walks on Undirected Graphs and Related Entropies
inferred← citeshttps://doi.org/10.1007/978-3-031-44274-2_22openalex-snapshot
Meeting Times of Non-atomic Random Walks
inferred← citeshttps://doi.org/10.1007/978-3-319-54289-8_3openalex-snapshot
Unbiased Quantized Consensus
inferred← citeshttps://doi.org/10.1007/978-3-319-54289-8_4openalex-snapshot
Metropolis Quantized Consensus
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_45openalex-snapshot
On the Expected Time for Herman’s Probabilistic Self-stabilizing Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-28634-9_10openalex-snapshot
Analysis of the Information Propagation Time Among Mobile Hosts
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_56openalex-snapshot
Polynomial Deterministic Rendezvous in Arbitrary Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-75336-0_6openalex-snapshot
An Algorithmic Theory of Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_48openalex-snapshot
Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_52openalex-snapshot
Randomized Rendez-Vous with Limited Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_17openalex-snapshot
Deterministic Rendezvous in Trees with Little Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-19592-1_10openalex-snapshot
Critical Phenomena on Large Graphs with Regular Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-19592-1_9openalex-snapshot
When Feedbacks Matter: Epidemics, Synchronization, and Self-regulation in Complex Networks
inferred← citeshttps://doi.org/10.1007/978-981-15-0302-3_4openalex-snapshot
Scheduling of Non-Colliding Random Walks
inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_8openalex-snapshot
Separation Between Walksat and DPLL
inferred← citeshttps://doi.org/10.1007/bf01270386openalex-snapshot
Collecting coupons on trees, and the cover time of random walks
inferred← citeshttps://doi.org/10.1007/pl00008732openalex-snapshot
Dependent percolation in two dimensions
inferred← citeshttps://doi.org/10.1007/s00373-012-1175-xopenalex-snapshot
Exact Mixing Times for Random Walks on Trees
inferred← citeshttps://doi.org/10.1007/s00440-013-0519-7openalex-snapshot
Lipschitz embeddings of random sequences
inferred← citeshttps://doi.org/10.1007/s00440-017-0826-5openalex-snapshot
Lipschitz embeddings of random fields
inferred← citeshttps://doi.org/10.1007/s00440-025-01383-8openalex-snapshot
Dissipative particle systems on expanders
inferred← citeshttps://doi.org/10.1007/s00446-015-0246-7openalex-snapshot
Efficient distributed computation of distance sketches in networks
inferred← citeshttps://doi.org/10.1007/s00446-025-00487-7openalex-snapshot
Near-Optimal Leader Election in Population Protocols on Graphs
inferred← citeshttps://doi.org/10.1007/s00453-006-0074-2openalex-snapshot
Deterministic Rendezvous in Graphs
inferred← citeshttps://doi.org/10.1007/s10626-010-0092-5openalex-snapshot
A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents
inferred← citeshttps://doi.org/10.1007/s10955-020-02547-7openalex-snapshot
The End Time of SIS Epidemics Driven by Random Walks on Edge-Transitive Graphs
inferred← citeshttps://doi.org/10.1007/s11277-012-0536-3openalex-snapshot
A Small-World Routing Protocol and the Effect of Pass-Over for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/s11590-018-1314-2openalex-snapshot
Hitting time quasi-metric and its forest representation
inferred← citeshttps://doi.org/10.1016/j.aam.2018.07.002openalex-snapshot
The maximum relaxation time of a random walk
inferred← citeshttps://doi.org/10.1016/j.chaos.2026.118356openalex-snapshot
Smart walkers in discrete space
inferred← citeshttps://doi.org/10.1016/j.cnsns.2010.02.016openalex-snapshot
Random walks and flights over connected graphs and complex networks
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.026openalex-snapshot
The infection time of graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2012.10.002openalex-snapshot
Discrete Greenʼs functions and random walks on graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.01.002openalex-snapshot
Efficient random walk sampling in distributed networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.042openalex-snapshot
Improved approximation of the minimum cover time
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.05.022openalex-snapshot
On the expected time for Herman's probabilistic self-stabilizing algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.12.016openalex-snapshot
Asynchronous deterministic rendezvous in graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.010openalex-snapshot
How to meet in anonymous network
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.020openalex-snapshot
The hitting and cover times of random walks on finite graphs using local degree information
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.08.016openalex-snapshot
Some remarks on cops and drunk robbers
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116257openalex-snapshot
Separation between WalkSAT and DPLL
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00286-1openalex-snapshot
The local detection paradigm and its applications to self-stabilization
inferred← citeshttps://doi.org/10.1016/s0743-7315(02)00028-xopenalex-snapshot
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1016/s0743-7315(02)00034-5openalex-snapshot
Distributed communication algorithms for ad hoc mobile networks
inferred← citeshttps://doi.org/10.1017/cbo9780511662096openalex-snapshot
Surveys in Combinatorics, 1995
inferred← citeshttps://doi.org/10.1017/cbo9780511662096.007openalex-snapshot
Mixing of random walks and other diffusions on a graph
inferred← citeshttps://doi.org/10.1017/cbo9781139107174.018openalex-snapshot
Three problems for the clairvoyant demon
inferred← citeshttps://doi.org/10.1017/s0021900200008676openalex-snapshot
Percolation of Words on Z d with Long-Range Connections
inferred← citeshttps://doi.org/10.1017/s0021900200020787openalex-snapshot
Random walks on a complete graph: a model for infection
inferred← citeshttps://doi.org/10.1017/s0963548300001309openalex-snapshot
An Extension of Foster's Network Theorem
inferred← citeshttps://doi.org/10.1017/s0963548300004405openalex-snapshot
The Clairvoyant Demon Has a Hard Task
inferred← citeshttps://doi.org/10.1017/s0963548308009474openalex-snapshot
On a Form of Coordinate Percolation
inferred← citeshttps://doi.org/10.1017/s0963548310000118openalex-snapshot
Exit Frequency Matrices for Finite Markov Chains
inferred← citeshttps://doi.org/10.1017/s0963548315000152openalex-snapshot
A Hitting Time Formula for the Discrete Green's Function
inferred← citeshttps://doi.org/10.1017/s0963548316000195openalex-snapshot
Monotonicity of Avoidance Coupling on KN
inferred← citeshttps://doi.org/10.1017/s0963548318000500openalex-snapshot
An Upper Bound on the Size of Avoidance Couplings
inferred← citeshttps://doi.org/10.1017/s0963548397003076openalex-snapshot
A Note on Distributional Equality in the Cyclic Tour Property for Markov Chains
inferred← citeshttps://doi.org/10.1017/s0963548397003349openalex-snapshot
Reversal of Markov Chains and the Forget Time
inferred← citeshttps://doi.org/10.1017/s0963548398003538openalex-snapshot
On the Cover Time for Random Walks on Random Graphs
inferred← citeshttps://doi.org/10.1080/15326349708807428openalex-snapshot
Optimal running times for systems of random walks involving several particles
inferred← citeshttps://doi.org/10.1103/physreve.75.026104openalex-snapshot
Random walks along the streets and canals in compact cities: Spectral analysis, dynamical modularity, information, and statistical mechanics
inferred← citeshttps://doi.org/10.1103/physreve.90.012816openalex-snapshot
Networks maximizing the consensus time of voter models
inferred← citeshttps://doi.org/10.1103/physrevlett.116.055701openalex-snapshot
Critical Fragmentation Properties of Random Drilling: How Many Holes Need to Be Drilled to Collapse a Wooden Cube?
inferred← citeshttps://doi.org/10.1109/71.577257openalex-snapshot
Uniform and self-stabilizing token rings allowing unfair daemon
inferred← citeshttps://doi.org/10.1109/cdc.2008.4738749openalex-snapshot
On the convergence time of distributed quantized averaging algorithms
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760867openalex-snapshot
Convergence time for unbiased quantized consensus
inferred← citeshttps://doi.org/10.1109/cdc.2014.7039566openalex-snapshot
Fast convergence of quantized consensus using Metropolis chains
inferred← citeshttps://doi.org/10.1109/iccad.1992.279334openalex-snapshot
A new approach to effective circuit clustering
inferred← citeshttps://doi.org/10.1109/iceis.2006.1703205openalex-snapshot
Distributed Computation of a Spanning Tree in a Dynamic Graph by Mobile Agents
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195727openalex-snapshot
Near-optimal random walk sampling in distributed networks
inferred← citeshttps://doi.org/10.1109/istcs.1993.253476openalex-snapshot
Random walks on colored graphs
inferred← citeshttps://doi.org/10.1109/reldis.2002.1180175openalex-snapshot
Random walk for self-stabilizing group communication in ad-hoc networks
inferred← citeshttps://doi.org/10.1109/tac.2010.2093276openalex-snapshot
On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms
inferred← citeshttps://doi.org/10.1109/tac.2014.2342071openalex-snapshot
An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs
inferred← citeshttps://doi.org/10.1109/tac.2015.2440568openalex-snapshot
Convergence Time for Unbiased Quantized Consensus Over Static and Dynamic Networks
inferred← citeshttps://doi.org/10.1109/tac.2016.2539547openalex-snapshot
Convergence Time of Quantized Metropolis Consensus Over Time-Varying Networks
inferred← citeshttps://doi.org/10.1109/tac.2019.2895299openalex-snapshot
On the Structure and Computation of Random Walk Times in Finite Graphs
inferred← citeshttps://doi.org/10.1109/tmc.2006.104openalex-snapshot
Random walk for self-stabilizing group communication in ad hoc networks
inferred← citeshttps://doi.org/10.1109/tpds.2021.3076769openalex-snapshot
Self-Stabilizing Population Protocols With Global Knowledge
inferred← citeshttps://doi.org/10.1109/tro.2020.2990362openalex-snapshot
Robotic Surveillance Based on the Meeting Time of Random Walks
inferred← citeshttps://doi.org/10.1137/080729542openalex-snapshot
Multiple Random Walks in Random Regular Graphs
inferred← citeshttps://doi.org/10.1137/17m1119901openalex-snapshot
Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time
inferred← citeshttps://doi.org/10.1137/s0097539798335511openalex-snapshot
Design of On-Line Algorithms Using Hitting Times
inferred← citeshttps://doi.org/10.1137/s0895480193260595openalex-snapshot
Random Walks on Regular and Irregular Graphs
inferred← citeshttps://doi.org/10.1137/s0895480194264988openalex-snapshot
Short Random Walks on Graphs
inferred← citeshttps://doi.org/10.1140/epjb/e2011-20834-1openalex-snapshot
Mean first-passage time for random walks on undirected networks
inferred← citeshttps://doi.org/10.1140/epjst/e2010-01232-1openalex-snapshot
Markov chains or the game of structure and chance
inferred← citeshttps://doi.org/10.1142/9789812702449_0014openalex-snapshot
ON A DESIGN OF TRANSITION PROBABILITIES AND ESTIMATES OF COVER TIMES
inferred← citeshttps://doi.org/10.1142/s0129183116501229openalex-snapshot
Random walks on real metro systems
inferred← citeshttps://doi.org/10.1145/1582716.1582745openalex-snapshot
Fast distributed random walks
inferred← citeshttps://doi.org/10.1145/1978782.1978789openalex-snapshot
Randomized rendezvous with limited memory
inferred← citeshttps://doi.org/10.1145/1993806.1993853openalex-snapshot
A tight unconditional lower bound on distributed randomwalk computation
inferred← citeshttps://doi.org/10.1145/225058.225086openalex-snapshot
Efficient stopping rules for Markov chains
inferred← citeshttps://doi.org/10.1145/2312005.2312060openalex-snapshot
Efficient computation of distance sketches in distributed networks
inferred← citeshttps://doi.org/10.1145/2601068openalex-snapshot
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
inferred← citeshttps://doi.org/10.1145/3576900openalex-snapshot
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
inferred← citeshttps://doi.org/10.1145/380752.380874openalex-snapshot
Compatible sequences and a slow Winkler percolation
inferred← citeshttps://doi.org/10.1145/383962.384053openalex-snapshot
An efficient communication strategy for ad-hoc mobile networks
inferred← citeshttps://doi.org/10.1145/509907.509925openalex-snapshot
Clairvoyant scheduling of random walks
inferred← citeshttps://doi.org/10.1145/509923.509925openalex-snapshot
Clairvoyant scheduling of random walks
inferred← citeshttps://doi.org/10.11501/3106036openalex-snapshot
A Study on Distributed k-Mutual Exclusion Algorithms
inferred← citeshttps://doi.org/10.1155/2014/794781openalex-snapshot
Some Bounds for the Kirchhoff Index of Graphs
inferred← citeshttps://doi.org/10.1186/s40736-015-0016-2openalex-snapshot
Exact computation for meeting times and infection times of random walks on graphs
inferred← citeshttps://doi.org/10.1214/ecp.v5-1022openalex-snapshot
On the Cover Time of Planar Graphs
inferred← citeshttps://doi.org/10.1239/jap/1324046024openalex-snapshot
Percolation of Words on Zd with Long-Range Connections
inferred← citeshttps://doi.org/10.17654/dm027010039openalex-snapshot
TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS
inferred← citeshttps://doi.org/10.17877/de290r-15362openalex-snapshot
Searching Randomly for Maximum Matchings
inferred← citeshttps://doi.org/10.17877/de290r-23openalex-snapshot
Zur Analyse von randomisierten Suchheuristiken und Online-Heuristiken
inferred← citeshttps://doi.org/10.2200/s00278ed1v01y201004dct001openalex-snapshot
The Mobile Agent Rendezvous Problem in the Ring
inferred← citeshttps://doi.org/10.32657/10356/58914openalex-snapshot
Random walks in distributed networks and their applications
inferred← citeshttps://doi.org/10.37236/1209openalex-snapshot
Exact Mixing in an Unknown Markov Chain
inferred← citeshttps://doi.org/10.4108/icst.valuetools2009.7447openalex-snapshot
A random walk model for infection on graphs
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2016.104openalex-snapshot
Proving the Herman-Protocol Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.0810.5263openalex-snapshot
Lower bounds for distributed markov chain problems
inferred← citeshttps://doi.org/10.48550/arxiv.1102.2906openalex-snapshot
A Tight Lower Bound on Distributed Random Walk Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1112.1210openalex-snapshot
Efficient Computation of Distance Sketches in Distributed Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1201.1363openalex-snapshot
Near-Optimal Random Walk Sampling in Distributed Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1204.2931openalex-snapshot
Lipschitz embeddings of random sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1302.3212openalex-snapshot
Hitting Times, Cover Cost, and the Wiener Index of a Tree
inferred← citeshttps://doi.org/10.48550/arxiv.1512.04340openalex-snapshot
Path integral distance for data interpretation
inferred← citeshttps://doi.org/10.48550/arxiv.1806.08843openalex-snapshot
The Meeting Time of Multiple Random Walks
inferred← citeshttps://doi.org/10.48550/arxiv.1910.09483openalex-snapshot
Sampling random graph homomorphisms and applications to network data analysis
inferred← citeshttps://doi.org/10.5555/1283383.1283448openalex-snapshot
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
inferred← citeshttps://doi.org/10.5555/304032.304146openalex-snapshot
A new approach to effective circuit clustering
inferred← citeshttps://doi.org/10.5555/314464.314577openalex-snapshot
Design of on-line algorithms using hitting times
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.