Papers
Topics
Authors
Recent
AI Research 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 83 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 30 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 174 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

Limit theorems for critical branching processes in a finite state space Markovian environment (2412.15585v1)

Published 20 Dec 2024 in math.PR

Abstract: Let $(Z_n){n\geq 0}$ be a critical branching process in a random environment defined by a Markov chain $(X_n){n\geq 0}$ with values in a finite state space $\mathbb X$. Let $ S_n = \sum_{k=1}n \ln f_{X_k}'(1)$ be the Markov walk associated to $(X_n)_{n\geq 0}$, where $f_i$ is the offspring generating function when the environment is $i \in \mathbb X$. Conditioned on the event ${ Z_n>0}$, we show the non degeneracy of limit law of the normalized number of particles ${Z_n}/{e{S_n}}$ and determine the limit of the law of $\frac{S_n}{\sqrt{n}} $ jointly with $X_n$. Based on these results we establish a Yaglom-type theorem which specifies the limit of the joint law of $ \log Z_n$ and $X_n$ given $Z_n>0$.

Citations (1)

Summary

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

Lightbulb On 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.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 2 posts and received 1 like.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube