On the public citation graph

Computation of the eigenprojection of a nonnegative matrix at its spectral radius

0 signed · 45 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-05156-2openalex-snapshot
Matrix Iterative Analysis
inferredcites →https://doi.org/10.1007/978-3-642-66282-9openalex-snapshot
Perturbation Theory for Linear Operators
inferredcites →https://doi.org/10.1007/978-3-662-12678-3openalex-snapshot
Perturbation theory for linear operators
inferredcites →https://doi.org/10.1016/0016-0032(60)90869-3openalex-snapshot
Mathematical methods and theory in games, programming and economics
inferredcites →https://doi.org/10.1016/0024-3795(75)90050-6openalex-snapshot
Algebraic eigenspaces of nonnegative matrices
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6043-6openalex-snapshot
Methods of Matrix Algebra
inferredcites →https://doi.org/10.1080/00401706.1970.10488745openalex-snapshot
Introduction to Matrices with Applications in Statistics
inferredcites →https://doi.org/10.1214/aoms/1177697379openalex-snapshot
Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
inferredcites →https://doi.org/10.1287/moor.9.1.6openalex-snapshot
Multiplicative Markov Decision Chains
inferredcites →https://doi.org/10.2307/1907925openalex-snapshot
Nonnegative Square Matrices
inferredcites →https://doi.org/10.2307/1910243openalex-snapshot
The Theory of Linear Economic Models
inferredcites →https://doi.org/10.2307/2003862openalex-snapshot
Matrix Iterative Analysis
inferredcites →https://doi.org/10.2307/2309264openalex-snapshot
Finite Markov Chains.
inferredcites →https://doi.org/10.2307/3006664openalex-snapshot
The Theory of Linear Economic Models

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf01609001openalex-snapshot
On solving optimization problems with proportion-constraints
inferred← citeshttps://doi.org/10.1016/0024-3795(81)90006-9openalex-snapshot
Resolvent expansions of matrices and applications
inferred← citeshttps://doi.org/10.1016/0024-3795(84)90138-1openalex-snapshot
Bounds on distances between eigenvalues
inferred← citeshttps://doi.org/10.1016/0024-3795(85)90125-9openalex-snapshot
Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90288-6openalex-snapshot
Nonnegative multiplicative processes reaching stationarity in finite time
inferred← citeshttps://doi.org/10.1016/j.dam.2012.02.015openalex-snapshot
The walk distances in graphs
inferred← citeshttps://doi.org/10.1016/j.procs.2013.05.145openalex-snapshot
Matrices of Forests, Analysis of Networks, and Ranking Problems
inferred← citeshttps://doi.org/10.1016/s0024-3795(02)00388-9openalex-snapshot
Forest matrices around the Laplacian matrix
inferred← citeshttps://doi.org/10.1023/a:1020488410896openalex-snapshot
On Determining the Eigenprojection and Components of a Matrix
inferred← citeshttps://doi.org/10.1109/rusautocon58002.2023.10272796openalex-snapshot
On the Critical Value of Time-Delay in Multiagent Systems
inferred← citeshttps://doi.org/10.1109/tac.2014.2304369openalex-snapshot
The Forest Consensus Theorem
inferred← citeshttps://doi.org/10.1134/s0005117909030126openalex-snapshot
Coordination in multiagent systems and Laplacian spectra of digraphs
inferred← citeshttps://doi.org/10.1134/s0005117911120034openalex-snapshot
The projection method for reaching consensus and the regularized power limit of a stochastic matrix
inferred← citeshttps://doi.org/10.1134/s0005117914020143openalex-snapshot
Control of limit states in absorbing resource networks
inferred← citeshttps://doi.org/10.1134/s0005117917010076openalex-snapshot
Models of latent consensus
inferred← citeshttps://doi.org/10.1134/s000511791902005xopenalex-snapshot
Testing the Configurations of Redundant Integrated Equipment Complexes
inferred← citeshttps://doi.org/10.1134/s0005117923050028openalex-snapshot
On the Properties of Orthogonal Projection Method for Reaching Consensus
inferred← citeshttps://doi.org/10.1134/s000511792406002xopenalex-snapshot
On the Boundary Value of the Time-Delay and the Asymptotic Behavior of a Continuous First-Order Consensus Protocol
inferred← citeshttps://doi.org/10.1137/0131057openalex-snapshot
A Representation of the Drazin Inverse and Characterizations of the Index
inferred← citeshttps://doi.org/10.1137/0326023openalex-snapshot
Invariant Polynomial Curves of Piecewise Linear Maps
inferred← citeshttps://doi.org/10.1137/0607065openalex-snapshot
An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Analysis
inferred← citeshttps://doi.org/10.1137/1023036openalex-snapshot
Expansions of Sums of Matrix Powers
inferred← citeshttps://doi.org/10.1137/s0895479895280697openalex-snapshot
A Characterization and Representation of the Drazin Inverse
inferred← citeshttps://doi.org/10.12737/21451openalex-snapshot
Resource network theory
inferred← citeshttps://doi.org/10.3182/20130925-2-de-4044.00052openalex-snapshot
The forest consensus theorem and asymptotic properties of coordination protocols
inferred← citeshttps://doi.org/10.31857/s0005117924060065openalex-snapshot
On the Boundary Value of the Time-Delay and the Asymptotic Behavior of a Continuous First-Order Consensus Protocol
inferred← citeshttps://doi.org/10.31857/s000523102305001xopenalex-snapshot
O svoystvakh metoda ortogonal'noy proektsii v zadache o konsensuse
inferred← citeshttps://doi.org/10.31857/s0005231024060068openalex-snapshot
On the Boundary Value of the Time-Delay and the Asymptotic Behavior of a Continuous First-Order Consensus Protocol
inferred← citeshttps://doi.org/10.37236/1065openalex-snapshot
Kernels of Directed Graph Laplacians
inferred← citeshttps://doi.org/10.48550/arxiv.1610.01200openalex-snapshot
Three Ways to Count Walks in a Digraph
inferred← citeshttps://doi.org/10.48550/arxiv.math/0508171openalex-snapshot
Matrices of Forests and the Analysis of Digraphs
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.