Colin Cooper

ORCID

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 49

Top Venues

CoRR

Random Struct. Algorithms

SIAM J. Discret. Math.

Internet Math.

Publications

Colin Cooper, Nan Kang, Tomasz Radzik, Ngoc Vu
A Simple Model of Influence: Details and Variants of Dynamics. WAW (2024)
Colin Cooper, Tomasz Radzik, Takeharu Shiraga
Brief Announcement: Discrete Incremental Voting. PODC (2023)
Colin Cooper, Nan Kang, Tomasz Radzik
A Simple Model of Influence. WAW (2023)
Colin Cooper, Tomasz Radzik, Takeharu Shiraga
Discrete Incremental Voting. CoRR (2023)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
A triangle process on graphs with given degree sequence. CoRR (2023)
Colin Cooper, Tomasz Radzik, Takeharu Shiraga
Discrete Incremental Voting. OPODIS (2023)
Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik, Nicolas Rivera
Distributed Averaging in Opinion Dynamics. PODC (2023)
Colin Cooper, Nan Kang, Tomasz Radzik
A simple model of influence. CoRR (2023)
Colin Cooper, Alan M. Frieze
Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs. SIAM J. Discret. Math. 36 (3) (2022)
Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Nicolás Rivera, Tomasz Radzik
Distributed Averaging in Population Protocols. CoRR (2022)
Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik
On early extinction and the effect of travelling in the SIR model. UAI (2022)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
A Triangle Process on Regular Graphs. IWOCA (2021)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
A triangle process on regular graphs. CoRR (2020)
Colin Cooper, Tomasz Radzik, Nicolas Rivera
New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. ACM Trans. Parallel Comput. 6 (3) (2019)
Colin Cooper, Alan M. Frieze, Wesley Pegden
On the rank of a random binary matrix. SODA (2019)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley
The flip Markov chain for connected regular graphs. Discret. Appl. Math. 254 (2019)
Colin Cooper, Alan M. Frieze, Wesley Pegden
On the Cover Time of Dense Graphs. SIAM J. Discret. Math. 33 (3) (2019)
Colin Cooper, Alan M. Frieze, Wesley Pegden
On the Rank of a Random Binary Matrix. Electron. J. Comb. 26 (4) (2019)
Colin Cooper, Alan M. Frieze, Wesley Pegden
Minors of a random binary matroid. Random Struct. Algorithms 55 (4) (2019)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
Triangle-creation processes on cubic graphs. CoRR (2019)
Colin Cooper, Alan M. Frieze, Tony Johansson
The cover time of a biased random walk on a random cubic graph. CoRR (2018)
Colin Cooper, Alan M. Frieze, Tony Johansson
The Cover Time of a Biased Random Walk on a Random Cubic Graph. AofA (2018)
Colin Cooper, Nicolás Rivera
Threshold behaviour of discordant voting on the complete graph. J. Discrete Algorithms 50 (2018)
Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolás Rivera
Discordant Voting Processes on Finite Graphs. SIAM J. Discret. Math. 32 (4) (2018)
Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Dispersion processes. Random Struct. Algorithms 53 (4) (2018)
Colin Cooper, Alan M. Frieze, Samantha Petti
. ANALCO (2018)
Colin Cooper, Ngoc Vu
An Experimental Study of the k-MXT Algorithm with Applications to Clustering Geo-Tagged Data. WAW (2018)
Colin Cooper, Alan M. Frieze, Wesley Pegden
On the cover time of dense graphs. CoRR (2018)
Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Dispersion processes. CoRR (2017)
Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi
Constructing self-stabilizing oscillators in population protocols. Inf. Comput. 255 (2017)
Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik
) Convergence Time. PODC (2017)
Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik
Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time. CoRR (2017)
Colin Cooper, Tomasz Radzik, Nicolas Rivera
Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. SPAA (2017)
Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley
The flip Markov chain for connected regular graphs. CoRR (2017)
Colin Cooper, Alan M. Frieze, Samantha Petti
. CoRR (2017)
David Kohan Marzagão, Nicolas Rivera, Colin Cooper, Peter McBurney, Kathleen Steinhöfel
Multi-Agent Flag Coordination Games. AAMAS (2017)
Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Fast Plurality Consensus in Regular Expanders. DISC (2017)
Colin Cooper, Tomasz Radzik, Nicolas Rivera
The coalescing-branching random walk on expanders and the dual epidemic process. CoRR (2016)
Colin Cooper, Alan M. Frieze
Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk. SIAM J. Discret. Math. 30 (1) (2016)
Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera
Discordant Voting Processes on Finite Graphs. ICALP (2016)
Patrick Veenstra, Colin Cooper, Steve Phelps
The use of Biweight Mid Correlation to improve graph based portfolio construction. CEEC (2016)
Colin Cooper, Nicolas Rivera
The Linear Voting Model. ICALP (2016)
Patrick Veenstra, Colin Cooper, Steve Phelps
Spectral clustering using the kNN-MST similarity graph. CEEC (2016)
Colin Cooper, Tomasz Radzik, Nicolas Rivera
The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process. PODC (2016)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
Fast Low-Cost Estimation of Network Properties Using Random Walks. Internet Math. 12 (4) (2016)
Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera
Discordant voting processes on finite graphs. CoRR (2016)
Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Fast plurality consensus in regular expanders. CoRR (2016)
Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat
Rainbow Arborescence in Random Digraphs. J. Graph Theory 83 (3) (2016)
Colin Cooper, Alan M. Frieze, Nate Ince, Svante Janson, Joel Spencer
On the Length of a Random Minimum Spanning Tree. Comb. Probab. Comput. 25 (1) (2016)
Petra Berenbrink, Colin Cooper, Tom Friedetzky
Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time. Random Struct. Algorithms 46 (1) (2015)
Colin Cooper, Alan M. Frieze
Long Paths in Random Apollonian Networks. Internet Math. 11 (4-5) (2015)
Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi
Constructing Self-stabilizing Oscillators in Population Protocols. SSS (2015)
Fei Gao, Katarzyna Musial, Colin Cooper, Sophia Tsoka
Link Prediction Methods and Their Accuracy for Different Social Networks and Network Metrics. Sci. Program. 2015 (2015)
Colin Cooper, Robert Elsässer, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Fast Consensus for Voting on General Expander Graphs. DISC (2015)
Mohammed Amin Abdullah, Colin Cooper, Moez Draief
Speeding Up Cover Time of Sparse Graphs Using Local Knowledge. IWOCA (2015)
Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Coalescing Walks on Rotor-Router Systems. SIROCCO (2015)
Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald
Randomized diffusion for indivisible loads. J. Comput. Syst. Sci. 81 (1) (2015)
Colin Cooper, Robert Elsässer, Tomasz Radzik
The Power of Two Choices in Distributed Voting. CoRR (2014)
Colin Cooper, Alan M. Frieze, Ryuhei Uehara
-trees and related branching processes. Random Struct. Algorithms 45 (4) (2014)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence. Internet Math. 10 (1-2) (2014)
Colin Cooper, Sang-Hyuk Lee, Tomasz Radzik, Yiannis Siantos
Random walks in recommender systems: exact computation and simulations. WWW (Companion Volume) (2014)
Colin Cooper, Robert Elsässer, Tomasz Radzik
The Power of Two Choices in Distributed Voting. ICALP (2) (2014)
Colin Cooper, Alan M. Frieze, Eyal Lubetzky
Cover time of a random graph with a degree sequence II: Allowing vertices of degree two. Random Struct. Algorithms 45 (4) (2014)
Colin Cooper, Alan M. Frieze, Pawel Pralat
Some Typical Properties of the Spatial Preferred Attachment Model. Internet Math. 10 (1-2) (2014)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
Estimating network parameters using random walks. Soc. Netw. Anal. Min. 4 (1) (2014)
Colin Cooper, Alan M. Frieze
Component structure of the vacant set induced by a random walk on a random graph. Random Struct. Algorithms 42 (2) (2013)
Colin Cooper, Alan M. Frieze, Tomasz Radzik
The cover times of random walks on random uniform hypergraphs. Theor. Comput. Sci. 509 (2013)
Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
Coalescing Random Walks and Voting on Connected Graphs. SIAM J. Discret. Math. 27 (4) (2013)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
Fast Low-Cost Estimation of Network Properties Using Random Walks. WAW (2013)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
Estimating network parameters using random walks. CASoN (2012)
Petra Berenbrink, Colin Cooper, Tom Friedetzky
Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time CoRR (2012)
Petra Berenbrink, Colin Cooper, Tom Friedetzky
Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time. PODC (2012)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
A fast algorithm to find all high degree vertices in power law graphs. WWW (Companion Volume) (2012)
Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
Coalescing random walks and voting on graphs. PODC (2012)
Colin Cooper, Alan M. Frieze
Stationary distribution and cover time of random walks on random digraphs. J. Comb. Theory, Ser. B 102 (2) (2012)
Colin Cooper, Alan M. Frieze, Pawel Pralat
Some Typical Properties of the Spatial Preferred Attachment Model. WAW (2012)
Mohammed Amin Abdullah, Colin Cooper, Alan M. Frieze
Cover time of a random graph with given degree sequence. Discret. Math. 312 (21) (2012)
Colin Cooper, Tomasz Radzik, Yiannis Siantos
A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence. WAW (2012)
Tugkan Batu, Petra Berenbrink, Colin Cooper
Chains-into-bins processes. J. Discrete Algorithms 14 (2012)
Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
Coalescing random walks and voting on graphs CoRR (2012)
Colin Cooper, Alan M. Frieze, Tomasz Radzik
The Cover Times of Random Walks on Hypergraphs. SIROCCO (2011)
Colin Cooper, Martin E. Dyer, Velumailum Mohanaraj
On the Imitation Strategy for Games on Graphs CoRR (2011)
Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald
Randomized Diffusion for Indivisible Loads. SODA (2011)
Colin Cooper, Pawel Pralat
Scale-free graphs of increasing degree. Random Struct. Algorithms 38 (4) (2011)
Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. 24 (2) (2011)
Colin Cooper, Alan M. Frieze
Stationary distribution and cover time of random walks on random digraphs CoRR (2011)
Mohammed Amin Abdullah, Colin Cooper, Moez Draief
Viral Processes by Random Walks on Random Regular Graphs. APPROX-RANDOM (2011)
Colin Cooper
Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful. SIROCCO (2011)
Colin Cooper, Martin E. Dyer, Andrew J. Handley
Networks of random cycles. SODA (2011)
Colin Cooper, Alan M. Frieze
The cover time of random geometric graphs. Random Struct. Algorithms 38 (3) (2011)
Colin Cooper, Alan M. Frieze
Component structure of the vacant set induced by a random walk on a random graph. SODA (2011)
Colin Cooper, Alan M. Frieze
Random Walks with Look-Ahead in Scale-Free Random Graphs. SIAM J. Discret. Math. 24 (3) (2010)
Colin Cooper, Alan M. Frieze
Component structure induced by a random walk on a random graph CoRR (2010)
Colin Cooper, Ralf Klasing, Tomasz Radzik
Locating and repairing faults in a network with mobile agents. Theor. Comput. Sci. 411 (14-15) (2010)
Tugkan Batu, Petra Berenbrink, Colin Cooper
Chains-into-Bins Processes. IWOCA (2010)
Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald
Speeding Up Random Walks with Neighborhood Exploration. SODA (2010)
Tugkan Batu, Petra Berenbrink, Colin Cooper
Chains-into-Bins Processes CoRR (2010)
Colin Cooper, Alan M. Frieze, Michael Krivelevich
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. SIAM J. Discret. Math. 24 (2) (2010)
Mohammed Amin Abdullah, Colin Cooper, Tomasz Radzik
The Cover Time of Cartesian Product Graphs. IWOCA (2010)
Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze
An Efficient Sparse Regularity Concept. SIAM J. Discret. Math. 23 (4) (2010)

Colin Cooper.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Colin Cooper