Finite Continuous Time Markov Chains
From MaRDI portal
Publication:3849299
DOI10.1137/1106012zbMath0112.09802OpenAlexW2091169817WikidataQ110853055 ScholiaQ110853055MaRDI QIDQ3849299
John G. Kemeny, J. Laurie Snell
Publication date: 1962
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1106012
Related Items (only showing first 100 items - show all)
The rapid mixing of random walks defined by an \(n\)-cube ⋮ On a two-level multigrid solution method for finite Markov chains ⋮ Spectral analysis of finite Markov chains with spherical symmetries ⋮ On the mean and variance of cover times for random walks on graphs ⋮ Limit distributions of sums of random variables defined on a finite homogeneous Markov chain. I ⋮ Multivariate approximation in total variation. I: Equilibrium distributions of Markov jump processes ⋮ Comparative branching-time semantics for Markov chains ⋮ A note on absorption probabilities in one-dimensional random walk via complex-valued martingales ⋮ A preorder relation for Markov reward processes ⋮ On regularly perturbed fundamental matrices ⋮ Stability of discrete linear inclusion ⋮ On weak lumpability of denumerable Markov chains ⋮ Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains ⋮ An all-or-none model for noncorrection routines with elimination of incorrect responses ⋮ Muddling through: Noisy equilibrium selection ⋮ Directed graphs, 2D state models, and characteristic polynomials of irreducible matrix pairs ⋮ Stationary ensembles in threshold networks ⋮ Nonparametric tests and nested sequential sampling plans for change-point detection ⋮ Coupled Markov chain model: Characterization of membrane channel currents with multiple conductance sublevels as partially coupled elementary pores ⋮ Stability, performance and sensitivity analysis of I.I.D. jump linear systems ⋮ On weak lumpability of a finite Markov chain ⋮ Discrete time Markov chain model for age of information ⋮ A sufficient condition for a unique invariant distribution of a higher-order Markov chain ⋮ Flux through a Markov chain ⋮ A rapidly mixing stochastic system of finite interacting particles on the circle ⋮ The effect of serial correlation on the in-control average run length of cumulative score charts ⋮ Approximating labelled Markov processes ⋮ Robust power series algorithm for epistemic uncertainty propagation in Markov chain models ⋮ Reward algorithms for semi-Markov processes ⋮ Parameter estimation: Known vector signals in unknown Gaussian noise ⋮ Exact results for the probability and stochastic dynamics of fixation in the Wright-Fisher model ⋮ Perturbation bounds for Markov chains with general state space ⋮ Testing lumpability in Markov chains. ⋮ Learning by matching patterns. ⋮ Model reduction for a class of nonstationary Markov jump linear systems ⋮ Rank and statistical mapping of a strongly connected automaton ⋮ Algebraic Schwarz methods for the numerical solution of Markov chains ⋮ Aggregation of stochastic automata networks with replicas ⋮ Improved bounds for a condition number for Markov chains ⋮ The first Laurent series coefficients for singularly perturbed stochastic matrices ⋮ A unified approach to Markov decision problems and performance sensitivity analysis ⋮ Perturbation analysis of continuous‐time absorbing Markov chains ⋮ Potentials for denumerable Markov chains ⋮ The generating functions of hitting times for random walk on trees ⋮ Hitting times for random walks on vertex-transitive graphs ⋮ Algorithms for improving efficiency of discrete Markov chains ⋮ Occupancy time in sets of states for demographic models ⋮ Strong stability and perturbation bounds for discrete Markov chains ⋮ Bisimulation relations for weighted automata ⋮ An evolutionary analysis of the volunteer's dilemma ⋮ On reducing the statespace of hidden Markov models for the identity by descent process ⋮ Arbitrary elementary landscapes \& AR(1) processes ⋮ An asymptotic maximum principle for essentially linear evolution models ⋮ Continuous state models for finite state machines† ⋮ On the Markov property of a finite hidden Markov chain ⋮ The characteristic landscape equation for an AR(2) landscape ⋮ Adaptive policy for two finite Markov chains zero-sum stochastic game with unknown transition matrices and average payoffs ⋮ Weak bisimulation is sound and complete for pCTL\(^*\) ⋮ New perturbation bounds for denumerable Markov chains ⋮ Bisimulation and cocongruence for probabilistic systems ⋮ Lot-sizing two-echelon assembly systems with random yields and rigid demand ⋮ Quantum dynamics of human decision-making ⋮ Mixing times with applications to perturbed Markov chains ⋮ Uniform random sampling of planar graphs in linear time ⋮ Process algebra for performance evaluation ⋮ One-dimensional kinetic diluted Ising model. Exact solution for correlation functions ⋮ Sensitivity of finite Markov chains under perturbation ⋮ Derivation of learning process statistics for a general Markov model ⋮ Interwoven redundant logic ⋮ Synthesis of probability transformers ⋮ Some convergence theorems for stochastic learning models with distance diminishing operators ⋮ Asymptotic reliability analysis for a class of complex systems ⋮ On the global limits and oscillations of a system of nonlinear differential equations describing a flow on a probabilistic network ⋮ Embedding fields: A theory of learning with physiological implications ⋮ Linear programming algorithms for semi-Markovian decision processes ⋮ Error prediction in Markov models of building/HVAC systems ⋮ A probabilistic approach to navigation in Hypertext ⋮ The application of some mathematical methods in medical diagnostics ⋮ Scalar timing and semi-Markov chains in free-operant avoidance ⋮ IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR ⋮ Comparative analysis of automata with a common input alphabet ⋮ A generalization of the classical occupancy problem ⋮ Probabilistic game automata ⋮ Open migration systems with uniform inflow ⋮ First passage step count number versus first passage time in age- dependent dynamics ⋮ A simple stochastic gene substitution model ⋮ Stability of Product Form G-Networks ⋮ Matrix analysis of a Markov chain small-world model ⋮ Markov chain sensitivity measured by mean first passage times ⋮ The evolution of aggregated Markov chains ⋮ Stationary distributions and mean first passage times of perturbed Markov chains ⋮ Language-based performance prediction for distributed and mobile systems ⋮ Controlled Markov set-chains under average criteria ⋮ On the computational power of probabilistic and quantum branching program ⋮ Entropic measures, Markov information sources and complexity ⋮ Asymptotic variance rate of the output of a transfer line with no buffer storage and cycle-dependent failures ⋮ Formal requirements of Markov state models for paired associate learning ⋮ Investigating the underlying Markovian dynamics of ECG rhythms by information flow ⋮ Statistical inference on markov process of neuronal impulse sequences ⋮ Learning correlated equilibria in population games.
This page was built for publication: Finite Continuous Time Markov Chains