Abstract
AbstractDerényi, Palla and Vicsek introduced the following dependent percolation model, in the context of finding communities in networks. Starting with a random graph Ggenerated by some rule, form an auxiliary graph G′ whose vertices are the k‐cliques of G, in which two vertices are joined if the corresponding cliques share k – 1 vertices. They considered in particular the case where G = G(n,p), and found heuristically the threshold function p = p(n) above which a giant component appears in G′. Here we give a rigorous proof of this result, as well as many extensions. The model turns out to be very interesting due to the essential global dependence present in G′. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009
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.
