scholarly journals Beyond non-backtracking: non-cycling network centrality measures

2020 ◽  
Vol 476 (2235) ◽  
pp. 20190653
Author(s):  
Francesca Arrigo ◽  
Desmond J. Higham ◽  
Vanni Noferini
Keyword(s):  
Large Scale ◽  
Theoretical Computer Science ◽  
Centrality Measures ◽  
Theoretical Computer ◽  
Wide Range ◽  
Limiting Behaviour ◽  
Large Scale Networks ◽  
Matrix Construction ◽  
Matrix Power Series ◽  
Previous Location

Walks around a graph are studied in a wide range of fields, from graph theory and stochastic analysis to theoretical computer science and physics. In many cases it is of interest to focus on non-backtracking walks; those that do not immediately revisit their previous location. In the network science context, imposing a non-backtracking constraint on traditional walk-based node centrality measures is known to offer tangible benefits. Here, we use the Hashimoto matrix construction to characterize, generalize and study such non-backtracking centrality measures. We then devise a recursive extension that systematically removes triangles, squares and, generally, all cycles up to a given length. By characterizing the spectral radius of appropriate matrix power series, we explore how the universality results on the limiting behaviour of classical walk-based centrality measures extend to these non-cycling cases. We also demonstrate that the new recursive construction gives rise to practical centrality measures that can be applied to large-scale networks.

scholarly journals Bisimulations, Games, and Logic

1994 ◽  
Vol 1 (6) ◽  
Author(s):  
Mogens Nielsen ◽  
Christian Clausen
Keyword(s):  
Computer Science ◽  
Recent Trend ◽  
Theoretical Computer Science ◽  
Theoretical Computer ◽  
Wide Range

In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically and logically in a non-interleaving model. Our characterizations appear as surprisingly simple extensions of corresponding characterizations of interleaving bisimulation.

scholarly journals An Efficient Partition-Based Approach to Identify and Scatter Multiple Relevant Spreaders in Complex Networks

Entropy ◽  
2021 ◽  
Vol 23 (9) ◽  
pp. 1216
Author(s):  
Jedidiah Yanez-Sierra ◽  
Arturo Diaz-Perez ◽  
Victor Sosa-Sosa
Keyword(s):  
Complex Networks ◽  
Information Diffusion ◽  
Large Scale ◽  
Centrality Measures ◽  
Correct Identification ◽  
Graph Analysis ◽  
Relevant Role ◽  
Two Phases ◽  
Large Scale Networks ◽  
Spreading Processes

One of the main problems in graph analysis is the correct identification of relevant nodes for spreading processes. Spreaders are crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases, rumors, and more. Correct identification of spreaders in graph analysis is a relevant task to optimally use the network structure and ensure a more efficient flow of information. Additionally, network topology has proven to play a relevant role in the spreading processes. In this sense, more of the existing methods based on local, global, or hybrid centrality measures only select relevant nodes based on their ranking values, but they do not intentionally focus on their distribution on the graph. In this paper, we propose a simple yet effective method that takes advantage of the underlying graph topology to guarantee that the selected nodes are not only relevant but also well-scattered. Our proposal also suggests how to define the number of spreaders to select. The approach is composed of two phases: first, graph partitioning; and second, identification and distribution of relevant nodes. We have tested our approach by applying the SIR spreading model over nine real complex networks. The experimental results showed more influential and scattered values for the set of relevant nodes identified by our approach than several reference algorithms, including degree, closeness, Betweenness, VoteRank, HybridRank, and IKS. The results further showed an improvement in the propagation influence value when combining our distribution strategy with classical metrics, such as degree, outperforming computationally more complex strategies. Moreover, our proposal shows a good computational complexity and can be applied to large-scale networks.

scholarly journals Performance Evaluation of Modularity Based Community Detection Algorithms in Large Scale Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Vinícius da Fonseca Vieira ◽  
Carolina Ribeiro Xavier ◽  
Nelson Francisco Favilla Ebecken ◽  
Alexandre Gonçalves Evsukoff
Keyword(s):  
Spectral Method ◽  
Community Detection ◽  
High Performance ◽  
Large Scale ◽  
Fine Tuning ◽  
Detection Algorithms ◽  
Research Areas ◽  
Structure Detection ◽  
Wide Range ◽  
Large Scale Networks

