ISTA Publications
metadata only
Monotonicity and decompositions of random regular graphs
In this work we establish several monotonicity and decomposition results in the framework of random regular graphs. Among other results, we show that, for a wide range of parameters d1 ≤ d2, there exists a coupling of G(n,d1) and G(n,d2) satisfying that G(n,d1) ⊆ G(n,d2) with high probability, confi
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
- Poisson occupancy of paths on permuted regular graphs#1325620
- Tight Bounds for Tusnády's Problem in the Plane#1217865
- Extremes of the zero-average Gaussian Free Field on random regular graphs#1201944
- On maximum likelihood estimation in the $β$-model for random hypergraphs#1457597
- Optimal detection of geometry in random graphs and kernel matrices at critical thresholds#1326522
Record · ID 1500875
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