Abstract
The natural connectivity as a robustness measure of complex network has been proposed recently. It can be regarded as the average eigenvalue obtained from the graph spectrum. In this paper, we introduce an inhomogeneous random graph model, G(n, {ci}, {pi}), and investigate its natural connectivity. Binomial random graph ... . Simulations are performed to validate our theoretical results.
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.
