Dudley Stark

Orcid: 0000-0001-8527-3996

Affiliations:
  • Queen Mary University of London, UK


According to our database1, Dudley Stark authored at least 29 papers between 1995 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The small cycle counts of random feedback shift registers.
Australas. J Comb., 2023

Random permutations and queues.
Adv. Appl. Math., 2023

2022
The component counts of random functions.
Discret. Math., 2022

2021
The Component Counts of Random Injections.
Electron. J. Comb., 2021

2018
The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph.
Comb. Probab. Comput., 2018

2017
Poisson approximation of counts of induced subgraphs in random intersection graphs.
Discret. Math., 2017

2015
Developments in the Khintchine-Meinardus Probabilistic Method for Asymptotic Enumeration.
Electron. J. Comb., 2015

2013
Wiggles and Finitely Discontinuous <i>k</i>-to-1 Functions Between Graphs.
J. Graph Theory, 2013

Asymptotic enumeration of decomposable combinatorial structures with multiple singularities (Abstract).
Electron. Notes Discret. Math., 2013

The asymptotic number of spanning forests of complete bipartite labelled graphs.
Discret. Math., 2013

2010
Asymptotic enumeration of 2-covers and line graphs.
Discret. Math., 2010

Random preorders and alignments.
Discret. Math., 2010

2008
The Vertex Degree Distribution of Passive Random Intersection Graph Models.
Comb. Probab. Comput., 2008

Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof.
Adv. Appl. Math., 2008

2006
The degree of a typical vertex in generalized random intersection graph models.
Discret. Math., 2006

Asymptotics for Incidence Matrix Classes.
Electron. J. Comb., 2006

2004
The vertex degree distribution of random intersection graphs.
Random Struct. Algorithms, 2004

Convergence in Distribution for Subset Counts Between Random Sets.
Electron. J. Comb., 2004

2002
Information Loss In Riffle Shuffling.
Comb. Probab. Comput., 2002

Information Loss In Top To Random Shuffling.
Comb. Probab. Comput., 2002

A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property.
Electron. J. Comb., 2002

2001
Compound Poisson approximations of subgraph counts in random graphs.
Random Struct. Algorithms, 2001

1999
Total Variation Asymptotics For Refined Poisson Process Approximations Of Random Logarithmic Assemblies.
Comb. Probab. Comput., 1999

The Asymptotic Number of Set Partitions with Unequal Block Sizes.
Electron. J. Comb., 1999

1997
Total variation asymptotics for independent process approximations of logarithmic multisets and selections.
Random Struct. Algorithms, 1997

Asymptotic Enumeration of Convex Polygons.
J. Comb. Theory, Ser. A, 1997

A Darboux-Type Theorem for Slowly Varying Functions.
J. Comb. Theory, Ser. A, 1997

Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes.
Comb. Probab. Comput., 1997

1995
First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner.
Comb. Probab. Comput., 1995


  Loading...