Related papers: Vertex cover problem studied by cavity method: Ana…
We present a mapping of dynamical graphs and, in particular, the graphs used in the Quantum Graphity models for emergent geometry, into an Ising hamiltonian on the line graph of a complete graph with a fixed number of vertices. We use this…
We discuss the finite-size scaling of the ferromagnetic Ising model on random regular graphs. These graphs are locally tree-like, and in the limit of large graphs, the Bethe approximation gives the exact free energy per site. In the…
We consider the Ising model on the two-dimensional square lattice where on each horizontal line, called "layer", the interaction is given by a ferromagnetic Kac potential with coupling strength $J_\gamma(x,y)=\gamma J(\gamma(x-y))$, where…
A zero temperature dynamics of Ising spin glasses and ferromagnets on random graphs of finite connectivity is considered, like granular media these systems have an extensive entropy of metastable states. We consider the problem of what…
Using T=0 Monte Carlo and simulated annealing simulation, we study the energy relaxation of ferromagnetic Ising and Potts models on random graphs. In addition to the expected exponential decay to a zero energy ground state, a range of…
We study the ground state which minimizes a Gross-Pitaevskii energy with general non-radial trapping potential, under the unit mass constraint, in the Thomas-Fermi limit where a small parameter tends to 0. This ground state plays an…
We consider the stochastic dynamics of Ising ferromagnets (either pure or random) near zero temperature. The master equation satisfying detailed balance can be mapped onto a quantum Hamiltonian which has an exact zero-energy ground state…
In this paper, we give simple optimal lower bounds on the one-way two-party communication complexity of approximate Maximum Matching and Minimum Vertex Cover with deletions. In our model, Alice holds a set of edges and sends a single…
We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Omega(n/psi(n)) for some function psi(n)=omega(1) of the instance size. We design new…
It has been known for a long time that the ground state problem of random magnets, e.g. random field Ising model (RFIM), can be mapped onto the max-flow/min-cut problem of transportation networks. I build on this approach, relying on the…
The ground state critical properties of the Random Field Ising Model (RFIM) on the diamond hierarchical lattice are investigated via a combining method encompassing real space renormalization group and an exact recurrence procedure. The…
We consider the Ising model on $\mathbb Z\times \mathbb Z$ where on each horizontal line $\{(x,i), x\in \mathbb Z\}$, the interaction is given by a ferromagnetic Kac potential with coupling strength $J_\gamma(x,y)\sim \gamma J(\gamma…
The zero-temperature critical state of the two-dimensional gauge glass model is investigated. It is found that low-energy vortex configurations afford a simple description in terms of gapless, weakly interacting vortex-antivortex pair…
The vertex cover problem is a fundamental and widely studied combinatorial optimization problem. It is known that its standard linear programming relaxation is integral for bipartite graphs and half-integral for general graphs. As a…
We investigate various versions of multi-dimensional systems involving many species, modeling aggregation phenomena through nonlocal interaction terms. We establish a rigorous connection between kinetic and macroscopic descriptions by…
A wide class of problems in combinatorics, computer science and physics can be described along the following lines. There are a large number of variables ranging over a finite domain that interact through constraints that each bind a few…
The low-lying spectrum of the three-dimensional Ising model is investigated numerically; we made use of an equivalence between the excitation gap and the reciprocal correlation length. In the broken-symmetry phase, the magnetic excitations…
We propose algorithms, based on the multi-scale entanglement renormalization ansatz, to obtain the ground state of quantum critical systems in the presence of boundaries, impurities, or interfaces. By exploiting the theory of minimal…
The L-distance (especially the 2-distance) minimal dominating set (MDS) problem is widely considered in various dominating set problems. Recently, we studied the regular dominating set problem using the cavity method and developed two…
A periodic Ising model is one endowed with interactions that are invariant under translations of members of a full-rank sublattice $\mathfrak{L}$ of $\mathbb{Z}^2$. We give an exact, quantitative description of the critical temperature,…