On the public citation graph

A comparison of some bounds for the nontrivial eigenvalues of stochastic matrices

https://doi.org/10.1007/bf01404690
0 signed · 21 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/bf01406004openalex-snapshot
A remark on the paper of H. H. Schaefer Absch�tzung der nichttrivalen eigenwerte stochastischer matrizen
inferredcites →https://doi.org/10.1007/bf01436327openalex-snapshot
Inclusion domains for the eigenvalues of stochastic matrices
inferredcites →https://doi.org/10.1007/bf01818444openalex-snapshot
Abschätzungen für den zweiten Eigenwert eines positiven Operators
inferredcites →https://doi.org/10.1007/bf02168970openalex-snapshot
Eine Abschätzung der nichttrivialen Eigenwerte stochastischer Matrizen
inferredcites →https://doi.org/10.1016/0024-3795(69)90031-7openalex-snapshot
Abschätzungen für die eigenwerte positiver linearer operatoren

What points at this work

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

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(93)90113-3openalex-snapshot
On explicit forms for ergodicity coefficients
inferred← citeshttps://doi.org/10.1016/0168-9274(90)90012-5openalex-snapshot
Some sufficient conditions for the convergence of the method of averaging functional corrections
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2011.07.010openalex-snapshot
Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10196-9openalex-snapshot
The convergence of general products of matrices and the weak ergodicity of Markov chains
inferred← citeshttps://doi.org/10.1016/s0898-1221(00)00060-2openalex-snapshot
Bounds for sums of eigenvalues and applications
inferred← citeshttps://doi.org/10.1017/s000186780003281xopenalex-snapshot
Coefficients of ergodicity: structure and applications
inferred← citeshttps://doi.org/10.1057/jors.1992.119openalex-snapshot
Note on the Convergence of a Manpower Distribution
inferred← citeshttps://doi.org/10.1109/acc.2011.5990901openalex-snapshot
Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain
inferred← citeshttps://doi.org/10.1109/mcas.2013.2271443openalex-snapshot
Multi-Agent Systems with Dynamical Topologies: Consensus and Applications
inferred← citeshttps://doi.org/10.1111/sjos.12024openalex-snapshot
On Sampling Designs with Ordered Conditional Inclusion Probabilities
inferred← citeshttps://doi.org/10.1137/110850116openalex-snapshot
Consensus of Discrete-Time Second-Order Multiagent Systems Based on Infinite Products of General Stochastic Matrices
inferred← citeshttps://doi.org/10.2307/1426800openalex-snapshot
Coefficients of ergodicity: structure and applications
inferred← citeshttps://doi.org/10.2307/1426955openalex-snapshot
Coefficients of ergodicity: structure and applications
inferred← citeshttps://doi.org/10.48550/arxiv.1003.1266openalex-snapshot
Hitting and commute times in large graphs are often misleading
inferred← citeshttps://doi.org/10.5555/2627435.2638591openalex-snapshot
Hitting and commute times in large random neighborhood graphs
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.