Fast Uncovering of Graph Communities on a Chip: Toward Scalable Community Detection on Multicore and Manycore Platforms

2016 ◽  
Vol 10 (3) ◽  
pp. 145-247 ◽  
Author(s):  
Ananth Kalyanaraman ◽  
Mahantesh Halappanavar ◽  
Daniel Chavarría-Miranda ◽  
Hao Lu ◽  
Karthi Duraisamy
Keyword(s):  
Community Detection

Fast Uncovering of Graph Communities on a Chip: Toward Scalable Community Detection on Multicore and Manycore Platforms

2016 ◽  
Author(s):  
Ananth Kalyanaraman ◽  
Mahantesh Halappanavar ◽  
Daniel Chavarría-Miranda ◽  
Hao Lu ◽  
Karthi Duraisamy
Keyword(s):  
Community Detection

Networks

2018 ◽  
Author(s):  
Stefan Thurner ◽  
Rudolf Hanel ◽  
Peter Klimekl
Keyword(s):  
Complex Systems ◽  
Complex Networks ◽  
Phase Diagrams ◽  
Community Detection ◽  
Network Science ◽  
Small World ◽  
Small World Networks ◽  
Multilayer Networks ◽  
Basic Vocabulary

Understanding the interactions between the components of a system is key to understanding it. In complex systems, interactions are usually not uniform, not isotropic and not homogeneous: each interaction can be specific between elements.Networks are a tool for keeping track of who is interacting with whom, at what strength, when, and in what way. Networks are essential for understanding of the co-evolution and phase diagrams of complex systems. Here we provide a self-contained introduction to the field of network science. We introduce ways of representing and handle networks mathematically and introduce the basic vocabulary and definitions. The notions of random- and complex networks are reviewed as well as the notions of small world networks, simple preferentially grown networks, community detection, and generalized multilayer networks.

scholarly journals Optimization Algorithms for Detection of Social Interactions

Algorithms ◽  
2020 ◽  
Vol 13 (6) ◽  
pp. 139 ◽  
Author(s):  
Vincenzo Cutello ◽  
Georgia Fargetta ◽  
Mario Pavone ◽  
Rocco A. Scollo
Keyword(s):  
Social Networks ◽  
Local Search ◽  
Social Interactions ◽  
Community Detection ◽  
Experimental Analysis ◽  
Search Strategy ◽  
Random Search ◽  
Optimization Methods ◽  
Research Areas ◽  
Greedy Optimization

Community detection is one of the most challenging and interesting problems in many research areas. Being able to detect highly linked communities in a network can lead to many benefits, such as understanding relationships between entities or interactions between biological genes, for instance. Two different immunological algorithms have been designed for this problem, called Opt-IA and Hybrid-IA, respectively. The main difference between the two algorithms is the search strategy and related immunological operators developed: the first carries out a random search together with purely stochastic operators; the last one is instead based on a deterministic Local Search that tries to refine and improve the current solutions discovered. The robustness of Opt-IA and Hybrid-IA has been assessed on several real social networks. These same networks have also been considered for comparing both algorithms with other seven different metaheuristics and the well-known greedy optimization Louvain algorithm. The experimental analysis conducted proves that Opt-IA and Hybrid-IA are reliable optimization methods for community detection, outperforming all compared algorithms.

scholarly journals Approaching the Optimal Solution of the Maximal α-quasi-clique Local Community Problem

Electronics ◽  
2020 ◽  
Vol 9 (9) ◽  
pp. 1438
Author(s):  
Patricia Conde-Cespedes
Keyword(s):  
Graph Theory ◽  
Community Detection ◽  
Local Community ◽  
Optimal Solution ◽  
Local Communities ◽  
Optimal Value ◽  
Interesting Task ◽  
Local Community Detection ◽  
Networks Analysis ◽  
Node Problem

Complex networks analysis (CNA) has attracted so much attention in the last few years. An interesting task in CNA complex network analysis is community detection. In this paper, we focus on Local Community Detection, which is the problem of detecting the community of a given node of interest in the whole network. Moreover, we study the problem of finding local communities of high density, known as α-quasi-cliques in graph theory (for high values of α in the interval ]0,1[). Unfortunately, the higher α is, the smaller the communities become. This led to the maximal α-quasi-clique community of a given node problem, which is, the problem of finding local communities that are α-quasi-cliques of maximal size. This problem is NP-hard, then, to approach the optimal solution, some heuristics exist. When α is high (>0.5) the diameter of a maximal α-quasi-clique is at most 2. Based on this property, we propose an algorithm to calculate an upper bound to approach the optimal solution. We evaluate our method in real networks and conclude that, in most cases, the bound is very accurate. Furthermore, for a real small network, the optimal value is exactly achieved in more than 80% of cases.

scholarly journals Modelling community structure and temporal spreading on complex networks

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Vesa Kuikka
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Network Structure ◽  
Network Connectivity ◽  
Network Models ◽  
Building Blocks ◽  
Detection Algorithm ◽  
Research Area ◽  
Detection Methods

AbstractWe present methods for analysing hierarchical and overlapping community structure and spreading phenomena on complex networks. Different models can be developed for describing static connectivity or dynamical processes on a network topology. In this study, classical network connectivity and influence spreading models are used as examples for network models. Analysis of results is based on a probability matrix describing interactions between all pairs of nodes in the network. One popular research area has been detecting communities and their structure in complex networks. The community detection method of this study is based on optimising a quality function calculated from the probability matrix. The same method is proposed for detecting underlying groups of nodes that are building blocks of different sub-communities in the network structure. We present different quantitative measures for comparing and ranking solutions of the community detection algorithm. These measures describe properties of sub-communities: strength of a community, probability of formation and robustness of composition. The main contribution of this study is proposing a common methodology for analysing network structure and dynamics on complex networks. We illustrate the community detection methods with two small network topologies. In the case of network spreading models, time development of spreading in the network can be studied. Two different temporal spreading distributions demonstrate the methods with three real-world social networks of different sizes. The Poisson distribution describes a random response time and the e-mail forwarding distribution describes a process of receiving and forwarding messages.

Sign in / Sign up

Export Citation Format

Share Document