On the public citation graph

Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph

https://doi.org/10.1017/s0021900200009402
0 signed · 16 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/jgt.3190140210openalex-snapshot
The phase transition in the evolution of random digraphs
inferredcites →https://doi.org/10.1002/rsa.20168openalex-snapshot
The phase transition in inhomogeneous random graphs
inferredcites →https://doi.org/10.1002/rsa.20283openalex-snapshot
The critical behavior of random digraphs
inferredcites →https://doi.org/10.1002/rsa.3240010106openalex-snapshot
The transitive closure of a random digraph
inferredcites →https://doi.org/10.1002/rsa.v31:1openalex-snapshot
inferredcites →https://doi.org/10.1017/cbo9780511546594openalex-snapshot
Random Graph Dynamics
inferredcites →https://doi.org/10.1017/s0001867800024976openalex-snapshot
Giant components in three-parameter random directed graphs
inferredcites →https://doi.org/10.1017/s096354830400611xopenalex-snapshot
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
inferredcites →https://doi.org/10.1103/physreve.64.025101openalex-snapshot
Giant strongly connected component of directed networks
inferredcites →https://doi.org/10.1103/physreve.64.026118openalex-snapshot
Random graphs with arbitrary degree distributions and their applications
inferredcites →https://doi.org/10.1103/physreve.66.066121openalex-snapshot
General formalism for inhomogeneous random graphs
inferredcites →https://doi.org/10.1103/revmodphys.74.47openalex-snapshot
Statistical mechanics of complex 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.2518840openalex-extracted
Inhomogeneous Financial Networks and Contagious Links
inferred← citeshttps://doi.org/10.1017/jpr.2015.8openalex-snapshot
The strong giant in a random digraph
inferred← citeshttps://doi.org/10.1137/140996045openalex-snapshot
Lengths of Attractors and Transients in Neuronal Networks with Random Connectivities
inferred← citeshttps://doi.org/10.1287/opre.2016.1540openalex-snapshot
Inhomogeneous Financial Networks and Contagious Links
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.