Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

$L\log L$ condition for supercritical branching Hunt processes (1009.4481v1)

Published 22 Sep 2010 in math.PR

Abstract: In this paper we use the spine decomposition and martingale change of measure to establish a Kesten-Stigum $L\log L$ theorem for branching Hunt processes. This result is a generalization of the results in Asmussen-Hering (1976) and Hering (1978) for branching diffusions.

Summary

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