اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA sprinkling of hybrid-signature discrete spacetimes in real-world networks
108
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Many real-world networks are embedded into a space or spacetime. The embedding space(time) constrains the properties of these real-world networks. We use the scale-dependent spectral dimension as a tool to probe whether real-world networks encode information on the dimensionality of the embedding space. We find that spacetime networks which are inspired by quantum gravity and based on a hybrid signature, following the Minkowski metric at small spatial distance and the Euclidean metric at large spatial distance, provide a template relevant for real-world networks of small-world type, including a representation of the internets architecture and biological neural networks.
قيم البحث
اقرأ أيضاً
Multiple scales coexist in complex networks. However, the small world property makes them strongly entangled. This turns the elucidation of length scales and symmetries a defiant challenge. Here, we define a geometric renormalization group for comple
x networks and use the technique to investigate networks as viewed at different scales. We find that real networks embedded in a hidden metric space show geometric scaling, in agreement with the renormalizability of the underlying geometric model. This allows us to unfold real scale-free networks in a self-similar multilayer shell which unveils the coexisting scales and their interplay. The multiscale unfolding offers a basis for a new approach to explore critical phenomena and universality in complex networks, and affords us immediate practical applications, like high-fidelity smaller-scale replicas of large networks and a multiscale navigation protocol in hyperbolic space which boosts the success of single-lay
Complex network theory aims to model and analyze complex systems that consist of multiple and interdependent components. Among all studies on complex networks, topological structure analysis is of the most fundamental importance, as it represents a n
atural route to understand the dynamics, as well as to synthesize or optimize the functions, of networks. A broad spectrum of network structural patterns have been respectively reported in the past decade, such as communities, multipartites, hubs, authorities, outliers, bow ties, and others. Here, we show that most individual real-world networks demonstrate multiplex structures. That is, a multitude of known or even unknown (hidden) patterns can simultaneously situate in the same network, and moreover they may be overlapped and nested with each other to collaboratively form a heterogeneous, nested or hierarchical organization, in which different connective phenomena can be observed at different granular levels. In addition, we show that the multiplex structures hidden in exploratory networks can be well defined as well as effectively recognized within an unified framework consisting of a set of proposed concepts, models, and algorithms. Our findings provide a strong evidence that most real-world complex systems are driven by a combination of heterogeneous mechanisms that may collaboratively shape their ubiquitous multiplex structures as we observe currently. This work also contributes a mathematical tool for analyzing different sources of networks from a new perspective of unveiling multiplex structures, which will be beneficial to multiple disciplines including sociology, economics and computer science.
The small-world transition is a first-order transition at zero density $p$ of shortcuts, whereby the normalized shortest-path distance undergoes a discontinuity in the thermodynamic limit. On finite systems the apparent transition is shifted by $Delt
a p sim L^{-d}$. Equivalently a ``persistence size $L^* sim p^{-1/d}$ can be defined in connection with finite-size effects. Assuming $L^* sim p^{-tau}$, simple rescaling arguments imply that $tau=1/d$. We confirm this result by extensive numerical simulation in one to four dimensions, and argue that $tau=1/d$ implies that this transition is first-order.
Two new classes of networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They consist of a one-dimensional lattice backbone overlayed by a hierarchical sequence of
long-distance links. Both types of networks, one 3-regular and the other 4-regular, lead to distinct behaviors, as revealed by renormalization group studies. The 3-regular networks are planar, have a diameter growing as sqrt{N} with the system size N, and lead to super-diffusion with an exact, anomalous exponent d_w=1.3057581..., but possesses only a trivial fixed point T_c=0 for the Ising ferromagnet. In turn, the 4-regular networks are non-planar, have a diameter growing as ~2^[sqrt(log_2 N^2)], exhibit ballistic diffusion (d_w=1), and a non-trivial ferromagnetic transition, T_c>0. It suggest that the 3-regular networks are still quite geometric, while the 4-regular networks qualify as true small-world networks with mean-field properties. As an example of an application we discuss synchronization of processors on these networks.
We calculate the number of metastable configurations of Ising small-world networks which are constructed upon superimposing sparse Poisson random graphs onto a one-dimensional chain. Our solution is based on replicated transfer-matrix techniques. We
examine the denegeracy of the ground state and we find a jump in the entropy of metastable configurations exactly at the crossover between the small-world and the Poisson random graph structures. We also examine the difference in entropy between metastable and all possible configurations, for both ferromagnetic and bond-disordered long-range couplings.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