Community structure detection is one of the major research areas of network science and it is particularly useful for large real networks applications. This work presents a deep study of the most discussed algorithms for community detection based on modularity measure: Newman’s spectral method using a fine-tuning stage and the method of Clauset, Newman, and Moore (CNM) with its variants. The computational complexity of the algorithms is analysed for the development of a high performance code to accelerate the execution of these algorithms without compromising the quality of the results, according to the modularity measure. The implemented code allows the generation of partitions with modularity values consistent with the literature and it overcomes 1 million nodes with Newman’s spectral method. The code was applied to a wide range of real networks and the performances of the algorithms are evaluated.

scholarly journals Bisimulations, Games and Logic

1994 ◽  
Vol 23 (467) ◽  
Author(s):  
Mogens Nielsen ◽  
Christian Clausen
Keyword(s):  
Computer Science ◽  
Recent Trend ◽  
Theoretical Computer Science ◽  
Theoretical Computer ◽  
Wide Range

In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically and logically in a non-interleaving model. Our characterizations appear as surprisingly simple extensions of corresponding characterizations of interleaving bisimulation.

PageRank Algorithm-Based Recommender System Using Uniformly Average Rating Matrix

2019 ◽  
pp. 99-112
Author(s):  
Bathrinath S. ◽  
Saranyadevi S. ◽  
Thirumalai Kumaran S. ◽  
Saravanasankar S.
Keyword(s):  
Recommender Systems ◽  
Large Scale ◽  
User Behavior ◽  
Personalized Recommendation ◽  
Pagerank Algorithm ◽  
Large Scale Networks ◽  
Matrix Construction ◽  
Item Item ◽  
New Item

Applications of web data mining is the prediction of user behavior with respect to items. Recommender systems are being applied in knowledge discovery techniques to the problem of making decisions on personalized recommendation of information. Traditional CF approaches involve the amount of effort increases with number of users. Hence, new recommender systems need to be developed to process high quality recommendations for large-scale networks. In this chapter, a model for UAR matrix construction method for item rank calculations, a Page Rank-based item ranking approach are proposed. The analysis of various techniques for computing item-item similarities to identify relationship between the selected items and to produce a qualified recommendation for users to acquire the items as their wish. As a result, the new item rank-based approaches improve the quality of recommendation outcome. Results show that the proposed UAR method outperforms than the existing method. The same method is applied for the large real-time rating dataset like Movie Lens.

Scaling up network centrality computations – A brief overview

2020 ◽  
Vol 62 (3-4) ◽  
pp. 189-204 ◽  
Author(s):  
Alexander van der Grinten ◽  
Eugenio Angriman ◽  
Henning Meyerhenke
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Centrality Measures ◽  
Graph Processing ◽  
Data Sets ◽  
Previous State ◽  
Computational Aspects ◽  
Algorithmic Techniques ◽  
Large Scale Networks ◽  
Science Methodology

AbstractNetwork science methodology is increasingly applied to a large variety of real-world phenomena, often leading to big network data sets. Thus, networks (or graphs) with millions or billions of edges are more and more common. To process and analyze these data, we need appropriate graph processing systems and fast algorithms. Yet, many analysis algorithms were pioneered on small networks when speed was not the highest concern. Developing an analysis toolkit for large-scale networks thus often requires faster variants, both from an algorithmic and an implementation perspective. In this paper we focus on computational aspects of vertex centrality measures. Such measures indicate the (relative) importance of a vertex based on the position of the vertex in the network. We describe several common (and some recent and thus less established) measures, optimization problems in their context as well as algorithms for an efficient solution of the raised problems. Our focus is on (not necessarily exact) performance-oriented algorithmic techniques that enable significantly faster processing than the previous state of the art – often allowing to process massive data sets quickly and without resorting to distributed graph processing systems.

scholarly journals Dynamic centrality measures for cattle trade networks

2021 ◽  
Vol 6 (1) ◽  
Author(s):  
Patrick Hoscheit ◽  
Éric Anthony ◽  
Elisabeta Vergu
Keyword(s):  
Random Walks ◽  
Large Scale ◽  
Specific Structure ◽  
Centrality Measures ◽  
Network Centrality ◽  
Direct Simulation ◽  
Contact Networks ◽  
Trade Networks ◽  
Large Scale Networks ◽  
Time Aware

