36,291 research outputs found
A variant of the current flow betweenness centrality and its application in urban networks
The current flow betweenness centrality is a useful tool to estimate traffic status in spatial networks and, in general, to measure the intermediation of nodes in networks where the transition between them takes place in a random way. The main drawback of this centrality is its high computational cost, especially for very large networks, as it is the case of urban networks. In this paper, a new approach to the current flow betweenness centrality for its practical application in urban networks with data is presented and discussed. The new centrality measure allows the estimation of pedestrian flow developed in urban networks, taking into account both the network topology and its associated data. In addition, its computational cost makes it suitable for application in networks with a large number of nodes. Some examples are studied in order to better understand the characteristics and behaviour of the proposed centrality in the context of the city.Partially supported by the Spanish Government, Ministerio de EconomÃa y Competividad, grant number TIN2017-84821-P
SAKE: Estimating Katz Centrality Based on Sampling for Large-Scale Social Networks
Katz centrality is a fundamental concept to measure the influence of a vertex in a social network. However, existing approaches to calculating Katz centrality in a large-scale network are unpractical and computationally expensive. In this article, we propose a novel method to estimate Katz centrality based on graph sampling techniques, which object to achieve comparable estimation accuracy of the state-of-the-arts with much lower computational complexity. Specifically, we develop a Horvitz–Thompson estimate for Katz centrality by using a multi-round sampling approach and deriving an unbiased mean value estimator. We further propose SAKE, a Sampling-based Algorithm for fast Katz centrality Estimation. We prove that the estimator calculated by SAKE is probabilistically guaranteed to be within an additive error from the exact value. Extensive evaluation experiments based on four real-world networks show that the proposed algorithm can estimate Katz centralities for partial vertices with low sampling rate, low computation time, and it works well in identifying high influence vertices in social networks
Graph Energies of Egocentric Networks and Their Correlation with Vertex Centrality Measures
Graph energy is the energy of the matrix representation of the graph, where
the energy of a matrix is the sum of singular values of the matrix. Depending
on the definition of a matrix, one can contemplate graph energy, Randi\'c
energy, Laplacian energy, distance energy, and many others. Although
theoretical properties of various graph energies have been investigated in the
past in the areas of mathematics, chemistry, physics, or graph theory, these
explorations have been limited to relatively small graphs representing chemical
compounds or theoretical graph classes with strictly defined properties. In
this paper we investigate the usefulness of the concept of graph energy in the
context of large, complex networks. We show that when graph energies are
applied to local egocentric networks, the values of these energies correlate
strongly with vertex centrality measures. In particular, for some generative
network models graph energies tend to correlate strongly with the betweenness
and the eigencentrality of vertices. As the exact computation of these
centrality measures is expensive and requires global processing of a network,
our research opens the possibility of devising efficient algorithms for the
estimation of these centrality measures based only on local information
Tackling information asymmetry in networks: a new entropy-based ranking index
Information is a valuable asset for agents in socio-economic systems, a
significant part of the information being entailed into the very network of
connections between agents. The different interlinkages patterns that agents
establish may, in fact, lead to asymmetries in the knowledge of the network
structure; since this entails a different ability of quantifying relevant
systemic properties (e.g. the risk of financial contagion in a network of
liabilities), agents capable of providing a better estimate of (otherwise)
unaccessible network properties, ultimately have a competitive advantage. In
this paper, we address for the first time the issue of quantifying the
information asymmetry arising from the network topology. To this aim, we define
a novel index - InfoRank - intended to measure the quality of the information
possessed by each node, computing the Shannon entropy of the ensemble
conditioned on the node-specific information. Further, we test the performance
of our novel ranking procedure in terms of the reconstruction accuracy of the
(unaccessible) network structure and show that it outperforms other popular
centrality measures in identifying the "most informative" nodes. Finally, we
discuss the socio-economic implications of network information asymmetry.Comment: 12 pages, 8 figure
Degree Ranking Using Local Information
Most real world dynamic networks are evolved very fast with time. It is not
feasible to collect the entire network at any given time to study its
characteristics. This creates the need to propose local algorithms to study
various properties of the network. In the present work, we estimate degree rank
of a node without having the entire network. The proposed methods are based on
the power law degree distribution characteristic or sampling techniques. The
proposed methods are simulated on synthetic networks, as well as on real world
social networks. The efficiency of the proposed methods is evaluated using
absolute and weighted error functions. Results show that the degree rank of a
node can be estimated with high accuracy using only samples of the
network size. The accuracy of the estimation decreases from high ranked to low
ranked nodes. We further extend the proposed methods for random networks and
validate their efficiency on synthetic random networks, that are generated
using Erd\H{o}s-R\'{e}nyi model. Results show that the proposed methods can be
efficiently used for random networks as well
A Faster Method to Estimate Closeness Centrality Ranking
Closeness centrality is one way of measuring how central a node is in the
given network. The closeness centrality measure assigns a centrality value to
each node based on its accessibility to the whole network. In real life
applications, we are mainly interested in ranking nodes based on their
centrality values. The classical method to compute the rank of a node first
computes the closeness centrality of all nodes and then compares them to get
its rank. Its time complexity is , where represents total
number of nodes, and represents total number of edges in the network. In
the present work, we propose a heuristic method to fast estimate the closeness
rank of a node in time complexity, where . We
also propose an extended improved method using uniform sampling technique. This
method better estimates the rank and it has the time complexity , where . This is an excellent improvement over the
classical centrality ranking method. The efficiency of the proposed methods is
verified on real world scale-free social networks using absolute and weighted
error functions
Estimating Node Importance in Knowledge Graphs Using Graph Neural Networks
How can we estimate the importance of nodes in a knowledge graph (KG)? A KG
is a multi-relational graph that has proven valuable for many tasks including
question answering and semantic search. In this paper, we present GENI, a
method for tackling the problem of estimating node importance in KGs, which
enables several downstream applications such as item recommendation and
resource allocation. While a number of approaches have been developed to
address this problem for general graphs, they do not fully utilize information
available in KGs, or lack flexibility needed to model complex relationship
between entities and their importance. To address these limitations, we explore
supervised machine learning algorithms. In particular, building upon recent
advancement of graph neural networks (GNNs), we develop GENI, a GNN-based
method designed to deal with distinctive challenges involved with predicting
node importance in KGs. Our method performs an aggregation of importance scores
instead of aggregating node embeddings via predicate-aware attention mechanism
and flexible centrality adjustment. In our evaluation of GENI and existing
methods on predicting node importance in real-world KGs with different
characteristics, GENI achieves 5-17% higher NDCG@100 than the state of the art.Comment: KDD 2019 Research Track. 11 pages. Changelog: Type 3 font removed,
and minor updates made in the Appendix (v2
- …