arXiv (All)
open access
On maximum likelihood estimation in the $β$-model for random hypergraphs
We study maximum likelihood estimation in the $β$-model for random hypergraphs, in which a group of vertices succeeds with a probability that depends on the sum of its members' parameters. The data are independent binary outcomes of experiments on groups of vertices, tested according to an arbitrary
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
- Random independent sets in uncrowded hypergraphs#1218499
- Poisson occupancy of paths on permuted regular graphs#1325620
- First-Passage Percolation on Spread-out line graphs: Microscopic Regime#821967
- $β$-Skewed Maximal Spanning Forests#999526
- Maximum Strong Independent Sets in Hypergraphs: Reductions, Bounds, and Greedy Certificates#1011663
Record · ID 1457597
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