scholarly journals Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing

2021 ◽  
Vol 36 (1) ◽  
pp. 16-33
Author(s):  
Chao Gao ◽  
Zongming Ma
2021 ◽  
Vol 2 (1) ◽  
pp. 113-139
Author(s):  
Dimitrios Tsiotas ◽  
Thomas Krabokoukis ◽  
Serafeim Polyzos

Within the context that tourism-seasonality is a composite phenomenon described by temporal, geographical, and socio-economic aspects, this article develops a multilevel method for studying time patterns of tourism-seasonality in conjunction with its spatial dimension and socio-economic dimension. The study aims to classify the temporal patterns of seasonality into regional groups and to configure distinguishable seasonal profiles facilitating tourism policy and development. The study applies a multilevel pattern recognition approach incorporating time-series assessment, correlation, and complex network analysis based on community detection with the use of the modularity optimization algorithm, on data of overnight-stays recorded for the time-period 1998–2018. The analysis reveals four groups of seasonality, which are described by distinct seasonal, geographical, and socio-economic profiles. Overall, the analysis supports multidisciplinary and synthetic research in the modeling of tourism research and promotes complex network analysis in the study of socio-economic systems, by providing insights into the physical conceptualization that the community detection based on the modularity optimization algorithm can enjoy to the real-world applications.


2018 ◽  
Vol 29 (01) ◽  
pp. 1850003 ◽  
Author(s):  
Chuang Liu ◽  
Linan Fan ◽  
Zhou Liu ◽  
Xiang Dai ◽  
Jiamei Xu ◽  
...  

Community detection in complex networks is a key problem of network analysis. In this paper, a new membrane algorithm is proposed to solve the community detection in complex networks. The proposed algorithm is based on membrane systems, which consists of objects, reaction rules, and a membrane structure. Each object represents a candidate partition of a complex network, and the quality of objects is evaluated according to network modularity. The reaction rules include evolutionary rules and communication rules. Evolutionary rules are responsible for improving the quality of objects, which employ the differential evolutionary algorithm to evolve objects. Communication rules implement the information exchanged among membranes. Finally, the proposed algorithm is evaluated on synthetic, real-world networks with real partitions known and the large-scaled networks with real partitions unknown. The experimental results indicate the superior performance of the proposed algorithm in comparison with other experimental algorithms.


2021 ◽  
Vol 30 (4) ◽  
pp. 441-455
Author(s):  
Rinat Aynulin ◽  
◽  
Pavel Chebotarev ◽  
◽  

Proximity measures on graphs are extensively used for solving various problems in network analysis, including community detection. Previous studies have considered proximity measures mainly for networks without attributes. However, attribute information, node attributes in particular, allows a more in-depth exploration of the network structure. This paper extends the definition of a number of proximity measures to the case of attributed networks. To take node attributes into account, attribute similarity is embedded into the adjacency matrix. Obtained attribute-aware proximity measures are numerically studied in the context of community detection in real-world networks.


Author(s):  
Nicole Belinda Dillen ◽  
Aruna Chakraborty

One of the most important aspects of social network analysis is community detection, which is used to categorize related individuals in a social network into groups or communities. The approach is quite similar to graph partitioning, and in fact, most detection algorithms rely on concepts from graph theory and sociology. The aim of this chapter is to aid a novice in the field of community detection by providing a wider perspective on some of the different detection algorithms available, including the more recent developments in this field. Five popular algorithms have been studied and explained, and a recent novel approach that was proposed by the authors has also been included. The chapter concludes by highlighting areas suitable for further research, specifically targeting overlapping community detection algorithms.


2020 ◽  
Vol 512 ◽  
pp. 1360-1371 ◽  
Author(s):  
Zhishan Dong ◽  
Shuangshuang Wang ◽  
Qun Liu

2020 ◽  
Vol 113 ◽  
pp. 25-40
Author(s):  
J. Fumanal-Idocin ◽  
A. Alonso-Betanzos ◽  
O. Cordón ◽  
H. Bustince ◽  
M. Minárová

2015 ◽  
Vol 29 (33) ◽  
pp. 1550215 ◽  
Author(s):  
Zhengyou Xia ◽  
Xiangying Gao ◽  
Xia Zhang

In complex network analysis, the local community detection problem is getting more and more attention. Because of the difficulty to get complete information of the network, such as the World Wide Web, the local community detection has been proposed by researcher. That is, we can detect a community from a certain source vertex with limited knowledge of an entire graph. The previous methods of local community detection now are more or less inadequate in some places. In this paper, we have proposed a new local modularity metric [Formula: see text] and based on it, a two-phase algorithm is proposed. The method we have taken is a greedy addition algorithm which means adding vertices into the community until [Formula: see text] does not increase. Compared with the previous methods, when our method is calculating the modularity metric, the range of vertices what we considered may affect the quality of the community detection wider. The results of experiments show that whether in computer-generated random graph or in the real networks, our method can effectively solve the problem of the local community detection.


2019 ◽  
Vol 47 (4) ◽  
pp. 1893-1927 ◽  
Author(s):  
Sivaraman Balakrishnan ◽  
Larry Wasserman

Sign in / Sign up

Export Citation Format

Share Document