On subcritical multi-type branching process in random environment

On subcritical multi-type branching process in random environment

We investigate a multi-type Galton-Watson process in a random environment generated by a sequence of independent identically distributed random variables. Suppose that the associated random walk constructed by the logarithms of the Perron roots of the reproduction mean matrices has negative mean and...

Full description

Bibliographic Details
Main Author:	Elena Dyakonova
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2008-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	branching processes in random environment survival probability limit theorems random walks [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-ds] mathematics [math]/dynamical systems [math.ds]
Online Access:	https://dmtcs.episciences.org/3579/pdf

Similar Items

Random Records and Cuttings in Split Trees: Extended Abstract
by: Cecilia Holmgren
Published: (2008-01-01)

Branching processes in random environment die slowly
by: Vladimir Vatutin, et al.
Published: (2008-01-01)

Subcritical pattern languages for and/or trees
by: Jakub Kozik
Published: (2008-01-01)

A note on the fragmentation of a stable tree
by: Philippe Marchal
Published: (2008-01-01)

On square permutations
by: Enrica Duchi, et al.
Published: (2008-01-01)

A variant of the Recoil Growth algorithm to generate multi-polymer systems
by: Florian Simatos
Published: (2008-01-01)

On density of truth of the intuitionistic logic in one variable
by: Zofia Kostrzycka
Published: (2008-01-01)

On the number of zero increments of random walks with a barrier
by: Alex Iksanov, et al.
Published: (2008-01-01)

Degree distribution in random planar graphs
by: Michael Drmota, et al.
Published: (2008-01-01)

Analytic Combinatorics of the Mabinogion Urn
by: Philippe Flajolet, et al.
Published: (2008-01-01)

Polynomial tails of additive-type recursions
by: Eva-Maria Schopp
Published: (2008-01-01)

Concentration of measure and mixing for Markov chains
by: Malwina Luczak
Published: (2008-01-01)

Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups
by: Lorenz A. Gilch
Published: (2008-01-01)

Small parts in the Bernoulli sieve
by: Alexander Gnedin, et al.
Published: (2008-01-01)

(k − 2)-linear connected components in hypergraphs of rank k
by: Florian Galliot, et al.
Published: (2023-11-01)

On Kerov polynomials for Jack characters (extended abstract)
by: Valentin Féray, et al.
Published: (2013-01-01)

A Markov Chain Algorithm for determining Crossing Times through nested Graphs
by: Uta Freiberg, et al.
Published: (2008-01-01)

Point process stabilization methods and dimension estimation
by: J. E. Yukich
Published: (2008-01-01)

The Degree Distribution of Thickened Trees
by: Michael Drmota, et al.
Published: (2008-01-01)

Hopcroft's automaton minimization algorithm and Sturmian words
by: Jean Berstel, et al.
Published: (2008-01-01)

Volume Laws for Boxed Plane Partitions and Area Laws for Ferrers Diagrams
by: Uwe Schwerdtfeger
Published: (2008-01-01)

Noncommutative symmetric functions III : Deformations of Cauchy and convolution algebras
by: Gérard Duchamp, et al.
Published: (1997-01-01)

A product formula for the TASEP on a ring
by: Erik Aas, et al.
Published: (2014-01-01)

Error bounds in stochastic-geometric normal approximation
by: Mathew Penrose, et al.
Published: (2008-01-01)

On the density and the structure of the Peirce-like formulae
by: Antoine Genitrini, et al.
Published: (2008-01-01)

The size of random fragmentation intervals
by: Rafik Aguech
Published: (2008-01-01)

The register function for lattice paths
by: Guy Louchard, et al.
Published: (2008-01-01)

The height of random binary unlabelled trees
by: Nicolas Broutin, et al.
Published: (2008-01-01)

A Note on the Transience of Critical Branching Random Walks on the Line
by: Gerold Alsmeyer, et al.
Published: (2008-01-01)

Staircase Macdonald polynomials and the $q$-Discriminant
by: Adrien Boussicault, et al.
Published: (2008-01-01)

A functional limit law for the profile of plane-oriented recursive trees.
by: Henning Sulzbach
Published: (2008-01-01)

Noncommutative Symmetric Hall-Littlewood Polynomials
by: Lenny Tevlin
Published: (2011-01-01)

On the $L(p,1)$-labelling of graphs
by: Daniel Gonçalves
Published: (2005-01-01)

Analysis of an algorithm catching elephants on the Internet
by: Yousra Chabchoub, et al.
Published: (2008-01-01)

The continuous limit of large random planar maps
by: Jean-François Le Gall
Published: (2008-01-01)

Deterministic Random Walks on the Integers
by: Joshua Cooper, et al.
Published: (2005-01-01)

Generic properties of random subgroups of a free group for general distributions
by: Frédérique Bassino, et al.
Published: (2012-01-01)

A Quantization of a theorem of Goulden and Jackson
by: Matjaž Konvalinka, et al.
Published: (2008-01-01)

Hamiltonian Chains in Hypergraphs
by: Gyula Y. Katona
Published: (2005-01-01)

Enumeration of alternating sign matrices of even size (quasi)-invariant under a quarter-turn rotation
by: Jean-Christophe Aval, et al.
Published: (2009-01-01)