Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMultiscale unfolding of real networks by geometric renormalization
79
0
0.0
(
0
)
Added by
Guillermo Garc\\'ia-P\\'erez Mr.
Publication date
2017
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
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 complex 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
rate research
Read More
A complete understanding of real networks requires us to understand the consequences of the uneven interaction strengths between a systems components. Here we use the minimum spanning tree (MST) to explore the effect of weight assignment and network topology on the organization of complex networks. We find that if the weight distribution is correlated with the network topology, the MSTs are either scale-free or exponential. In contrast, when the correlations between weights and topology are absent, the MST degree distribution is a power-law and independent of the weight distribution. These results offer a systematic way to explore the impact of weak links on the structure and integrity of complex networks.
Although the spectra of random networks have been studied for a long time, the influence of network topology on the dense limit of network spectra remains poorly understood. By considering the configuration model of networks with four distinct degree distributions, we show that the spectral density of the adjacency matrices of dense random networks is determined by the strength of the degree fluctuations. In particular, the eigenvalue distribution of dense networks with an exponential degree distribution is governed by a simple equation, from which we uncover a logarithmic singularity in the spectral density. We also derive a relation between the fourth moment of the eigenvalue distribution and the variance of the degree distribution, which leads to a sufficient condition for the breakdown of the Wigner semicircle law for dense random networks. Based on the same relation, we propose a classification scheme of the distinct universal behaviours of the spectral density in the dense limit. Our theoretical findings should lead to important insights on the mean-field behaviour of models defined on graphs.
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.
The key idea behind the renormalization group (RG) transformation is that properties of physical systems with very different microscopic makeups can be characterized by a few universal parameters. However, finding the optimal RG transformation remains difficult due to the many possible choices of the weight factors in the RG procedure. Here we show, by identifying the conditional distribution in the restricted Boltzmann machine (RBM) and the weight factor distribution in the RG procedure, an optimal real-space RG transformation can be learned without prior knowledge of the physical system. This neural Monte Carlo RG algorithm allows for direct computation of the RG flow and critical exponents. This scheme naturally generates a transformation that maximizes the real-space mutual information between the coarse-grained region and the environment. Our results establish a solid connection between the RG transformation in physics and the deep architecture in machine learning, paving the way to further interdisciplinary research.
We propose a new framework to understand how quantum effects may impact on the dynamics of neural networks. We implement the dynamics of neural networks in terms of Markovian open quantum systems, which allows us to treat thermal and quantum coherent effects on the same footing. In particular, we propose an open quantum generalisation of the celebrated Hopfield neural network, the simplest toy model of associative memory. We determine its phase diagram and show that quantum fluctuations give rise to a qualitatively new non-equilibrium phase. This novel phase is characterised by limit cycles corresponding to high-dimensional stationary manifolds that may be regarded as a generalisation of storage patterns to the quantum domain.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
