Dudley Stark

collaborators

2 papers

math.CO2016

Poisson approximation of counts of subgraphs in random intersection graphs

Katarzyna Rybarczyk, Dudley Stark

Random intersection graphs are characterized by three parameters: $n$ , $m$ and $p$ , where $n$ is the number of vertices, $m$ is the number of objects, and $p$ is the probability th…

math.CO2016

The probability of nonexistence of a subgraph in a moderately sparse random graph

Dudley Stark, Nick Wormald

We develop a general procedure that finds recursions for statistics counting isomorphic copies of a graph $G_{0}$ in the common random graph models $G (n, m)$ and ${\cal G}(n,p)…