Searcharxiv⌕ Search

arXiv subjects

Heng Guo

Publications and source records attributed to Heng Guo.

At least 127 records · Page 7Linked to original sources

Uniform Sampling through the Lovász Local Lemma

We propose a new algorithmic framework, called "partial rejection sampling", to draw samples exactly from a product distribution, conditioned on none of a number of bad events occurring. Our framework builds (perhaps surprising) new connections between the variable framework of the Lovász Local Lemma and some classical sampling algorithms such as the "cycle-popping" algorithm for rooted spanning trees. Among other applications, we discover new algorithms to sample satisfying assignments of k-CNF formulas with bounded variable occurrences.

cs.DS↗

Tight bounds for popping algorithms

We sharpen run-time analysis for algorithms under the partial rejection sampling framework. Our method yields improved bounds for: the cluster-popping algorithm for approximating all-terminal network reliability; the cycle-popping algorithm for sampling rooted spanning trees; the sink-popping algorithm for sampling sink-free orientations. In all three applications, our bounds are not only tight in order, but also optimal in constants.

cs.DS↗

Zeros of Holant problems: locations and algorithms

We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases. As a consequence, any non-negative Holant problem on cubic graphs has an efficient approximation algorithm unless the problem is equivalent to approximately counting perfect matchings, a central open problem in the area. This is in sharp contrast to the computational phase transition shown by 2-state spin systems on cubic graphs. Our main technique is the recently established connection between zeros of graph polynomials and approximate counting. We also use the "winding" technique to deduce the second result on cubic graphs.

cs.DS↗

Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems

We give fully polynomial-time approximation schemes (FPTAS) for the partition function of ferromagnetic 2-spin systems in certain parameter regimes. The threshold we obtain is almost tight up to an integrality gap. Our technique is based on the correlation decay framework. The main technical contribution is a new potential function, with which we establish a new kind of spatial mixing.

cs.DS↗

Cross and joint ordinal partition transition networks for multivariate time series analysis

We propose to construct cross and joint ordinal pattern transition networks from multivariate time series for two coupled systems, where synchronizations are often present. In particular, we focus on phase synchronization, which is one of prototypical scenarios in dynamical systems. We systematically show that cross and joint ordinal patterns transition networks are sensitive to phase synchronization. Furthermore, we find that some particular missing ordinal patterns play crucial roles in forming the detailed structures in the parameter space whereas the calculations of permutation entropy measures often do not. We conclude that cross and joint ordinal partition transition network approaches provide complementary insights to the traditional symbolic analysis of synchronization transitions.

nlin.CD↗

Prediction of two-dimensional nodal-line semimetal in a carbon nitride covalent network

Carbon nitride compounds have emerged recently as a prominent member of 2D materials beyond graphene. The experimental realizations of 2D graphitic carbon nitride g-C$_3$N$_4$, nitrogenated holey grahpene C$_2$N, polyaniline C$_3$N have shown their promising potential in energy and environmental applications. In this work, we predict a new type of carbon nitride network with a C$_9$N$_4$ stoichiometry from first principle calculations. Unlike common C-N compounds and covalent organic frameworks (COFs), which are typically insulating, surprisingly C$_9$N$_4$ is found to be a 2D nodal-line semimetal (NLSM). The nodal line in C$_9$N$_4$ forms a closed ring centered at $Γ$ point, which originates from the pz orbitals of both C and N. The linear crossing happens right at Fermi level contributed by two sets of dispersive Kagome and Dirac bands, which is robust due to negligible spin-orbital-coupling (SOC) in C and N. Besides, it is revealed that the formation of nodal ring is of accidental band degeneracy in nature induced by the chemical potential difference of C and N, as validated by a single orbital tight-binding model, rather than protected by crystal in-plane mirror symmetry or band topology. Interestingly, a new structure of nodal line, i.e., nodal-cylinder, is found in momentum space for AA-stacking C$_9$N$_4$. Our results imply possible functionalization for a novel metal-free C-N covalent network with interesting semimetallic properties.

