Search results for "Clustering coefficient"
showing 6 items of 16 documents
Simulated poaching affects global connectivity and efficiency in social networks of African savanna elephants-An exemplar of how human disturbance im…
2022
Selective harvest, such as poaching, impacts group-living animals directly through mortality of individuals with desirable traits, and indirectly by altering the structure of their social networks. Understanding the relationship between disturbance-induced, structural network changes and group performance in wild animals remains an outstanding problem. To address this problem, we evaluated the immediate effect of disturbance on group sociality in African savanna elephants—an example, group-living species threatened by poaching. Drawing on static association data from ten free-ranging groups, we constructed one empirically based, population-wide network and 100 virtual networks; performed a …
Effect of Topological Structure and Coupling Strength in Weighted Multiplex Networks
2018
Algebraic connectivity (second smallest eigenvalue of the supra-Laplacian matrix of the underlying multilayer network) and inter-layer coupling strength play an important role in the diffusion processes on the multiplex networks. In this work, we study the effect of inter-layer coupling strength, topological structure on algebraic connectivity in weighted multiplex networks. The results show a remarkable transition in the value of algebraic connectivity from classical cases where the inter-layer coupling strength is homogeneous. We investigate various topological structures in multiplex networks using configuration model, the Barabasi-Albert model (BA) and empirical data-set of multiplex ne…
Correlations among Game of Thieves and other centrality measures in complex networks
2021
Social Network Analysis (SNA) is used to study the exchange of resources among individuals, groups, or organizations. The role of individuals or connections in a network is described by a set of centrality metrics which represent one of the most important results of SNA. Degree, closeness, betweenness and clustering coefficient are the most used centrality measures. Their use is, however, severely hampered by their computation cost. This issue can be overcome by an algorithm called Game of Thieves (GoT). Thanks to this new algorithm, we can compute the importance of all elements in a network (i.e. vertices and edges), compared to the total number of vertices. This calculation is done not in…
Graph Clustering with Local Density-Cut
2018
In this paper, we introduce a new graph clustering algorithm, called Dcut. The basic idea is to envision the graph clustering as a local density-cut problem. To identify meaningful communities in a graph, a density-connected tree is first constructed in a local fashion. Building upon the local intuitive density-connected tree, Dcut allows partitioning a graph into multiple densely tight-knit clusters effectively and efficiently. We have demonstrated that our method has several attractive benefits: (a) Dcut provides an intuitive criterion to evaluate the goodness of a graph clustering in a more precise way; (b) Building upon the density-connected tree, Dcut allows identifying high-quality cl…
Robust Synchronization-Based Graph Clustering
2013
Complex graph data now arises in various fields like social networks, protein-protein interaction networks, ecosystems, etc. To reveal the underlying patterns in graphs, an important task is to partition them into several meaningful clusters. The question is: how can we find the natural partitions of a complex graph which truly reflect the intrinsic patterns? In this paper, we propose RSGC, a novel approach to graph clustering. The key philosophy of RSGC is to consider graph clustering as a dynamic process towards synchronization. For each vertex, it is viewed as an oscillator and interacts with other vertices according to the graph connection information. During the process towards synchro…
Correlation Analysis of Node and Edge Centrality Measures in Artificial Complex Networks
2021
The role of an actor in a social network is identified through a set of measures called centrality. Degree centrality, betweenness centrality, closeness centrality, and clustering coefficient are the most frequently used metrics to compute the node centrality. Their computational complexity in some cases makes unfeasible, when not practically impossible, their computations. For this reason, we focused on two alternative measures, WERW-Kpath and Game of Thieves, which are at the same time highly descriptive and computationally affordable. Our experiments show that a strong correlation exists between WERW-Kpath and Game of Thieves and the classical centrality measures. This may suggest the po…