Koc University Digital Collections
metadata only
Density of a random interval catch digraph family and its use for testing uniformity
We consider (arc) density of a parameterized interval catch digraph (ICD) family with random vertices residing on the real line. The ICDs are random digraphs where randomness lies in the vertices and are defined with two parameters, a centrality parameter and an expansion parameter, hence they will
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
- Classification of imbalanced data with a geometric digraph family#934703
- Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs#628834
- Hardness of Sampling in Random Constraint Satisfaction Problems#350556
- The Borel Distinguishing Number of Schreier Graphs#1084902
- $c$-Packedness versus $λ$-Low-Density in Geometric Graphs: Theory and Practice#1063442
Record · ID 934979
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