21 citations · 67 across the 26 of their papers we have counts for
38 papers
Rainbow Greedy Matching Algorithms
Patrick Bennett, Colin Cooper, Alan Frieze
We consider the problem of finding a large rainbow matching in a random graph with randomly colored edges. In particular we analyze the performance of two greedy algorithms for thi…
Discrete Incremental Voting
Colin Cooper, Tomasz Radzik, Takeharu Shiraga
We consider a type of pull voting suitable for discrete numeric opinions which can be compared on a linear scale, for example, 1 ('disagree strongly'), 2 ('disagree'), 5…
A simple model of influence
Colin Cooper, Nan Kang, Tomasz Radzik
We propose a simple model of influence in a network, based on edge density. In the model vertices (people) follow the opinion of the group they belong to. The opinion percolates do…
Triangle processes on graphs with given degree sequence
Colin Cooper, Martin Dyer, Catherine Greenhill
The switch chain is a well-studied Markov chain which generates random graphs with a given degree sequence and has uniform stationary distribution. Motivated by the high number of…
Distributed Averaging in Opinion Dynamics
Petra Berenbrink, Colin Cooper, Cristina Gava +4
We consider two simple asynchronous opinion dynamics on arbitrary graphs where every node has an initial value . In the first process, the NodeModel, at each time step…
Rank of the vertex-edge incidence matrix of -out hypergraphs
Colin Cooper, Alan Frieze
We consider a space of sparse Boolean matrices of size , which have finite co-rank over with high probability. In particular, the probability such a matrix has…