Related papers: The simplest nearest-neighbor spin system on regul…
One-flip stable configurations of an Ising-model on a random graph with fluctuating connectivity are examined. In order to perform the quenched average of the number of stable configurations we introduce a global order-parameter function…
We study estimates of the Green's function in $\mathbb{R}^d$ with $d \ge 2$, for the linear second order elliptic equation in divergence form with variable uniformly elliptic coefficients. In the case $d \ge 3$, we obtain estimates on the…
We study the off equilibrium dynamics of a mean field disordered systems which can be interpreted both as a long range interaction spin glass and as a particle in a random potential. The statics of this problem is well known and exhibits a…
Kinetically constrained spin models are known to exhibit dynamical behavior mimicking that of glass forming systems. They are often understood as coarse-grained models of glass formers, in terms of some "mobility" field. The identity of…
The requirement that packings of hard particles, arguably the simplest structural glass, cannot be compressed by rearranging their network of contacts is shown to yield a new constraint on their microscopic structure. This constraint takes…
We discuss the mean-field theory of spin-glass models with frustrated long-range random spin exchange. We analyze the reasons for breakdown of the simple mean-field theory of Sherrington and Kirkpatrick. We relate the replica-symmetry…
We establish the conditions under which scalable spin squeezing can be achieved in interacting spin ensembles embedded in arbitrary, inhomogeneous graph geometries. We identify two different forms of squeezing: OAT-like scalable squeezing…
We investigate a general class of models for swarming/self-collective behaviour in domains with boundaries. The model is expressed as a stochastic system of interacting particles subject to both reflecting boundary condition and common…
We study the problem of ensemble equivalence in spin systems with short-range interactions under the existence of a first-order phase transition. The spherical model with nonlinear nearest-neighbour interactions is solved exactly both for…
We argue that complex systems must possess long range correlations and illustrate this idea on the example of the mean field spin glass model. Defined on the complete graph, this model has no genuine concept of distance, but the long range…
In this paper, we study the differential inclusion associated to the minimal surface system for two-dimensional graphs in $\mathbb{R}^{2 + n}$. We prove regularity of $W^{1,2}$ solutions and a compactness result for approximate solutions of…
We study the minimum dominating set problem as a representative combinatorial optimization challenge with a global topological constraint. The requirement that the backbone induced by the vertices of a dominating set should be a connected…
The gauge theory of spin glasses and statistical-mechanical formulation of error-correcting codes are reviewed with an emphasis on their similarities. For the gauge theory, we explain the functional identities on dynamical autocorrelation…
Given a graph and a subset of its nodes, referred to as source nodes, the minimum broadcast problem asks for the minimum number of steps in which a signal can be transmitted from the sources to all other nodes in the graph. In each step,…
Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems. A wide class of random graph ensembles characterized by an arbitrary degree distribution is discussed with some theoretical frameworks.…
Equilibrium properties of long-range interacting systems on lattices are investigated. There was a conjecture by Cannas et. al. that the mean-field theory is exact for spin systems with non-additive long-range interactions. This is called…
Persistent currents flowing through disordered mesoscopic rings threaded by a magnetic flux are investigated. Models of fermions with on-site interactions (Hubbard model) or models of spinless fermions with nearest neighbor interactions are…
We consider a family of compact manifolds which shrinks with respect to an appropriate parameter to a graph. The main result is that the spectrum of the Laplace-Beltrami operator converges to the spectrum of the (differential) Laplacian on…
Subgraph complementation is an operation that toggles all adjacencies inside a selected vertex set. Given a graph \(G\) and a target class \(\mathcal{C}\), the Minimum Subgraph Complementation problem asks for a minimum-size vertex set…
We define a general class of network formation models, Statistical Exponential Random Graph Models (SERGMs), that nest standard exponential random graph models (ERGMs) as a special case. We provide the first general results on when these…