Dr Dudley Stark
Reader in Mathematics and Probability
School of Mathematical Sciences
Queen Mary University of London
Queen Mary University of London
Research
Random combinatorial object, Random graph, Poisson approximation, Generating function, Asymptotic expansion, Graph theory
Interests
I have done a lot of research in probability and combinatorics, often regarding random combinatorial objects such as random permutations and random graphs.Publications
Publications of specific relevance to the Centre for Combinatorics, Algebra and Number Theory2024
Stark D (2024). Markov chains generating random permutations and set partitions. Stochastic Processes and their Applications, Elsevier vol. 178, 104483-104483. 10-09-2024
2023
Stark D (2023). The small cycle counts of random feedback shift registers. Australasian Journal of Combinatorics, Centre for Combinatorics vol. 86 (3), 414-422. 01-06-2023
Gnedin A and Stark D (2023). Random permutations and queues. Advances in Applied Mathematics, Elsevier vol. 149, 102549-102549. 12-05-2023
2022
Stark D (2022). The component counts of random functions. Discrete Mathematics, Elsevier vol. 345 (9) 01-09-2022
2021
Stark D (2021). The asymptotic number of weighted partitions with a given number of parts. The Ramanujan Journal: an international journal devoted to areas of mathematics influenced by Ramanu, Springer Verlag 15-02-2021
Stark D (2021). The component counts of random injections. The Electronic Journal of Combinatorics, The Electronic Journal of Combinatorics 15-01-2021
2018
STARK D and Wormald N (2018). The probability of non-existence of a subgraph in a moderately sparse random graph. Combinatorics, Probability and Computing, Cambridge University Press (CUP) vol. 27, 672-715. 24-07-2018
2017
STARK D and Cortis D (2017). Balancing the book: Is it necessary and sufficient? The Journal of Gambling Business and Economics 16-12-2017
Rybarczyk K and STARK D (2017). Poisson approximation of counts of subgraphs in random intersection graphs. Discrete Mathematics, Elsevier 16-05-2017
2016
Stark D (2016). Bin sizes in time-inhomogeneous infinite Polya processes. Statistics & Probability Letters vol. 113, 49-53. 04-03-2016
2015
Granovsky BL and Stark D (2015). Developments in the Khintchine-Meinardus Probabilistic Method for Asymptotic Enumeration. The Electronic Journal of Combinatorics, The Electronic Journal of Combinatorics vol. 22 (4) 27-11-2015
2013
Granovsky BL and Stark D (2013). Asymptotic enumeration of decomposable combinatorial structures with multiple singularities (Abstract). Electronic Notes in Discrete Mathematics, Elsevier vol. 43, 15-20. 01-09-2013
Stark D (2013). The asymptotic number of spanning forests of complete bipartite labelled graphs. 01-01-2013
Gauci JB, Hilton AJW and Stark D (2013). Wiggles and Finitely Discontinuous k-to-1 Functions Between Graphs. JOURNAL OF GRAPH THEORY vol. 74 (3), 275-308. 01-01-2013
2012
Granovsky BL and Stark D (2012). A Meinardus Theorem with Multiple Singularities. COMMUNICATIONS IN MATHEMATICAL PHYSICS, Springer Link vol. 314 (2), 329-350. 01-09-2012
2011
Stark D (2011). The Edge Correlation of Random Forests. ANNALS OF COMBINATORICS, Springer Link vol. 15 (3), 529-539. 01-09-2011
Stark D (2011). OIL PRODUCTION MODELS WITH NORMAL RATE CURVES. PROBAB ENG INFORM SC, Cambridge Journals vol. 25 (2), 205-217. 01-01-2011
2010
Rybarczyk K and Stark D (2010). Poisson Approximation of the Number of Cliques in Random Intersection Graphs. Journal of Applied Probability, Cambridge University Press (CUP) vol. 47 (3), 826-840. 01-09-2010
Rybarczyk K and Stark D (2010). POISSON APPROXIMATION OF THE NUMBER OF CLIQUES IN RANDOM INTERSECTION GRAPHS. J APPL PROBAB, Applied Probability Trust vol. 47 (3), 826-840. 01-09-2010
Cameron P, Prellberg T and Stark D (2010). Asymptotic enumeration of 2-covers and line graphs. 28-01-2010
2009
Stark D (2009). The limit of the statistic R/P in models of oil discovery and production. Applied Mathematical Sciences vol. 3 (53-56), 2703-2706. 01-12-2009
2008
Stark D (2008). Peak production in an oil depletion model with triangular field profiles. Journal of Interdisciplinary Mathematics, Taru Publications vol. 11 (5), 695-706. 01-10-2008
Granovsky BL, Stark D and Erlihson M (2008). Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof. ADV APPL MATH, Elsevier/Science Direct vol. 41 (3), 307-328. 01-09-2008
Jaworski J and Stark D (2008). The Vertex Degree Distribution of Passive Random Intersection Graph Models. Combinatrics, Probability & Computing, Cambirdge Journals Online vol. 17 (4), 549-558. 01-07-2008
2006
Cameron P, Prellberg T and Stark D (2006). Asymptotics for incidence matrix classes. ELECTRON J COMB vol. 13 (1) 12-10-2006
Jaworski J, Karonski M and Stark D (2006). The degree of a typical vertex in generalized random intersection graph models. DISCRETE MATH vol. 306 (18), 2152-2165. 28-09-2006
Stark D (2006). Logical limit laws for logarithmic structures. MATH PROC CAMBRIDGE vol. 140, 537-544. 01-05-2006
Granovsky BL and Stark D (2006). Asymptotic enumeration and logical limit laws for expansive multisets and selections. J LOND MATH SOC vol. 73, 252-272. 01-02-2006
Cameron P, Prellberg T and Stark D (2006). Asymptotic enumeration of incidence matrices., Editors: DeGier J and Warnaar O. 01-01-2006
2005
Stark D (2005). LOGARITHMIC COMBINATORIAL STRUCTURES: A PROBABILISTIC APPROACH (EMS Monographs in Mathematics). Bulletin of the London Mathematical Society, Wiley vol. 37 (1), 157-159. 01-01-2005
2004
Stark D (2004). Convergence in distribution for subset counts between random sets. ELECTRON J COMB vol. 11 (1) 09-09-2004
Stark D (2004). The vertex degree distribution of random intersection graphs. RANDOM STRUCT ALGOR vol. 24 (3), 249-258. 01-05-2004
2002
Stark D (2002). Information loss in top to random shuffling. COMB PROBAB COMPUT vol. 11 (6), 607-627. 01-11-2002
Stark D, Ganesh A and O'Connell N (2002). Information loss in riffle shuffling. COMB PROBAB COMPUT vol. 11 (1), 79-95. 01-01-2002
CAMERON PJ and STARK D (2002). A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property. The Electronic Journal of Combinatorics, University of Delaware vol. 9 01-01-2002
2001
Stark D (2001). Compound Poisson approximations of subgraph counts in random graphs. RANDOM STRUCT ALGOR vol. 18 (1), 39-60. 01-01-2001
2000
Hambly BM, Keevash P, O'Connell N and Stark D (2000). The characteristic polynomial of a random permutation matrix. Stochastic Processes and their Applications, Elsevier vol. 90 (2), 335-346. 01-12-2000
Ganesh A, Hambly BM, O'Connell N, Stark D and Upton PJ (2000). Poissonian Behavior of Ising Spin Systems in an External Field. Journal of Statistical Physics, Springer Nature vol. 99 (1-2), 613-626. 01-04-2000
Hambly BM, Keevash P, O'Connell N and Stark D (2000). The characteristic polynomial of a random permutation matrix. HP Laboratories Technical Report vol. BRIMS (1) 17-01-2000
1999
Knopfmacher A, Odlyzko AM, Pittel B, Richmond LB, Stark D, Szekeres G and Wormald NC (1999). The asymptotic number of set partitions with unequal block sizes. Electronic Journal of Combinatorics vol. 6 (1) 01-12-1999
STARK D (1999). Total Variation Asymptotics for Refined Poisson Process Approximations of Random Logarithmic Assemblies. Combinatorics Probability Computing, Cambridge University Press (CUP) vol. 8 (6), 567-598. 01-11-1999
Stark D, Ganesh A and O'Connell N (1999). Information loss in card shuffling. HP Laboratories Technical Report vol. BRIMS (5) 16-09-1999
Ganesh A, Hambly BM, O'Connell N, Stark D and Upton PJ (1999). Poissonian behavior of Ising spin systems in an external field. HP Laboratories Technical Report vol. BRIMS (4) 01-06-1999
1998
Stark D (1998). Compound Poisson approximations of subgraph counts in random graphs. HP Laboratories Technical Report 01-10-1998
1997
Stark D and Wormald NC (1997). Asymptotic Enumeration of Convex Polygons. Journal of Combinatorial Theory Series A, Elsevier vol. 80 (2), 196-217. 01-11-1997
Stark D (1997). Total variation asymptotics for independent process approximations of logarithmic multisets and selections. Random Structures and Algorithms, Wiley vol. 11 (1), 51-80. 01-08-1997
STARK D (1997). Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes. Combinatorics Probability Computing, Cambridge University Press (CUP) vol. 6 (1), 87-105. 01-03-1997
Braaksma BLJ and Stark D (1997). A Darboux-Type Theorem for Slowly Varying Functions. Journal of Combinatorial Theory Series A, Elsevier vol. 77 (1), 51-66. 01-01-1997
1995
Stark D (1995). First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner. Combinatorics Probability Computing, Cambridge University Press (CUP) vol. 4 (3), 279-285. 01-09-1995