English
Related papers

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

200 papers

Random flights in $\mathbb{R}^d,d\geq 2,$ with Dirichlet-distributed displacements and uniformly distributed orientation are analyzed. The explicit characteristic functions of the position $\underline{\bf X}_d(t),\,t>0,$ when the number of…

Probability · Mathematics 2011-08-01 Alessandro De Gregorio , Enzo Orsingher

We develop a new robust technique to deduce variance principles for non-integrable discrete systems. To illustrate this technique, we show the existence of a variational principle for graph homomorphisms from $\Z^m$ to a $d$-regular tree.…

Probability · Mathematics 2020-03-20 Georg Menz , Martin Tassy

Random walkers characterized by random positions and random velocities lead to normal diffusion. A random walk was originally proposed by Einstein to model Brownian motion and to demonstrate the existence of atoms and molecules. Such a…

Statistical Mechanics · Physics 2018-08-01 Daniel Escaff , Raul Toral , Christian Van den Broeck , Katja Lindenberg

We present new insights into causal inference in the context of Heterogeneous Treatment Effects by proposing natural variants of Random Forests to estimate the key conditional distributions. To achieve this, we recast Breiman's original…

Machine Learning · Statistics 2021-02-16 Qiming Du , Gérard Biau , François Petit , Raphaël Porcher

We extend the ideas of (Barbour 1990) and use Stein's method to obtain a bound on the distance between a scaled time-changed random walk and a time-changed Brownian Motion. We then apply this result to bound the distance between a…

Probability · Mathematics 2017-10-05 Mikolaj J. Kasprzak

We study a rumour model from a percolation theory and branching process point of view. The existence of a giant component is related to the event where the rumour, which started from the root of a tree, spreads out through an infinite…

Probability · Mathematics 2016-11-11 Valdivino Vargas Junior , Fábio Prates Machado , Krishnamurthi Ravishankar

Random forests are a scheme proposed by Leo Breiman in the 2000's for building a predictor ensemble with a set of decision trees that grow in randomly selected subspaces of data. Despite growing interest and practical use, there has been…

Machine Learning · Statistics 2012-03-28 Gérard Biau

We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…

Probability · Mathematics 2007-05-23 Andrea Collevecchio

Via a Dirichlet form extension theorem and making full use of two-sided heat kernel estimates, we establish quenched invariance principles for random walks in random environments with a boundary. In particular, we prove that the random walk…

Probability · Mathematics 2015-09-10 Zhen-Qing Chen , David A. Croydon , Takashi Kumagai

We propose in this paper a construction of a diffusion process on the Wasserstein space P\_2(R) of probability measures with a second-order moment. This process was introduced in several papers by Konarovskyi (see e.g. "A system of…

Probability · Mathematics 2018-12-06 Victor Marx

We study $I(T)$, the number of inversions in a tree $T$ with its vertices labeled uniformly at random, which is a generalization of inversions in permutations. We first show that the cumulants of $I(T)$ have explicit formulas involving the…

Probability · Mathematics 2020-04-21 Xing Shi Cai , Cecilia Holmgren , Svante Janson , Tony Johansson , Fiona Skerman

We study the parking process on the random recursive tree. We first prove that although the random recursive tree has a non-degenerate Benjamini--Schramm limit, the phase transition for the parking process appears at density $0$. We then…

Probability · Mathematics 2025-01-07 Alice Contat , Lucile Laulin

Random forests are a statistical learning method widely used in many areas of scientific research because of its ability to learn complex relationships between input and output variables and also its capacity to handle high-dimensional…

Machine Learning · Statistics 2024-02-19 Louis Capitaine , Jérémie Bigot , Rodolphe Thiébaut , Robin Genuer

Fix $p\geq 5$ an odd integer integer. Let $M_n$ be a uniform $p$-angulation with $n$ vertices and endowed with the uniform probability measure on its vertices. We prove that, there exists $C_p\in \mathbb{R}_+$ such that, after rescaling…

Probability · Mathematics 2020-08-03 Louigi Addario-Berry , Marie Albenque

We characterize all random point measures which are in a certain sense stable under the action of branching. Denoting by $\circledast$ the branching convolution operation introduced by Bertoin and Mallein (2019), and by $\mathcal{Z}$ the…

Probability · Mathematics 2022-01-04 Pascal Maillard , Bastien Mallein

We consider a Feller diffusion (Zs, s $\ge$ 0) (with diffusion coefficient $\sqrt$ 2$\beta$ and drift $\theta$ $\in$ R) that we condition on {Zt = at}, where at is a deterministic function, and we study the limit in distribution of the…

Probability · Mathematics 2025-11-04 Romain Abraham , Jean-Franç Ois Delmas , Hui He

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

Probability · Mathematics 2012-10-24 David A. Croydon

The Drude-Lorentz model for the motion of electrons in a solid is a classical model in statistical mechanics, where electrons are represented as point particles bouncing on a fixed system of obstacles (the atoms in the solid). Under some…

Mathematical Physics · Physics 2016-06-29 François Golse

The coalescing Brownian flow on $\mathbb{R}$ is a process which was introduced by Arratia [Coalescing Brownian motions on the line (1979) Univ. Wisconsin, Madison] and T\'{o}th and Werner [Probab. Theory Related Fields 111 (1998) 375-452],…

Probability · Mathematics 2015-12-23 Nathanaël Berestycki , Christophe Garban , Arnab Sen

Rooted trees with probabilities are convenient to represent a class of random processes with memory. They allow to describe and analyze variable length codes for data compression and distribution matching. In this work, the Leaf-Average…

Information Theory · Computer Science 2013-02-05 Georg Böcherer