Scaling limit of linearly edge-reinforced random walks on critical Galton-Watson trees

نویسندگان

چکیده

We prove an invariance principle for linearly edge reinforced random walks on γ-stable critical Galton-Watson trees, where γ∈(1,2] and the joining x to its parent has rescaled initial weight d(O,x)α some α≤1. This corresponds recurrent regime of weights. then establish fine asymptotics limit process. In transient regime, we also give upper bound walk displacement in discrete setting, showing that never positive speed, even when weights are strongly biased away from root.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Biased Random Walks on Galton - Watson Trees

We consider random walks with a bias toward the root on the family tree T of a supercritical Galton-Watson branching process and show that the speed is positive whenever the walk is transient. The corresponding harmonic measures are carried by subsets of the boundary of dimension smaller than that of the whole boundary. When the bias is directed away from the root and the extinction probability...

متن کامل

Branching random walks and contact processes on Galton-Watson trees

We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is a Galton-Watson tree then, in certain circumstances, the branching random walks and contact processes will have weak survival phases. We also provide bounds...

متن کامل

A Central Limit Theorem for biased random walks on Galton-Watson trees

Let T be a rooted Galton-Watson tree with offspring distribution {pk} that has p0 = 0, mean m = P kpk > 1 and exponential tails. Consider the λ-biased random walk {Xn}n≥0 on T ; this is the nearest neighbor random walk which, when at a vertex v with dv offspring, moves closer to the root with probability λ/(λ + dv), and moves to each of the offspring with probability 1/(λ+dv). It is known that ...

متن کامل

Galton-watson Trees with Vanishing Martingale Limit

We show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than ε, agrees up to generation K with a regular μ-ary tree, where μ is the essential minimum of the offspring distribution and the random variable K is strongly concentrated near an explicit deterministic function growing like a multiple of log(1/ε). More precisely, we show that if μ ≥ 2 then with hi...

متن کامل

Scaling limits of Markov branching trees, with applications to Galton-Watson and random unordered trees

We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the number of leaves or vertices. Such families are parameterized by sequences of distributions on partitions of the integers, that determine how the size of a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Probability

سال: 2023

ISSN: ['1083-6489']

DOI: https://doi.org/10.1214/23-ejp901