Related papers: The simplest nearest-neighbor spin system on regul…
We address the problem of identifying families of discrete models naturally flowing in continuum limit to relativistic quantum field theories. We call them Dirac graphs. In this work, we require the graphs to obey spectrality property,…
We study the dynamics of a spin-flip model with a mean field interaction. The system is non reversible, spacially inhomogeneous, and it is designed to model social interactions. We obtain the limiting behavior of the empirical averages in…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
We study a graph-theoretic model of interface dynamics called $Competitive\, Erosion$. Each vertex of the graph is occupied by a particle, which can be either red or blue. New red and blue particles are emitted alternately from their…
The spectrum of integrable spin chains are shown to be independent of the ordering of their spins. As an application we introduce defects (local spin inhomogeneities in homogenous chains) in two-boundary spin systems and, by changing their…
We perform a duality transformation that allows one to express the partition function of the d-dimensional Ising model with random nearest neighbor coupling in terms of new spin variables defined on the square plaquettes of the lattice. The…
Simplifications of a result from a prior paper concerning the electric resistance between points in a distance-regular graph are given. In particular, we prove that the maximal resistance between points is bounded by twice the resistance…
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture…
Facilitated or kinetically constrained spin models (KCSM) are a class of interacting particle systems reversible w.r.t. to a simple product measure. Each dynamical variable (spin) is re-sampled from its equilibrium distribution only if the…
In spin glass models one can remove minimization of free energy by some order parameter. One can consider hierarchy of order parameters. It is possible to divide energy among these parts. We can consider relaxation process in glass system…
The aim of this paper is to give a simpler, more usable sufficient condition to the regularity of generic weakly stationary time series. Also, this condition is used to show how regular processes satisfying these sufficient conditions can…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
We present a detailed analysis of the spin models with near-neighbors interactions constructed in our previous paper [Phys. Lett. B 605 (2005) 214] by a suitable generalization of the exchange operator formalism. We provide a complete…
An extensive list of results for the ground state properties of spin glasses on random graphs is presented. These results provide a timely benchmark for currently developing theoretical techniques based on replica symmetry breaking that are…
We analyze the density and size dependence of the relaxation time for kinetically constrained spin models (KCSM) intensively studied in the physical literature as simple models sharing some of the features of a glass transition. KCSM are…
Visibility graphs are spatial interpretations of time series. When derived from the time evolution of physical systems, the graphs associated with such series may exhibit properties that can reflect aspects such as ergodicity, criticality,…
In this work, we begin the study of a new class of dynamical systems determined by interval maps generated by the symbolic action of erasing substitution rules. We do this by discussing in some detail the geometric, analytical, dynamical…
A minimum chain cover (MCC) of a $k$-width directed acyclic graph (DAG) $G = (V, E)$ is a set of $k$ chains (paths in the transitive closure) of $G$ such that every vertex appears in at least one chain in the cover. The state-of-the-art…
The meromorphic functional calculus developed in Part I overcomes the nondiagonalizability of linear operators that arises often in the temporal evolution of complex systems and is generic to the metadynamics of predicting their behavior.…
This paper develops results for the next nearest neighbour Ising model on random graphs. Besides being an essential ingredient in classic models for frustrated systems, second neighbour interactions interactions arise naturally in several…