Related papers: Parallel dynamics of disordered Ising spin systems…
The analytical description of the dynamics in models with discrete variables (e.g. Ising spins) is a notoriously difficult problem, that can be tackled only under some approximation. Recently a novel variational approach to solve the…
This paper investigates the problem of dynamical sampling for graph signals influenced by a constant source term. We consider signals evolving over time according to a linear dynamical system on a graph, where both the initial state and the…
We study non-terminating graph rewriting models, whose local rules are applied non-deterministically -- and yet enjoy a strong form of determinism, namely space-time determinism. Of course in the case of terminating computation it is…
An efficient microcanonical dynamics has been recently introduced for Ising spin models embedded in a generic connected graph even in the presence of disorder i.e. with the spin couplings chosen from a random distribution. Such a dynamics…
We consider the equilibrium dynamics of Ising spin models with multi-spin interactions on sparse random graphs (Bethe lattices). Such models undergo a mean field glass transition upon increasing the graph connectivity or lowering the…
We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…
Many optimization problems can be naturally represented as (hyper) graphs, where vertices correspond to variables and edges to tasks, whose cost depends on the values of the adjacent variables. Capitalizing on the structure of the graph,…
The Ising spin glass in two dimensions exhibits rich behavior with subtle differences in the scaling for different coupling distributions. We use recently developed mappings to graph-theoretic problems together with highly efficient…
We introduce a general class of mean-field-like spin systems with random couplings that comprises both the Ising model on inhomogeneous dense random graphs and the randomly diluted Hopfield model. We are interested in quantitative estimates…
A disordered spin glass model where both static and dynamical properties depend on macroscopic magnetizations is presented. These magnetizations interact via random couplings and, therefore, the typical quenched realization of the system…
In the graph exploration problem, a team of mobile computational entities, called agents, arbitrarily positioned at some nodes of a graph, must cooperate so that each node is eventually visited by at least one agent. In the literature, the…
We review recent numerical progress in the study of finite dimensional strongly disordered magnetic systems like spin glasses and random field systems. In particular we report in some details results for the critical properties and the…
We investigate the phase diagram of a mixed spin-1/2--spin-1 Ising system in the presence of quenched disordered anisotropy. We carry out a mean-field and a standard self-consistent Bethe--Peierls calculation. Depending on the amount of…
If we have a system of binary variables and we measure the pairwise correlations among these variables, then the least structured or maximum entropy model for their joint distribution is an Ising model with pairwise interactions among the…
The full replica symmetry breaking free energy of the Ising spin glass on random regular graphs is given by the solutions of two auxiliary variational problems inside a global (physical) variational problem on the order parameter. In this…
In this work, we consider a parameterized Ising model with long-range symmetric pairwise interactions on a network of spin $\frac{1}{2}$ particles. The system is designed with symmetric dynamics, allowing for the reduction of the state…
We analyze the random sequential dynamics of a message passing algorithm for Ising models with random interactions in the large system limit. We derive exact results for the two-time correlation functions and the speed of convergence. The…
In this paper we study the problem of dynamically maintaining graph properties under batches of edge insertions and deletions in the massively parallel model of computation. In this setting, the graph is stored on a number of machines, each…
The vast amounts of data used in social, business or traffic networks, biology and other natural sciences are often managed in graph-based data sets, consisting of a few thousand up to billions and trillions of vertices and edges,…
Dualization is a key discrete enumeration problem. It is not known whether or not this problem is polynomial-time solvable. Asymptotically optimal dualization algorithms are the fastest among the known dualization algorithms, which is…