C. Cooper

activity

20062023

most citedOn the length of a random minimum spanning tree

21 citations · 67 across the 26 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018

On the cover time of dense graphs

Colin Cooper, Alan Frieze, Wesley Pegden

We consider arbitrary graphs $G$ with $n$ vertices and minimum degree at least $δ n$ where $δ > 0$ is constant. If the conductance of $G$ is sufficiently large then we obtain an asymp…

math.CO2018★ 5 cited

On the rank of a random binary matrix

C. Cooper, A. M. Frieze, W. Pegden

We study the rank of the random $n \times m$ 0/1 matrix $A_{n, m; k}$ where each column is chosen independently from the set $Ω_{n, k}$ of 0/1 vectors with exactly $k$ 1's. Here…

math.CO2018

The cover time of a biased random walk on a random cubic graph

Colin Cooper, Alan Frieze, Tony Johansson

We study a random walk that prefers tou se unvisited edges in the context of random cubic graphs. We establish asymptotically correct estimates for the vertex and edge cover times,…