On the public citation graph
On primitivity of sets of matrices
0 signed · 62 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/0-8176-4452-0openalex-snapshot
Stochastic Switching Systems: Analysis and Design
inferredcites →https://doi.org/10.1007/978-1-4612-0017-8openalex-snapshot
Switching in Systems and Control
inferredcites →https://doi.org/10.1007/978-3-540-95980-9openalex-snapshot
The Joint Spectral Radius: Theory and Applications
inferredcites →https://doi.org/10.1007/978-3-642-22953-4_15openalex-snapshot
Modifying the Upper Bound on the Length of Minimal Synchronizing Word
inferredcites →https://doi.org/10.1007/bf01219774openalex-snapshot
The Lyapunov exponent and joint spectral radius of pairs of matrices are hard?when not impossible?to compute and to approximate
inferredcites →https://doi.org/10.1007/s10688-010-0031-0openalex-snapshot
Invariant functionals for random matrices
inferredcites →https://doi.org/10.1007/s10958-013-1295-8openalex-snapshot
Combinatorial properties of irreducible semigroups of nonnegative matrices
inferredcites →https://doi.org/10.1016/0024-3795(82)90237-3openalex-snapshot
Sets of nonnegative matrices with positive inhomogeneous products
inferredcites →https://doi.org/10.1016/j.automatica.2015.07.026openalex-snapshot
On primitivity of sets of matrices
inferredcites →https://doi.org/10.1016/j.laa.2012.02.029openalex-snapshot
Sets of nonnegative matrices without positive products
inferredcites →https://doi.org/10.1016/j.laa.2013.01.027openalex-snapshot
Lower and upper bounds for the largest Lyapunov exponent of matrices
inferredcites →https://doi.org/10.1016/j.laa.2013.04.025openalex-snapshot
Shortest positive products of nonnegative matrices
inferredcites →https://doi.org/10.1016/s0024-3795(02)00365-8openalex-snapshot
Exponents of tuples of nonnegative matrices
inferredcites →https://doi.org/10.1016/s0304-3975(02)00405-xopenalex-snapshot
Synchronizing finite automata on Eulerian digraphs
inferredcites →https://doi.org/10.1017/s0021900200104681openalex-snapshot
Towards consensus: some convergence theorems on repeated averaging
inferredcites →https://doi.org/10.1070/rm2010v065n06abeh004722openalex-snapshot
Semigroups of non-negative matrices
inferredcites →https://doi.org/10.1109/cdc.2012.6427078openalex-snapshot
On the cost of deciding consensus
inferredcites →https://doi.org/10.1109/tac.1986.1104412openalex-snapshot
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
inferredcites →https://doi.org/10.1109/tac.2003.812781openalex-snapshot
Coordination of groups of mobile autonomous agents using nearest neighbor rules
inferredcites →https://doi.org/10.1109/tac.2008.917743openalex-snapshot
A Necessary and Sufficient Condition for Consensus Over Random Networks
inferredcites →https://doi.org/10.1109/tac.2010.2046086openalex-snapshot
On Conditions for Convergence to Consensus
inferredcites →https://doi.org/10.1137/0219033openalex-snapshot
Reset Sequences for Monotonic Automata
inferredcites →https://doi.org/10.1137/05063516xopenalex-snapshot
Stability Criteria for Switched and Hybrid Systems
inferredcites →https://doi.org/10.1137/100816109openalex-snapshot
The Synchronizing Probability Function of an Automaton
inferredcites →https://doi.org/10.1137/12086594xopenalex-snapshot
How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard
inferredcites →https://doi.org/10.1137/120883414openalex-snapshot
Classification of $k$-Primitive Sets of Matrices
inferredcites →https://doi.org/10.23919/ecc.2013.6669270openalex-snapshot
Convex optimization methods for computing the Lyapunov exponent of matrices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-24886-4_4openalex-snapshot
A Linear Bound on the K-Rendezvous Time for Primitive Sets of NZ Matrices
inferred← citeshttps://doi.org/10.1007/978-3-030-30806-3_2openalex-snapshot
Primitivity and Synchronizing Automata: A Functional Analytic Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_16openalex-snapshot
On the Synchronizing Probability Function and the Triple Rendezvous Time
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_16openalex-snapshot
The Synchronizing Probability Function for Primitive Sets of Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_27openalex-snapshot
On Completely Reachable Automata and Subset Reachability
inferred← citeshttps://doi.org/10.1007/s10958-015-2390-9openalex-snapshot
Combinatorial Properties of Entire Semigroups of Nonnegative Matrices
inferred← citeshttps://doi.org/10.1016/j.endm.2017.07.006openalex-snapshot
Generalized primitivity of labeled digraphs
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105086openalex-snapshot
New characterizations of primitive permutation groups with applications to synchronizing automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.08.002openalex-snapshot
Preimage problems for deterministic finite automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.02.007openalex-snapshot
Analytic methods for reachability problems
inferred← citeshttps://doi.org/10.1109/cdc.2015.7402864openalex-snapshot
Reachability of consensus and synchronizing automata
inferred← citeshttps://doi.org/10.1109/tac.2017.2720703openalex-snapshot
Consensus of Discrete-Time Linear Multiagent Systems With Communication, Input and Output Delays
inferred← citeshttps://doi.org/10.1109/tsmc.2018.2855741openalex-snapshot
Stability Analysis of Covariance Intersection-Based Kalman Consensus Filtering for Time-Varying Systems
inferred← citeshttps://doi.org/10.1134/s0001434619050183openalex-snapshot
A New Proof of the Protasov-Voynov Theorem on Semigroups of Nonnegative Matrices
inferred← citeshttps://doi.org/10.1134/s1990478918030067openalex-snapshot
Primitivity and Local Primitivity of Digraphs and Nonnegative Matrices
inferred← citeshttps://doi.org/10.1137/15m1024603openalex-snapshot
On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata
inferred← citeshttps://doi.org/10.1137/16m1094099openalex-snapshot
Primitive Sets of Nonnegative Matrices and Synchronizing Automata
inferred← citeshttps://doi.org/10.1137/22m1471535openalex-snapshot
Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach
inferred← citeshttps://doi.org/10.1142/s0129054120410051openalex-snapshot
The Synchronizing Probability Function for Primitive Sets of Matrices
inferred← citeshttps://doi.org/10.13001/1081-3810.3088openalex-snapshot
An Expansion Property of Boolean Linear Maps
inferred← citeshttps://doi.org/10.3233/fi-2021-2043openalex-snapshot
A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices
inferred← citeshttps://doi.org/10.37236/5193openalex-snapshot
Lifespan in a Primitive Boolean Linear Dynamical System
inferred← citeshttps://doi.org/10.4213/mzm11929openalex-snapshot
Новое доказательство теоремы Протасова-Войнова о полугруппах неотрицательных матриц
inferred← citeshttps://doi.org/10.4213/sm8408openalex-snapshot
Компактные несжимающие полугруппы аффинных операторов
inferred← citeshttps://doi.org/10.46298/dmtcs.2101openalex-snapshot
A note on a recent attempt to improve the Pin-Frankl bound
inferred← citeshttps://doi.org/10.48550/arxiv.1712.02614openalex-snapshot
Sets of Stochastic Matrices with Converging Products: Bounds and Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1801.05391openalex-snapshot
Using Sat solvers for synchronization issues in non-deterministic automata
inferred← citeshttps://doi.org/10.48550/arxiv.1805.02540openalex-snapshot
On Completely Reachable Automata and Subset Reachability
inferred← citeshttps://doi.org/10.7153/oam-2021-15-50openalex-snapshot
Recognition of matrices which are sign-regular of a given order and a generalization of oscillatory matrices
showing the first 29 of 30 · page through all 30
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.