arXiv (All)
open access
Random bipartite graphs with i.i.d. weights and applications to inhomogeneous random intersection graphs
We propose a random bipartite graph with weights assigned to both parts of the vertex sets. Edges are formed independently with probabilities that depend on these weights. This bipartite graph naturally gives rise to a random intersection graph which has nontrivial clustering properties and inhomoge
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
- Smooth Partial Lotteries for Stable Randomized Selection#204785
- A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem#670289
- A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem#668224
- Bounded Independence Edge Subsampling in Graphs#347579
- A Faster Auction Algorithm for Weighted Matroid Intersection#1155855
Record · ID 1130446
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