Convergence rate of Markov chains over switching distance regular networks
From MaRDI portal
(Redirected from Publication:6669324)
Recommendations
- On the convergence rate of diffusion in the bidirectional Erdős-Rényi networks: an \(H^2\)-norm perspective
- Product of Random Stochastic Matrices and Distributed Averaging
- On backward product of stochastic matrices
- Stochastic approximation based consensus dynamics over Markovian networks
- Convergence results for the linear consensus problem under Markovian random graphs
Cites work
- A characterization of strongly regular graphs in terms of the largest signless Laplacian eigenvalues
- A Modern Introduction to Probability and Statistics
- Analysis of an epidemiological model driven by multiple noises: ergodicity and convergence rate
- Bounds on Lyapunov Exponents via Entropy Accumulation
- Calculating two-point resistances in distance-regular resistor networks
- Consensus and Cooperation in Networked Multi-Agent Systems
- Consensus and Products of Random Stochastic Matrices: Exact Rate for Convergence in Probability
- Consensus Over Ergodic Stationary Graph Processes
- Convergence speed in distributed consensus and averaging
- Design of Feedback Control Laws for Information Transfer in Spintronics Networks
- Diffusion-Based Distributed Parameter Estimation Through Directed Graphs With Switching Topology: Application of Dynamic Regressor Extension and Mixing
- Distance-regular graphs
- Effective estimates of Lyapunov exponents for random products of positive matrices
- Effective estimates on the top Lyapunov exponents for random matrix products
- Evaluation of effective resistances in pseudo-distance-regular resistor networks
- Exact Lyapunov exponent for infinite products of random matrices
- Fastest mixing reversible Markov chain on friendship graph: trade-off between transition probabilities among friends and convergence rate
- Fluctuations of the product of random matrices and generalized Lyapunov exponent
- Gossip algorithm with nonuniform clock distribution: optimization over classical and quantum networks
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- scientific article; zbMATH DE number 3951681 (Why is no real title available?)
- scientific article; zbMATH DE number 3798745 (Why is no real title available?)
- scientific article; zbMATH DE number 2117211 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Infinite products of random matrices and repeated interaction dynamics
- Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
- Learning control for linear systems under general data dropouts at both measurement and actuator sides: a Markov chain approach
- Limit theorems for products of positive random matrices
- Lower and upper bounds for the largest Lyapunov exponent of matrices
- Lyapunov Criterion for Stochastic Systems and Its Applications in Distributed Computation
- Lyapunov Exponent of Rank-One Matrices: Ergodic Formula and Inapproximability of the Optimal Distribution
- Lyapunov indices of a product of random matrices
- Markov chain Monte Carlo based adaptive Rauch-Tung-Striebel smoother
- Markov chains with random transition matrices
- Maximal Lyapunov exponents for random matrix products
- Non-negative matrices and Markov chains.
- On the cycle expansion for the Lyapunov exponent of a product of random matrices
- Optimal curing resource allocation for epidemic spreading processes
- Optimizing the Convergence Rate of the Continuous-Time Quantum Consensus
- Optimizing the diffusion system based on continuous-time consensus algorithm
- Parametric Furstenberg theorem on random products of \(\mathrm{SL}(2, \mathbb{R})\) matrices
- Perfect codes and related structures
- Product of Random Stochastic Matrices
- Products of Indecomposable, Aperiodic, Stochastic Matrices
- Products of Random Matrices
- Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate
- Stabilization of probabilistic finite automata based on semi-tensor product of matrices
- Strongly regular graphs
This page was built for publication: Convergence rate of Markov chains over switching distance regular networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6669324)
