Spin models on random graphs with controlled topologies beyond degree constraints

Abstract

We study Ising spin models on finitely connected random interaction graphs which are drawn from an ensemble in which not only the degree distribution $p(k)$ can be chosen arbitrarily, but which allows for further fine-tuning of the topology via preferential attachment of edges on the basis of an arbitrary function Q(k,k') of the degrees of the vertices involved. We solve these models using finite connectivity equilibrium replica theory, within the replica symmetric ansatz. In our ensemble of graphs, phase diagrams of the spin system are found to depend no longer only on the chosen degree distribution, but also on the choice made for Q(k,k'). The increased ability to control interaction topology in solvable models beyond prescribing only the degree distribution of the interaction graph enables a more accurate modeling of real-world interacting particle systems by spin systems on suitably defined random graphs.

21 pages, 4 figures, submitted to J Phys A

References in corpus (35)

• The Bethe lattice spin glass revisited
• Class of correlated random networks with hidden variables
• Ising Model on Networks with an Arbitrary Distribution of Connections
• Phase Transitions in the Coloring of Random Graphs
• A General Formalism for Inhomogeneous Random Graphs
• The number of guards needed by a museum: A phase transition in vertex covering of random graphs
• Statistical mechanics of the random K-SAT model
• Coloring random graphs
• Solution of the 2-star model of a network
• Optimisation problems and replica symmetry breaking in finite connectivity spin-glasses
• The Statistical Physics of Regular Low-Density Parity-Check Error-Correcting Codes
• Tricritical Points in Random Combinatorics: the (2+p)-SAT case
• Finite Connectivity Attractor Neural Networks
• Parallel dynamics of disordered Ising spin systems on finitely connected random graphs
• Replicated Transfer Matrix Analysis of Ising Spin Models on `Small World' Lattices
• Trading interactions for topology in scale-free networks
• Statistical Mechanics of Low-Density Parity Check Error-Correcting Codes over Galois Fields
• Finitely connected vector spin systems with random matrix interactions
• Sparsely-spread CDMA - a statistical mechanics based analysis
• On the stochastic dynamics of disordered spin models
• Analytic solution of attractor neural networks on scale-free graphs
• Approximation schemes for the dynamics of diluted spin models: the Ising ferromagnet on a Bethe lattice
• Criticality on networks with topology-dependent interactions
• Cavity approach for real variables on diluted graphs and application to synchronization in small-world lattices
• The Little-Hopfield model on a Random Graph
• Dynamical replica analysis of disordered Ising spin systems on finitely connected random graphs
• Finitely coordinated models for low-temperature phases of amorphous systems
• Average and reliability error exponents in low-density parity-check codes
• Dynamics of dilute disordered models: a solvable case
• Replica symmetry breaking in the `small world' spin glass
• Spin models on random graphs with controlled topologies beyond degree constraints
• Dynamical replica analysis of processes on finitely connected random graphs I: vertex covering
• Diagonalization of replicated transfer matrices for disordered Ising spin systems
• Statistical Mechanics Analysis of LDPC Coding in MIMO Gaussian Channels
• Statics and dynamics of the Lebwohl-Lasher model in the Bethe approximation

Cited by in corpus (10)

• Constrained Markovian dynamics of random graphs
• Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure
• Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations
• Parallel dynamics of disordered Ising spin systems on finitely connected directed random graphs with arbitrary degree distributions
• Spectral density of random graphs with topological constraints
• Spin models on random graphs with controlled topologies beyond degree constraints
• Dynamical replica analysis of processes on finitely connected random graphs II: Dynamics in the Griffiths phase of the diluted Ising ferromagnet
• Network resilience against intelligent attacks constrained by degree dependent node removal cost
• Generating functional analysis of complex formation and dissociation in large protein interaction networks
• Controlled Markovian dynamics of graphs: unbiased generation of random graphs with prescribed topological properties