Abstract
We give a new derivation of the threshold of appearance of the $k$-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on random functions, and the pairing or configuration model for random graphs with given degree sequence. Our approach also gives a simple derivation of properties of the degree sequence of the $k$-core of a random graph, in particular its relation to multinomial and hence independent Poisson variables. The method is also applied to $d$-uniform hypergraphs.
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.
