Representation Theory for Denumerable Markov Chains

From MaRDI portal
Publication:5568435

DOI10.2307/1994587zbMath0178.53306OpenAlexW4252988739MaRDI QIDQ5568435

John G. Kemeny

Publication date: 1966

Full work available at URL: https://doi.org/10.2307/1994587




Related Items (31)

Random walks with ``back buttonsTHE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALSOn the ergodic theorem for positive operators. IINumerical method for discrete-time finite-buffer queues with some regenerative structureThe harmonic functions of (At, Bt,)Markov chains and summability methodsMarkov chains and summability methodsPerformance analysis of binary exponential backoff MAC protocol for cognitive radio in the IEEE 802.16e/m networkMartin boundaries for discrete Markov chainsLimit probabilities for coranks of matrices over GF(q)An Extension of Foster's Network TheoremStochastic models with electrical analoguesGeneralized inverses and the total stopping times of collatz sequencesAn application of Markov potential theory to Markovian decision processesComputation of the stationary distribution of an infinite stochastic matrix of special formThe double chain markov modelMarches aléatoires récurrentes totalement dissymétriques et domaine d⊃attraction des lois stablesSUFFICIENT CONDITIONS FOR A GEOMETRIC TAIL IN A QBD PROCESS WITH MANY COUNTABLE LEVELS AND PHASESProbabilistic analysis of some distributed algorithmsTri-Layered QBD Processes with Boundary Assistance for Service ResourcesOn the relation between Markov random fields and social networks*Light-Tailed Behavior in QBD Processes with Countably Many PhasesA matrix representation of a class of denumerable homogeneous Markov chainsSlowly spreading chains of the first kindMULTIPLICATIVE MEASURES ON FREE GROUPSRepresentation theory for a class of denumerable Markov chainsRisk theory in a Markovian environmentA New Algorithm for Computing the Ergodic Probability Vector for Large Markov ChainsA mixing Markov chain with exponentially decaying return times is finitarily BernoulliA class of time-reversible semi-Markov processesStrong 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