Related papers: Invariance Principle for the Random Wind-Tree Proc…

We prove that the Boltzmann-Grad limit of the Lorentz gas with periodic distribution of scatterers cannot be described with a linear Boltzmann equation. This is at variance with the case of a Poisson distribution of scatterers, for which…

As a first step toward a characterization of the limiting extremal process of branching Brownian motion, we proved in a recent work [Comm. Pure Appl. Math. 64 (2011) 1647-1676] that, in the limit of large time $t$, extremal particles…

We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…

A correlated random walk approach to diffusion is applied to the disordered nonoverlapping Lorentz gas. By invoking the Lu-Torquato theory for chord-length distributions in random media [J. Chem. Phys. 98, 6472 (1993)], an analytic…

We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…

We revisit the problem of Brownian diffusion with drift in order to study finite-size effects in the geometric Galton-Watson branching process. This is possible because of an exact mapping between one-dimensional random walks and geometric…

Consider a time-varying collection of n points on the positive real axis, modeled as exponentials of n Brownian motions whose drift vector at every time point is determined by the relative ranks of the coordinate processes at that time. If…

We consider aperiodic wind-tree models, and show that for a generic (in the sense of Baire) configuration the wind-tree dynamics is minimal in almost all directions, and has a dense set of periodic points.

Consider a Markov chain on the space of rooted real binary trees that randomly removes leaves and reinserts them on a random edge and suitably rescales the lengths of edges. This chain was introduced by David Aldous who conjectured a…

We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson…

We prove a central limit theorem for the momentum distribution of a particle undergoing an unbiased spatially periodic random forcing at exponentially distributed times without friction. The start is a linear Boltzmann equation for the…

In the air surrounding us, how does a particle diffuse? Thanks to Einstein and other pioneers,it has been well known that generally the particle will undergo the Brownian motion, and in the last century this insight has been corroborated by…

In this paper we consider a telegraph equation with time-dependent coefficients, governing the persistent random walk of a particle moving on the line with a time-varying velocity $c(t)$ and changing direction at instants distributed…

In this paper we study finite velocity planar random motions with an infinite number of possible directions, where the number of changes of direction is randomized by means of an inhomogeneous fractional Poisson distribution. We first…

We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…

Consider the following partial "sorting algorithm" on permutations: take the first entry of the permutation in one-line notation and insert it into the position of its own value. Continue until the first entry is 1. This process imposes a…

We consider a recursively defined random set of points and its barycenter, where the random set is constructed by the following inductive rule: Given a realization of $n-1$ points, one of them is picked at random and serves as a source the…

While circular data occur in a wide range of scientific fields, the methodology for distributional modeling and probabilistic forecasting of circular response variables is rather limited. Most of the existing methods are built on the…

We give a generalization to a continuous setting of the classic Markov chain tree Theorem. In particular, we consider an irreducible diffusion process on a metric graph. The unique invariant measure has an atomic component on the vertices…

Random forests are a learning algorithm proposed by Breiman [Mach. Learn. 45 (2001) 5--32] that combines several randomized decision trees and aggregates their predictions by averaging. Despite its wide usage and outstanding practical…