On the public citation graph
Parameter testing in bounded degree graphs of subexponential growth
0 signed · 37 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/3-540-33700-8_18openalex-snapshot
Counting Graph Homomorphisms
inferredcites →https://doi.org/10.1007/bf01209306openalex-snapshot
Remark on the continuity of the density of states of ergodic finite difference operators
inferredcites →https://doi.org/10.1007/bf02776032openalex-snapshot
Amenability, Kazhdan’s property and percolation for trees, groups and equivalence relations
inferredcites →https://doi.org/10.1007/bf02807400openalex-snapshot
An ergodic theorem for Delone dynamical systems and existence of the integrated density of states
inferredcites →https://doi.org/10.1007/s00493-007-2214-8openalex-snapshot
Note on limits of finite graphs
inferredcites →https://doi.org/10.1016/j.aim.2009.10.018openalex-snapshot
Every minor-closed property of sparse graphs is testable
inferredcites →https://doi.org/10.1016/j.jctb.2006.05.002openalex-snapshot
Limits of dense graph sequences
inferredcites →https://doi.org/10.1016/j.jfa.2008.01.010openalex-snapshot
L2 -spectral invariants and convergent sequences of finite graphs
inferredcites →https://doi.org/10.1016/s0304-3975(98)00158-3openalex-snapshot
Some APX-completeness results for cubic graphs
inferredcites →https://doi.org/10.1109/sfcs.2005.5openalex-snapshot
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
inferredcites →https://doi.org/10.1137/060652324openalex-snapshot
Testing versus Estimation of Graph Properties
inferredcites →https://doi.org/10.1137/070681831openalex-snapshot
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
inferredcites →https://doi.org/10.1145/1060590.1060611openalex-snapshot
Every monotone graph property is testable
inferredcites →https://doi.org/10.1145/1132516.1132556openalex-snapshot
Graph limits and parameter testing
inferredcites →https://doi.org/10.1145/174644.174650openalex-snapshot
Approximation algorithms for NP-complete problems on planar graphs
inferredcites →https://doi.org/10.1214/ejp.v6-96openalex-snapshot
Recurrence of Distributional Limits of Finite Planar Graphs
inferredcites →https://doi.org/10.2307/2043545openalex-snapshot
The Independence Ratio of Regular Graphs
inferredcites →https://doi.org/10.48550/arxiv.math/0510471openalex-snapshot
Counting without sampling. New algorithms for enumeration problems using statistical physics
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-642-16367-8_9openalex-snapshot
Sublinear Graph Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_45openalex-snapshot
An Efficient Partitioning Oracle for Bounded-Treewidth Graphs
inferred← citeshttps://doi.org/10.1007/s00208-017-1552-0openalex-snapshot
Infinite dimensional representations of finite dimensional algebras and amenability
inferred← citeshttps://doi.org/10.1007/s10955-019-02225-3openalex-snapshot
Controllability, Matching Ratio and Graph Convergence
inferred← citeshttps://doi.org/10.1016/j.aim.2009.10.018openalex-snapshot
Every minor-closed property of sparse graphs is testable
inferred← citeshttps://doi.org/10.1016/j.jfa.2012.08.021openalex-snapshot
Finite graphs and amenability
inferred← citeshttps://doi.org/10.1017/s0963548311000733openalex-snapshot
Approximating Cayley Diagrams Versus Cayley Graphs
inferred← citeshttps://doi.org/10.1090/s0002-9939-10-10291-3openalex-snapshot
Borel oracles. An analytical approach to constant-time algorithms
inferred← citeshttps://doi.org/10.1093/imrn/rnx082openalex-snapshot
Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding
inferred← citeshttps://doi.org/10.1109/focs.2009.77openalex-snapshot
Local Graph Partitions for Approximation and Testing
inferred← citeshttps://doi.org/10.1137/120890946openalex-snapshot
Every Property of Hyperfinite Graphs Is Testable
inferred← citeshttps://doi.org/10.1142/s0218196714500556openalex-snapshot
Convergence theorems for graph sequences
inferred← citeshttps://doi.org/10.14232/phd.10380openalex-snapshot
Local weak limits of random graphs and parameter continuity
inferred← citeshttps://doi.org/10.5802/ahl.102openalex-snapshot
Non-standard limits of graphs and some orbit equivalence invariants
inferred← citeshttps://doi.org/10.5802/ahl.124openalex-snapshot
Approximate Schreier decorations and approximate Kőnig’s line coloring Theorem
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.