Wesley Pegden

activity

20102026

most citedAssessing significance in a Markov chain without mixing

86 citations · 218 across the 38 of their papers we have counts for

collaborators

Showing 2018Show all

4 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

On the cover time of the emerging giant

Alan Frieze, Wesley Pegden, Tomasz Tkocz

Let $p = \frac{1 + ε}{n}$ . It is known that if $N = ε^{3} n \to \infty$ then w.h.p. $G_{n, p}$ has a unique giant largest component. We show that if in addition, $\varepsil…

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

Extremal Collections of $k$ -Uniform Vectors

Joseph Briggs, Wesley Pegden

We show any matrix of rank $r$ over $F_{q}$ can have $\leq (k r) (q - 1)^{k}$ distinct columns of weight $k$ if $k \leq O_{q} (lo g r)$ (up to divisibility issues), a…

On the cover time of dense graphs

On the cover time of the emerging giant

On the rank of a random binary matrix

Extremal Collections of k-Uniform Vectors

Extremal Collections of $k$ -Uniform Vectors