中文
相关论文

相关论文: Generating Galton-Watson trees using random walks …

200 篇论文

We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…

概率论 · 数学 2018-06-20 Olivier Hénard , Pascal Maillard

The arboreal gas is the probability measure on (unrooted spanning) forests of a graph in which each forest is weighted by a factor $\beta>0$ per edge. It arises as the $q\to 0$ limit of the $q$-state random cluster model with $p=\beta q$.…

概率论 · 数学 2024-07-11 Roland Bauerschmidt , Nicholas Crawford , Tyler Helmuth

We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…

概率论 · 数学 2016-02-09 D. A. Dawson , L. G. Gorostiza

We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…

概率论 · 数学 2023-04-11 Christoffer Olsson

Consider a random walk in random environment on a supercritical Galton--Watson tree, and let $\tau_n$ be the hitting time of generation $n$. The paper presents a large deviation principle for $\tau_n/n$, both in quenched and annealed cases.…

概率论 · 数学 2011-01-11 Elie Aidekon

We consider infinite Galton-Watson trees without leaves together with i.i.d.~random variables called marks on each of their vertices. We define a class of flow rules on marked Galton-Watson trees for which we are able, under some algebraic…

概率论 · 数学 2018-05-07 Pierre Rousselin

We consider a branching random walk on a $d$-ary tree of height $n$ ($n \in \mathbb{N}$), under the presence of a hard wall which restricts each value to be positive, where $d$ is a natural number satisfying $d\geqslant2$. The question of…

概率论 · 数学 2024-02-23 Rishideep Roy

We consider the asymptotics of various estimators based on a large sample of branching trees from a critical multi-type Galton-Watson process, as the sample size increases to infinity. The asymptotics of additive functions of trees, such as…

概率论 · 数学 2007-05-23 Zhiyi Chi

We give a simple new proof of a theorem of Duquesne, stating that the properly rescaled contour function of a critical aperiodic Galton-Watson tree, whose offspring distribution is in the domain of attraction of a stable law of index…

概率论 · 数学 2014-11-14 Igor Kortchemski

We study the level-set percolation of the Gaussian free field on Z^d, d bigger or equal to 3. We consider a level alpha such that the excursion-set of the Gaussian free field above alpha percolates. We derive large deviation estimates on…

概率论 · 数学 2015-10-30 Alain-Sol Sznitman

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 consider a null-recurrent randomly biased walk $\mathbb{X}$ on a Galton-Watson tree in the (sub)-diffusive regime and we prove that properly renormalized, the local time in a critical generation converges in law towards some function of…

概率论 · 数学 2026-03-26 Alexis Kagan

We study level-set percolation for Gaussian free fields on metric graphs. In two dimensions, we give an upper bound on the chemical distance between the two boundaries of a macroscopic annulus. Our bound holds with high probability…

概率论 · 数学 2019-03-14 Jian Ding , Mateo Wirth

We consider a Galton-Watson tree where each node is marked independently of each others with a probability depending on itsout-degree. Using a penalization method, we exhibit new martingales where the number of marks up to level n -- 1…

概率论 · 数学 2024-03-04 Romain Abraham , Sonia Boulal , Pierre Debs

We study the decay of connectivity of the subcritical excursion sets of a class of strongly correlated Gaussian fields. Our main result shows that, for smooth isotropic Gaussian fields whose covariance kernel $K(x)$ is regularly varying at…

概率论 · 数学 2024-05-29 Stephen Muirhead , Franco Severo

We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [9]. We describe our results…

概率论 · 数学 2015-12-23 M. Eckhoff , J. Goodman , R. van der Hofstad , F. R. Nardi

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

概率论 · 数学 2012-10-24 David Croydon

We study (unrooted) random forests on a graph where the probability of a forest is multiplicatively weighted by a parameter $\beta>0$ per edge. This is called the arboreal gas model, and the special case when $\beta=1$ is the uniform forest…

概率论 · 数学 2021-07-06 Roland Bauerschmidt , Nicholas Crawford , Tyler Helmuth , Andrew Swan

We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…

概率论 · 数学 2024-12-02 Amine Asselah , Bruno Schapira

We consider a super-critical Galton-Watson tree whose non-degenerate offspring distribution has finite mean. We consider the random trees $\tau$n distributed as $\tau$ conditioned on the n-th generation, Zn, to be of size an $\in$ N. We…

概率论 · 数学 2017-12-14 Romain Abraham , Jean-François Delmas