21 citations · 29 across the 13 of their papers we have counts for
7 papers · 1 filter
Poisson approximations of the number of fixed points in random multiset permutations
Dudley Stark
For ordinary permutations on letters, the distribution of the number of fixed points of random permutations is well known to approach the Poisson distribution in total var…
Poisson approximation of counts of subgraphs in random intersection graphs
Katarzyna Rybarczyk, Dudley Stark
Random intersection graphs are characterized by three parameters: , and , where is the number of vertices, is the number of objects, and is the probability th…
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 in the common random graph models and ${\cal G}(n,p)…
Asymptotic enumeration of 2-covers and line graphs
Peter Cameron, Thomas Prellberg, Dudley Stark
In this paper we find asymptotic enumerations for the number of line graphs on -labelled vertices and for different types of related combinatorial objects called 2-covers. We fi…
Asymptotic enumeration of incidence matrices
Peter Cameron, Thomas Prellberg, Dudley Stark
We discuss the problem of counting {\em incidence matrices}, i.e. zero-one matrices with no zero rows or columns. Using different approaches we give three different proofs for the…
Asymptotics for incidence matrix classes
Peter Cameron, Thomas Prellberg, Dudley Stark
We define {\em incidence matrices} to be zero-one matrices with no zero rows or columns. A classification of incidence matrices is considered for which conditions of symmetry by tr…