2006
DOI: 10.1103/physreve.73.016138
|View full text |Cite
|
Sign up to set email alerts
|

Metastable configurations of small-world networks

Abstract: We calculate the number of metastable configurations of Ising small-world networks that 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 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 poss… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(12 citation statements)
references
References 35 publications
0
12
0
Order By: Relevance
“…In recent years, ever-increasing attention has been paid to the study of networks. 6,22 There are several questions which can be addressed when dealing with a random graph. 1 Beyond topology one can put variables (e.g., spins) on the nodes and impose rules for their interaction.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In recent years, ever-increasing attention has been paid to the study of networks. 6,22 There are several questions which can be addressed when dealing with a random graph. 1 Beyond topology one can put variables (e.g., spins) on the nodes and impose rules for their interaction.…”
Section: Resultsmentioning
confidence: 99%
“…In the last few years, while an ever-increasing understanding of disordered statistical mechanics has been achievable -mainly due to the recent breakthrough in mathematical methods (see e.g., Refs. 8,9,[17][18][19][20][21] and mainly focused on the paradigmatic (fully connected) Sherrington-Kirkpatrick (SK) model, 14 -the theory of networks, in particular random, small world and scalefree networks, 6,[22][23][24] revealed surprisingly common features between apparently much different structures in Nature, turning to itself the attention of several scientists, such that, by merging these two fields of research (disordered statistical mechanics and network theory), our study on diluted spin glasses developed.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, for any choice of the value of the average connectivity, however small, the ferromagnetic-paramagnetic transition occurs at a finite temperature. Furthermore, a jump in the entropy of metastable configurations has been found [18] exactly at the crossover between the small-world and the Poisson random graph structure due to the formation of disconnected clusters within the graph.…”
Section: Introductionmentioning
confidence: 99%
“…This low clustering can indicate a metastable structure. 48 Indeed, the structure of this sample changed slightly during the measurements, either due to the small movements of the objective or very slow sedimentation.…”
Section: Sample Characterisationmentioning
confidence: 97%