Related papers: Random recursive trees and the Bolthausen-Sznitman…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
We consider the kinetic theory of dilute gases in the Boltzmann--Grad limit. We propose a new perspective based on a large deviation estimate for the probability of the empirical distribution dynamics. Assuming Boltzmann molecular chaos…
We describe a new general connection between $\Lambda$-coalescents and genealogies of continuous-state branching processes. This connection is based on the construction of an explicit coupling using a particle representation inspired by the…
We introduce and analyze a novel type of coalescent processes called cross-multiplicative coalescent that models a system with two types of particles, $A$ and $B$. The bonds are formed only between the pairs of particles of opposite types…
For the directed landscape, the putative universal space-time scaling limit object in the (1+1) dimensional Kardar-Parisi-Zhang (KPZ) universality class, consider the geodesic tree -- the tree formed by the coalescing semi-infinite…
Consider a point particle moving through a Poisson distributed array of cubes all oriented along the axes - the random wind-tree model introduced in Ehrenfest-Ehrenfest (1912). We show that, in the joint Boltzmann-Grad and diffusive limit…
We propose a method for cutting down a random recursive tree that focuses on its higher degree vertices. Enumerate the vertices of a random recursive tree of size $n$ according to a decreasing order of their degrees; namely, let…
We use the Mass Transport Principle to analyze the local recursion governing the resolvent $(A-z)^{-1}$ of the adjacency operator of unimodular random trees. In the limit where the complex parameter $z$ approaches a given location $\lambda$…
We consider a Bernoulli bond percolation on a random recursive tree of size $n\gg 1$, with supercritical parameter $p_n=1-c/\ln n$ for some $c>0$ fixed. It is known that with high probability, there exists then a unique giant cluster of…
Consider the motion of a charged, point particle moving in the complement of a Poisson distribution of hard sphere scatterers in two dimensions under the effect of a fixed magnetic field. Building on, and extending a coupling method…
Kingman's coalescent is a random tree that arises from classical population genetic models such as the Moran model. The individuals alive in these models correspond to the leaves in the tree and the following two laws of large numbers…
We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…
A well-known open problem on the behavior of optimal paths in random graphs in the strong disorder regime, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [31,32,38,70] is as…
These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the uniform law on the unit disc of the complex…
A new coercivity estimate on the spectral gap of the linearized Boltzmann collision operator for multiple species is proved. The assumptions on the collision kernels include hard and Maxwellian potentials under Grad's angular cut-off…
We introduce a colored coalescent process which recovers random colored genealogical trees. Here a colored genealogical tree has its vertices colored black or white. Moving backward along the colored genealogical tree, the color of vertices…
For $\Lambda$-$n$-coalescents with mutation, we analyse the size $O_n$ of the partition block of $i\in\{1,\ldots,n\}$ at the time where the first mutation appears on the tree that affects $i$ and is shared with any other…
Growth-fragmentation processes describe systems of particles in which each particle may grow larger or smaller, and divide into smaller ones as time proceeds. Unlike previous studies, which have focused mainly on the self-similar case, we…
A sequence of Markov chains is said to exhibit (total variation) cutoff if the convergence to stationarity in total variation distance is abrupt. We consider reversible lazy chains. We prove a necessary and sufficient condition for the…
We study weighted particle systems in which new generations are resampled from current particles with probabilities proportional to their weights. This covers a broad class of sequential Monte Carlo (SMC) methods, widely-used in applied…