article Open Access
Products of indecomposable, aperiodic, stochastic matrices
Proceedings of the American Mathematical Society · 1963 · Vol. 14(5) · pp. 733–737
Abstract
exists and all the rows of Q are the same. SIA matrices are defined differently in books on probability theory; see, for example, [1] or [2]. The latter definition is more intuitive, takes longer to state, is easier to verify, and explains why the probabilist is interested in SIA matrices. A theorem in probability theory or matrix theory then says that the customary definition is equivalent to the one we have given. The latter is brief and emphasizes the property which will interest us in this note. We define S(P) by
Matrix Theory and AlgorithmsAdvanced Algebra and LogicAperiodic graphIndecomposable moduleMathematicsCombinatorics
Citations
486
FWCI
1.38
field-weighted impact
References
7
Percentile
82%
vs. same field & year
Citations per year
Cited by
Coordination of groups of mobile autonomous agents using nearest neighbor rules
IEEE Transactions on Automatic Control · 2003 · 8,369 citations
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
IEEE Transactions on Industrial Informatics · 2012 · 2,363 citations
Consensus seeking in multiagent systems under dynamically changing interaction topologies
IEEE Transactions on Automatic Control · 2005 · 6,488 citations
Constrained Consensus and Optimization in Multi-Agent Networks
IEEE Transactions on Automatic Control · 2010 · 2,122 citations
Consensus and Cooperation in Networked Multi-Agent Systems
Proceedings of the IEEE · 2007 · 10,218 citations
References
An introduction to probability theory and its applications
Journal of the Franklin Institute · 1958 · 29,713 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.
