On the public citation graph

Anatomy of the giant component: The strictly supercritical regime

https://doi.org/10.1016/j.ejc.2013.06.004

0 signed · 60 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.20342openalex-snapshot

Anatomy of a young giant component in the random graph

inferredcites →https://doi.org/10.1002/rsa.3240010305openalex-snapshot

Component behavior near the critical point of the random graph process

inferredcites →https://doi.org/10.1002/rsa.3240020405openalex-snapshot

Cycles in a random graph near the critical point

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/j.jctb.2004.09.005openalex-snapshot

Counting connected graphs inside-out

inferredcites →https://doi.org/10.1016/s0195-6698(80)80030-8openalex-snapshot

A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs

inferredcites →https://doi.org/10.1016/s0246-0203(98)80003-4openalex-snapshot

Tree-valued Markov chains derived from Galton-Watson processes

inferredcites →https://doi.org/10.1017/cbo9780511721335openalex-snapshot

Surveys in Combinatorics, 1999

inferredcites →https://doi.org/10.1017/cbo9780511721335.010openalex-snapshot

Models of Random Regular Graphs

inferredcites →https://doi.org/10.1017/s0963548310000301openalex-snapshot

Diameters in Supercritical Random Graphs Via First Passage Percolation

inferredcites →https://doi.org/10.1017/s0963548310000325openalex-snapshot

The Diameter of Sparse Random Graphs

inferredcites →https://doi.org/10.1090/s0002-9947-1984-0756039-5openalex-snapshot

The evolution of random graphs

inferredcites →https://doi.org/10.1090/s0002-9947-1994-1138950-5openalex-snapshot

The structure of a random graph at the point of the phase transition

inferredcites →https://doi.org/10.1112/blms/24.2.205openalex-snapshot

PROBABILITY: THEORY AND EXAMPLES

inferredcites →https://doi.org/10.11429/emath1996.2007.autumn-meeting1_104openalex-snapshot

Poisson Cloning Model for Random Graphs

inferredcites →https://doi.org/10.1214/11-aop647openalex-snapshot

Mixing time of near-critical random graphs

inferredcites →https://doi.org/10.1214/aop/1024404421openalex-snapshot

Brownian excursions, critical random graphs and the multiplicative coalescent

inferredcites →https://doi.org/10.1214/aop/1176989404openalex-snapshot

The Continuum Random Tree III

inferredcites →https://doi.org/10.1214/aop/1176990534openalex-snapshot

The Continuum Random Tree. I

inferredcites →https://doi.org/10.1214/ejp.v15-772openalex-snapshot

Critical Random Graphs: Limiting Constructions and Distributional Properties

inferredcites →https://doi.org/10.2307/1999405openalex-snapshot

The Evolution of Random Graphs

inferredcites →https://doi.org/10.2307/2290301openalex-snapshot

Probability: Theory and Examples.

inferredcites →https://doi.org/10.48550/arxiv.0808.1599openalex-snapshot

Finding cores of random 2-SAT formulae via Poisson cloning

inferredcites →https://doi.org/10.5486/pmd.1959.6.3-4.12openalex-snapshot

On random graphs. I.

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.4273484openalex-extracted

Heavy and Light Paths and Hamilton Cycles

inferred← citeshttps://doi.org/10.1002/jgt.23081openalex-snapshot

A note on the width of sparse random graphs

inferred← citeshttps://doi.org/10.1002/rsa.20573openalex-snapshot

Cover time of a random graph with a degree sequence II: Allowing vertices of degree two

inferred← citeshttps://doi.org/10.1002/rsa.20680openalex-snapshot

Finding paths in sparse random graphs requires many queries

inferred← citeshttps://doi.org/10.1002/rsa.20751openalex-snapshot

On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments

inferred← citeshttps://doi.org/10.1002/rsa.20878openalex-snapshot

Limiting shape of the depth first search tree in an Erdős‐Rényi graph

inferred← citeshttps://doi.org/10.1002/rsa.20903openalex-snapshot

Asymptotics in percolation on high‐girth expanders

inferred← citeshttps://doi.org/10.1002/rsa.21067openalex-snapshot

