اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCharacterization of complex networks by higher order neighborhood properties
80
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A concept of higher order neighborhood in complex networks, introduced previously (PRE textbf{73}, 046101, (2006)), is systematically explored to investigate larger scale structures in complex networks. The basic idea is to consider each higher order neighborhood as a network in itself, represented by a corresponding adjacency matrix. Usual network indices are then used to evaluate the properties of each neighborhood. Results for a large number of typical networks are presented and discussed. Further, the information from all neighborhoods is condensed in a single neighborhood matrix, which can be explored for visualizing the neighborhood structure. On the basis of such representation, a distance is introduced to compare, in a quantitative way, how far apart networks are in the space of neighborhood matrices. The distance depends both on the network topology and the adopted node numbering. Given a pair of networks, a Monte Carlo algorithm is developed to find the best numbering for one of them, holding fixed the numbering of the second network, obtaining a projection of the first one onto the pattern of the other. The minimal value found for the distance reflects differences in the neighborhood structures of the two networks that arise from distinct topologies. Examples are worked out allowing for a quantitative comparison for distances among a set of distinct networks.
قيم البحث
اقرأ أيضاً
From social interactions to the human brain, higher-order networks are key to describe the underlying network geometry and topology of many complex systems. While it is well known that network structure strongly affects its function, the role that ne
twork topology and geometry has on the emerging dynamical properties of higher-order networks is yet to be clarified. In this perspective, the spectral dimension plays a key role since it determines the effective dimension for diffusion processes on a network. Despite its relevance, a theoretical understanding of which mechanisms lead to a finite spectral dimension, and how this can be controlled, represents nowadays still a challenge and is the object of intense research. Here we introduce two non-equilibrium models of hyperbolic higher-order networks and we characterize their network topology and geometry by investigating the interwined appearance of small-world behavior, $delta$-hyperbolicity and community structure. We show that different topological moves determining the non-equilibrium growth of the higher-order hyperbolic network models induce tunable values of the spectral dimension, showing a rich phenomenology which is not displayed in random graph ensembles. In particular, we observe that, if the topological moves used to construct the higher-order network increase the area$/$volume ratio, the spectral dimension continuously decreases, while the opposite effect is observed if the topological moves decrease the area$/$volume ratio. Our work reveals a new link between the geometry of a network and its diffusion properties, contributing to a better understanding of the complex interplay between network structure and dynamics.
A calculation method for higher-order moments of physical quantities, including magnetization and energy, based on the higher-order tensor renormalization group is proposed. The physical observables are represented by impurity tensors. A systematic s
ummation scheme provides coarse-grained tensors including multiple impurities. Our method is compared with the Monte Carlo method on the two-dimensional Potts model. While the nature of the transition of the $q$-state Potts model has been known for a long time owing to the analytical arguments, a clear numerical confirmation has been difficult due to extremely long correlation length in the weakly first-order transitions, e.g., for $q=5$. A jump of the Binder ratio precisely determines the transition temperature. The finite-size scaling analysis provides critical exponents and distinguishes the weakly first-order and the continuous transitions.
Complexity of dynamics is at the core of quantum many-body chaos and exhibits a hierarchical feature: higher-order complexity implies more chaotic dynamics. Conventional ergodicity in thermalization processes is a manifestation of the lowest order co
mplexity, which is represented by the eigenstate thermalization hypothesis (ETH) stating that individual energy eigenstates are thermal. Here, we propose a higher-order generalization of the ETH, named the $ k $-ETH ($ k=1,2,dots $), to quantify higher-order complexity of quantum many-body dynamics at the level of individual energy eigenstates, where the lowest order ETH (1-ETH) is the conventional ETH. As a non-trivial contribution of the higher-order ETH, we show that the $ k $-ETH with $ kgeq 2 $ implies a universal behavior of the $ k $th Renyi entanglement entropy of individual energy eigenstates. In particular, the Page correction of the entanglement entropy originates from the higher-order ETH, while as is well known, the volume law can be accounted for by the 1-ETH. We numerically verify that the 2-ETH approximately holds for a nonintegrable system, but does not hold in the integrable case. To further investigate the information-theoretic feature behind the $ k $-ETH, we introduce a concept named a partial unitary $ k $-design (PU $ k $-design), which is an approximation of the Haar random unitary up to the $ k $th moment, where partial means that only a limited number of observables are accessible. The $ k $-ETH is a special case of a PU $ k $-design for the ensemble of Hamiltonian dynamics with random-time sampling. In addition, we discuss the relationship between the higher-order ETH and information scrambling quantified by out-of-time-ordered correlators. Our framework provides a unified view on thermalization, entanglement entropy, and unitary $ k $-designs, leading to deeper characterization of higher-order quantum complexity.
Many real-world complex networks arise as a result of a competition between growth and rewiring processes. Usually the initial part of the evolution is dominated by growth while the later one rather by rewiring. The initial growth allows the network
to reach a certain size while rewiring to optimise its function and topology. As a model example we consider tree networks which first grow in a stochastic process of node attachment and then age in a stochastic process of local topology changes. The ageing is implemented as a Markov process that preserves the node-degree distribution. We quantify differences between the initial and aged network topologies and study the dynamics of the evolution. We implement t
Given a set of variables and the correlations among them, we develop a method for finding clustering among the variables. The method takes advantage of information implicit in higher-order (not just pairwise) correlations. The idea is to define a Pot
ts model whose energy is based on the correlations. Each state of this model is a partition of the variables and a Monte Carlo method is used to identify states of lowest energy, those most consistent with the correlations. A set of the 100 or so lowest such partitions is then used to construct a stochastic dynamics (using the adjacency matrix of each partition) whose observable representation gives the clustering. Three examples are studied. For two of them the 3$^mathrm{rd}$ order correlations are significant for getting the clusters right. The last of these is a toy model of a biological system in which the joint action of several genes or proteins is necessary to accomplish a given process.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
