On the public citation graph

Inside the critical window for cohomology of random k -complexes

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.
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/9781118032718.scardopenalex-snapshot
Wiley‐Interscience Series in Discrete Mathematics and Optimization
inferredcites →https://doi.org/10.1002/rsa.20238openalex-snapshot
Homological connectivity of random k ‐dimensional complexes
inferredcites →https://doi.org/10.1002/rsa.20270openalex-snapshot
Clique percolation
inferredcites →https://doi.org/10.1007/s00454-012-9483-8openalex-snapshot
Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes
inferredcites →https://doi.org/10.1007/s00493-006-0027-9openalex-snapshot
Homological Connectivity Of Random 2-Complexes
inferredcites →https://doi.org/10.1016/0097-3165(78)90059-6openalex-snapshot
The asymptotic number of labeled graphs with given degree sequences
inferredcites →https://doi.org/10.1016/0304-3975(78)90009-9openalex-snapshot
The expected linearity of a simple equivalence algorithm
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1090/s0002-9939-2010-10596-8openalex-snapshot
The threshold function for vanishing of the top homology group of random 𝑑-complexes
inferredcites →https://doi.org/10.1090/s0894-0347-2010-00677-7openalex-snapshot
The fundamental group of random 2-complexes
inferredcites →https://doi.org/10.1137/1114052openalex-snapshot
Combinatorial Algebra and Random Graphs
inferredcites →https://doi.org/10.1137/1115004openalex-snapshot
On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.20697openalex-snapshot
On the vanishing of homology in random Čech complexes
inferred← citeshttps://doi.org/10.1002/rsa.20857openalex-snapshot
Vanishing of cohomology groups of random simplicial complexes
inferred← citeshttps://doi.org/10.1002/rsa.21036openalex-snapshot
Algebraic and combinatorial expansion in random simplicial complexes
inferred← citeshttps://doi.org/10.1007/978-3-030-91374-8_2openalex-snapshot
Random Simplicial Complexes: Models and Phenomena
inferred← citeshttps://doi.org/10.1007/s00440-022-01149-6openalex-snapshot
Homological connectivity in random Čech complexes
inferred← citeshttps://doi.org/10.1007/s00454-017-9938-zopenalex-snapshot
Integral Homology of Random Simplicial Complexes
inferred← citeshttps://doi.org/10.1007/s00493-025-00142-6openalex-snapshot
Bounds on the Mod 2 Homology of Random 2-Dimensional Determinantal Hypertrees
inferred← citeshttps://doi.org/10.1007/s41468-023-00161-6openalex-snapshot
Large deviation principle for persistence diagrams of random cubical filtrations
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.11.001openalex-snapshot
Forcing large tight components in 3-graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.049openalex-snapshot
Homological connectedness of random hypergraphs
inferred← citeshttps://doi.org/10.1017/jpr.2022.39openalex-snapshot
Limit theory for U-statistics under geometric and topological constraints with rare events
inferred← citeshttps://doi.org/10.1090/proc/16196openalex-snapshot
The integer homology threshold in 𝑌_{𝑑}(𝑛,𝑝)
inferred← citeshttps://doi.org/10.1090/tran/8255openalex-snapshot
Minimum weight disk triangulations and fillings
inferred← citeshttps://doi.org/10.1112/tlms/tlv001openalex-snapshot
Fundamental groups of clique complexes of random graphs
inferred← citeshttps://doi.org/10.1137/18m1221527openalex-snapshot
Subcritical Random Hypergraphs, High-Order Components, and Hypertrees
inferred← citeshttps://doi.org/10.1142/s0218216522500158openalex-snapshot
Maps on random hypergraphs and random simplicial complexes
inferred← citeshttps://doi.org/10.1142/s021821652350075xopenalex-snapshot
Random hypergraphs, random simplicial complexes and their Künneth-type formulae
inferred← citeshttps://doi.org/10.1214/19-aihp1020openalex-snapshot
Thresholds for vanishing of ‘Isolated’ faces in random Čech and Vietoris–Rips complexes
inferred← citeshttps://doi.org/10.1214/22-aap1800openalex-snapshot
Convergence of persistence diagram in the sparse regime
inferred← citeshttps://doi.org/10.37236/10607openalex-snapshot
Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes
inferred← citeshttps://doi.org/10.48550/arxiv.1604.00842openalex-snapshot
Homological connectivity of random hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1802.08224openalex-snapshot
Thresholds for vanishing of `Isolated' faces in random Čech and Vietoris-Rips complexes
inferred← citeshttps://doi.org/10.48550/arxiv.1810.08107openalex-snapshot
Subcritical random hypergraphs, high-order components, and hypertrees
inferred← citeshttps://doi.org/10.48550/arxiv.2001.01933openalex-snapshot
Random Uniform and Pure Random Simplicial Complexes
inferred← citeshttps://doi.org/10.48550/arxiv.2009.06559openalex-snapshot
A probabilistic approach to exhaustion in the infinite-genus case
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.