中文
相关论文

相关论文: Condensation in critical Cauchy Bienaym\'e-Galton-…

200 篇论文

The goal of this note is to study the geometry of large size-conditioned Bienaym\'e trees whose offspring distribution is subcritical, belongs to the domain of attraction of a stable law of index $\alpha=1$ and satisfies a local regularity…

概率论 · 数学 2025-10-09 Igor Kortchemski , Leonard Vetter

We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…

概率论 · 数学 2018-06-13 Igor Kortchemski , Loïc Richier

We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…

概率论 · 数学 2012-10-24 David A. Croydon , Takashi Kumagai

We study a particular type of subcritical Galton--Watson trees, which are called non-generic trees in the physics community. In contrast with the critical or supercritical case, it is known that condensation appears in certain large…

概率论 · 数学 2018-02-19 Igor Kortchemski

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…

概率论 · 数学 2024-07-24 Eleanor Archer , Quirin Vogel

We study a linear-fractional Bienaym\'e-Galton-Watson process with a general type space. The corresponding tree contour process is described by an alternating random walk with the downward jumps having a geometric distribution. This leads…

概率论 · 数学 2016-03-07 Alexey Lindo , Serik Sagitov

As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…

概率论 · 数学 2011-01-24 Gerard Ben Arous , Alan Hammond

The goal of these notes is to fill some gaps in the literature about random walks in the Cauchy domain of attraction, which has been in many cases left aside because of its additional technical difficulties. We prove here several results in…

概率论 · 数学 2018-11-14 Quentin Berger

We discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard case of a critical Galton-Watson tree conditioned to be large…

概率论 · 数学 2018-02-09 Benedikt Stufler

We study the limiting behavior of a Bienayme-Galton-Watson tree conditioned to have a large number of vertices and either a fixed number of leaves or a fixed number of internal nodes. The first biconditioning gives a universal result with…

概率论 · 数学 2026-02-06 Vanessa Dan

We provide a complete picture of the local convergence of critical or subcritical Galton-Watson tree conditioned on having a large number of individuals with out-degree in a given set. The generic case, where the limit is a random tree with…

概率论 · 数学 2014-07-01 Romain Abraham , Jean-Francois Delmas

We derive an upper bound for the annealed return probability for the simple random walk on supercritical Bienaym\'e-Galton-Watson trees. The bound decays subexponentially in time $t$ with $t^{1/3}$ in the exponent. It is valid for all…

概率论 · 数学 2026-03-04 Markus Heydenreich , Peter Müller , Sara Terveer

Looptrees have recently arisen in the study of critical percolation on the uniform infinite planar triangulation. Here we consider random infinite looptrees defined as the local limit of the looptree associated with a critical…

概率论 · 数学 2015-06-18 Jakob E. Björnberg , Sigurdur Örn Stefánsson

We show a central limit theorem for random walk on a Galton-Watson tree, when the edges of the tree are assigned randomly uniformly elliptic conductances. When a positive fraction of edges is assigned a small conductance $\varepsilon$, we…

概率论 · 数学 2024-10-14 Tabea Glatzel , Jan Nagel

We study $\lambda$-biased branching random walks on Bienaym\'e--Galton--Watson trees in discrete time. We consider the maximal displacement at time $n$, $\max_{\vert u \vert =n} \vert X(u) \vert$, and show that it almost surely grows at a…

概率论 · 数学 2026-03-02 Julien Berestycki , Nina Gantert , David Geldbach , Quan Shi

We prove CLTs for biased randomly trapped random walks in one dimension. In particular, we will establish an annealed invariance principal by considering a sequence of regeneration times under the assumption that the trapping times have…

概率论 · 数学 2016-11-22 Adam Bowditch

We establish lower tail bounds for the height, and upper tail bounds for the width, of critical size-conditioned Bienaym\'e trees. Our bounds are optimal at this level of generality. We also obtain precise asymptotics for offspring…

概率论 · 数学 2025-03-05 Louigi Addario-Berry , Serte Donderwinkel , Igor Kortchemski

In this paper we study the recurrence and transience of the $\mathbb{Z}^d$-valued branching random walk in random environment indexed by a critical Bienaym\'e-Galton-Watson tree, conditioned to survive. The environment is made either of…

概率论 · 数学 2025-01-03 Alexandre Legrand , Christophe Sabot , Bruno Schapira

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;…

概率论 · 数学 2015-03-13 Gabriel Faraud , Yueyun Hu , Zhan Shi

We are interested in the randomly biased random walk on the supercritical Galton--Watson tree. Our attention is focused on a slow regime when the biased random walk $(X_n)$ is null recurrent, making a maximal displacement of order of…

概率论 · 数学 2015-09-29 Yueyun Hu , Zhan Shi
‹ 上一页 1 2 3 10 下一页 ›