Triangles and subgraph probabilities in random regular graphs
Pu Gao
TL;DR
This paper enhances the estimation of subgraph probabilities in random regular graphs and refines the understanding of the distribution of triangles within these graphs.
Contribution
It provides improved bounds on subgraph probabilities and advances the limiting distribution analysis of triangles in random regular graphs.
Findings
More accurate subgraph probability estimates
Refined limiting distribution for triangle counts
Enhanced theoretical understanding of random regular graphs
Abstract
We improve the estimates of the subgraph probabilities in a random regular graph. Using the improved results, we further improve the limiting distribution of the number of triangles in random regular graphs.
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
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Finite Group Theory Research