Related papers: Random recursive trees and the Bolthausen-Sznitman…

We will revisit the classical questions of understanding the statistics of various deterministic dynamics of $N$ hard spheres of diameter $\varepsilon$ with random initial data in the Boltzmann-Grad scaling as $\varepsilon$ tends to zero…

We analyse sequential Markov coalescent algorithms for populations with demographic structure: for a bottleneck model, a population-divergence model, and for a two-island model with migration. The sequential Markov coalescent method is an…

We provide a rigorous derivation of the Boltzmann equation as the mesoscopic limit of systems of hard spheres, or Newtonian particles interacting via a short-range potential, as the number of particles $N$ goes to infinity and the…

In this brief note, we find formulas for the distribution and the transition probability matrices of a stochastic process described as a time-reversion in a finite time window of a Markov chain, with cluster observation of the Markov state…

We define a doubly infinite, monotone labeling of Bienayme-Galton-Watson (BGW) genealogies. The genealogy of the current generation backwards in time is uniquely determined by the coalescent point process $(A_i; i\ge 1)$, where $A_i$ is the…

Using the information current, we develop a Lorentz-covariant framework for modeling equilibrium fluctuations in relativistic kinetic theory in the grand-canonical ensemble. The resulting stochastic theory is proven to be causal and…

Following the recent work of Sznitman (arXiv:0805.4516), we investigate the microscopic picture induced by a random walk trajectory on a cylinder of the form G_N x Z, where G_N is a large finite connected weighted graph, and relate it to…

Let $X_1,X_2,...$ be a sequence of random variables satisfying the distributional recursion $X_1=0$ and $X_n= X_{n-I_n}+1$ for $n=2,3,...$, where $I_n$ is a random variable with values in $\{1,...,n-1\}$ which is independent of…

Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We…

Many finite-state reversible Markov chains can be naturally decomposed into "projection" and "restriction" chains. In this paper we provide bounds on the total variation mixing times of the original chain in terms of the mixing properties…

This article shows the asymptotics of distributions of various functionals of the Beta$(2-\alpha,\alpha)$ $n$-coalescent process with $1<\alpha<2$ when $n$ goes to infinity. This process is a Markov process taking {values} in the set of…

We first study crossing statistics in random connection models (RCM) built on marked Poisson point processes on $\mathbb R^d$. Under general assumptions, we show exponential tail bounds for the number of crossings of a box contained in the…

Focusing on stochastic systems arising in mean-field models, the systems under consideration belong to the class of switching diffusions, in which continuous dynamics and discrete events coexist and interact. The discrete events are modeled…

We consider a (one-dimensional) branching Brownian motion process with a general offspring distribution having at least two moments, and in which all particles have a drift towards the origin where they are immediately absorbed. It is…

$\Lambda$-coalescents model genealogies of samples of individuals from a large population by means of a family tree whose branches have lengths. The tree's leaves represent the individuals, and the lengths of the adjacent edges indicate the…

This paper investigates the combinatorics that gives rise to the Boltzmann probability distribution. Despite being one of the most important distributions in physics and other fields of science, the mathematics of the underlying model of…

Panagiotou and Stufler recently proved an important fact on their way to establish the scaling limits of random P\'olya trees: a uniform random P\'olya tree of size $n$ consists of a conditioned critical Galton-Watson tree $C_n$ and many…

Recently Ren et al. [Stoch. Proc. Appl., 137 (2021)] have proved that the extremal process of the super-Brownian motion converges in distribution in the limit of large times. Their techniques rely heavily on the study of the convergence of…

Conditional restricted Boltzmann machines are undirected stochastic neural networks with a layer of input and output units connected bipartitely to a layer of hidden units. These networks define models of conditional probability…

Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…