Abstract
We explore the scaling properties for graph connectivity in random threshold graphs. In the many node limit, we provide a complete characterization for the existence and type of the underlying zero-one laws, and identify the corresponding critical scalings. These results are consequences of well-known facts in Extreme Value Theory concerning the asymptotic behavior of running maxima on i.i.d. random variables. In the important special case of exponentially distributed fitness, we show that the (essentially unique) critical scaling which ensures a power-law degree distribution, does not result in graph connectivity in the asymptotically almost sure (a.a.s.) sense.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
