Abstract
We examine the relationship of a graph _G_ and its random subgraphs, which are defined by independently choosing each edge with probability _p_. Suppose that _G_ has a spectral gap λ (in terms of its normalized Laplacian) and minimum degree _d_<sub>min</sub>. Then we can show that a random subgraph of _G_ on _n_ vertices with edge-selection probability _p_ almost surely has as its spectral gap <inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="uinm_a_10129296_o_ilf0001.gif"></inline-graphic>.
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.
