scholarly journals COVID-19 and Networks

Author(s):  
Tsuyoshi Murata

AbstractOngoing COVID-19 pandemic poses many challenges to the research of artificial intelligence. Epidemics are important in network science for modeling disease spread over networks of contacts between individuals. To prevent disease spread, it is desirable to introduce prioritized isolation of the individuals contacting many and unspecified others, or connecting different groups. Finding such influential individuals in social networks, and simulating the speed and extent of the disease spread are what we need for combating COVID-19. This article focuses on the following topics, and discusses some of the traditional and emerging research attempts: (1) topics related to epidemics in network science, such as epidemic modeling, influence maximization and temporal networks, (2) recent research of network science for COVID-19 and (3) datasets and resources for COVID-19 research.

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-14 ◽  
Author(s):  
Xiaodong Liu ◽  
Xiangke Liao ◽  
Shanshan Li ◽  
Si Zheng ◽  
Bin Lin ◽  
...  

Influence maximization problem aims to identify the most influential individuals so as to help in developing effective viral marketing strategies over social networks. Previous studies mainly focus on designing efficient algorithms or heuristics on a static social network. As a matter of fact, real-world social networks keep evolving over time and a recalculation upon the changed network inevitably leads to a long running time. In this paper, we propose an incremental approach, IncInf, which can efficiently locate the top-K influential individuals in evolving social networks based on previous information instead of calculation from scratch. In particular, IncInf quantitatively analyzes the influence spread changes of nodes by localizing the impact of topology evolution to only local regions, and a pruning strategy is further proposed to narrow the search space into nodes experiencing major increases or with high degrees. To evaluate the efficiency and effectiveness, we carried out extensive experiments on real-world dynamic social networks: Facebook, NetHEPT, and Flickr. Experimental results demonstrate that, compared with the state-of-the-art static algorithm, IncInf achieves remarkable speedup in execution time while maintaining matching performance in terms of influence spread.


Author(s):  
Zachary P. Neal

The first law of geography holds that everything is related to everything else, but near things are more related than distant things, where distance refers to topographical space. If a first law of network science exists, it would similarly hold that everything is related to everything else, but near things are more related than distant things, but where distance refers to topological space. Frequently these two laws collide, together holding that everything is related to everything else, but topographically and topologically near things are more related than topographically and topologically distant things. The focus of the spatial study of social networks lies in exploring a series of questions embedded in this combined law of geography and networks. This chapter explores the questions that have been asked and the answers that have been offered at the intersection of geography and networks.


2021 ◽  
Author(s):  
Wei Wang ◽  
Haili Yang ◽  
Yuanfu Lu ◽  
Yuanhang Zou ◽  
Xu Zhang ◽  
...  

Computing ◽  
2021 ◽  
Author(s):  
Zahra Aghaee ◽  
Mohammad Mahdi Ghasemi ◽  
Hamid Ahmadi Beni ◽  
Asgarali Bouyer ◽  
Afsaneh Fatemi

Sign in / Sign up

Export Citation Format

Share Document