Representation Theory for Denumerable Markov Chains
From MaRDI portal
Publication:5568435
DOI10.2307/1994587zbMath0178.53306OpenAlexW4252988739MaRDI QIDQ5568435
Publication date: 1966
Full work available at URL: https://doi.org/10.2307/1994587
Related Items (31)
Random walks with ``back buttons ⋮ THE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALS ⋮ On the ergodic theorem for positive operators. II ⋮ Numerical method for discrete-time finite-buffer queues with some regenerative structure ⋮ The harmonic functions of (At, Bt,) ⋮ Markov chains and summability methods ⋮ Markov chains and summability methods ⋮ Performance analysis of binary exponential backoff MAC protocol for cognitive radio in the IEEE 802.16e/m network ⋮ Martin boundaries for discrete Markov chains ⋮ Limit probabilities for coranks of matrices over GF(q) ⋮ An Extension of Foster's Network Theorem ⋮ Stochastic models with electrical analogues ⋮ Generalized inverses and the total stopping times of collatz sequences ⋮ An application of Markov potential theory to Markovian decision processes ⋮ Computation of the stationary distribution of an infinite stochastic matrix of special form ⋮ The double chain markov model ⋮ Marches aléatoires récurrentes totalement dissymétriques et domaine d⊃attraction des lois stables ⋮ SUFFICIENT CONDITIONS FOR A GEOMETRIC TAIL IN A QBD PROCESS WITH MANY COUNTABLE LEVELS AND PHASES ⋮ Probabilistic analysis of some distributed algorithms ⋮ Tri-Layered QBD Processes with Boundary Assistance for Service Resources ⋮ On the relation between Markov random fields and social networks* ⋮ Light-Tailed Behavior in QBD Processes with Countably Many Phases ⋮ A matrix representation of a class of denumerable homogeneous Markov chains ⋮ Slowly spreading chains of the first kind ⋮ MULTIPLICATIVE MEASURES ON FREE GROUPS ⋮ Representation theory for a class of denumerable Markov chains ⋮ Risk theory in a Markovian environment ⋮ A New Algorithm for Computing the Ergodic Probability Vector for Large Markov Chains ⋮ A mixing Markov chain with exponentially decaying return times is finitarily Bernoulli ⋮ A class of time-reversible semi-Markov processes ⋮ Strong ratio limits, R-recurrence and mixing properties of discrete parameter Markov processes
Cites Work
This page was built for publication: Representation Theory for Denumerable Markov Chains