Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 89 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 39 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 119 tok/s Pro
Kimi K2 188 tok/s Pro
GPT OSS 120B 460 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Maximal local time of randomly biased random walks on a Galton-Watson tree (2009.13816v2)

Published 29 Sep 2020 in math.PR

Abstract: We consider a recurrent random walk on a rooted tree in random environment given by a branching random walk. Up to the first return to the root, its edge local times form a Multi-type Galton-Watson tree with countably infinitely many types. When the walk is the diffusive or sub-diffusive, by studying the maximal type of this Galton-Watson tree, we establish the asymptotic behaviour of the largest local times of this walk during n excursions, under the annealed law.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.