ID: 0907.1699

Parallel dynamics of disordered Ising spin systems on finitely connected directed random graphs with arbitrary degree distributions

July 10, 2009

View on ArXiv

Similar papers 3

Variational perturbation and extended Plefka approaches to dynamics on random networks: the case of the kinetic Ising model

July 28, 2016

83% Match
Ludovica Bachschmid-Romano, Claudia Battistin, ... , Roudi Yasser
Disordered Systems and Neura...
Data Analysis, Statistics an...
Machine Learning

We describe and analyze some novel approaches for studying the dynamics of Ising spin glass models. We first briefly consider the variational approach based on minimizing the Kullback-Leibler divergence between independent trajectories and the real ones and note that this approach only coincides with the mean field equations from the saddle point approximation to the generating functional when the dynamics is defined through a logistic link function, which is the case for the...

Find SimilarView on arXiv

Dynamics of the directed Ising chain

February 1, 2011

83% Match
Claude Godreche
Statistical Mechanics
Mathematical Physics

The study by Glauber of the time-dependent statistics of the Ising chain is extended to the case where each spin is influenced unequally by its nearest neighbours. The asymmetry of the dynamics implies the failure of the detailed balance condition. The functional form of the rate at which an individual spin changes its state is constrained by the global balance condition with respect to the equilibrium measure of the Ising chain. The local magnetization, the equal-time and tw...

Find SimilarView on arXiv

Ising-like models on arbitrary graphs : The Hadamard way

August 30, 2014

83% Match
Rémy Mosseri
Statistical Mechanics

We propose a generic framework to describe classical Ising-like models defined on arbitrary graphs. The energy spectrum is shown to be the Hadamard transform of a suitably defined sparse "coding" vector associated with the graph. We expect that the existence of a fast Hadamard transform algorithm (used for instance in image ccompression processes), together with the sparseness of the coding vector, may provide ways to fasten the spectrum computation.. Applying this formalism ...

Find SimilarView on arXiv

From Network Reliability to the Ising Model: A Parallel Scheme for Estimating the Joint Density of States

October 18, 2016

83% Match
Yihui Ren, Stephen Eubank, Madhurima Nath
Statistical Mechanics
Distributed, Parallel, and C...

Network reliability is the probability that a dynamical system composed of discrete elements interacting on a network will be found in a configuration that satisfies a particular property. We introduce a new reliability property, Ising feasibility, for which the network reliability is the Ising model s partition function. As shown by Moore and Shannon, the network reliability can be separated into two factors: structural, solely determined by the network topology, and dynamic...

Find SimilarView on arXiv

Time scale separation and heterogeneous off-equilibrium dynamics in spin models over random graphs

November 3, 1998

83% Match
A. Barrat, R. Zecchina
Disordered Systems and Neura...

We study analytically and numerically the statics and the off-equilibrium dynamics of spin models over finitely connected random graphs. We identify a threshold value for the connectivity beyond which the loop structure of the graph becomes thermodynamically relevant. Glauber dynamics simulations show that this loop structure is responsible for the onset of dynamical features of a local character (dynamical heterogeneities and spontaneous time scale separation), consistently ...

Find SimilarView on arXiv

Statistical mechanics of random graphs

December 18, 2003

83% Match
Zdzislaw Burda, Jerzy Jurkiewicz, Andre Krzywicki
Statistical Mechanics

We discuss various aspects of the statistical formulation of the theory of random graphs, with emphasis on results obtained in a series of our recent publications.

Find SimilarView on arXiv

A class of random fields on complete graphs with tractable partition function

December 10, 2012

83% Match
Boris Flach
Machine Learning
Machine Learning

The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising models with homogeneous pairwise potentials but arbitrary (inhomogeneous) unary potentials. Similarly, the partition function and marginal probabilities can be computed in polynomial time for random fields on complete bipartite graphs, provide...

Find SimilarView on arXiv

Ising models on locally tree-like graphs

April 30, 2008

83% Match
Amir Dembo, Andrea Montanari
Probability
Statistical Mechanics
Mathematical Physics

We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the "cavity" prediction for the limiting free energy per spin is correct for any positive temperature and external field. Further, local marginals can be approximated by iterating a set of mean field (cavity) equations. Both results are achieved by proving the local co...

Find SimilarView on arXiv

Growing spin model in deterministic and stochastic trees

July 7, 2014

83% Match
Julian Sienkiewicz
Statistical Mechanics
Physics and Society

We solve the growing asymmetric Ising model [Phys. Rev. E 89, 012105 (2014)] in the topologies of deterministic and stochastic (random) scale-free trees predicting its non-monotonous behavior for external fields smaller than the coupling constant $J$. In both cases we indicate that the crossover temperature corresponding to maximal magnetization decays approximately as $(\ln \ln N)^{-1}$, where $N$ is the number of nodes in the tree.

Find SimilarView on arXiv

Zero Temperature Dynamics of 2D and 3D Ising Ferromagnets

November 10, 2004

83% Match
Palani Sundaramurthy, D. L. Stein
Statistical Mechanics

We consider zero-temperature, stochastic Ising models with nearest-neighbor interactions in two and three dimensions. Using both symmetric and asymmetric initial configurations, we study the evolution of the system with time. We examine the issue of convergence of the dynamics and discuss the nature of the final state of the system. By determining a relation between the median number of spin flips per site, the probability p that a spin in the initial spin configuration takes...

Find SimilarView on arXiv