Finite Continuous Time Markov Chains
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Combining decomposition and reduction for state space analysis of a self-stabilizing system
- nano\(\kappa\): A calculus for the modeling and simulation of nano devices
- A rapidly mixing stochastic system of finite interacting particles on the circle
- Controlled Markov set-chains under average criteria
- Rank and statistical mapping of a strongly connected automaton
- Markovian interpretations of dual retrieval processes
- Efficient simulation of hierarchical stochastic activity network models
- A necessary condition for weak lumpability in finite Markov processes
- Characterisation of ergodic upper transition operators
- The Brownian approximation for rate-control throttles and the \(G/G/1/C\) queue
- Asymptotic variance rate of the output of a transfer line with no buffer storage and cycle-dependent failures
- Learning correlated equilibria in population games.
- A discrete time model for detection of randomly presented stimuli
- Formal requirements of Markov state models for paired associate learning
- A definition of measures over language space
- New perturbation bounds for denumerable Markov chains
- Investigating the underlying Markovian dynamics of ECG rhythms by information flow
- Variances of first passage times in a Markov chain with applications to mixing times
- Stationary distributions and mean first passage times of perturbed Markov chains
- Parameter estimation: Known vector signals in unknown Gaussian noise
- On the global limits and oscillations of a system of nonlinear differential equations describing a flow on a probabilistic network
- Partially additive categories and flow-diagram semantics
- Moments of transition-additive random variables defined on finite, regenerative random processes
- On the Markov property of a finite hidden Markov chain
- A higher order Markov model for analyzing covariate dependence
- Stochastically stable equilibria in n-person binary coordination games
- Probabilistic game automata
- Continuous state models for finite state machines†
- The generating functions of hitting times for random walk on trees
- Matrix analysis of a Markov chain small-world model
- Language-based performance prediction for distributed and mobile systems
- Bidirectional resource networks: A new flow model
- Spread of (mis)information in social networks
- On the inverse mean first passage matrix problem and the inverse \(M\)-matrix problem
- Algorithms for improving efficiency of discrete Markov chains
- Occupancy time in sets of states for demographic models
- Coupled Markov chain model: Characterization of membrane channel currents with multiple conductance sublevels as partially coupled elementary pores
- A fluid analysis framework for a Markovian process algebra
- Some stochastic properties of ``semi-magic and ``magic Markov chains
- Sojourn times for conditioned Markov chains in genetics
- Coupling and mixing times in a Markov chain
- An introduction to multivariate Krawtchouk polynomials and their applications
- Measuring the confinement of probabilistic systems
- Equivalence notions and model minimization in Markov decision processes
- A feedback algorithm for determining search parameters for Monte Carlo optimization
- Generalized inverses and their application to applied probability problems
- Computing the characteristics of a thinned Markov sequence
- Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph
- A generalization of the classical occupancy problem
- H_ estimation for discrete-time piecewise homogeneous Markov jump linear systems
- Probabilistic weak simulation is decidable in polynomial time
- Approximating labelled Markov processes
- Covering times of random walks on bounded degree trees and other graphs
- Saturated chains of subsets and a random walk
- Tempus fugit: How to plug it
- Lot-sizing two-echelon assembly systems with random yields and rigid demand
- On the first passage time of a simple random walk on a tree
- The expected hitting times for finite Markov chains
- Calculation of characteristics of binormal sequential criteria and plans
- On the computational power of probabilistic and quantum branching program
- Embedding fields: A theory of learning with physiological implications
- An asymptotic maximum principle for essentially linear evolution models
- Weak bisimulation is sound and complete for pCTL\(^*\)
- Modelling spatio-temporal movement of tourists using finite Markov chains
- Sensitivity of finite Markov chains under perturbation
- A simple stochastic gene substitution model
- Aggregation of stochastic automata networks with replicas
- Algebraic Schwarz methods for the numerical solution of Markov chains
- Analysis of a versatile multi-class delay-loss system with a superimposed Markovian arrival process
- One-dimensional kinetic diluted Ising model. Exact solution for correlation functions
- On regularly perturbed fundamental matrices
- The effect of serial correlation on the in-control average run length of cumulative score charts
- An \(M/M/2\) queueing system with heterogeneous servers and multiple vacations
- The rapid mixing of random walks defined by an \(n\)-cube
- On zero-sum two person perfect information semi-Markov games
- An informational transition in conditioned Markov chains: applied to genetics and evolution
- On weak lumpability of denumerable Markov chains
- Cyclical dynamics of industrial production and employment: Markov chain-based estimates and tests
- Detection of embeddings in binary Markov chains
- Directed graphs, 2D state models, and characteristic polynomials of irreducible matrix pairs
- Measurement and comparison of soil structures
- On reducing the statespace of hidden Markov models for the identity by descent process
- Asymptotic reliability analysis for a class of complex systems
- The characteristic landscape equation for an AR(2) landscape
- An all-or-none model for noncorrection routines with elimination of incorrect responses
- Equivalence classes of functions of finite Markov chains
- Distance measures in terms of substitution processes
- Linear programming algorithms for semi-Markovian decision processes
- Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
- Spectral analysis of finite Markov chains with spherical symmetries
- Graph-theoretic approach to symbolic analysis of linear descriptor systems
- Asymptotic growth and stability in populations with time dependent vital rates
- What can and what cannot be inferred from pairwise sequence comparisons?
- Generalized eigenvectors and sets of nonnegative matrices
- Scalar timing and semi-Markov chains in free-operant avoidance
- Muddling through: Noisy equilibrium selection
- Mutation, selection, and ancestry in branching models: a variational approach
- Seven things to remember about hidden Markov models: A tutorial on Markovian models for time series
- Single-crossover dynamics: finite versus infinite populations
- Model reduction for a class of nonstationary Markov jump linear systems
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)