The imbedding problem for finite Markov chains
From MaRDI portal
Publication:5728809
DOI10.1007/BF00531768zbMATH Open0118.13501MaRDI QIDQ5728809FDOQ5728809
Authors: J. F. C. Kingman
Publication date: 1962
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)
Cites Work
Cited In (34)
- Zum Einbettungsproblem für Markoff-Prozesse
- Estimation using plug-in of the stationary distribution and Shannon entropy of continuous time Markov processes
- The root problem for stochastic and doubly stochastic operators
- Fitting timeseries by continuous-time Markov chains: a quadratic programming approach
- Lie-Markov models derived from finite semigroups
- Maximum likelihood estimation of symmetric group-based models via numerical algebraic geometry
- Optimal adaptive sampling for a symmetric two-state continuous time Markov chain
- On \(p\)th roots of stochastic matrices
- The complexity of divisibility
- Embedding of Markov matrices for \(d \leqslant 4\)
- The model-specific Markov embedding problem for symmetric group-based models
- Statistical Inference for Discretely Observed Markov Jump Processes
- The complexity of relating quantum channels to master equations
- A solution to the reversible embedding problem for finite Markov chains
- The life and work of Gustav Elfving.
- An open set of 4×4 embeddable matrices whose principal logarithm is not a Markov generator
- Random evolutions in discrete and continuous time
- A central limit theorem for finite semigroups and its application to the imbedding problem for finite state Markov chains
- On the imbedding problem for three-state time homogeneous Markov chains with coinciding negative eigenvalues
- Embeddability of real and positive operators
- On monotone Markov chains and properties of monotone matrix roots
- On equal-input and monotone Markov matrices
- Sufficient embedding conditions for three-state discrete-time Markov chains with real eigenvalues
- Some results on the embeddable problem for discrete-time Markov models in manpower planning
- Accessible Maps in a Group of Classical or Quantum Channels
- The combinatorial structure of non-homogeneous Markov chains
- Infinitely divisible nonnegative matrices, \(M\)-matrices, and the embedding problem for finite state stationary Markov chains
- Roots of completely positive maps
- The stochastic theory of regenerative events
- Ausdehnung von Markoff-Prozessen auf erweiterte Parametermengen
- Estimating malaria incidence and recovery rates from panel surveys
- Notes on Markov embedding
- Embeddability of centrosymmetric matrices capturing the double-helix structure in natural and synthetic DNA
- The embedding problem for Markov matrices
This page was built for publication: The imbedding problem for finite Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5728809)