arXiv (OAI Expanded)
open access
Equitable Partition Realizability for Dynamics-preserving and Privacy-aware Network Reconstruction
Degree-sequence realizability is the combinatorial basis of configuration models, but degree constraints alone do not ensure the preservation of graph dynamics. Hence, configuration models are unable to recover centrality measures, unless these are strongly correlated with the degree sequence. To ad
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
- The Hidden Topology of Network Entanglement#1144428
- Tensor renormalization group: local magnetizations, correlation functions, and phase diagrams of systems with quenched randomness#934935
- Privacy Preserving Gossip Learning#1084700
- Phase Transition and Fluctuation Results for First-Passage Percolation on Spread-Out Cycle Graphs#819581
- Phase Transition and Fluctuation Results for First-Passage Percolation on Spread-Out Cycle Graphs#809585
Record · ID 1122764
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