2 citations · 3 across the 6 of their papers we have counts for
Showing 2007Show all
3 papers · 1 filter
math.CO2007
On the threshold for k-regular subgraphs of random graphs
Pawel Pralat, Jacques Verstraete, Nicholas Wormald
The -core of a graph is the largest subgraph of minimum degree at least . We show that for sufficiently large, the -core of a random graph $\G(n,p)$ asymptotical…
math.CO2007
Expansion properties of a random regular graph after random vertex deletions
Catherine Greenhill, Fred B. Holt, Nicholas Wormald
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p=n^{-a…
math.PR2007★ 2 cited
On the hardness of sampling independent sets beyond the tree threshold
Elchanan Mossel, Dror Weitz, Nicholas Wormald
We consider local Markov chain Monte-Carlo algorithms for sampling from the weighted distribution of independent sets with activity , where the weight of an independent set …