English
Related papers

Related papers: Weak limits for the largest subpopulations in Yule…

200 papers

Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…

Combinatorics · Mathematics 2024-09-10 Sahar Diskin , Michael Krivelevich

We consider a (sub) critical Galton-Watson process with neutral mutations (infinite alleles model), and decompose the entire population into clusters of individuals carrying the same allele. We specify the law of this allelic partition in…

Probability · Mathematics 2009-08-28 Jean Bertoin

This article employs the relation between probabilities of two consecutive values of a Poisson random variable to derive conditions for the weak convergence of point processes to a Poisson process. As applications, we consider the starting…

Probability · Mathematics 2021-01-20 Federico Pianoforte , Matthias Schulte

Weak selection, which means a phenotype is slightly advantageous over another, is an important limiting case in evolutionary biology. Recently it has been introduced into evolutionary game theory. In evolutionary game dynamics, the…

Populations and Evolution · Quantitative Biology 2010-10-15 Bin Wu , Philipp M. Altrock , Long Wang , Arne Traulsen

We study bond percolation on the hypercube $\{0,1\}^m$ in the slightly subcritical regime where $p = p_c (1-\varepsilon_m)$ and $\varepsilon_m = o(1)$ but $\varepsilon_m \gg 2^{-m/3}$ and study the clusters of largest volume and diameter.…

Probability · Mathematics 2016-12-07 Tim Hulshof , Asaf Nachmias

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

Probability · Mathematics 2007-05-23 Noga Alon , Itai Benjamini , Alan Stacey

Given a branching random walk on a graph, we consider two kinds of truncations: by inhibiting the reproduction outside a subset of vertices and by allowing at most $m$ particles per site. We investigate the convergence of weak and strong…

Probability · Mathematics 2011-01-25 Daniela Bertacchi , Fabio Zucca

One method to generate random permutations involves using Gaussian elimination with partial pivoting (GEPP) on a random matrix $A$ and storing the permutation matrix factor $P$ from the resulting GEPP factorization $PA=LU$. We are…

Probability · Mathematics 2024-11-19 John Peca-Medlin , Chenyang Zhong

We consider critical percolation on a supercritical Galton-Watson tree. We show that, when the offspring distribution is in the domain of attraction of an $\alpha$-stable law for some $\alpha \in (1,2)$, or has finite variance, several…

Probability · Mathematics 2024-07-24 Eleanor Archer , Quirin Vogel

We investigate the \emph{last passage percolation} problem on transitive tournaments, in the case when the edge weights are independent Bernoulli random variables. Given a transitive tournament on $n$ nodes with random weights on its edges,…

Combinatorics · Mathematics 2020-05-21 Kunal Dutta

We investigate the onset of the discontinuous percolation transition in small-world hyperbolic networks by studying the systems-size scaling of the typical largest cluster approaching the transition, $p\nearrow p_{c}$. To this end, we…

Statistical Mechanics · Physics 2014-08-01 Vijay Singh , Stefan Boettcher

In the usual Achlioptas processes the smallest clusters of a few randomly chosen ones are selected to merge together at each step. The resulting aggregation process leads to the delayed birth of a giant cluster and the so-called explosive…

Disordered Systems and Neural Networks · Physics 2015-04-27 R. A. da Costa , S. N. Dorogovtsev , A. V. Goltsev , J. F. F. Mendes

We consider the problem of estimating the elapsed time since the most recent common ancestor of a finite random sample drawn from a population which has evolved through a Bienayme-Galton-Watson branching process. More specifically, we are…

Populations and Evolution · Quantitative Biology 2019-09-04 Conrad J. Burden , Albert C. Soewongsono

We study supercritical age-structured branching models starting from a single particle with a random lifetime, where the reproduction law depends on the remaining lifetime of the parent. The lifespan of an individual is decided at its birth…

Probability · Mathematics 2024-03-20 Ziling Cheng

We consider a stochastic process that describes several particles interacting by either merging or annihilation. When two particles merge, they combine their masses; when annihilation occurs, only the particle of smallest mass survives.…

Probability · Mathematics 2017-09-25 Antonio Auffinger , Dylan Cable

We show that the uniqueness thresholds for Poisson-Voronoi percolation in symmetric spaces of connected higher rank semisimple Lie groups with property (T) converge to zero in the low-intensity limit. This phenomenon is fundamentally…

Probability · Mathematics 2025-04-04 Jan Grebík , Konstantin Recke

For Bernoulli site percolation on an infinite, connected, locally finite graph $G=(V,E)$, we obtain quantitative upper bounds on the supercritical disconnection probability \[ \mathbb{P}_p(S\nleftrightarrow\infty) \] for arbitrary finite or…

Probability · Mathematics 2026-03-18 Zhongyang Li

We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…

Probability · Mathematics 2026-03-06 Arthur Blanc-Renaudie , Emmanuel Kammerer

On a locally finite, infinite tree $T$, let $p_c(T)$ denote the critical probability for Bernoulli percolation. We prove that every positively associated, finite-range dependent percolation model on $T$ with marginals $p > p_c(T)$ must…

Probability · Mathematics 2024-05-14 Laurin Köhler-Schindler , Aurelio L. Sulser

Large deviation principles and related results are given for a class of Markov chains associated to the "leaves" in random recursive trees and preferential attachment random graphs, as well as the "cherries" in Yule trees. In particular,…

Probability · Mathematics 2010-01-22 W. Bryc , D. Minda , S. Sethuraman