Gonality of Random Graphs
Andrew Deveau, David Jensen, Jenna Kainic, Dan Mitropolsky
TL;DR
This paper demonstrates that in large random graphs, the average gonality closely approximates the total number of vertices, revealing a fundamental property of their algebraic structure.
Contribution
It establishes the asymptotic behavior of gonality in random graphs, providing new insights into their algebraic and combinatorial properties.
Findings
Expected gonality is asymptotic to the number of vertices
Gonality provides a measure of algebraic complexity in graphs
Results apply to large classes of random graphs
Abstract
We show that the expected gonality of a random graph is asymptotic to the number of vertices.
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.