Abstract
We propose a criterion for the stability of network-structured systems, which counts the number of paths between all the pairs of distinct nodes in the random network. In order to estimate the criterion we introduce a Monte Carlo algorithm. Some numerical experiments are presented to show the performance of our criterion.
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.
