arXiv (All)
open access
Asymptotic normality of embedding distributions of some families of graphs
Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are often the normal distribution. We establish the asymptotic no
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
- Explicit Bounds on the Entropy of Piecewise Hölder Graphon Models#1247466
- A Finite-Entropy Criterion for the Entropic Conditional Central Limit Theorem#799769
- Central Limit Theorems for Sample Fréchet Means of Manifold-Valued Markov Chains#1049002
- Hyperedge approximation for stochastic processes on higher-order networks.#449989
- Sharp Thresholds for Distance Patterns in Random Subsets of $\mathbb Z^d$#1130864
Record · ID 1201897
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