Further Properties of Random Threshold Graphs
Christopher Ross
TL;DR
This paper extends previous research on random threshold graphs by analyzing additional properties such as matching number, degeneracy, and longest cycle length, using adapted techniques from earlier studies.
Contribution
It introduces new methods to determine the distribution of various graph properties in random threshold graphs, expanding understanding beyond earlier focus areas.
Findings
Distribution of matching number derived
Degeneracy levels characterized
Longest cycle length distribution established
Abstract
In 2009, two different groups independently explored the behavior of random threshold graphs. Here, we extend their techniques to find the distribution of other properties, including matching number, degeneracy, and length of the longest cycle.
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 · Stochastic processes and statistical mechanics · Complex Network Analysis Techniques