Weighted kshell degree neighborhood: A new method for identifying the influential spreaders from a variety of complex network connectivity structures

2020 ◽  
Vol 139 ◽  
pp. 112859 ◽  
Author(s):  
Amrita Namtirtha ◽  
Animesh Dutta ◽  
Biswanath Dutta
Author(s):  
Ф.Х. НАХЛИ ◽  
А.И. ПАРАМОНОВ

Анализируется фрактальная размерность (ФР) сети связи и ее использование для исследования и планирования сетей связи. Рассматривается применение метода «выращивания кластера» для оценки ФР и предлагается новый метод определения ФР сети, основанный на оценивании связности сети путем поиска кратчайших путей. Показано, что оценка ФР сети является дополнительной характеристикой, отражающей топологические свойства сети. Дается сравнительный анализ предложенного метода и «выращивания кластера». Полученные результаты позволяют выбрать метод и получить оценки ФР сети в зависимости от ее особенностей. The paper analyzes the fractal dimension of the network and its use for telecommunication networks research and planning. The analysis of the "cluster growing" method for assessing the fractal dimension is given and a new method for assessing the fractal dimensionof anetwork is proposed, based onassessing the network connectivity by finding the shortest paths. The article shows that the assessment of the fractal dimension of the network is an additional characteristic that reflects the topological properties of the network. Comparative analysis of the proposed method and "cluster growing" is given. The results obtained make it possible to select a method and obtain estimates of the fractal dimension of the network, depending on its features.


2020 ◽  
Vol 12 (15) ◽  
pp. 6110
Author(s):  
Dongdong Feng ◽  
Lin Cheng ◽  
Mingyang Du

As a green and sustainable travel mode, the bikeshare plays an important role in solving the “last-mile” problem. The new dockless bikeshare system (DBS) is widely favored by travelers, and the traditional docked bikeshare system (BS) is affected to a certain extent, but the specific circumstances of this impact are not yet known. To fill the knowledge gap, the objective of this study is to measure the impacts of DBS on London cycle hire, which is a type of BS. In this study, the travel data of 707 docking stations in two periods, i.e., March 2018 and March 2017, are included. A spatial-temporal analysis is first conducted to investigate the mobility pattern changes. A complex network analysis is then developed to explore the impact of DBS on network connectivity. The results suggest a significant decrease of 64% in the average trip amounts, with both origins and destinations in the affected area, and the trips with short and medium duration and short and medium distances are mainly replaced by DBS. DBS also has a considerable impact on the structure and properties of the mobility network. The connectivity and interaction strength between stations decrease after DBS appears. We also concluded that the observed changes are heterogeneously distributed in space, especially on weekends. The applied spatial-temporal analysis and complex network analysis provide a better understanding of the relationships between DBS and BS.


2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Jianlin Jia ◽  
Yanyan Chen ◽  
Ning Chen ◽  
Hui Yao ◽  
Yongxing Li ◽  
...  

In the bus network, key bus station failure can interrupt transfer lines, which leads to the low effectiveness of the whole network, especially during peak hours. Thus, identifying key stations in the bus network before the emergency occurs has a great significance to improve the response speed. In this paper, we proposed a new method considering station hybrid influence and passenger flow to identify key stations in the whole bus network. This method aims to measure the influence of bus stations while combining the topological structure of the bus network and dynamic bus stations passenger flow. The influence of bus stations was calculated based on the local structure of the network, which refines from finding the shortest paths with high computational complexity. To evaluate the performance of the method, we used the efficiency of the network and vehicle average speed at the station to examine the accuracy. The results show that the new method can rank the influence of bus stations more accurately and more efficiently than other complex network methods such as degree, H-index, and betweenness. On this basis, the key stations of the bus network of Beijing in China are identified out and the distribution characteristics of the key bus stations are analyzed.


Author(s):  
Munawar Hussain ◽  
Awais Akram

Introduction: Regarding complex network, to find optimal communities in the network has become a key topic in the field of network theory. It is crucial to understand the Structure and functionality of associated networks. In this paper, we propose a new method of community detection that works on the structural similarity of a network (SSN). Method: This method works in two steps, at the first step, it removes edges between the different groups of nodes which are not very similar to each other. As a result of edge removal, the network is divided into many small random communities, which are referred as main communities. Result: In the second step, we apply the evaluation method (EM), it chooses the best quality communities, from all main communities which already produced at the first step. At last, we apply evaluation metrics to our proposed method and benchmarking methods, which show that the SSN method can detect comparatively more accurate results than other methods in this paper. Conclusion: In this article, we proposed a novel method for community detection in networks, called structural similarity of network (SSN). It works in two steps. In the first step, it randomly removes low similarity edges from the network, which makes several small disconnected communities, called as main communities. Afterward, the main communities are merged to search for the final communities, which are near to actual existing communities of the network. Discussion: This approach is defined on the base of the unweighted network, so in Further research it could be used on weighted networks and can explore some new deep-down attributes. Furthermore, it will be used Facebook and twitter weighted data with the artificial intelligence approach.


2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Yong-Sheng Qian ◽  
Min Wang ◽  
Hong-Xia Kang ◽  
Jun-Wei Zeng ◽  
Yu-Fei Liu

Based on the research progress in related fields and the distribution characteristics of road networks in valley cities, the complex network model of a city road network is established to study its connectivity reliability. Taking Lanzhou as the example, several parameters of the complex network abstracted from the road network are calculated and the practical meanings of them are described, respectively. On this basis, through computing the global efficiency and the relative size of the largest connecting subgraph under intentional attacks and random attacks, respectively, the curves of the above two parameters varying with the attacking times are drawn. The detailed investigation of connectivity reliability of Lanzhou road network is done by analyzing the curves’ tendency. Finally, we find that the network of a valley city has a poor connection and has a lot of dead ends. Besides, the average length of the roads is very long and the holistic connectivity reliability is at a lower level; these are suitable to the group-type distribution of valley city’s road network, and the connectivity reliability of the road network is stronger under random attacks than that under intentional attacks.


Sign in / Sign up

Export Citation Format

Share Document