Abstract
In this paper, we study how special patterns affect certain dynamic process on networks. The process we analyze is an iteration to generate a doubly-stochastic matrix consistent to the adjacent matrix of a network and the patterns can be described as h non-interconnected vertices only connect other g vertices (h>g). From the perspective of network structure, we prove that the necessary and sufficient condition when the iteration converges is that these patterns do not exist in the network. For BA networks, there is a phase transition. The diverge–converge transition point is that the average degree is about 8, which is theoretically proved. The existence of these patterns depends on two factors: first, higher moments of degree distribution of the network; second, the probability that vertices with degree 1 exist in the network. Simulation results also support our theory.
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 callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: 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.
