14,178 research outputs found
Evolutionary Algorithms for Community Detection in Continental-Scale High-Voltage Transmission Grids
Symmetry is a key concept in the study of power systems, not only because the admittance and Jacobian matrices used in power flow analysis are symmetrical, but because some previous studies have shown that in some real-world power grids there are complex symmetries. In order to investigate the topological characteristics of power grids, this paper proposes the use of evolutionary algorithms for community detection using modularity density measures on networks representing supergrids in order to discover densely connected structures. Two evolutionary approaches (generational genetic algorithm, GGA+, and modularity and improved genetic algorithm, MIGA) were applied. The results obtained in two large networks representing supergrids (European grid and North American grid) provide insights on both the structure of the supergrid and the topological differences between different regions. Numerical and graphical results show how these evolutionary approaches clearly outperform to the well-known Louvain modularity method. In particular, the average value of modularity obtained by GGA+ in the European grid was 0.815, while an average of 0.827 was reached in the North American grid. These results outperform those obtained by MIGA and Louvain methods (0.801 and 0.766 in the European grid and 0.813 and 0.798 in the North American grid, respectively)
Link Prediction in Complex Networks: A Survey
Link prediction in complex networks has attracted increasing attention from
both physical and computer science communities. The algorithms can be used to
extract missing information, identify spurious interactions, evaluate network
evolving mechanisms, and so on. This article summaries recent progress about
link prediction algorithms, emphasizing on the contributions from physical
perspectives and approaches, such as the random-walk-based methods and the
maximum likelihood methods. We also introduce three typical applications:
reconstruction of networks, evaluation of network evolving mechanism and
classification of partially labelled networks. Finally, we introduce some
applications and outline future challenges of link prediction algorithms.Comment: 44 pages, 5 figure
Hierarchical mutual information for the comparison of hierarchical community structures in complex networks
The quest for a quantitative characterization of community and modular
structure of complex networks produced a variety of methods and algorithms to
classify different networks. However, it is not clear if such methods provide
consistent, robust and meaningful results when considering hierarchies as a
whole. Part of the problem is the lack of a similarity measure for the
comparison of hierarchical community structures. In this work we give a
contribution by introducing the {\it hierarchical mutual information}, which is
a generalization of the traditional mutual information, and allows to compare
hierarchical partitions and hierarchical community structures. The {\it
normalized} version of the hierarchical mutual information should behave
analogously to the traditional normalized mutual information. Here, the correct
behavior of the hierarchical mutual information is corroborated on an extensive
battery of numerical experiments. The experiments are performed on artificial
hierarchies, and on the hierarchical community structure of artificial and
empirical networks. Furthermore, the experiments illustrate some of the
practical applications of the hierarchical mutual information. Namely, the
comparison of different community detection methods, and the study of the
consistency, robustness and temporal evolution of the hierarchical modular
structure of networks.Comment: 14 pages and 12 figure
Defining and identifying communities in networks
The investigation of community structures in networks is an important issue
in many domains and disciplines. This problem is relevant for social tasks
(objective analysis of relationships on the web), biological inquiries
(functional studies in metabolic, cellular or protein networks) or
technological problems (optimization of large infrastructures). Several types
of algorithm exist for revealing the community structure in networks, but a
general and quantitative definition of community is still lacking, leading to
an intrinsic difficulty in the interpretation of the results of the algorithms
without any additional non-topological information. In this paper we face this
problem by introducing two quantitative definitions of community and by showing
how they are implemented in practice in the existing algorithms. In this way
the algorithms for the identification of the community structure become fully
self-contained. Furthermore, we propose a new local algorithm to detect
communities which outperforms the existing algorithms with respect to the
computational cost, keeping the same level of reliability. The new algorithm is
tested on artificial and real-world graphs. In particular we show the
application of the new algorithm to a network of scientific collaborations,
which, for its size, can not be attacked with the usual methods. This new class
of local algorithms could open the way to applications to large-scale
technological and biological applications.Comment: Revtex, final form, 14 pages, 6 figure
A graph-based mathematical morphology reader
This survey paper aims at providing a "literary" anthology of mathematical
morphology on graphs. It describes in the English language many ideas stemming
from a large number of different papers, hence providing a unified view of an
active and diverse field of research
Complex Networks Unveiling Spatial Patterns in Turbulence
Numerical and experimental turbulence simulations are nowadays reaching the
size of the so-called big data, thus requiring refined investigative tools for
appropriate statistical analyses and data mining. We present a new approach
based on the complex network theory, offering a powerful framework to explore
complex systems with a huge number of interacting elements. Although interest
on complex networks has been increasing in the last years, few recent studies
have been applied to turbulence. We propose an investigation starting from a
two-point correlation for the kinetic energy of a forced isotropic field
numerically solved. Among all the metrics analyzed, the degree centrality is
the most significant, suggesting the formation of spatial patterns which
coherently move with similar vorticity over the large eddy turnover time scale.
Pattern size can be quantified through a newly-introduced parameter (i.e.,
average physical distance) and varies from small to intermediate scales. The
network analysis allows a systematic identification of different spatial
regions, providing new insights into the spatial characterization of turbulent
flows. Based on present findings, the application to highly inhomogeneous flows
seems promising and deserves additional future investigation.Comment: 12 pages, 7 figures, 3 table
- …