AbstractWe study network centrality measures that take into account the specific structure of networks with time-stamped edges. In particular, we explore how such measures can be used to identify nodes most relevant for the spread of epidemics on directed, temporal contact networks. We present a percolation study on the French cattle trade network, proving that time-aware centrality measures such as the TempoRank significantly outperform measures defined on the static network. In order to make TempoRank amenable to large-scale networks, we show how it can be efficiently computed through direct simulation of time-respecting random walks.

Electron microscopy study of reactively sputter-deposited Ti/N films on silicon

1992 ◽  
Vol 50 (2) ◽  
pp. 1362-1363
Author(s):  
V. C. Kannan ◽  
A. K. Singh ◽  
R. B. Irwin ◽  
S. Chittipeddi ◽  
F. D. Nkansah ◽  
...  
Keyword(s):  
Integrated Circuits ◽  
Large Scale ◽  
Hexagonal Phase ◽  
Microscopy Study ◽  
Electron Microscopy Study ◽  
Process Conditions ◽  
Tin Films ◽  
Wide Range ◽  
Fcc Phase ◽  
Circuits Vlsi

Titanium nitride (TiN) films have historically been used as diffusion barrier between silicon and aluminum, as an adhesion layer for tungsten deposition and as an interconnect material etc. Recently, the role of TiN films as contact barriers in very large scale silicon integrated circuits (VLSI) has been extensively studied. TiN films have resistivities on the order of 20μ Ω-cm which is much lower than that of titanium (nearly 66μ Ω-cm). Deposited TiN films show resistivities which vary from 20 to 100μ Ω-cm depending upon the type of deposition and process conditions. TiNx is known to have a NaCl type crystal structure for a wide range of compositions. Change in color from metallic luster to gold reflects the stabilization of the TiNx (FCC) phase over the close packed Ti(N) hexagonal phase. It was found that TiN (1:1) ideal composition with the FCC (NaCl-type) structure gives the best electrical property.

THE SOME QUESTIONS OF AUTONOMOUS MOTION AND MANAGEMENT OF LAND-MOBILE ROBOTIC COMPLEXES FOR UKRAINIAN GROUND FORCESE

2019 ◽  
pp. 53-58
Author(s):  
О. Кravchuk ◽  
V. Symonenkov ◽  
I. Symonenkova ◽  
O. Hryhorev
Keyword(s):  
Large Scale ◽  
Armed Forces ◽  
Distributed Information ◽  
Wide Range ◽  
Highly Effective ◽  
Information Management Systems ◽  
Robotic Devices ◽  
Principles And Standards ◽  
And Control ◽  
The Eu

Today, more than forty countries of the world are engaged in the development of military-purpose robots. A number of unique mobile robots with a wide range of capabilities are already being used by combat and intelligence units of the Armed forces of the developed world countries to conduct battlefield intelligence and support tactical groups. At present, the issue of using the latest information technology in the field of military robotics is thoroughly investigated, and the creation of highly effective information management systems in the land-mobile robotic complexes has acquired a new phase associated with the use of distributed information and sensory systems and consists in the transition from application of separate sensors and devices to the construction of modular information subsystems, which provide the availability of various data sources and complex methods of information processing. The purpose of the article is to investigate the ways to increase the autonomy of the land-mobile robotic complexes using in a non-deterministic conditions of modern combat. Relevance of researches is connected with the necessity of creation of highly effective information and control systems in the perspective robotic means for the needs of Land Forces of Ukraine. The development of the Armed Forces of Ukraine management system based on the criteria adopted by the EU and NATO member states is one of the main directions of increasing the effectiveness of the use of forces (forces), which involves achieving the principles and standards necessary for Ukraine to become a member of the EU and NATO. The inherent features of achieving these criteria will be the transition to a reduction of tasks of the combined-arms units and the large-scale use of high-precision weapons and land remote-controlled robotic devices. According to the views of the leading specialists in the field of robotics, the automation of information subsystems and components of the land-mobile robotic complexes can increase safety, reliability, error-tolerance and the effectiveness of the use of robotic means by standardizing the necessary actions with minimal human intervention, that is, a significant increase in the autonomy of the land-mobile robotic complexes for the needs of Land Forces of Ukraine.

Sign in / Sign up

Export Citation Format

Share Document