Publications: Dr Dudley Stark
STARK D, Wormald N(2018).
The probability of non-existence of a subgraph in a moderately sparse random graph. Combinatorics, Probability and Computing
vol. 27,
672-715.
STARK D, Cortis D(2017).
Balancing the book: Is it necessary and sufficient?. The Journal of Gambling Business and Economics
Rybarczyk K, STARK D(2017).
Poisson approximation of counts of subgraphs in random intersection graphs. Discrete Mathematics
Stark D(2016).
Bin sizes in time-inhomogeneous infinite Polya processes. Statistics & Probability Letters
vol. 113,
Article C,
49-53.
Granovsky BL, Stark D(2015).
Developments in the Khintchine-Meinardus probabilistic method for asymptotic enumeration. ELECTRONIC JOURNAL OF COMBINATORICS
vol. 22,
(4)
Article ARTN P4.32,
Gauci JB, Hilton AJW, Stark D(2013).
Wiggles and Finitely Discontinuous k-to-1 Functions Between Graphs. JOURNAL OF GRAPH THEORY
vol. 74,
(3)
275-308.
Stark D (2013).
The asymptotic number of spanning forests of complete bipartite labelled graphs. DISCRETE MATHEMATICS.
vol. 313,
1256-1261.
Granovsky BL, Stark D(2012).
A Meinardus Theorem with Multiple Singularities. COMMUNICATIONS IN MATHEMATICAL PHYSICS
vol. 314,
(2)
329-350.
Stark D(2011).
The Edge Correlation of Random Forests. ANNALS OF COMBINATORICS
vol. 15,
(3)
529-539.
Stark D(2011).
OIL PRODUCTION MODELS WITH NORMAL RATE CURVES. PROBAB ENG INFORM SC
vol. 25,
(2)
205-217.
Rybarczyk K, Stark D(2010).
POISSON APPROXIMATION OF THE NUMBER OF CLIQUES IN RANDOM INTERSECTION GRAPHS. J APPL PROBAB
vol. 47,
(3)
826-840.
Cameron P, Kang M, Stark D (2010).
Random preorders and alignments. DISCRETE MATHEMATICS.
vol. 310,
591-603.
Cameron P, Prellberg T, Stark D (2010).
Asymptotic enumeration of 2-covers and line graphs. DISCRETE MATHEMATICS.
vol. 310,
230-240.
Granovsky BL, Stark D, Erlihson M(2008).
Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof. ADV APPL MATH
vol. 41,
(3)
307-328.
Jaworski J, Stark D(2008).
The Vertex Degree Distribution of Passive Random Intersection Graph Models. Combinatrics, Probability & Computing
vol. 17,
(4)
549-558.
Cameron P, Prellberg T, Stark D(2006).
Asymptotics for incidence matrix classes. ELECTRON J COMB
vol. 13,
(1)
Article R85,
Jaworski J, Karonski M, Stark D(2006).
The degree of a typical vertex in generalized random intersection graph models. DISCRETE MATH
vol. 306,
(18)
2152-2165.
Stark D(2006).
Logical limit laws for logarithmic structures. MATH PROC CAMBRIDGE
vol. 140,
537-544.
Granovsky BL, Stark D(2006).
Asymptotic enumeration and logical limit laws for expansive multisets and selections. J LOND MATH SOC
vol. 73,
252-272.
Cameron P, Prellberg T, Stark D (2006).
Asymptotic enumeration of incidence matrices. International Workshop on Statistical Mechanics and Combinatorics: Counting Complexity.
Editors: DeGier, J, Warnaar, O,
vol. 42,
59-70.
Stark D(2004).
Convergence in distribution for subset counts between random sets. ELECTRON J COMB
vol. 11,
(1)
Article R59,
Stark D(2004).
The vertex degree distribution of random intersection graphs. RANDOM STRUCT ALGOR
vol. 24,
(3)
249-258.
Stark D(2002).
Information loss in top to random shuffling. COMB PROBAB COMPUT
vol. 11,
(6)
607-627.
CAMERON PJ, STARK D(2002).
A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property. The Electronic Journal of Combinatorics
vol. 9,
Stark D, Ganesh A, O'Connell N(2002).
Information loss in riffle shuffling. COMB PROBAB COMPUT
vol. 11,
(1)
79-95.
Stark D(2001).
Compound Poisson approximations of subgraph counts in random graphs. RANDOM STRUCT ALGOR
vol. 18,
(1)
39-60.
