Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain
From MaRDI portal
Publication:430187
Recommendations
- Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains
- Iterative component-wise bounds for the steady-state distribution of a Markov chain.
- Refinable bounds for large Markov chains
- Geometric bounds for eigenvalues of Markov chains
- Simple bounds on the convergence rate of an ergodic Markov chain
Cites work
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 2160766 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- A New Approach to the Economic Analysis of Nonstationary Time Series and the Business Cycle
- A comparison of some bounds for the nontrivial eigenvalues of stochastic matrices
- Asymptotic distribution of smoothed eigenvalue density. II. Wigner random matrices
- Basecalling using hidden Markov models
- Bias and variance approximation in value function estimates
- Estimating the second largest eigenvalue of a Markov transition matrix
- Fastest Mixing Markov Chain on a Graph
- Geometric bounds for eigenvalues of Markov chains
- Inference in hidden Markov models.
- Initial-condition estimation in network synchronization processes: algebraic and graphical processes: algebraic and graphical characterizations of the estimator
- Markov Chains
- Maximum likelihood estimation for multivariate observations of Markov sources
- Monte Carlo sampling methods using Markov chains and their applications
- New directions in nonlinear observer design. International workshop, Geiranger Fjord, Norway, June 24--26, 1999
- On controllability with respect to the expectation of discrete time jump linear systems
- On nonlinear discrete-time systems driven by Markov chains
- On the Markov chain central limit theorem
- On the structure of stochastic matrices with a subdominant eigenvalue near 1
- Opportunistic spectrum access in unslotted primary systems
- Principal eigenvectors of irregular graphs
- Sensitivity of the Stationary Distribution of a Markov Chain
- State and unknown input estimation for discrete time multiple model
- State estimation for partially observed Markov chains
- Static decentralized control of a single-integrator network with Markovian sensing topology
- Statistical Inference about Markov Chains
- Statistical Inference for Probabilistic Functions of Finite State Markov Chains
- Stochastic fault tolerant control of networked control systems
- Stochastic sampling algorithms for state estimation of jump Markov linear systems
- Strong Consistency of the Variance Estimator in Steady-State Simulation Output Analysis
- The impact of multi-group multi-layer network structure on the performance of distributed consensus building strategies
- Topology identification and adaptive synchronization of uncertain complex networks with non-derivative and derivative coupling
This page was built for publication: Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q430187)