On the public citation graph
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
0 signed · 60 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.1006/inco.2001.3088openalex-snapshot
Distributed Probabilistic Polling and Applications to Proportionate Agreement
inferredcites →https://doi.org/10.1007/978-3-642-02930-1_33openalex-snapshot
Multiple Random Walks and Interacting Particle Systems
inferredcites →https://doi.org/10.1007/978-3-642-03685-9_36openalex-snapshot
How Well Do Random Walks Parallelize?
inferredcites →https://doi.org/10.1007/978-3-662-43951-7_37openalex-snapshot
The Power of Two Choices in Distributed Voting
inferredcites →https://doi.org/10.1007/978-3-662-48653-5_17openalex-snapshot
Fast Consensus for Voting on General Expander Graphs
inferredcites →https://doi.org/10.1007/s10959-013-0497-9openalex-snapshot
Mixing Times are Hitting Times of Large Sets
inferredcites →https://doi.org/10.1016/0304-4149(91)90090-yopenalex-snapshot
Meeting times for independent Markov chains
inferredcites →https://doi.org/10.1016/j.jcss.2005.06.009openalex-snapshot
On certain connectivity properties of the internet topology
inferredcites →https://doi.org/10.1016/j.tcs.2010.08.010openalex-snapshot
Tight bounds for the cover time of multiple random walks
inferredcites →https://doi.org/10.1016/s0304-3975(01)00055-xopenalex-snapshot
Local majorities, coalitions and monopolies in graphs: a review
inferredcites →https://doi.org/10.1017/s0963548307008693openalex-snapshot
On the Laplacian Eigenvalues of Gn,p
inferredcites →https://doi.org/10.1017/s096354831000012xopenalex-snapshot
Testing Expansion in Bounded-Degree Graphs
inferredcites →https://doi.org/10.1017/s0963548311000125openalex-snapshot
Many Random Walks Are Faster Than One
inferredcites →https://doi.org/10.1017/s144678870001274xopenalex-snapshot
Random walks on random trees
inferredcites →https://doi.org/10.1090/s0002-9947-2011-05523-6openalex-snapshot
On the coalescence time of reversible random walks
inferredcites →https://doi.org/10.1093/imrn/rnx082openalex-snapshot
Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding
inferredcites →https://doi.org/10.1109/infcom.2009.5062181openalex-snapshot
Using Three States for Binary Consensus on Complete Graphs
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.1137/0406029openalex-snapshot
Collisions Among Random Walks on a Graph
inferredcites →https://doi.org/10.1137/080729542openalex-snapshot
Multiple Random Walks in Random Regular Graphs
inferredcites →https://doi.org/10.1137/1.9781611973730.27openalex-snapshot
Plurality Consensus in the Gossip Model
inferredcites →https://doi.org/10.1137/1.9781611974331.ch46openalex-snapshot
Stabilizing Consensus with Many Opinions
inferredcites →https://doi.org/10.1137/1.9781611975482.59openalex-snapshot
On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract
inferredcites →https://doi.org/10.1137/1.9781611975505.13openalex-snapshot
Random walks on graphs: new bounds on hitting, meeting, coalescing and returning
inferredcites →https://doi.org/10.1137/120900368openalex-snapshot
Coalescing Random Walks and Voting on Connected Graphs
inferredcites →https://doi.org/10.1137/s0895480103428478openalex-snapshot
The Cover Time of Random Regular Graphs
inferredcites →https://doi.org/10.1145/1411509.1411510openalex-snapshot
Tight bounds for asynchronous randomized consensus
inferredcites →https://doi.org/10.1145/1989493.1989516openalex-snapshot
Stabilizing consensus with the power of two choices
inferredcites →https://doi.org/10.1145/3388392.3388402openalex-snapshot
Distributed Computing Column 77 Consensus Dynamics
inferredcites →https://doi.org/10.1145/781027.781046openalex-snapshot
Conductance and congestion in power law graphs
inferredcites →https://doi.org/10.1214/12-aop813openalex-snapshot
Mean field conditions for coalescing random walks
inferredcites →https://doi.org/10.1214/aoap/1028903453openalex-snapshot
Chernoff-type bound for finite Markov chains
inferredcites →https://doi.org/10.1214/aop/1176991158openalex-snapshot
Coalescing Random Walks and Voter Model Consensus Times on the Torus in $\mathbb{Z}^d$
inferredcites →https://doi.org/10.4007/annals.2015.182.1.7openalex-snapshot
Interlacing families I: Bipartite Ramanujan graphs of all degrees
inferredcites →https://doi.org/10.4230/lipics.disc.2017.13openalex-snapshot
Fast Plurality Consensus in Regular Expanders
inferredcites →https://doi.org/10.4230/lipics.icalp.2016.144openalex-snapshot
The Linear Voting Model
inferredcites →https://doi.org/10.4230/lipics.icalp.2016.146openalex-snapshot
Bounds on the Voter Model in Dynamic Networks
inferredcites →https://doi.org/10.48550/arxiv.1404.7479openalex-snapshot
The Power of Two Choices in Distributed Voting
inferredcites →https://doi.org/10.48550/arxiv.1705.05583openalex-snapshot
Tight Analysis for the 3-Majority Consensus Dynamics
inferredcites →https://doi.org/10.5555/1958171.1958176openalex-snapshot
Multiple Random Walks in Random Regular Graphs
inferredcites →https://doi.org/10.5555/3091125.3091319openalex-snapshot
Error Cascades in Collective Behavior: A Case Study of the Gradient Algorithm on 1000 Physical Agents
inferredcites →https://doi.org/10.5860/choice.47-2624openalex-snapshot
Markov chains and mixing times
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-77404-6_14openalex-snapshot
Random Walks with Multiple Step Lengths
inferred← citeshttps://doi.org/10.1016/j.spa.2025.104737openalex-snapshot
The phase transition of the voter model on evolving scale-free networks
inferred← citeshttps://doi.org/10.1073/pnas.1706439114openalex-snapshot
Ant-Inspired Density Estimation via Random Walks
inferred← citeshttps://doi.org/10.1098/rsos.230505openalex-snapshot
How networks shape diversity for better or worse
inferred← citeshttps://doi.org/10.1109/hpca68181.2026.11408601openalex-snapshot
RidgeWalker: Perfectly Pipelined Graph Random Walks on FPGAs
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00106openalex-snapshot
Servicing Demands between Multiple Pairs of Nodes on Heterogeneous Quantum Networks
inferred← citeshttps://doi.org/10.1126/sciadv.abe8211openalex-snapshot
Intermittent inverse-square Lévy walks are optimal for finding targets of all sizes
inferred← citeshttps://doi.org/10.1137/1.9781611975505.13openalex-snapshot
Random walks on graphs: new bounds on hitting, meeting, coalescing and returning
inferred← citeshttps://doi.org/10.1145/3796701.3815961openalex-snapshot
Brief Announcement: Limit Laws for Consensus Protocols on the Complete Graph
inferred← citeshttps://doi.org/10.1214/25-ecp725openalex-snapshot
Coalescence on the discrete torus revisited
inferred← citeshttps://doi.org/10.17863/cam.41384openalex-snapshot
Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2020.28openalex-snapshot
Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths
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.