cond-mat.mtrl-sci↗

A Complete Dichotomy Rises from the Capture of Vanishing Signatures

We prove a complexity dichotomy theorem for Holant problems over an arbitrary set of complex-valued symmetric constraint functions F on Boolean variables. This extends and unifies all previous dichotomies for Holant problems on symmetric constraint functions (taking values without a finite modulus). We define and characterize all symmetric vanishing signatures. They turned out to be essential to the complete classification of Holant problems. The dichotomy theorem has an explicit tractability criterion expressible in terms of holographic transformations. A Holant problem defined by a set of constraint functions F is solvable in polynomial time if it satisfies this tractability criterion, and is #P-hard otherwise. The tractability criterion can be intuitively stated as follows: A set F is tractable if (1) every function in F has arity at most two, or (2) F is transformable to an affine type, or (3) F is transformable to a product type, or (4) F is vanishing, combined with the right type of binary functions, or (5) F belongs to a special category of vanishing type Fibonacci gates. The proof of this theorem utilizes many previous dichotomy theorems on Holant problems and Boolean #CSP. Holographic transformations play an indispensable role as both a proof technique and in the statement of the tractability criterion.

cs.CC↗

Holographic Algorithms Beyond Matchgates

Holographic algorithms introduced by Valiant are composed of two ingredients: matchgates, which are gadgets realizing local constraint functions by weighted planar perfect matchings, and holographic reductions, which show equivalences among problems with different descriptions via certain basis transformations. In this paper, we replace matchgates in the paradigm above by the affine type and the product type constraint functions, which are known to be tractable in general (not necessarily planar) graphs. More specifically, we present polynomial-time algorithms to decide if a given counting problem has a holographic reduction to another problem defined by the affine or product-type functions. Our algorithms also find a holographic transformation when one exists. We further present polynomial-time algorithms of the same decision and search problems for symmetric functions, where the complexity is measured in terms of the (exponentially more) succinct representations. The algorithm for the symmetric case also shows that the recent dichotomy theorem for Holant problems with symmetric constraints is efficiently decidable. Our proof techniques are mainly algebraic, e.g., using stabilizers and orbits of group actions.

cs.DS↗

Layerwise Systematic Scan: Deep Boltzmann Machines and Beyond

For Markov chain Monte Carlo methods, one of the greatest discrepancies between theory and system is the scan order - while most theoretical development on the mixing time analysis deals with random updates, real-world systems are implemented with systematic scans. We bridge this gap for models that exhibit a bipartite structure, including, most notably, the Restricted/Deep Boltzmann Machine. The de facto implementation for these models scans variables in a layerwise fashion. We show that the Gibbs sampler with a layerwise alternating scan order has its relaxation time (in terms of epochs) no larger than that of a random-update Gibbs sampler (in terms of variable updates). We also construct examples to show that this bound is asymptotically tight. Through standard inequalities, our result also implies a comparison on the mixing times.

cs.LG↗

Clifford Gates in the Holant Framework

We show that the Clifford gates and stabilizer circuits in the quantum computing literature, which admit efficient classical simulation, are equivalent to affine signatures under a unitary condition. The latter is a known class of tractable functions under the Holant framework.

cs.CC↗

Spectrum Structure of Fermion on Bloch Branes with Two Scalar-fermion Couplings

