On the public citation graph

Finite graphs and amenability

0 signed · 41 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.1002/rsa.20308openalex-snapshot
Parameter testing in bounded degree graphs of subexponential growth
inferredcites →https://doi.org/10.1002/rsa.20334openalex-snapshot
Sparse graphs: Metrics and random models
inferredcites →https://doi.org/10.1006/aima.1998.1771openalex-snapshot
Borel Chromatic Numbers
inferredcites →https://doi.org/10.1007/978-1-4419-9675-6_19openalex-snapshot
Hyperfinite Graph Limits
inferredcites →https://doi.org/10.1007/b99421openalex-snapshot
Topics in Orbit Equivalence
inferredcites →https://doi.org/10.1007/bf02790325openalex-snapshot
Entropy and isomorphism theorems for actions of amenable groups
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.jfa.2008.01.010openalex-snapshot
L2 -spectral invariants and convergent sequences of finite graphs
inferredcites →https://doi.org/10.1016/s0764-4442(97)89093-3openalex-snapshot
Amenability, hyperfiniteness, and isoperimetric inequalities
inferredcites →https://doi.org/10.1017/s0143385798108180openalex-snapshot
Hausdorff dimension of the harmonic measure on trees
inferredcites →https://doi.org/10.1090/surv/101openalex-snapshot
Ergodic Theory via Joinings
inferredcites →https://doi.org/10.1109/focs.2009.77openalex-snapshot
Local Graph Partitions for Approximation and Testing
inferredcites →https://doi.org/10.1145/1993636.1993726openalex-snapshot
Every property of hyperfinite graphs is testable
inferredcites →https://doi.org/10.1214/ejp.v12-463openalex-snapshot
Processes on Unimodular Random Networks
inferredcites →https://doi.org/10.3934/era.2008.15.17openalex-snapshot
Hyperfinite graph limits
inferredcites →https://doi.org/10.48550/arxiv.1203.2346openalex-snapshot
Graphings and Unimodularity
inferredcites →https://doi.org/10.48550/arxiv.math/0505335openalex-snapshot
On limits of finite graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00039-014-0258-7openalex-snapshot
Limits of locally–globally convergent graph sequences
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/s10474-020-01065-yopenalex-snapshot
Hyperfinite graphings and combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s11854-016-0028-6openalex-snapshot
A Banach space-valued ergodic theorem for amenable groups and applications
inferred← citeshttps://doi.org/10.1007/s11856-023-2503-yopenalex-snapshot
Testability in group theory
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114056openalex-snapshot
Factor-of-iid Schreier decorations of lattices in Euclidean spaces
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2015.11.023openalex-snapshot
Convergence and limits of linear representations of finite groups
inferred← citeshttps://doi.org/10.1016/j.jfa.2018.01.004openalex-snapshot
Uniformly recurrent subgroups and simple C⁎-algebras
inferred← citeshttps://doi.org/10.1017/etds.2019.26openalex-snapshot
Weak containment of measure-preserving group actions
inferred← citeshttps://doi.org/10.1017/etds.2024.22openalex-snapshot
Approximate homomorphisms and sofic approximations of orbit equivalence relations
inferred← citeshttps://doi.org/10.1090/tran/8378openalex-snapshot
Uniform hyperfiniteness
inferred← citeshttps://doi.org/10.1090/tran/9186openalex-snapshot
One-ended spanning trees and definable combinatorics
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00037openalex-snapshot
Testability of relations between permutations
inferred← citeshttps://doi.org/10.1142/s0218196714500556openalex-snapshot
Convergence theorems for graph sequences
inferred← citeshttps://doi.org/10.1145/1993636.1993726openalex-snapshot
Every property of hyperfinite graphs is testable
inferred← citeshttps://doi.org/10.1215/00127094-2019-0024openalex-snapshot
Stability and invariant random subgroups
inferred← citeshttps://doi.org/10.4064/fm292-10-2023openalex-snapshot
Existentially closed measure-preserving actions of free groups
inferred← citeshttps://doi.org/10.48550/arxiv.1205.4356openalex-snapshot
Limits of local-global convergent graph sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1704.06019openalex-snapshot
Edge sliding and ergodic hyperfinite decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.1802.01908openalex-snapshot
Cantor combinatorics and almost finiteness
inferred← citeshttps://doi.org/10.48550/arxiv.1812.07511openalex-snapshot
Qualitative graph limit theory. Cantor Dynamical Systems and Constant-Time Distributed Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1908.10170openalex-snapshot
Learning Very Large Graphs with Unknown Vertex Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.2106.01988openalex-snapshot
Perfect matchings in hyperfinite graphings
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.