Daniel J. Poole

most citedOn Weak Hamiltonicity of a Random Hypergraph

11 citations · 11 across the 2 of their papers we have counts for

collaborators

Showing math.PRShow all

2 papers · 1 filter

math.PR2016

Birth of a giant $(k_{1}, k_{2})$ -core in the random digraph

Boris Pittel, Dan Poole

The $(k_{1}, k_{2})$ -core of a digraph is the largest sub-digraph with minimum in-degree and minimum out-degree at least $k_{1}$ and $k_{2}$ respectively. For $max {k_{1}, k_{2}} \geq 2$ , we…

math.PR2014

Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs

Boris Pittel, Daniel Poole

Two models of a random digraph on $n$ vertices, $D (n, Prob (arc) = p)$ and $D (n, number of arcs = m)$ are studied. In 1990, Karp for $D (n, p)$ and independently T. Łuc…

Birth of a giant (k1​,k2​)-core in the random digraph

Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs

Birth of a giant $(k_{1}, k_{2})$ -core in the random digraph