Lower deviations for branching processes with immigration
Litsenziya: cc-by
Annotatsiya
Abstract Let left brace upper Y Subscript n Baseline <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content"> <mml:mo stretchy="false" fence="false">{</mml:mo> <mml:msub> <mml:mi>Y</mml:mi> <mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> </mml:msub> </mml:math> $\{Y_{n}$ , n greater than or equals 1 right brace <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content"> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false" fence="false">}</mml:mo> </mml:math> $n \geq 1\}$ be a critical branching process with immigration having finite variance for the offspring number of particles and finite mean for the immigrating number of particles. In this paper we study lower deviation probabilities for upper Y Subscript n <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content"> <mml:msub> <mml:mi>Y</mml:mi> <mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> </mml:msub> </mml:math> $Y_{n}$ . More precisely, assuming that k comma n right arrow normal infinity <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content"> <mml:mi>k</mml:mi> <mml:mo>,</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">→</mml:mo> <mml:mi mathvariant="normal">∞</mml:mi> </mml:math> $k,n \to \infty$ so that k equals normal o left parenthesis n right parenthesis <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content"> <mml:mi>k</mml:mi> <mml:mo>=</mml:mo> <mml:mrow> <mml:mrow> <mml:mi mathvariant="normal">o</mml:mi> </mml:mrow> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:math> $k={\mathrm{o}} (n)$ , we investigate the asymptotics of double struck upper P left parenthesis upper Y Subscript n Baseline less than or equals k right parenthesis <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content"> <mml:mrow> <mml:mi mathvariant="double-struck">P</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:msub> <mml:mi>Y</mml:mi> <mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> </mml:msub> <mml:mo>≤</mml:mo> <mml:mi>k</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:math> $\mathbb P(Y_{n} \leq k )$ and double struck upper P left parenthesis upper Y Subscript n Baseline equals k right parenthesis <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content"> <mml:mrow> <mml:mi mathvariant="double-struck">P</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:msub> <mml:mi>Y</mml:mi> <mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> </mml:msub> <mml:mo>=</mml:mo> <mml:mi>k</mml:mi> <mml:mo st
Hali tarjima qilinmagan