Dudley Stark

activity

20042026

most citedA Meinardus theorem with multiple singularities

21 citations · 29 across the 13 of their papers we have counts for

collaborators

13 papers

math.CO2026

Poisson approximations of the number of fixed points in random multiset permutations

Dudley Stark

For ordinary permutations on $n$ letters, the distribution of the number of fixed points of random permutations is well known to approach the Poisson $(1)$ distribution in total var…

math.PR2025

A Chinese restaurant process for multiset permutations

Dudley Stark

Multisets are like sets, except that they can contain multiple copies of their elements. If there are $n_{i}$ copies of $i$ , $1 \leq i \leq t$ , in multiset $M_{t}$ , then there are $\bino…

q-bio.PE2023

Single-cell mutational burden distributions in birth-death processes

Christo Morison, Dudley Stark, Weini Huang

Genetic mutations are footprints of tumour growth. While mutation data in bulk samples has been used to infer evolutionary parameters hard to measure in vivo, the advent of single-…

math.PR2022

Random Permutations and Queues

Alexander Gnedin, Dudley Stark

Given a growth rule which sequentially constructs random permutations of increasing degree, the stochastic process version of the rencontre problem asks what is the limiting propor…

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)…