Cycle lengths in sparse random graphs

inferred← citeshttps://doi.org/10.1002/rsa.21107openalex-snapshot

Voter models on subcritical scale‐free random graphs

inferred← citeshttps://doi.org/10.1002/rsa.21225openalex-snapshot

Expansion in supercritical random subgraphs of expanders and its consequences

inferred← citeshttps://doi.org/10.1002/rsa.70022openalex-snapshot

Packing Paths in Sparse Random Graphs

inferred← citeshttps://doi.org/10.1007/978-3-032-21908-4_6openalex-snapshot

Random Walks, Mixing Times

inferred← citeshttps://doi.org/10.1007/s00493-024-00089-0openalex-snapshot

Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs

inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104184openalex-snapshot

Giant rainbow trees in sparse random graphs

inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106396openalex-snapshot

Heavy and light paths and Hamilton cycles

inferred← citeshttps://doi.org/10.1017/nws.2021.17openalex-snapshot

Large Very Dense Subgraphs in a Stream of Edges

inferred← citeshttps://doi.org/10.1093/jrsssa/qnad066openalex-snapshot

From Delaunay triangulation to topological data analysis: generation of more realistic synthetic power grid networks

inferred← citeshttps://doi.org/10.1109/tr.2024.3410526openalex-snapshot

A Novel Links Fault Tolerant Analysis: $g$-Good $r$-Component Edge-Connectivity of Interconnection Networks With Applications to Hypercubes

inferred← citeshttps://doi.org/10.1137/17m1128721openalex-snapshot

Finding and Using Expanders in Locally Sparse Graphs

inferred← citeshttps://doi.org/10.1137/22m1544373openalex-snapshot

Discursive Voter Models on the Supercritical Scale-Free Network

inferred← citeshttps://doi.org/10.1145/3717823.3718173openalex-snapshot

Smoothed Analysis for Graph Isomorphism

inferred← citeshttps://doi.org/10.1155/2018/8983218openalex-snapshot

The Maximal Length of 2-Path in Random Critical Graphs

inferred← citeshttps://doi.org/10.1184/r1/6477176openalex-snapshot

Cover time of a random graph with a degree sequence II: Allowing vertices of degree two

inferred← citeshttps://doi.org/10.1214/17-aop1189openalex-snapshot

Random walks on the random graph

inferred← citeshttps://doi.org/10.1214/20-aihp1057openalex-snapshot

Cutoff for random walk on dynamical Erdős–Rényi graph

inferred← citeshttps://doi.org/10.1214/22-aop1592openalex-snapshot

Expansion in supercritical random subgraphs of the hypercube and its consequences

inferred← citeshttps://doi.org/10.1214/23-ejp920openalex-snapshot

Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs

inferred← citeshttps://doi.org/10.1214/24-ejp1091openalex-snapshot

Speeding up random walk mixing by starting from a uniform vertex

inferred← citeshttps://doi.org/10.1214/25-aap2146openalex-snapshot

Average-case and smoothed analysis of graph isomorphism

inferred← citeshttps://doi.org/10.17863/cam.10807openalex-snapshot

RANDOM WALKS ON THE RANDOM GRAPH

inferred← citeshttps://doi.org/10.17863/cam.60147openalex-snapshot

Cutoff for random walk on dynamical Erdős–Rényi graph

inferred← citeshttps://doi.org/10.3390/math11153299openalex-snapshot

Influence Maximization Dynamics and Topological Order on Erdös-Rényi Networks

inferred← citeshttps://doi.org/10.48550/arxiv.1704.00465openalex-snapshot

Finding and using expanders in locally sparse graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1911.13187openalex-snapshot

Voter models on subcritical inhomogeneous random graphs

inferred← citeshttps://doi.org/10.48550/arxiv.2102.10975openalex-snapshot

Anatomy of a gaussian giant: supercritical level-sets of the free field on random regular graphs

inferred← citeshttps://doi.org/10.70675/54d2cf08z5a68z4273zbe91zffe8274feea4openalex-snapshot

Graphes aléatoires peu denses : de spécifications locales vers des phénomènes globaux

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.