It is known that the Bloch brane is generated by an odd scalar field $ϕ$ and an even one $χ$. In order to localize a bulk fermion on the Bloch brane, the coupling between the fermion and scalars should be introduced. { There are two localization mechanisms in the literature, the Yukawa coupling $-η\barΨ F_1(ϕ,χ) Ψ$ and non-Yukawa coupling $λ\bar ΨΓ^M \partial_M F_2(ϕ,χ) γ^5 Ψ$. The Yukawa coupling has been considered.} In this paper, we consider { both couplings between the fermion and the scalars with $F_1=χ^mϕ^{2p+1}$ and $F_2=χ^nϕ^{2q}$}, and investigate the localization and spectrum structure of the fermion on the Bloch brane. { It is found that the} left-handed fermion zero mode can be localized on the Bloch brane under some conditions, and the effective potentials have { rich} structure and may be volcano-like, finite square well-like, and infinite potentials. As a result, the spectrum { consists of} a series of resonant Kaluza-Klein fermions, finite or infinite numbers of bound Kaluza-Klein fermions. { Especially, we find a new feature of the introduction of both couplings: the spectrum for the case of finite square well-like potentials contains discrete quasi-localized and localized massive KK modes simultaneously.

hep-th↗

The complexity of approximating complex-valued Ising and Tutte partition functions

We study the complexity of approximately evaluating the Ising and Tutte partition functions with complex parameters. Our results are partly motivated by the study of the quantum complexity classes BQP and IQP. Recent results show how to encode quantum computations as evaluations of classical partition functions. These results rely on interesting and deep results about quantum computation in order to obtain hardness results about the difficulty of (classically) evaluating the partition functions for certain fixed parameters. The motivation for this paper is to study more comprehensively the complexity of (classically) approximating the Ising and Tutte partition functions with complex parameters. Partition functions are combinatorial in nature and quantifying their approximation complexity does not require a detailed understanding of quantum computation. Using combinatorial arguments, we give the first full classification of the complexity of multiplicatively approximating the norm and additively approximating the argument of the Ising partition function for complex edge interactions (as well as of approximating the partition function according to a natural complex metric). We also study the norm approximation problem in the presence of external fields, for which we give a complete dichotomy when the parameters are roots of unity. Previous results were known just for a few such points, and we strengthen these results from BQP-hardness to #P-hardness. Moreover, we show that computing the sign of the Tutte polynomial is #P-hard at certain points related to the simulation of BQP. Using our classifications, we then revisit the connections to quantum computation, drawing conclusions that are a little different from (and incomparable to) ones in the quantum literature, but along similar lines.

cs.CC↗

Random cluster dynamics for the Ising model is rapidly mixing

We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at $q=2$ is bounded by a polynomial in the size of the underlying graph. As a consequence, the Swendsen-Wang algorithm for the ferromagnetic Ising model at any temperature has the same polynomial mixing time bound.

cs.DS↗

New localization mechanism and Hodge duality for $q-$form field

In this paper, we investigate the problem of localization and the Hodge duality for a $q-$form field on a $p-$brane with codimension one. By a general Kaluza-Klein (KK) decomposition without gauge fixing, we obtain two Schrödinger-like equations for two types of KK modes of the bulk $q-$form field, which determine the localization and mass spectra of these KK modes. It is found that there are two types of zero modes (the $0-$level modes): a $q-$form zero mode and a $(q-1)-$form one, which cannot be localized on the brane at the same time. For the $n-$level KK modes, there are two interacting KK modes, a massive $q-$form KK mode and a massless $(q-1)-$form one. By analyzing gauge invariance of the effective action and choosing a gauge condition, the $n-$level massive $q-$form KK mode decouples from the $n-$level massless $(q-1)-$form one. It is also found that the Hodge duality in the bulk naturally becomes two dualities on the brane. The first one is the Hodge duality between a $q-$form zero mode and a $(p-q-1)-$form one, or between a $(q-1)-$form zero mode and a $(p-q)-$form one. The second duality is between two group KK modes: one is an $n-$level massive $q-$form KK mode with mass $m_n$ and an $n-$level massless $(q-1)-$form mode; another is an $n-$level $(p-q)-$form one with the same mass $m_n$ and an $n-$level massless $(p-q-1)-$form mode. Because of the dualities, the effective field theories on the brane for the KK modes of the two dual bulk form fields are physically equivalent.

hep-th↗

#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Nonuniqueness Region

Counting independent sets on bipartite graphs (#BIS) is considered a canonical counting problem of intermediate approximation complexity. It is conjectured that #BIS neither has an FPRAS nor is as hard as #SAT to approximate. We study #BIS in the general framework of two-state spin systems on bipartite graphs. We define two notions, nearly-independent phase-correlated spins and unary symmetry breaking. We prove that it is #BIS-hard to approximate the partition function of any 2-spin system on bipartite graphs supporting these two notions. As a consequence, we classify the complexity of approximating the partition function of antiferromagnetic 2-spin systems on bounded-degree bipartite graphs.

cs.CC↗

A Holant Dichotomy: Is the FKT Algorithm Universal?

We prove a complexity dichotomy for complex-weighted Holant problems with an arbitrary set of symmetric constraint functions on Boolean variables. This dichotomy is specifically to answer the question: Is the FKT algorithm under a holographic transformation a \emph{universal} strategy to obtain polynomial-time algorithms for problems over planar graphs that are intractable in general? This dichotomy is a culmination of previous ones, including those for Spin Systems, Holant, and #CSP. A recurring theme has been that a holographic reduction to FKT is a universal strategy. Surprisingly, for planar Holant, we discover new planar tractable problems that are not expressible by a holographic reduction to FKT. In previous work, an important tool was a dichotomy for #CSP^d, which denotes #CSP where every variable appears a multiple of d times. However its proof violates planarity. We prove a dichotomy for planar #CSP^2. We apply this planar #CSP^2 dichotomy in the proof of the planar Holant dichotomy. As a special case of our new planar tractable problems, counting perfect matchings (#PM) over k-uniform hypergraphs is polynomial-time computable when the incidence graph is planar and k >= 5. The same problem is #P-hard when k=3 or k=4, which is also a consequence of our dichotomy. When k=2, it becomes #PM over planar graphs and is tractable again. More generally, over hypergraphs with specified hyperedge sizes and the same planarity assumption, #PM is polynomial-time computable if the greatest common divisor of all hyperedge sizes is at least 5.

cs.CC↗

Localization and quasilocalization of spin-$1/2$ fermion field on two-field thick braneworld

Localization of a spin-$1/2$ fermion on the braneworld is an important and interesting problem. It is well known that a five-dimensional free massless fermion $Ψ$ minimally coupled to gravity cannot be localized on the Randall-Sundrum braneworld. In order to trap such a fermion, the coupling between the fermion and bulk scalar fields should be introduced. In this paper, localization and quasilocalization of a bulk fermion on the thick braneworld generated by two scalar fields (a kink scalar $ϕ$ and a dilaton scalar $π$) are investigated. Two types of couplings between the fermion and two scalars are considered. One coupling is the usual Yukawa coupling $-η\barΨϕΨ$ between the fermion and kink scalar, another one is $λ\barΨΓ^{M}\partial_{M}πγ^{5}Ψ$ between the fermion and dilaton scalar. The left-chiral fermion zero mode can be localized on the brane, and both the left- and right-chiral fermion massive Kaluza-Klein modes may be localized or quasilocalized. Hence the four-dimensional massless left-chiral fermion and massive Dirac fermions, whose lifetime is infinite or finite, can be obtained on the brane.

hep-th↗

Localization of $q-$form fields on $AdS_{p+1}$ branes

In this paper, we investigate localization of a free massless $q-$form bulk field on thin and thick $AdS_{p+1}$ branes with codimension one. It is found that the zero mode of the $q-$form field with $q>(p+2)/2$ can be localized on the thin negative tension brane, which is different from the flat brane case given in [JHEP 10 (2012) 060]. For the thick $AdS_{p+1}$ branes, the $q-$form field with $q>(p+2)/2$ also has a localized zero mode under some conditions. Furthermore, we find that there are massive bound KK modes of the $q-$form field, which are localized on this type $p-$branes.

hep-th↗