arXiv (All)
open access
Degree Sequence Reconstruction from Subgraph Traces
The goal of degree sequence reconstruction is to recover the ordered vector of degrees of an unknown graph from vertex deleted traces, where each vertex is deleted independently with probability $p$. We provide two algorithms for reconstruction; the first uses rejection sampling to reduce the proble
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles#923083
- Tensor-network Monte Carlo approach based on time-evolving block decimation#1000413
- An Automated Graph Theory Framework for Reconstructing Missing Data in Stormwater Networks#278361
- RObust Header Compression (ROHC): Terminology and Channel Mapping Examples#141950
- Do Deep Ensembles Actually Capture Uncertainty in Graph Neural Networks?#216853
Record · ID 987150
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive