Convergence time to equilibrium distributions of autonomous and periodic non-autonomous graphs
We present some estimates of the time of convergence to the equilibrium distribution in autonomous and periodic non-autonomous graphs, with ergodic stochastic adjacency matrices, using the eigenvalues of these matrices. On this way we generalize previous results from several authors, that only consi...
Main Author: | |
---|---|
Other Authors: | , |
Format: | article |
Language: | eng |
Published: |
2017
|
Subjects: | |
Online Access: | http://hdl.handle.net/10174/19882 |
Country: | Portugal |
Oai: | oai:dspace.uevora.pt:10174/19882 |
Summary: | We present some estimates of the time of convergence to the equilibrium distribution in autonomous and periodic non-autonomous graphs, with ergodic stochastic adjacency matrices, using the eigenvalues of these matrices. On this way we generalize previous results from several authors, that only considered reversible matrices. |
---|