Degree distribution of an inhomogeneous random intersection graph
Mindaugas Bloznelis, Julius Damarackas
TL;DR
This paper determines the asymptotic degree distribution of a typical vertex in a sparse inhomogeneous random intersection graph, providing insights into its structural properties.
Contribution
It introduces a method to analyze the degree distribution in inhomogeneous random intersection graphs, extending previous models to more general settings.
Findings
Asymptotic degree distribution characterized
Applicable to a wide class of inhomogeneous graphs
Provides theoretical foundation for network analysis
Abstract
We show the asymptotic degree distribution of the typical vertex of a sparse inhomogeneous random intersection graph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.