Related papers: Correlation Decay up to Uniqueness in Spin Systems
A two-state spin system is specified by a 2 x 2 matrix A = {A_{0,0} A_{0,1}, A_{1,0} A_{1,1}} = {\beta 1, 1 \gamma} where \beta, \gamma \ge 0. Given an input graph G=(V,E), the partition function Z_A(G) of a system is defined as Z_A(G) =…
For spin systems, such as the $q$-colorings and independent-set models, approximating the partition function in the so-called non-uniqueness region, where the model exhibits long-range correlations, is typically computationally hard for…
Recent results establish for 2-spin antiferromagnetic systems that the computational complexity of approximating the partition function on graphs of maximum degree D undergoes a phase transition that coincides with the uniqueness phase…
Spin asymmetry of the ground states is studied for the trapped spin-degenerate (two-component) gases of the fermionic atoms with the repulsive interaction between different components, and, for large particle number, the asymmetric…
The hard core model in statistical physics is a probability distribution on independent sets in a graph in which the weight of any independent set I is proportional to lambda^(|I|), where lambda > 0 is the vertex activity. We show that…
We study the effect of sublattice symmetry breaking on the electronic, magnetic and transport properties of two dimensional graphene as well as zigzag terminated one and zero dimensional graphene nanostructures. The systems are described…
Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs…
In a two-subband GaAs/AlGaAs two-dimensional electron system, the phase diagram of longitudinal resistivity \rho_xx in density and magnetic field plane exhibits an intriguing structure centered at filling factor \nu = 4 which is strikingly…
We prove that, unless P=NP, there is no polynomial-time algorithm to approximate within some multiplicative constant the average size of an independent set in graphs of maximum degree 6. This is a special case of a more general result for…
We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs…
We show that spin systems with bounded degrees and coupling independence admit fully polynomial time approximation schemes (FPTAS). We design a new recursive deterministic counting algorithm to achieve this. As applications, we give the…
We explore theoretically the density of states (LDOS) probed by an STM tip of 2D systems hosting an adatom and a subsurface impurity,both capacitively coupled to AFM tips and traversed by antiparallel magnetic fields. Two kinds of setups…
We show for a broad class of counting problems, correlation decay (strong spatial mixing) implies FPTAS on planar graphs. The framework for the counting problems considered by us is the Holant problems with arbitrary constant-size domain…
We propose a deterministic algorithm for approximately counting the number of list colorings of a graph. Under the assumption that the graph is triangle free, the size of every list is at least $\alpha \Delta$, where $\alpha$ is an…
Graph coloring is arguably the most exhaustively studied problem in the area of approximate counting. It is conjectured that there is a fully polynomial-time (randomized) approximation scheme (FPTAS/FPRAS) for counting the number of proper…
A finite dynamical system (FDS) is a system of multivariate functions over a finite alphabet, that is typically used to model a network of interacting entities. The main feature of a finite dynamical system is its interaction graph, which…
This work establishes novel optimum mixing bounds for the Glauber dynamics on the Hard-core and Ising models. These bounds are expressed in terms of the local connective constant of the underlying graph $G$. This is a notion of effective…
We establish tight results for rapid mixing of Gibbs samplers for the Ferromagnetic Ising model on general graphs. We show that if \[(d-1)\tanh\beta<1,\] then there exists a constant C such that the discrete time mixing time of Gibbs…
We use group theory to derive the exact analytical expression of the ferromagnetic ground states of the Hubbard model on a complete graph for arbitrary lattice sites f and for arbitrary fillings $N$. We find that for $t>0$ and for $N=f+1$…
We study the hard-core model defined on independent sets of an input graph where the independent sets are weighted by a parameter $\lambda>0$. For constant $\Delta$, previous work of Weitz (2006) established an FPTAS for the partition…