Andrew D. Barbour

According to our database, Andrew D. Barbour authored at least 14 papers between 1989 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Local limit theorems for occupancy models.

Andrew D. Barbour, Peter Braunsteins, Nathan Ross

Random Struct. Algorithms, 2021

Estimating the correlation in network disturbance models.

Andrew D. Barbour, Gesine Reinert

J. Complex Networks, 2021

2012

Asymptotic behaviour of gossip processes and small world networks

Andrew D. Barbour, Gesine Reinert

CoRR, 2012

2011

The shortest distance in random multi-type intersection graphs.

Andrew D. Barbour, Gesine Reinert

Random Struct. Algorithms, 2011

2006

A Tale of Three Couplings: Poisson-Dirichlet and GEM Approximations for Random Permutations.

Richard Arratia, Andrew D. Barbour, Simon Tavaré

Comb. Probab. Comput., 2006

2005

Random combinatorial structures: the convergent case.

Andrew D. Barbour, Boris L. Granovsky

J. Comb. Theory A, 2005

2004

Correction: Small worlds.

Andrew D. Barbour, Gesine Reinert

Random Struct. Algorithms, 2004

2001

Small worlds.

Andrew D. Barbour, Gesine Reinert

Random Struct. Algorithms, 2001

1999

The Poisson-Dirichlet Distribution And The Scale-Invariant Poisson Process.

Richard Arratia, Andrew D. Barbour, Simon Tavaré

Comb. Probab. Comput., 1999

1997

Imperfections in Random Tournaments.

Andrew D. Barbour, Anant P. Godbole, Jinghua Qian

Comb. Probab. Comput., 1997

1994

A Rate for the Erdös-Turán Law.

Andrew D. Barbour, Simon Tavaré

Comb. Probab. Comput., 1994

1992

Refined Approximation for the Ewens Sampling Forumla.

Andrew D. Barbour

Random Struct. Algorithms, 1992

1990

Small Cliques in Random Graphs.

Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski

Random Struct. Algorithms, 1990

1989

A central limit theorem for decomposable random variables with applications to random graphs.

Andrew D. Barbour, Michal Karonski, Andrzej Rucinski

J. Comb. Theory B, 1989