Pith. sign in

REVIEW 1 cited by

Dynamical replica analysis of disordered Ising spin systems on finitely connected random graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cond-mat/0504313 v1 pith:XQL44D6T submitted 2005-04-13 cond-mat.dis-nn cond-mat.stat-mech

Dynamical replica analysis of disordered Ising spin systems on finitely connected random graphs

classification cond-mat.dis-nn cond-mat.stat-mech
keywords randomgraphsconnectivitydegreedisordereddynamicaldynamicsfinite
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study the dynamics of macroscopic observables such as the magnetization and the energy per degree of freedom in Ising spin models on random graphs of finite connectivity, with random bonds and/or heterogeneous degree distributions. To do so we generalize existing implementations of dynamical replica theory and cavity field techniques to systems with strongly disordered and locally tree-like interactions. We illustrate our results via application to the dynamics of e.g. $\pm J$ spin-glasses on random graphs and of the overlap in finite connectivity Sourlas codes. All results are tested against Monte Carlo simulations.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Dynamical cavity method for continuous-time complex systems on sparse random graphs

    cond-mat.dis-nn 2026-06 unverdicted novelty 7.0

    Derives cavity equations at the level of path measures for continuous-time stochastic dynamics with pairwise interactions on sparse graphs, distinguishing directed and reciprocal cases and recovering dense DMFT limits.