Colin Cooper
Identifiers
- name variant Colin Cooper 0.60 · backfill
Papers (31)
- Edge disjoint Hamilton cycles in random digraphs of constant minimum degree math.CO · 2026 · author #1
- Diffusion limited aggregation in the layers model math.PR · 2023 · author #1
- Triangle-creation processes on cubic graphs cs.DM · 2019 · author #1
- On the cover time of dense graphs math.CO · 2018 · author #1
- The cover time of a biased random walk on a random cubic graph math.CO · 2018 · author #1
- Dispersion processes cs.DM · 2017 · author #1
- The covertime of a biased random walk on $G_{n,p}$ math.CO · 2017 · author #1
- Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time cs.DC · 2017 · author #2
- The flip Markov chain for connected regular graphs cs.DM · 2017 · author #1
- Minors of a random binary matroid math.CO · 2016 · author #1
- Fast plurality consensus in regular expanders cs.DM · 2016 · author #1
- On randomly generated intersecting hypergraphs math.CO · 2016 · author #2
- Discordant voting processes on finite graphs cs.DM · 2016 · author #1
- The coalescing-branching random walk on expanders and the dual epidemic process cs.DC · 2016 · author #1
- Rainbow arborescence in random digraphs math.CO · 2014 · author #3
- Cover time of a random graph with a degree sequence II: Allowing vertices of degree two math.CO · 2014 · author #1
- A note on the vacant set of random walks on the hypercube and other regular graphs of high degree math.CO · 2014 · author #1
- The Power of Two Choices in Distributed Voting cs.DS · 2014 · author #1
- Vacant sets and vacant nets: Component structures induced by a random walk math.CO · 2014 · author #1
- Long paths in random Apollonian networks math.PR · 2014 · author #1
- The height of random $k$-trees and related branching processes math.CO · 2013 · author #1
- On the length of a random minimum spanning tree math.CO · 2012 · author #1
- Coalescing random walks and voting on connected graphs cs.DS · 2012 · author #1
- Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time cs.DS · 2012 · author #2
- Corrigendum: Sampling regular graphs and a peer-to-peer network math.CO · 2012 · author #1
- Viral processes by random walks on random regular graphs math.PR · 2011 · author #2
- Stationary distribution and cover time of random walks on random digraphs math.CO · 2011 · author #1
- On the Imitation Strategy for Games on Graphs cs.GT · 2011 · author #1
- Chains-into-Bins Processes cs.DS · 2010 · author #3
- Component structure of the vacant set induced by a random walk on a random graph math.CO · 2010 · author #1
- Energy Efficient Randomized Communication in Unknown AdHoc Networks cs.DC · 2006 · author #2
Mentions
Frequent Coauthors
- Alan Frieze 17 shared papers
- Tomasz Radzik 6 shared papers
- Martin Dyer 5 shared papers
- Catherine Greenhill 3 shared papers
- Nicolas Rivera 3 shared papers
- Petra Berenbrink 3 shared papers
- Takeharu Shiraga 2 shared papers
- Wesley Pegden 2 shared papers
- Andreas Bilke 1 shared papers
- Andrew Handley 1 shared papers
- Andrew McDowell 1 shared papers
- Deepak Bal 1 shared papers
- Eyal Lubetzky 1 shared papers
- Hirotaka Ono 1 shared papers
- Joel Spencer 1 shared papers
- Mikl\'os Ruszink\'o 1 shared papers
- Moez Draief 1 shared papers
- Mohammed Abdullah 1 shared papers
- Nate Ince 1 shared papers
- Nicol\'as Rivera 1 shared papers