Font Size: a A A

Robustness Analysis And Community Detection Algorithm Of Interdependent Networks

Posted on:2022-01-16Degree:MasterType:Thesis
Country:ChinaCandidate:G H ChenFull Text:PDF
GTID:2480306335456674Subject:Mathematics
Abstract/Summary:PDF Full Text Request
Complex networks have a variety of network structures.with the development of social sciences,people gradually realize that a network structure of interdependent networks is very common in our lives,and has gradually become a popular research direction in the field of complex networks.At present,the research on interdependent networks is mainly focused on the robustness,while there is relatively little research on other aspects of interdependent networks,such as the field of community discovery.And among the many research methods of the robustness of interdependent networks,most of them do not consider the interdependent characteristics of interdependent networks.The following studies have been carried out in this paper for these problems:This article does an in-depth studying and analysis on the robustness of interdependent networks.Based on the load-capacity model,we put forward a new way to compute the load of points in interdependent networks.We construct many types interdependent networks and use them with the load-capacity model.The results of study show that under the load-capacity model,the robustness curves of different load impact parameters will intersect near an approximate "convergence point" with the increase of tolerance parameters;The connection of height and height degree nodes and the connection of high and high intermediate nodes has the highest robustness.And the robustness of interdependent networks has a process from high to low with the increase of tolerance parameters.In our article,we put forward a community detection algorithm to suitable for interdependent networks.It calculates the node importance through the Leader Rank and base on the COPRA.The studying results show that this algorithm has a better performance than COPRA and CPM on interdependent networks.And it is more stable than COPRA.Relative to CPM,it has lower time and space complexity and is more practical on the big networks.For embodying the application ability of this algorithm,we constructs an Area?Culture interdependent network about Yunnan Province.And we make a community detection research on this network,which has divided several important area community and folk culture community.It can helps people to see the distribution of ethnic in Yunnan.And we can construct a new type of tourism and cultural zone by the result.The research on the robustness of interdependent networks is helpful for people to build interdependent networks with stronger anti-destruction ability,which has important research value.Through the research on the community discovery of the interdependent network,it can help people to find the important community structure in networks,which has important practical means.The research in this paper is general and can be extended to different types of dependent networks,including simulation networks and real networks.
Keywords/Search Tags:Interdependent networks, Robustness, Load-Capacity model, Community discovery, Ethnic minority
PDF Full Text Request
Related items