Finite Continuous Time Markov Chains

DOI10.1137/1106012zbMath0112.09802OpenAlexW2091169817WikidataQ110853055 ScholiaQ110853055MaRDI QIDQ3849299

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

zbMATH Keywords

probability theory

Related Items (only showing first 100 items - show all)

An iterative aggregation-disaggregation algorithm for solving linear equations ⋮ On the effects of noise and speed on computations ⋮ Expected hitting times for a random walk on a connected graph ⋮ Stationary distributions of perturbed Markov chains ⋮ Reversed absorbing Markov chain: A sample path approach ⋮ An exact solution to a class of queueing systems with multipurpose counters ⋮ Random walks on quasisymmetric functions ⋮ Cyclical dynamics of industrial production and employment: Markov chain-based estimates and tests ⋮ Detection of embeddings in binary Markov chains ⋮ On the complexity of partially observed Markov decision processes ⋮ A parametric uncertainty analysis method for queues with vacations ⋮ PH-graphs for analyzing shortest path problems with correlated traveling times ⋮ A Markovian procedure for assessing the state of a system ⋮ Moments of transition-additive random variables defined on finite, regenerative random processes ⋮ Saturated chains of subsets and a random walk ⋮ Computing the characteristics of a thinned Markov sequence ⋮ Bidirectional resource networks: A new flow model ⋮ Finiteness in the Beggar-My-Neighbor card game ⋮ Spread of (mis)information in social networks ⋮ Mutation, selection, and ancestry in branching models: a variational approach ⋮ Transition matrices for well-conditioned Markov chains ⋮ Comparative statics and stochastic dynamics of age-structured populations ⋮ Combining decomposition and reduction for state space analysis of a self-stabilizing system ⋮ Markovian interpretations of dual retrieval processes ⋮ Partially additive categories and flow-diagram semantics ⋮ Loss of selectively neutral alleles in small populations and regular mating systems ⋮ Random walks on trees ⋮ Modeling dependence dynamics through copulas with regime switching ⋮ Measurement and comparison of soil structures ⋮ Stochastically stable equilibria in \(n\)-person binary coordination games ⋮ Guidelines for choosing the transition matrix in Monte Carlo methods using Markov chains ⋮ On the inverse mean first passage matrix problem and the inverse \(M\)-matrix problem ⋮ Recurrence and transience for finite probabilistic tables ⋮ On the first passage time of a simple random walk on a tree ⋮ Parametric forms for generalized inverses of Markovian kernels and their applications ⋮ Characterisation of ergodic upper transition operators ⋮ The detection of particular genotypes in finite populations I. Natural selection effects ⋮ Lumpability in compartmental models ⋮ An introduction to multivariate Krawtchouk polynomials and their applications ⋮ Generalized inverses and their application to applied probability problems ⋮ Inequalities for functions of transition matrices ⋮ The expected hitting times for finite Markov chains ⋮ Seven things to remember about hidden Markov models: A tutorial on Markovian models for time series ⋮ The first-passage times of phase semi-Markov processes ⋮ Single-crossover dynamics: finite versus infinite populations ⋮ Variances of first passage times in a Markov chain with applications to mixing times ⋮ Transport in two-dimensional maps: Concepts, examples, amd a comparison of the theory of Rom-Kedar and Wiggins with the Markov model of MacKay, Meiss, Ott, and Percival ⋮ Calculation of characteristics of binormal sequential criteria and plans ⋮ Saddle-point calculation for constrained finite Markov chains ⋮ The Brownian approximation for rate-control throttles and the \(G/G/1/C\) queue ⋮ Efficient simulation of hierarchical stochastic activity network models ⋮ A necessary condition for weak lumpability in finite Markov processes ⋮ nano\(\kappa\): A calculus for the modeling and simulation of nano devices ⋮ Adaptive \(m\)-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers ⋮ A Markov model for switching regressions ⋮ Systems factorial technology provides new insights on global-local information processing in autism spectrum disorders ⋮ A fluid analysis framework for a Markovian process algebra ⋮ On the theory of biased bisection operations and their inverses ⋮ Sum rules for hitting times of Markov chains ⋮ Measuring the confinement of probabilistic systems ⋮ Equivalence classes of functions of finite Markov chains ⋮ Information networks: A probabilistic model for hierarchical message transfer ⋮ On the calculation of the probability of current family-planning status in a cohort of women ⋮ Stack distance density and page fault probability in virtual memory systems ⋮ The distribution of sojourn times in finite absorbing Markov chains ⋮ Some stochastic properties of ``semi-magic and ``magic Markov chains ⋮ A mathematical model for paced serial addition ⋮ A lower bound for probabilistic algorithms for finite state machines ⋮ Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph ⋮ Covering times of random walks on bounded degree trees and other graphs ⋮ Functions of random walks on hyperplane arrangements ⋮ A worm algorithm for the fully-packed loop model ⋮ Tempus fugit: How to plug it ⋮ A discrete time model for detection of randomly presented stimuli ⋮ A definition of measures over language space ⋮ Modelling spatio-temporal movement of tourists using finite Markov chains ⋮ Sojourn times for conditioned Markov chains in genetics ⋮ An alternative expression for the mean first passage matrix ⋮ An informational transition in conditioned Markov chains: applied to genetics and evolution ⋮ Asymptotic growth and stability in populations with time dependent vital rates ⋮ Variance estimation in the central limit theorem for Markov chains ⋮ Coupling and mixing times in a Markov chain ⋮ An \(M/M/2\) queueing system with heterogeneous servers and multiple vacations ⋮ A feedback algorithm for determining search parameters for Monte Carlo optimization ⋮ Probabilistic weak simulation is decidable in polynomial time ⋮ Carries, shuffling, and symmetric functions ⋮ A higher order Markov model for analyzing covariate dependence ⋮ Distance measures in terms of substitution processes ⋮ Analysis of a versatile multi-class delay-loss system with a superimposed Markovian arrival process ⋮ \(H_\infty \) estimation for discrete-time piecewise homogeneous Markov jump linear systems ⋮ Multiplicative processes reaching stationarity in finite time ⋮ The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem ⋮ What can and what cannot be inferred from pairwise sequence comparisons? ⋮ Generalized eigenvectors and sets of nonnegative matrices ⋮ Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques ⋮ Sensitivity of the stationary distribution vector for an ergodic Markov chain ⋮ Graph-theoretic approach to symbolic analysis of linear descriptor systems ⋮ Equivalence notions and model minimization in Markov decision processes ⋮ A lattice path lemma and an application in enzyme kinetics ⋮ Random walks on the triangular prism and other vertex-transitive graphs

This page was built for publication: Finite Continuous Time Markov Chains