On the public citation graph
Resource network theory
0 signed · 54 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.1006/eujc.1999.0366openalex-snapshot
On the Sandpile Group of Dual Graphs
inferredcites →https://doi.org/10.1007/0-387-32792-4openalex-snapshot
Non-negative Matrices and Markov Chains
inferredcites →https://doi.org/10.1007/978-0-85729-169-1openalex-snapshot
Distributed Coordination of Multi-agent Networks: Emergent Problems, Models, and Issues
inferredcites →https://doi.org/10.1007/978-1-4471-3267-7openalex-snapshot
Markov Chains and Stochastic Stability
inferredcites →https://doi.org/10.1007/978-3-642-19592-1openalex-snapshot
Random Walks and Diffusions on Graphs and Databases: An Introduction
inferredcites →https://doi.org/10.1007/bf00144359openalex-snapshot
Why does the probabilistic abacus work?
inferredcites →https://doi.org/10.1007/bf01048088openalex-snapshot
Asymmetric abeiian sandpile models
inferredcites →https://doi.org/10.1007/bf01048272openalex-snapshot
Lower bounds for covering times for reversible Markov chains and random walks on graphs
inferredcites →https://doi.org/10.1007/bf02188212openalex-snapshot
Structure of two-dimensional sandpile. I. Height probabilities
inferredcites →https://doi.org/10.1007/bf02558479openalex-snapshot
Chip firing and the tutte polynomial
inferredcites →https://doi.org/10.1007/bfb0120751openalex-snapshot
Computation of the eigenprojection of a nonnegative matrix at its spectral radius
inferredcites →https://doi.org/10.1007/s00026-005-0237-zopenalex-snapshot
Laplacians and the Cheeger Inequality for Directed Graphs
inferredcites →https://doi.org/10.1016/s0024-3795(02)00388-9openalex-snapshot
Forest matrices around the Laplacian matrix
inferredcites →https://doi.org/10.1016/s0195-6698(13)80111-4openalex-snapshot
Chip-firing Games on Graphs
inferredcites →https://doi.org/10.1016/s0378-4371(98)00493-2openalex-snapshot
The Abelian sandpile and related models
inferredcites →https://doi.org/10.1017/cbo9780511626630openalex-snapshot
Markov Chains and Stochastic Stability
inferredcites →https://doi.org/10.1017/cbo9780511662096.007openalex-snapshot
Mixing of random walks and other diffusions on a graph
inferredcites →https://doi.org/10.1017/s0305004100030991openalex-snapshot
The ergodic properties of non-homogeneous finite Markov chains
inferredcites →https://doi.org/10.1017/s0305004100033399openalex-snapshot
Weak ergodicity in non-homogeneous Markov chains
inferredcites →https://doi.org/10.1023/a:1018611014097openalex-snapshot
Chip-Firing and the Critical Group of a Graph
inferredcites →https://doi.org/10.1023/a:1018748527916openalex-snapshot
The Tutte Polynomial as a Growth Function
inferredcites →https://doi.org/10.1023/a:1022467132614openalex-snapshot
Chip-Firing Games on Directed Graphs
inferredcites →https://doi.org/10.1038/30918openalex-snapshot
Collective dynamics of ‘small-world’ networks
inferredcites →https://doi.org/10.1038/scientificamerican0191-46openalex-snapshot
Self-Organized Criticality
inferredcites →https://doi.org/10.1080/00029890.1989.11972227openalex-snapshot
Disks, Balls, and Walls: Analysis of a Combinatorial Game
inferredcites →https://doi.org/10.1088/0034-4885/62/10/201openalex-snapshot
Self-organized criticality
inferredcites →https://doi.org/10.1103/physreve.66.046137openalex-snapshot
Epidemic spreading in a variety of scale free networks
inferredcites →https://doi.org/10.1103/physrevlett.64.1613openalex-snapshot
Self-organized critical state of sandpile automaton models
inferredcites →https://doi.org/10.1109/sfcs.1979.34openalex-snapshot
Random walks, universal traversal sequences, and the complexity of maze problems
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1137/0126044openalex-snapshot
Limits and the Index of a Square Matrix
inferredcites →https://doi.org/10.1145/1353343.1353424openalex-snapshot
Social ties and their relevance to churn in mobile telecom networks
inferredcites →https://doi.org/10.1145/167088.167250openalex-snapshot
Approximate load balancing on dynamic and asynchronous networks
inferredcites →https://doi.org/10.1209/0295-5075/85/48002openalex-snapshot
Pattern formation in growing sandpiles
inferredcites →https://doi.org/10.1214/aoap/1177005705openalex-snapshot
Trailing the Dovetail Shuffle to its Lair
inferredcites →https://doi.org/10.1214/aop/1039548382openalex-snapshot
The Abelian sandpile model on an infinite tree
inferredcites →https://doi.org/10.1515/9781400835355openalex-snapshot
Graph Theoretic Methods in Multiagent Networks
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.3182/20110828-6-it-1002.00766openalex-snapshot
Flows and Limit States in Bidirectional Resource Networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.3075968openalex-extracted
, 2017. (EDB Macroreview, May 2017. Recovery in Trade Between the EDB Countries)
inferred← citeshttps://doi.org/10.2139/ssrn.3075977openalex-extracted
, 2017. : (EDB Macroreview, January 2017 - EDB Countries: Targeting Lower Inflation)
inferred← citeshttps://doi.org/10.1007/978-3-030-00617-4_22openalex-snapshot
Resource Network with Limitations on Vertex Capacities: A Double-Threshold Dynamic Flow Model
inferred← citeshttps://doi.org/10.1007/978-3-030-59535-7_13openalex-snapshot
Complex Graphs in the Modeling of Multi-agent Systems: From Goal-Resource Networks to Fuzzy Metagraphs
inferred← citeshttps://doi.org/10.1007/s10958-025-07812-2openalex-snapshot
BALANCED NETWORKS AND GRAPHS
inferred← citeshttps://doi.org/10.1007/s10958-026-08581-2openalex-snapshot
“n-1” PATHS ON THE LATTICE GRAPH. RANDOM WALKS
inferred← citeshttps://doi.org/10.1088/1757-899x/890/1/012188openalex-snapshot
Synthesis of Group Incentive Systems on the Basis of Heuristic Algorithms
inferred← citeshttps://doi.org/10.17308/sait.2019.3/1306openalex-snapshot
О заполнении растущих деревьев источником, находящемся в корне
inferred← citeshttps://doi.org/10.4213/mzm12111openalex-snapshot
2-3 пути на графе-решетке. Случайные блуждания
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.