Topic
Network theory
About: Network theory is a research topic. Over the lifetime, 2257 publications have been published within this topic receiving 109864 citations.
Papers published on a yearly basis
Papers
More filters
Posted Content•
TL;DR: In both networks, the Hirsch index has poor correlation with Betweenness centrality but correlates well with Eigenvector centrality, specially for the more important nodes that are relevant for ranking purposes, say in Search Machine Optimization.
Abstract: We study the h Hirsch index as a local node centrality measure for complex networks in general. The h index is compared with the Degree centrality (a local measure), the Betweenness and Eigenvector centralities (two non-local measures) in the case of a biological network (Yeast interaction protein-protein network) and a linguistic network (Moby Thesaurus II) as test environments. In both networks, the Hirsch index has poor correlation with Betweenness centrality but correlates well with Eigenvector centrality, specially for the more important nodes that are relevant for ranking purposes, say in Search Machine Optimization. In the thesaurus network, the h index seems even to outperform the Eigenvector centrality measure as evaluated by simple linguistic criteria.
5 citations
TL;DR: This model is based upon the assumption that new links are formed not only according to the centrality of other nodes in a network but geodetic distance is also important in link formation.
Abstract: The paper presents a simple extension of the Barabasi-Albert model of network evolution. This model is based upon the assumption that new links are formed not only according to the centrality of other nodes in a network but geodetic distance is also important in link formation. Simulation results show that if link formation is based on distance then the resulting network is more clustered than in the case of centrality being the dominant factor in link formation. Our empirical results show that in European regional patent inventor networks distance is a considerably more important factor in link formation than network centrality.
5 citations
TL;DR: This work states that determining a reasonable project duration is one of the most critical activities required by project owner agencies for successful project letting and delivery.
Abstract: Determining a reasonable project duration is one of the most critical activities required by project owner agencies for successful project letting and delivery. Most owner agencies, specifi...
5 citations
TL;DR: In this article, the authors presented an overview of key methods and tools that may be used for the analysis of criminal networks, which are presented in a real-world case study, starting from available juridical acts, extracted data on the interactions among suspects within two Sicilian Mafia clans, obtaining two weighted undirected graphs.
Abstract: Social Network Analysis is the use of Network and Graph Theory to study social phenomena, which was found to be highly relevant in areas like Criminology. This chapter provides an overview of key methods and tools that may be used for the analysis of criminal networks, which are presented in a real-world case study. Starting from available juridical acts, we have extracted data on the interactions among suspects within two Sicilian Mafia clans, obtaining two weighted undirected graphs. Then, we have investigated the roles of these weights on the criminal networks properties, focusing on two key features: weight distribution and shortest path length. We also present an experiment that aims to construct an artificial network which mirrors criminal behaviours. To this end, we have conducted a comparative degree distribution analysis between the real criminal networks, using some of the most popular artificial network models: Watts-Strogats, Erdős-Renyi, and Barabasi-Albert, with some topology variations. This chapter will be a valuable tool for researchers who wish to employ social network analysis within their own area of interest.
5 citations
Posted Content•
TL;DR: This paper compares the reliance ranking with Google PageRank, Markov centrality as well as betweenness centrality and shows that a criminal investigation using the reliance measure, will lead to a different prioritisation in terms of possible people to investigate.
Abstract: Recent research on finding important intermediate nodes in a network suspected to contain criminal activity is highly dependent on network centrality values. Betweenness centrality, for example, is widely used to rank the nodes that act as brokers in the shortest paths connecting all source and all the end nodes in a network. However both the shortest path node betweenness and the linearly scaled betweenness can only show rankings for all the nodes in a network. In this paper we explore the mathematical concept of pair-dependency on intermediate nodes, adapting the concept to criminal relationships and introducing a new source-intermediate reliance measure. To illustrate our measure, we apply it to rank the nodes in the Enron email dataset and the Noordin Top Terrorist networks. We compare the reliance ranking with Google PageRank, Markov centrality as well as betweenness centrality and show that a criminal investigation using the reliance measure, will lead to a different prioritisation in terms of possible people to investigate. While the ranking for the Noordin Top terrorist network nodes yields more extreme differences than for the Enron email transaction network, in the latter the reliance values for the set of finance managers immediately identified another employee convicted of money laundering.
5 citations