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

Thermodynamics of spin systems on small-world hypergraphs

Abstract: We study the thermodynamic properties of spin systems on small-world hypergraphs, obtained by superimposing sparse Poisson random graphs with p-spin interactions onto a one-dimensional Ising chain with nearest-neighbor interactions. We use replica-symmetric transfer-matrix techniques to derive a set of fixed-point equations describing the relevant order parameters and free energy, and solve them employing population dynamics. In the special case where the number of connections per site is of the order of the s… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
21
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 13 publications
(23 citation statements)
references
References 19 publications
2
21
0
Order By: Relevance
“…SADDLE-POINT EQUATIONS As usual we replicate the partition function in order to calculate the free energy. Analytically, the calculation is analogous to the one found in [11]:…”
Section: The Modelmentioning
confidence: 85%
“…SADDLE-POINT EQUATIONS As usual we replicate the partition function in order to calculate the free energy. Analytically, the calculation is analogous to the one found in [11]:…”
Section: The Modelmentioning
confidence: 85%
“…where Θ 0 (η c ) and ρ(η c ) are calculated using Eqs. (15) and (19), respectively. Therefore, the transition is hybrid with the exponent β = 1/2.…”
Section: Order Parametermentioning
confidence: 99%
“…where G(Θ) is the self-consistency function of the infinite system provided in Eq. (15). The solution of G N (Θ) = 0 yields the density of infected nodes in finite systems.…”
Section: Correlation Sizementioning
confidence: 99%
“…Explicitly, by applying Eqs. (123), (9) and (121), the transformations (127) and (128) become, respectively…”
Section: B Random Models Defined On Unconstrained Random Graphsmentioning
confidence: 99%