6 research outputs found
Exploring the randomness of Directed Acyclic Networks
The feed-forward relationship naturally observed in time-dependent processes
and in a diverse number of real systems -such as some food-webs and electronic
and neural wiring- can be described in terms of so-called directed acyclic
graphs (DAGs). An important ingredient of the analysis of such networks is a
proper comparison of their observed architecture against an ensemble of
randomized graphs, thereby quantifying the {\em randomness} of the real systems
with respect to suitable null models. This approximation is particularly
relevant when the finite size and/or large connectivity of real systems make
inadequate a comparison with the predictions obtained from the so-called {\em
configuration model}. In this paper we analyze four methods of DAG
randomization as defined by the desired combination of topological invariants
(directed and undirected degree sequence and component distributions) aimed to
be preserved. A highly ordered DAG, called \textit{snake}-graph and a
Erd\:os-R\'enyi DAG were used to validate the performance of the algorithms.
Finally, three real case studies, namely, the \textit{C. elegans} cell lineage
network, a PhD student-advisor network and the Milgram's citation network were
analyzed using each randomization method. Results show how the interpretation
of degree-degree relations in DAGs respect to their randomized ensembles depend
on the topological invariants imposed. In general, real DAGs provide disordered
values, lower than the expected by chance when the directedness of the links is
not preserved in the randomization process. Conversely, if the direction of the
links is conserved throughout the randomization process, disorder indicators
are close to the obtained from the null-model ensemble, although some
deviations are observed.Comment: 13 pages, 5 figures and 5 table
Global network structure of dominance hierarchy of ant workers
Dominance hierarchy among animals is widespread in various species and
believed to serve to regulate resource allocation within an animal group.
Unlike small groups, however, detection and quantification of linear hierarchy
in large groups of animals are a difficult task. Here, we analyse
aggression-based dominance hierarchies formed by worker ants in Diacamma sp. as
large directed networks. We show that the observed dominance networks are
perfect or approximate directed acyclic graphs, which are consistent with
perfect linear hierarchy. The observed networks are also sparse and random but
significantly different from networks generated through thinning of the perfect
linear tournament (i.e., all individuals are linearly ranked and dominance
relationship exists between every pair of individuals). These results pertain
to global structure of the networks, which contrasts with the previous studies
inspecting frequencies of different types of triads. In addition, the
distribution of the out-degree (i.e., number of workers that the focal worker
attacks), not in-degree (i.e., number of workers that attack the focal worker),
of each observed network is right-skewed. Those having excessively large
out-degrees are located near the top, but not the top, of the hierarchy. We
also discuss evolutionary implications of the discovered properties of
dominance networks.Comment: 5 figures, 2 tables, 4 supplementary figures, 2 supplementary table
Extreme robustness of scaling in sample space reducing processes explains Zipf's law in diffusion on directed networks
It has been shown recently that a specific class of path-dependent stochastic
processes, which reduce their sample space as they unfold, lead to exact
scaling laws in frequency and rank distributions. Such Sample Space Reducing
processes (SSRP) offer an alternative new mechanism to understand the emergence
of scaling in countless processes. The corresponding power law exponents were
shown to be related to noise levels in the process. Here we show that the
emergence of scaling is not limited to the simplest SSRPs, but holds for a huge
domain of stochastic processes that are characterized by non-uniform prior
distributions. We demonstrate mathematically that in the absence of noise the
scaling exponents converge to (Zipf's law) for almost all prior
distributions. As a consequence it becomes possible to fully understand
targeted diffusion on weighted directed networks and its associated scaling
laws law in node visit distributions. The presence of cycles can be properly
interpreted as playing the same role as noise in SSRPs and, accordingly,
determine the scaling exponents. The result that Zipf's law emerges as a
generic feature of diffusion on networks, regardless of its details, and that
the exponent of visiting times is related to the amount of cycles in a network
could be relevant for a series of applications in traffic-, transport- and
supply chain management.Comment: 11 pages, 5 figure
Mapping hybrid functional-structural connectivity traits in the human connectome
One of the crucial questions in neuroscience is how a rich functional
repertoire of brain states relates to its underlying structural organization.
How to study the associations between these structural and functional layers is
an open problem that involves novel conceptual ways of tackling this question.
We here propose an extension of the Connectivity Independent Component Analysis
(connICA) framework, to identify joint structural-functional connectivity
traits. Here, we extend connICA to integrate structural and functional
connectomes by merging them into common hybrid connectivity patterns that
represent the connectivity fingerprint of a subject. We test this extended
approach on the 100 unrelated subjects from the Human Connectome Project. The
method is able to extract main independent structural-functional connectivity
patterns from the entire cohort that are sensitive to the realization of
different tasks. The hybrid connICA extracted two main task-sensitive hybrid
traits. The first, encompassing the within and between connections of dorsal
attentional and visual areas, as well as fronto-parietal circuits. The second,
mainly encompassing the connectivity between visual, attentional, DMN and
subcortical networks. Overall, these findings confirms the potential ofthe
hybrid connICA for the compression of structural/functional connectomes into
integrated patterns from a set of individual brain networks.Comment: article: 34 pages, 4 figures; supplementary material: 5 pages, 5
figure