ﻻ يوجد ملخص باللغة العربية
The spectrum of the non-backtracking matrix plays a crucial role in determining various structural and dynamical properties of networked systems, ranging from the threshold in bond percolation and non-recurrent epidemic processes, to community structure, to node importance. Here we calculate the largest eigenvalue of the non-backtracking matrix and the associated non-backtracking centrality for uncorrelated random networks, finding expressions in excellent agreement with numerical results. We show however that the same formulas do not work well for many real-world networks. We identify the mechanism responsible for this violation in the localization of the non-backtracking centrality on network subgraphs whose formation is highly unlikely in uncorrelated networks, but rather common in real-world structures. Exploiting this knowledge we present an heuristic generalized formula for the largest eigenvalue, which is remarkably accurate for all networks of a large empirical dataset. We show that this newly uncovered localization phenomenon allows to understand the failure of the message-passing prediction for the percolation threshold in many real-world structures.
Community detection or clustering is a crucial task for understanding the structure of complex systems. In some networks, nodes are permitted to be linked by either positive or negative edges; such networks are called signed networks. Discovering com
The spectral properties of the adjacency matrix, in particular its largest eigenvalue and the associated principal eigenvector, dominate many structural and dynamical properties of complex networks. Here we focus on the localization properties of the
Complex networks or graphs provide a powerful framework to understand importance of individuals and their interactions in real-world complex systems. Several graph theoretical measures have been introduced to access importance of the individual in sy
Understanding the causes and consequences of, and devising countermeasures to, global warming is a profoundly complex problem. Even when researchers narrow down the focus to a publishable investigation, their analysis often contains enough interactin
There are different measures to classify a networks data set that, depending on the problem, have different success. For example, the resistance distance and eigenvector centrality measures have been successful in revealing ecological pathways and di