English
Related papers

Related papers: The external lengths in Kingman's coalescent

200 papers

The nested Kingman coalescent describes the ancestral tree of a population undergoing neutral evolution at the level of individuals and at the level of species, simultaneously. We study the speed at which the number of lineages descends…

Probability · Mathematics 2018-03-28 Airam Blancas Benítez , Tim Rogers , Jason Schweinsberg , Arno Siri-Jégousse

In the case of neutral populations of fixed sizes in equilibrium whose genealogies are described by the Kingman $N$-coalescent back from time $t$ consider the associated processes of total tree length as $t$ increases. We show that the…

Probability · Mathematics 2015-02-03 Iulia Dahmer , Robert Knobloch , Anton Wakolbinger

Let $p_n$ denote the number of self-avoiding polygons of length $n$ on a regular three-dimensional lattice, and let $p_n(K)$ be the number which have knot type $K$. The probability that a random polygon of length $n$ has knot type $K$ is…

Statistical Mechanics · Physics 2015-05-27 E. J. Janse van Rensburg , A. Rechnitzer

The cutoff phenomenon for an ergodic Markov chain describes a sharp transition in the convergence to its stationary distribution, over a negligible period of time, known as cutoff window. We study the cutoff phenomenon for simple random…

Combinatorics · Mathematics 2014-07-10 Ali Pourmiri , Thomas Sauerwald

We prove a Kahane-Khinchin type result with a few random vectors, which are distributed independently with respect to an arbitrary log-concave probability measure on $\R^n$. This is an application of small ball estimate and Chernoff's…

Functional Analysis · Mathematics 2007-09-10 Omer Friedland

Let K be a d-dimensional convex body, and let $K^{(n)}$ be the intersection of n halfspaces containing $K$ whose bounding hyperplanes are independent and identically distributed. Under suitable distributional assumptions, we prove an…

Metric Geometry · Mathematics 2014-10-15 Károly J. Böröczky , Ferenc Fodor , Daniel Hug

An urn contains black and red balls. Let $Z_n$ be the proportion of black balls at time $n$ and $0\leq L<U\leq 1$ random barriers. At each time $n$, a ball $b_n$ is drawn. If $b_n$ is black and $Z_{n-1}<U$, then $b_n$ is replaced together…

Probability · Mathematics 2015-08-27 Patrizia Berti , Irene Crimaldi , Luca Pratelli , Pietro Rigo

We study the number of collisions $X_n$ of an exchangeable coalescent with multiple collisions ($\Lambda$-coalescent) which starts with $n$ particles and is driven by rates determined by a finite characteristic measure $\nu({\rm…

Probability · Mathematics 2008-07-18 Alexander Gnedin , Alex Iksanov , Martin Möhle

We consider the problem of sampling a proper $k$-coloring of a graph of maximal degree $\Delta$ uniformly at random. We describe a new Markov chain for sampling colorings, and show that it mixes rapidly on graphs of bounded treewidth if…

Data Structures and Algorithms · Computer Science 2017-08-10 Shai Vardi

We study a generalized P\'{o}lya urn model with two types of ball. If the drawn ball is red, it is replaced together with a black ball, but if the drawn ball is black it is replaced and a red ball is thrown out of the urn. When only black…

Probability · Mathematics 2012-01-17 Edward Crane , Nicholas Georgiou , Stanislav Volkov , Andrew R. Wade , Robert J. Waters

The results in this paper provide new information on asymptotic properties of classical models: the neutral Kingman coalescent under a general finite-alleles, parent-dependent mutation mechanism, and its generalisation, the ancestral…

Probability · Mathematics 2022-07-08 Martina Favero , Henrik Hult

We derive some key extremal features for $k$th order Markov chains that can be used to understand how the process moves between an extreme state and the body of the process. The chains are studied given that there is an exceedance of a…

Statistics Theory · Mathematics 2023-01-27 Ioannis Papastathopoulos , Adrian Casey , Jonathan A. Tawn

We study several fundamental properties of a class of stochastic processes called spatial Lambda-coalescents. In these models, a number of particles perform independent random walks on some underlying graph G. In addition, particles on the…

Probability · Mathematics 2010-01-21 Omer Angel , Nathanael Berestycki , Vlada Limic

We obtain an explicit formula for the variance of the number of $k$-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest $k$-alternating subsequence in random…

Probability · Mathematics 2026-04-15 Recep Altar Çiçeksiz , Yunus Emre Demirci , Ümit Işlak

In this work we generalize Polya urn schemes with possibly infinitely many colors and extend the earlier models described in [4, 5, 7]. We provide a novel and unique approach of representing the observed sequence of colors in terms a…

Probability · Mathematics 2016-06-17 Antar Bandyopadhyay , Debleena Thacker

The Kingman coalescent is a fundamental process in population genetics modelling the ancestry of a sample of individuals backwards in time. In this paper, in a large-sample-size regime, we study asymptotic properties of the coalescent under…

Probability · Mathematics 2025-03-17 Martina Favero , Henrik Hult

The method of 'coupling from the past' permits exact sampling from the invariant distribution of a Markov chain on a finite state space. The coupling is successful whenever the stochastic dynamics are such that there is coalescence of all…

Probability · Mathematics 2025-10-17 Geoffrey R. Grimmett , Mark Holmes

We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…

Probability · Mathematics 2009-01-16 Florent Benaych-Georges

The celebrated invariance property states that particles entering a bounded domain, with isotropic and uniform incidence, spend on average $\langle \ell \rangle=4V/S$ length inside, no matter how they scatter. We show that this remarkable…

Mathematical Physics · Physics 2025-11-04 Tiziano Binzoni , Eric Dumonteil , Alain Mazzolo

This is the third in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

Discrete Mathematics · Computer Science 2019-11-14 Joel Friedman , David Kohler