On the diameter of Kronecker graphs
Tomasz {\L}uczak, Justyna Tabor
TL;DR
This paper proves that for Kronecker graphs, once they are connected, their diameter is almost surely bounded by a constant, highlighting a fundamental property of their structure.
Contribution
The paper establishes that the diameter of connected Kronecker graphs is almost surely bounded by a constant, a new theoretical insight into their connectivity properties.
Findings
Connected Kronecker graphs have a constant upper bound on diameter.
Asymptotically almost surely, the diameter remains bounded once connected.
Provides a theoretical foundation for understanding the structure of Kronecker graphs.
Abstract
It is shown that a.a.s. as soon as a Kronecker graph becomes connected its diameter is bounded by a constant.
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.
Taxonomy
TopicsGraph theory and applications · Advanced Graph Theory Research · Limits and Structures in Graph Theory