On the public citation graph

Partial Recovery of Erdðs-Rényi Graph Alignment via k-Core Alignment

0 signed · 42 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.20934openalex-snapshot
Seeded graph matching via large neighborhood statistics
inferredcites →https://doi.org/10.1007/bf02392023openalex-snapshot
Graphs on unlabelled nodes with a given number of edges
inferredcites →https://doi.org/10.1016/0012-365x(91)90162-uopenalex-snapshot
Size and connectivity of the k-core of a random graph
inferredcites →https://doi.org/10.1017/9781108616799.014openalex-snapshot
Statistical Problems with Planted Structures: Information-Theoretical and Computational Limits
inferredcites →https://doi.org/10.1038/npre.2009.4089.1openalex-snapshot
Topological network alignment uncovers biological function and phylogeny
inferredcites →https://doi.org/10.1073/pnas.0806627105openalex-snapshot
Global alignment of multiple protein interaction networks with application to functional orthology detection
inferredcites →https://doi.org/10.1093/bioinformatics/btv130openalex-snapshot
L-GRAAL: Lagrangian graphlet-based network aligner
inferredcites →https://doi.org/10.1098/rsif.2010.0063openalex-snapshot
Topological network alignment uncovers biological function and phylogeny
inferredcites →https://doi.org/10.1109/allerton.2013.6736720openalex-snapshot
A Bayesian method for matching two similar graphs without seeds
inferredcites →https://doi.org/10.1109/allerton.2015.7446983openalex-snapshot
When can two unlabeled networks be aligned under partial overlap?
inferredcites →https://doi.org/10.1109/icde.2008.4497505openalex-snapshot
TALE: A Tool for Approximate Large Graph Matching
inferredcites →https://doi.org/10.1109/isit.2018.8437567openalex-snapshot
Typicality Matching for Pairs of Correlated Graphs
inferredcites →https://doi.org/10.1109/isit.2018.8437908openalex-snapshot
Fundamental Limits of Database Alignment
inferredcites →https://doi.org/10.1109/tpami.2015.2424894openalex-snapshot
Graph Matching: Relax at Your Own Risk
inferredcites →https://doi.org/10.1145/1242572.1242598openalex-snapshot
Wherefore art thou r3579x?
inferredcites →https://doi.org/10.1145/2020408.2020596openalex-snapshot
On the privacy of anonymized networks
inferredcites →https://doi.org/10.1145/2512938.2512952openalex-snapshot
On the performance of percolation graph matching
inferredcites →https://doi.org/10.1145/2896377.2901460openalex-snapshot
Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
inferredcites →https://doi.org/10.1145/3139550.3139562openalex-snapshot
Blind De-anonymization Attacks using Social Networks
inferredcites →https://doi.org/10.14722/ndss.2015.23096openalex-snapshot
On Your Social Network De-anonymizablity: Quantification and Large Scale Evaluation with Seed Knowledge
inferredcites →https://doi.org/10.14778/2732269.2732274openalex-snapshot
An efficient reconciliation algorithm for social networks
inferredcites →https://doi.org/10.14778/2794367.2794371openalex-snapshot
Growing a graph matching from a handful of seeds
inferredcites →https://doi.org/10.48550/arxiv.1805.02349openalex-snapshot
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs

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.4794776openalex-extracted
On Seeded Subgraph-to-Subgraph Matching: The Sssgm Algorithm and Matchability Information Theory
inferred← citeshttps://doi.org/10.1007/s00440-020-00997-4openalex-snapshot
Efficient random graph matching via degree profiles
inferred← citeshttps://doi.org/10.1007/s00440-022-01184-3openalex-snapshot
Exact matching of random graphs with constant correlation
inferred← citeshttps://doi.org/10.1007/s41109-021-00398-zopenalex-snapshot
The phantom alignment strength conjecture: practical use of graph matching alignment strength to indicate a meaningful graph match
inferred← citeshttps://doi.org/10.1007/s41109-022-00464-0openalex-snapshot
Multiplex graph matching matched filters
inferred← citeshttps://doi.org/10.1080/10618600.2025.2544182openalex-snapshot
On Seeded Subgraph-to-Subgraph Matching: The ssSGM Algorithm and Matchability Information Theory
inferred← citeshttps://doi.org/10.1109/ieeeconf53345.2021.9723092openalex-snapshot
Network Recovery from Unlabeled Noisy Samples
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518130openalex-snapshot
On Graph Matching Using Generalized Seed Side-Information
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518266openalex-snapshot
Settling the Sharp Reconstruction Thresholds of Random Graph Matching
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195646openalex-snapshot
Detecting Correlation Between Multiple Unlabeled Gaussian Networks
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195705openalex-snapshot
Exact Random Graph Matching with Multiple Graphs
inferred← citeshttps://doi.org/10.1109/tit.2022.3169005openalex-snapshot
Settling the Sharp Reconstruction Thresholds of Random Graph Matching
inferred← citeshttps://doi.org/10.1109/tit.2025.3555187openalex-snapshot
Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation
inferred← citeshttps://doi.org/10.1109/tsp.2024.3382840openalex-snapshot
Blind Graph Matching Using Graph Signals
inferred← citeshttps://doi.org/10.1145/3564246.3585156openalex-snapshot
Random Graph Matching at Otter’s Threshold via Counting Chandeliers
inferred← citeshttps://doi.org/10.1214/22-aap1786openalex-snapshot
Testing correlation of unlabeled random graphs
inferred← citeshttps://doi.org/10.1214/23-aap2048openalex-snapshot
Statistical limits of correlation detection in trees
inferred← citeshttps://doi.org/10.1287/opre.2023.0574openalex-snapshot
Random Graph Matching at Otter’s Threshold via Counting Chandeliers
inferred← citeshttps://doi.org/10.1287/opre.2025.1808openalex-snapshot
Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery
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.