503 research outputs found
Module identification in bipartite and directed networks
Modularity is one of the most prominent properties of real-world complex
networks. Here, we address the issue of module identification in two important
classes of networks: bipartite networks and directed unipartite networks. Nodes
in bipartite networks are divided into two non-overlapping sets, and the links
must have one end node from each set. Directed unipartite networks only have
one type of nodes, but links have an origin and an end. We show that directed
unipartite networks can be conviniently represented as bipartite networks for
module identification purposes. We report a novel approach especially suited
for module detection in bipartite networks, and define a set of random networks
that enable us to validate the new approach
Modularity from Fluctuations in Random Graphs and Complex Networks
The mechanisms by which modularity emerges in complex networks are not well
understood but recent reports have suggested that modularity may arise from
evolutionary selection. We show that finding the modularity of a network is
analogous to finding the ground-state energy of a spin system. Moreover, we
demonstrate that, due to fluctuations, stochastic network models give rise to
modular networks. Specifically, we show both numerically and analytically that
random graphs and scale-free networks have modularity. We argue that this fact
must be taken into consideration to define statistically-significant modularity
in complex networks.Comment: 4 page
Robust Patterns in Food Web Structure
We analyze the properties of seven community food webs from a variety of
environments--including freshwater, marine-freshwater interfaces and
terrestrial environments. We uncover quantitative unifying patterns that
describe the properties of the diverse trophic webs considered and suggest that
statistical physics concepts such as scaling and universality may be useful in
the description of ecosystems. Specifically, we find that several quantities
characterizing these diverse food webs obey functional forms that are universal
across the different environments considered. The empirical results are in
remarkable agreement with the analytical solution of a recently proposed model
for food webs.Comment: 4 pages. Final version to appear in PR
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
Functional cartography of complex metabolic networks
High-throughput techniques are leading to an explosive growth in the size of
biological databases and creating the opportunity to revolutionize our
understanding of life and disease. Interpretation of these data remains,
however, a major scientific challenge. Here, we propose a methodology that
enables us to extract and display information contained in complex networks.
Specifically, we demonstrate that one can (i) find functional modules in
complex networks, and (ii) classify nodes into universal roles according to
their pattern of intra- and inter-module connections. The method thus yields a
``cartographic representation'' of complex networks. Metabolic networks are
among the most challenging biological networks and, arguably, the ones with
more potential for immediate applicability. We use our method to analyze the
metabolic networks of twelve organisms from three different super-kingdoms. We
find that, typically, 80% of the nodes are only connected to other nodes within
their respective modules, and that nodes with different roles are affected by
different evolutionary constraints and pressures. Remarkably, we find that
low-degree metabolites that connect different modules are more conserved than
hubs whose links are mostly within a single module.Comment: 17 pages, 4 figures. Go to http://amaral.northwestern.edu for the PDF
file of the reprin
Network-Based Models for Social Recommender Systems
With the overwhelming online products available in recent years, there is an increasing need to filter and deliver relevant personalized advice for users. Recommender systems solve this problem by modelling and predicting individual preferences for a great variety of items such as movies, books or research articles. In this chapter, we explore rigorous network-based models that outperform leading approaches for recommendation. The network models we consider are based on the explicit assumption that there are groups of individuals and of items, and that the preferences of an individual for an item are determined only by their group memberships. The accurate prediction of individual user preferences over items can be accomplished by different methodologies, such as Monte Carlo sampling or Expectation-Maximization methods, the latter resulting in a scalable algorithm which is suitable for large datasets
Communication and optimal hierarchical networks
We study a general and simple model for communication processes. In the
model, agents in a network (in particular, an organization) interchange
information packets following simple rules that take into account the limited
capability of the agents to deal with packets and the cost associated to the
existence of open communication channels. Due to the limitation in the
capability, the network collapses under certain conditions. We focus on when
the collapse occurs for hierarchical networks and also on the influence of the
flatness or steepness of the structure. We find that the need for hierarchy is
related to the existence of costly connections.Comment: 7 pages, 2 figures. NATO ARW on Econophysic
A new four-point probe design to measure conductivity in polymeric thin films
In the development of new conducting polymers applications,the conductivity measurement is still a challenge, specially for extremely thin samples as the ones obtained by CVD. This study shows the design of a novel four-point probe for conductivity characterization of polypirrole thin films synthesized by plasma enhanced polymerization.The system possesses the minimal distance possible among electrodes, together with a high ratio of electrode length to spacing to enhance the electrical response. The four-point probe has been fabricated in a printed circuit board, which offers some advantages such as non-damaging samples, low cost or repeatability in the analysis measurements
Signatures of currency vertices
Many real-world networks have broad degree distributions. For some systems,
this means that the functional significance of the vertices is also broadly
distributed, in other cases the vertices are equally significant, but in
different ways. One example of the latter case is metabolic networks, where the
high-degree vertices -- the currency metabolites -- supply the molecular groups
to the low-degree metabolites, and the latter are responsible for the
higher-order biological function, of vital importance to the organism. In this
paper, we propose a generalization of currency metabolites to currency
vertices. We investigate the network structural characteristics of such
systems, both in model networks and in some empirical systems. In addition to
metabolic networks, we find that a network of music collaborations and a
network of e-mail exchange could be described by a division of the vertices
into currency vertices and others.Comment: to appear in Journal of the Physical Society of Japa
- âŠ