中文
相关论文

相关论文: Distances between pairs of vertices and vertical p…

200 篇论文

We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…

概率论 · 数学 2007-05-23 Jean-Francois Le Gall

We are interested in nodes with fixed outdegrees in large conditioned Galton--Watson trees. We first study the scaling limits of processes coding the evolution of the number of such nodes in different explorations of the tree…

概率论 · 数学 2020-02-27 Paul Thévenin

Consider biased random walks on two Galton-Watson trees without leaves having progeny distributions $P_1$ and $P_2$ (GW$(P_1)$ and GW$(P_2)$) where $P_1$ and $P_2$ are supported on positive integers and $P_1$ dominates $P_2$ stochastically.…

概率论 · 数学 2015-06-12 Behzad Mehrdad , Sanchayan Sen , Lingjiong Zhu

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…

概率论 · 数学 2022-04-26 Louigi Addario-Berry , Anna Brandenberger , Jad Hamdan , Céline Kerriou

We study the height and width of a Galton--Watson tree with offspring distribution B satisfying E(B)=1, 0 < Var(B) < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the…

概率论 · 数学 2014-07-22 Louigi Addario-Berry , Luc Devroye , Svante Janson

This paper deals with a transient random walk in Dirichlet environment, or equivalently a linearly edge reinforced random walk, on a Galton-Watson tree. We compute the stationary distribution of the environment seen from the particle of an…

概率论 · 数学 2024-05-21 Dongjian Qian , Yang Xiao

We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…

概率论 · 数学 2026-03-06 Arthur Blanc-Renaudie , Emmanuel Kammerer

We consider a continuous-time vertex reinforced jump process on a supercritical Galton-Watson tree. This process takes values in the set of vertices of the tree and jumps to a neighboring vertex with rate proportional to the local time at…

概率论 · 数学 2012-09-25 Anne-Laure Basdevant , Arvind Singh

In the regime of Galton-Watson trees, first order logic statements are roughly equivalent to examining the presence of specific finite subtrees. We consider the space of all trees with Poisson offspring distribution and show that such…

概率论 · 数学 2016-12-06 Joel Spencer , Moumanti Podder

This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…

概率论 · 数学 2023-09-01 Fabian Michel

In this paper, we address the question of comparison between populations of trees. We study an statistical test based on the distance between empirical mean trees, as an analog of the two sample z statistic for comparing two means. Despite…

统计理论 · 数学 2007-08-14 Ana Georgina Flesia , Ricardo Fraiman

In this article, we consider a branching random walk on the real-line where displacements coming from the same parent have jointly regularly varying tails. The genealogical structure is assumed to be a supercritical Galton-Watson tree,…

概率论 · 数学 2022-04-07 Ayan Bhattacharya

We compute exact values respectively bounds of "distances" - in the sense of (transforms of) power divergences and relative entropy - between two discrete-time Galton-Watson branching processes with immigration GWI for which the offspring…

概率论 · 数学 2022-10-21 Niels B. Kammerer , Wolfgang Stummer

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

Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…

We study the random planar maps obtained from supercritical Galton--Watson trees by adding the horizontal connections between successive vertices at each level. These are the hyperbolic analog of the maps studied by Curien, Hutchcroft and…

概率论 · 数学 2019-09-30 Thomas Budzinski

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 work on a Galton--Watson tree with random weights, in the so-called "subdiffusive" regime. We study the rate of decay of the conductance between the root and the $n$-th level of the tree, as $n$ goes to infinity, by a mostly analytic…

概率论 · 数学 2023-04-27 Pierre Rousselin

We consider a random walk on a Galton-Watson tree whose offspring distribution has a regular varying tail of order $\kappa\in (1,2)$. We prove the convergence of the renormalised height function of the walk towards the continuous-time…

概率论 · 数学 2024-03-27 Dongjian Qian , Yang Xiao

In this paper, we study a parallel version of Galton-Watson processes for the random generation of tree-shaped structures. Random trees are useful in many situations (testing, binary search, simulation of physics phenomena,...) as attests…

分布式、并行与集群计算 · 计算机科学 2016-06-22 Olivier Bodini , Camille Coti , Julien David