The DOI matches its Crossref record.
Non-Negative Matrices and Markov Chains.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Expokit: a software package for computing matrix exponentials
Sidje, R. B. (1998) · ACM Transactions on Mathematical Software · doi:10.1145/285861.285868 · Cited by 781
“A number of results of interest were provided in Sidje [1994] and Philippe and Sidje [1995] by exploiting the fact that the matrix A is an infinitesimal generator of a Markov chain and satisfies some inherent properties.”
BackgroundMethodInfluentialLiaisons dangereuses: Increasing connectivity, risk sharing, and systemic risk
Battiston, S., Delli Gatti, D., Gallegati, M., Greenwald, B., & Stiglitz, J. E. (2012) · Journal of Economic Dynamics and Control · doi:10.1016/j.jedc.2012.04.001 · Cited by 734
Towards Deeper Graph Neural Networks
Liu, M., Gao, H., & Ji, S. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403076 · Cited by 507
Non-equilibrium statistical mechanics: from a paradigmatic model to biological transport
Chou, T., Mallick, K., & Zia, R. K. P. (2011) · Reports on Progress in Physics · doi:10.1088/0034-4885/74/11/116601 · Cited by 501
Reweighted Random Walks for Graph Matching
Cho, M., Lee, J., & Lee, K. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15555-0_36 · Cited by 455
Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
Lambiotte, R., Delvenne, J.-C., & Barahona, M. (2014) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2391998 · Cited by 398
Push-Sum Distributed Dual Averaging for convex optimization
Tsianos, K. I., Lawlor, S., & Rabbat, M. G. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426375 · Cited by 304
Distributed strategies for average consensus in directed graphs
Domínguez-García, A. D., & Hadjicostis, C. N. (2011) · 2011 50th IEEE Conference on Decision and Control and European Control Conference · doi:10.1109/cdc.2011.6160462 · Cited by 75
Metadata
- Authors
- Isham, V., & Seneta, E.
- Venue
- Journal of the Royal Statistical Society. Series A (General)
- Publisher
- JSTOR
- Published
- 1983
- Volume
- 146
- Issue
- 2
- Pages
- 202
- ISSN
- 0035-9238 (ISSN-L)
- OpenAlex
- W2802074788
- Cited by
- 439
- References
- 0
- FWCI
- 0.56
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.