499,702 research outputs found
Higher-Order Aggregate Networks in the Analysis of Temporal Networks: Path structures and centralities
Recent research on temporal networks has highlighted the limitations of a
static network perspective for our understanding of complex systems with
dynamic topologies. In particular, recent works have shown that i) the specific
order in which links occur in real-world temporal networks affects causality
structures and thus the evolution of dynamical processes, and ii) higher-order
aggregate representations of temporal networks can be used to analytically
study the effect of these order correlations on dynamical processes. In this
article we analyze the effect of order correlations on path-based centrality
measures in real-world temporal networks. Analyzing temporal equivalents of
betweenness, closeness and reach centrality in six empirical temporal networks,
we first show that an analysis of the commonly used static, time-aggregated
representation can give misleading results about the actual importance of
nodes. We further study higher-order time-aggregated networks, a recently
proposed generalization of the commonly applied static, time-aggregated
representation of temporal networks. Here, we particularly define path-based
centrality measures based on second-order aggregate networks, empirically
validating that node centralities calculated in this way better capture the
true temporal centralities of nodes than node centralities calculated based on
the commonly used static (first-order) representation. Apart from providing a
simple and practical method for the approximation of path-based centralities in
temporal networks, our results highlight interesting perspectives for the use
of higher-order aggregate networks in the analysis of time-stamped network
data.Comment: 27 pages, 13 figures, 3 table
Shortest path routing algorithm for hierarchical interconnection network-on-chip
Interconnection networks play a significant role in efficient on-chip communication for multicore systems. This paper introduces a new interconnection topology called the Hierarchical Cross Connected Recursive network (HCCR) and a shortest path routing algorithm for the HCCR. Proposed topology offers a high degree of regularity, scalability, and symmetry with a reduced number of links and node degree. A unique address encoding scheme is proposed for hierarchical graphical representation of HCCR networks, and based on this scheme a shortest path routing algorithm is devised. The algorithm requires 5(k-1) time where k=logn4-2 and k>0, in worst case to determine the next node along the shortest path
On the Efficiency of Data Representation on the Modeling and Characterization of Complex Networks
Specific choices about how to represent complex networks can have a
substantial effect on the execution time required for the respective
construction and analysis of those structures. In this work we report a
comparison of the effects of representing complex networks statically as
matrices or dynamically as spase structures. Three theoretical models of
complex networks are considered: two types of Erdos-Renyi as well as the
Barabasi-Albert model. We investigated the effect of the different
representations with respect to the construction and measurement of several
topological properties (i.e. degree, clustering coefficient, shortest path
length, and betweenness centrality). We found that different forms of
representation generally have a substantial effect on the execution time, with
the sparse representation frequently resulting in remarkably superior
performance
A Dependency-Based Neural Network for Relation Classification
Previous research on relation classification has verified the effectiveness
of using dependency shortest paths or subtrees. In this paper, we further
explore how to make full use of the combination of these dependency
information. We first propose a new structure, termed augmented dependency path
(ADP), which is composed of the shortest dependency path between two entities
and the subtrees attached to the shortest path. To exploit the semantic
representation behind the ADP structure, we develop dependency-based neural
networks (DepNN): a recursive neural network designed to model the subtrees,
and a convolutional neural network to capture the most important features on
the shortest path. Experiments on the SemEval-2010 dataset show that our
proposed method achieves state-of-art results.Comment: This preprint is the full version of a short paper accepted in the
annual meeting of the Association for Computational Linguistics (ACL) 2015
(Beijing, China
Symbolic Exact Inference for Discrete Probabilistic Programs
The computational burden of probabilistic inference remains a hurdle for
applying probabilistic programming languages to practical problems of interest.
In this work, we provide a semantic and algorithmic foundation for efficient
exact inference on discrete-valued finite-domain imperative probabilistic
programs. We leverage and generalize efficient inference procedures for
Bayesian networks, which exploit the structure of the network to decompose the
inference task, thereby avoiding full path enumeration. To do this, we first
compile probabilistic programs to a symbolic representation. Then we adapt
techniques from the probabilistic logic programming and artificial intelligence
communities in order to perform inference on the symbolic representation. We
formalize our approach, prove it sound, and experimentally validate it against
existing exact and approximate inference techniques. We show that our inference
approach is competitive with inference procedures specialized for Bayesian
networks, thereby expanding the class of probabilistic programs that can be
practically analyzed
- …