21 citations · 67 across the 26 of their papers we have counts for
Showing 2018 · math.COShow all
3 papers · 2 filters
math.CO2018
On the cover time of dense graphs
Colin Cooper, Alan Frieze, Wesley Pegden
We consider arbitrary graphs with vertices and minimum degree at least where is constant. If the conductance of 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 0/1 matrix where each column is chosen independently from the set of 0/1 vectors with exactly 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,…