arXiv (All)
open access
Random Schreier graphs as expanders
Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a bipartite graph of degree $d$). This construction is much s
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
- Tests of graph homogeneity, subgraph counts, and quasirandomness#822606
- Weisfeiler-Lehman subtree encoding for Bayesian optimization of atomic configurations#820947
- Structural Entropy-Driven Graph Diffusion Generation for One-Shot Federated Graph Learning#974071
- Colorful Exponential Random Graph Models#819150
- Colorful Exponential Random Graph Models#809158
Record · ID 984010
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