Representation Theory for Denumerable Markov Chains

Cites Work

Title not available (Why is that?)
Random walks
Potentials for denumerable Markov chains
Notes on discrete potential theory
Martin boundaries for certain Markov chains
Slowly spreading chains of the first kind

Cited In (31)

Markov chains and summability methods
Markov chains and summability methods
Stochastic models with electrical analogues
Risk theory in a Markovian environment
MULTIPLICATIVE MEASURES ON FREE GROUPS
A New Algorithm for Computing the Ergodic Probability Vector for Large Markov Chains
An Extension of Foster's Network Theorem
On the relation between Markov random fields and social networks*
Generalized inverses and the total stopping times of collatz sequences
The \(M/G/1\)-type Markov chain with restricted transitions and its application to queues with batch arrivals
Computation of the stationary distribution of an infinite stochastic matrix of special form
A mixing Markov chain with exponentially decaying return times is finitarily Bernoulli
Light-Tailed Behavior in QBD Processes with Countably Many Phases
Random walks with ``back buttons
Numerical method for discrete-time finite-buffer queues with some regenerative structure
Limit probabilities for coranks of matrices over GF(q)
The double chain markov model
On the ergodic theorem for positive operators. II
Performance analysis of binary exponential backoff MAC protocol for cognitive radio in the IEEE 802.16e/m network
A class of time-reversible semi-Markov processes
The harmonic functions of (A_t, B_t,)
Marches aléatoires récurrentes totalement dissymétriques et domaine d⊃attraction des lois stables
A matrix representation of a class of denumerable homogeneous Markov chains
Tri-Layered QBD Processes with Boundary Assistance for Service Resources
SUFFICIENT CONDITIONS FOR A GEOMETRIC TAIL IN A QBD PROCESS WITH MANY COUNTABLE LEVELS AND PHASES
An application of Markov potential theory to Markovian decision processes
Strong ratio limits, R-recurrence and mixing properties of discrete parameter Markov processes
Slowly spreading chains of the first kind
Martin boundaries for discrete Markov chains
Probabilistic analysis of some distributed algorithms
Representation theory for a class of denumerable Markov chains

This page was built for publication: Representation Theory for Denumerable Markov Chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5568435)