a Department of Modern Physics, University of Science and Technology of China, Hefei 230026, China;
b College of Physics and Electronic Information Engineering, Wenzhou University, Wenzhou 325035, China;
c School of Science, Southwest University of Science and Technology, Mianyang 621010, China
Abstract As a classical model of statistical physics, the percolation theory provides a powerful approach to analyze the network structure and dynamics. Recently, to model the relations among interacting agents beyond the connection of the networked system, the concept of dependence link is proposed to represent the dependence relationship of agents. These studies suggest that the percolation properties of these networks differ greatly from those of the ordinary networks. In particular, unlike the well known continuous transition on the ordinary networks, the percolation transitions on these networks are discontinuous. Moreover, these networks are more fragile for a broader degree distribution, which is opposite to the famous results for the ordinary networks. In this article, we give a summary of the theoretical approaches to study the percolation process on networks with inter- and inner-dependence links, and review the recent advances in this field, focusing on the topology and robustness of such networks.
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.