Finite Continuous Time Markov Chains
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Modelling spatio-temporal movement of tourists using finite Markov chains
- 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
- Probabilistic weak simulation is decidable in polynomial time
- Carries, shuffling, and symmetric functions
- A higher order Markov model for analyzing covariate dependence
- H_ estimation for discrete-time piecewise homogeneous Markov jump linear systems
- Sensitivity of the stationary distribution vector for an ergodic Markov chain
- A lattice path lemma and an application in enzyme kinetics
- Random walks on the triangular prism and other vertex-transitive graphs
- An iterative aggregation-disaggregation algorithm for solving linear equations
- Expected hitting times for a random walk on a connected graph
- Stationary distributions of perturbed Markov chains
- 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
- Comparative statics and stochastic dynamics of age-structured populations
- Partially additive categories and flow-diagram semantics
- Loss of selectively neutral alleles in small populations and regular mating systems
- Random walks on trees
- Measurement and comparison of soil structures
- Guidelines for choosing the transition matrix in Monte Carlo methods using Markov chains
- The detection of particular genotypes in finite populations I. Natural selection effects
- Generalized inverses and their application to applied probability problems
- 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
- The Brownian approximation for rate-control throttles and the \(G/G/1/C\) queue
- Adaptive \(m\)-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers
- A Markov model for switching regressions
- On the theory of biased bisection operations and their inverses
- 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
- A mathematical model for paced serial addition
- A discrete time model for detection of randomly presented stimuli
- A definition of measures over language space
- Sojourn times for conditioned Markov chains in genetics
- An alternative expression for the mean first passage matrix
- Asymptotic growth and stability in populations with time dependent vital rates
- A feedback algorithm for determining search parameters for Monte Carlo optimization
- Distance measures in terms of substitution processes
- Analysis of a versatile multi-class delay-loss system with a superimposed Markovian arrival process
- 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?
- Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
- Graph-theoretic approach to symbolic analysis of linear descriptor systems
- On the effects of noise and speed on computations
- Reversed absorbing Markov chain: A sample path approach
- An exact solution to a class of queueing systems with multipurpose counters
- On the complexity of partially observed Markov decision processes
- On the mean and variance of cover times for random walks on graphs
- Muddling through: Noisy equilibrium selection
- Directed graphs, 2D state models, and characteristic polynomials of irreducible matrix pairs
- A rapidly mixing stochastic system of finite interacting particles on the circle
- Approximating labelled Markov processes
- Parameter estimation: Known vector signals in unknown Gaussian noise
- Testing lumpability in Markov chains.
- Learning by matching patterns.
- 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
- Markov chain sensitivity measured by mean first passage times
- 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
- Multivariate approximation in total variation. I: Equilibrium distributions of Markov jump processes
- Reward algorithms for semi-Markov processes
- Exact results for the probability and stochastic dynamics of fixation in the Wright-Fisher model
- Perturbation bounds for Markov chains with general state space
- Algorithms for improving efficiency of discrete Markov chains
- Occupancy time in sets of states for demographic models
- An asymptotic maximum principle for essentially linear evolution models
- Sensitivity of finite Markov chains under perturbation
- Error prediction in Markov models of building/HVAC systems
- A probabilistic approach to navigation in Hypertext
- Probabilistic game automata
- First passage step count number versus first passage time in age- dependent dynamics
- A simple stochastic gene substitution model
- Language-based performance prediction for distributed and mobile systems
- Controlled Markov set-chains under average criteria
- Entropic measures, Markov information sources and complexity
- Learning correlated equilibria in population games.
- The rapid mixing of random walks defined by an \(n\)-cube
- On a two-level multigrid solution method for finite Markov chains
- Limit distributions of sums of random variables defined on a finite homogeneous Markov chain. I
- Stability of discrete linear inclusion
- On weak lumpability of denumerable Markov chains
- Coupled Markov chain model: Characterization of membrane channel currents with multiple conductance sublevels as partially coupled elementary pores
- On weak lumpability of a finite Markov chain
- The effect of serial correlation on the in-control average run length of cumulative score charts
- A unified approach to Markov decision problems and performance sensitivity analysis
- Weak bisimulation is sound and complete for pCTL\(^*\)
- New perturbation bounds for denumerable Markov chains
- Spectral analysis of finite Markov chains with spherical symmetries
- Comparative branching-time semantics for Markov chains
This page was built for publication: Finite Continuous Time Markov Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3849299)