اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe network source location problem: ground state energy, entropy and effects of freezing
133
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Ground state entropy of the network source location problem is evaluated at both the replica symmetric level and one-step replica symmetry breaking level using the entropic cavity method. The regime that is a focus of this study, is closely related to the vertex cover problem with randomly quenched covered nodes. The resulting entropic message passing inspired decimation and reinforcement algorithms are used to identify the optimal location of sources in single instances of transportation networks. The conventional belief propagation without taking the entropic effect into account is also compared. We find that in the glassy phase the entropic message passing inspired decimation yields a lower ground state energy compared to the belief propagation without taking the entropic effect. Using the extremal optimization algorithm, we study the ground state energy and the fraction of frozen hubs, and extend the algorithm to collect statistics of the entropy. The theoretical results are compared with the extremal optimization results.
قيم البحث
اقرأ أيضاً
In this paper we generalize the concept of random networks to describe networks with non trivial features by a statistical mechanics approach. This framework is able to describe ensembles of undirected, directed as well as weighted networks. These ne
tworks might have not trivial community structure or, in the case of networks embedded in a given space, non trivial distance dependence of the link probability. These ensembles are characterized by their entropy which evaluate the cardinality of networks in the ensemble. The general framework we present in this paper is able to describe microcanonical ensemble of networks as well as canonical or hidden variables network ensemble with significant implication for the formulation of network constructing algorithms. Moreover in the paper we define and and characterize in particular the structural entropy, i.e. the entropy of the ensembles of undirected uncorrelated simple networks with given degree sequence. We discuss the apparent paradox that scale-free degree distribution are characterized by having small structural entropy but are so widely encountered in natural, social and technological complex systems. We give the proof that while scale-free networks ensembles have small structural entropy, they also correspond to the most likely degree distribution with the corresponding value of the structural entropy.
Randomized network ensembles are the null models of real networks and are extensivelly used to compare a real system to a null hypothesis. In this paper we study network ensembles with the same degree distribution, the same degree-correlations or the
same community structure of any given real network. We characterize these randomized network ensembles by their entropy, i.e. the normalized logarithm of the total number of networks which are part of these ensembles. We estimate the entropy of randomized ensembles starting from a large set of real directed and undirected networks. We propose entropy as an indicator to assess the role of each structural feature in a given real network.We observe that the ensembles with fixed scale-free degree distribution have smaller entropy than the ensembles with homogeneous degree distribution indicating a higher level of order in scale-free networks.
In this letter, we show how the Survey Propagation algorithm can be generalized to include external forcing messages, and used to address selectively an exponential number of glassy ground states. These capabilities can be used to explore efficiently
the space of solutions of random NP-complete constraint satisfaction problems, providing a direct experimental evidence of replica symmetry breaking in large-size instances. Finally, a new lossy data compression protocol is introduced, exploiting as a computational resource the clustered nature of the space of addressable states.
In the Edwards-Anderson model of spin glasses with a bimodal distribution of bonds, the degeneracy of the ground state allows one to define a structure called backbone, which can be characterized by the rigid lattice (RL), consisting of the bonds tha
t retain their frustration (or lack of it) in all ground states. In this work we have performed a detailed numerical study of the properties of the RL, both in two-dimensional (2D) and three-dimensional (3D) lattices. Whereas in 3D we find strong evidence for percolation in the thermodynamic limit, in 2D our results indicate that the most probable scenario is that the RL does not percolate. On the other hand, both in 2D and 3D we find that frustration is very unevenly distributed. Frustration is much lower in the RL than in its complement. Using equilibrium simulations we observe that this property can be found even above the critical temperature. This leads us to propose that the RL should share many properties of ferromagnetic models, an idea that recently has also been proposed in other contexts. We also suggest a preliminary generalization of the definition of backbone for systems with continuous distributions of bonds, and we argue that the study of this structure could be useful for a better understanding of the low temperature phase of those frustrated models.
It is well-known that spontaneous symmetry breaking in one spatial dimension is thermodynamically forbidden at finite energy density. Here we show that mirror-symmetric disorder in an interacting quantum system can invert this paradigm, yielding spon
taneous breaking of mirror symmetry only at finite energy density and giving rise to mirror-glass order. The mirror-glass transition, which is driven by a finite density of interacting excitations, is enabled by many-body localization, and appears to occur simultaneously with the localization transition. This counterintuitive manifestation of localization-protected order can be viewed as a quantum analog of inverse freezing, a phenomenon that occurs, e.g., in certain models of classical spin glasses.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
