Joel Spencer

most citedA point process describing the component sizes in the critical window of the random graph evolution

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2005

First Order Definability of Trees and Sparse Random Graphs

Tom Bohman, Alan Frieze, Tomasz Luczak +4

Let D(G) be the smallest quantifier depth of a first order formula which is true for a graph G but false for any other non-isomorphic graph. This can be viewed as a measure for the…

math.PR2005★ 1 cited

A point process describing the component sizes in the critical window of the random graph evolution

Svante Janson, Joel Spencer

We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n,p) in the critical window p=n^{-1}+lambda n^{-4/3}. In partic…

math.CO2005

Counting Connected Graphs Asymptotically

Remco van der Hofstad, Joel Spencer

We find the asymptotic number of connected graphs with $k$ vertices and $k - 1 + l$ edges when $k, l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\e…