19,702 research outputs found
Size reduction of complex networks preserving modularity
The ubiquity of modular structure in real-world complex networks is being the
focus of attention in many trials to understand the interplay between network
topology and functionality. The best approaches to the identification of
modular structure are based on the optimization of a quality function known as
modularity. However this optimization is a hard task provided that the
computational complexity of the problem is in the NP-hard class. Here we
propose an exact method for reducing the size of weighted (directed and
undirected) complex networks while maintaining invariant its modularity. This
size reduction allows the heuristic algorithms that optimize modularity for a
better exploration of the modularity landscape. We compare the modularity
obtained in several real complex-networks by using the Extremal Optimization
algorithm, before and after the size reduction, showing the improvement
obtained. We speculate that the proposed analytical size reduction could be
extended to an exact coarse graining of the network in the scope of real-space
renormalization.Comment: 14 pages, 2 figure
Randomized Algorithms for the Loop Cutset Problem
We show how to find a minimum weight loop cutset in a Bayesian network with
high probability. Finding such a loop cutset is the first step in the method of
conditioning for inference. Our randomized algorithm for finding a loop cutset
outputs a minimum loop cutset after O(c 6^k kn) steps with probability at least
1 - (1 - 1/(6^k))^c6^k, where c > 1 is a constant specified by the user, k is
the minimal size of a minimum weight loop cutset, and n is the number of
vertices. We also show empirically that a variant of this algorithm often finds
a loop cutset that is closer to the minimum weight loop cutset than the ones
found by the best deterministic algorithms known
Local structure of directed networks
Previous work on undirected small-world networks established the paradigm
that locally structured networks tend to have high density of short loops. On
the other hand, many realistic networks are directed. Here we investigate the
local organization of directed networks and find, surprisingly, that real
networks often have very few short loops as compared to random models. We
develop a theory and derive conditions for determining if a given network has
more or less loops than its randomized counterpart. These findings carry broad
implications for structural and dynamical processes sustained by directed
networks
Unevenness of Loop Location in Complex Networks
The loop structure plays an important role in many aspects of complex
networks and attracts much attention. Among the previous works, Bianconi et al
find that real networks often have fewer short loops as compared to random
models. In this paper, we focus on the uneven location of loops which makes
some parts of the network rich while some other parts sparse in loops. We
propose a node removing process to analyze the unevenness and find rich loop
cores can exist in many real networks such as neural networks and food web
networks. Finally, an index is presented to quantify the unevenness of loop
location in complex networks.Comment: 7 pages, 6 figure
- …