相关论文: Graphical Representations and Worm Algorithms for …

An ortho-polygon visibility representation $\Gamma$ of a $1$-plane graph $G$ (OPVR of $G$) is an embedding preserving drawing that maps each vertex of $G$ to a distinct orthogonal polygon and each edge of $G$ to a vertical or horizontal…

We consider Heterotic string theories in the DLCQ. We derive that the matrix model of the Spin(32)/$Z_2$ Heterotic theory is the theory living on N D-strings in type I wound on a circle with no Spin(32)/$Z_2$ Wilson line on the circle. This…

Oscillator Ising machines (OIMs) are networks of coupled oscillators that seek the minimum energy state of an Ising model. Since many NP-hard problems are equivalent to the minimization of an Ising Hamiltonian, OIMs have emerged as a…

Motivated by the increasing need to understand the algorithmic foundations of distributed large-scale graph computations, we study a number of fundamental graph problems in a message-passing model for distributed computing where $k \geq 2$…

Besides its original spin representation, the Ising model is known to have the Fortuin-Kasteleyn (FK) bond and loop representations, of which the former was recently shown to exhibit two upper critical dimensions $(d_c=4,d_p=6)$. Using a…

Orthogonal graph drawings are used in applications such as UML diagrams, VLSI layout, cable plans, and metro maps. We focus on drawing planar graphs and assume that we are given an \emph{orthogonal representation} that describes the desired…

Graph-based nearest neighbor search methods have seen a surge of popularity in recent years, offering state-of-the-art performance across a wide variety of applications. Central to these methods is the task of constructing a sparse…

A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to…

We study the conformal bootstrap for 3D CFTs with O(N) global symmetry. We obtain rigorous upper bounds on the scaling dimensions of the first O(N) singlet and symmetric tensor operators appearing in the $\phi_i \times \phi_j$ OPE, where…

We prove rapid mixing of the Prokofiev-Svistunov (or worm) algorithm for the zero-field ferromagnetic Ising model, on all finite graphs and at all temperatures. As a corollary, we show how to rigorously construct simple and efficient…

We introduce new fast canonical local algorithms for discrete and continuous spin systems. We show that for a broad selection of spin systems they compare favorably to the known ones except for the Ising +/-1 spins. The new procedures use…

Three-dimensional N-vector spin models may define universality classes for such diverse phenomena as i) the superfluid transition in liquid helium (currently investigated in the micro-gravity environment of the Space Shuttle) and ii) the…

We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any graph on n vertices into an O(n\log n)-edge graph on the same…

We investigate the computational power of the recently introduced class of isometric tensor network states (isoTNSs), which generalizes the isometric conditions of the canonical form of one-dimensional matrix-product states to tensor…

This paper gives simple distributed algorithms for the fundamental problem of computing graph distances in the Congested Clique model. One of the main components of our algorithms is fast matrix multiplication, for which we show an…

We study the non-perturbative renormalization group flow of the nonlinear O(N) sigma model in two and three spacetime dimensions using a scheme that combines an effective local Hybrid Monte Carlo update routine, blockspin transformations…

We argue that the N=1 higher-spin theory on AdS4 is holographically dual to the N=1 supersymmetric critical O(N) vector model in three dimensions. This appears to be a special form of the AdS/CFT correspondence in which both regular and…

We give efficient distributed algorithms for the minimum vertex cover problem in bipartite graphs in the CONGEST model. From K\H{o}nig's theorem, it is well known that in bipartite graphs the size of a minimum vertex cover is equal to the…

In the conventional formulation of N=1 supersymmetry, a vector multiplet is supposed to be in the adjoint representation of a given gauge group. We present a new formulation with a vector multiplet in the non-adjoint representation of SO(N)…

Recently, Kawarabayashi and Thorup presented the first deterministic edge-connectivity recognition algorithm in near-linear time. A crucial step in their algorithm uses the existence of vertex subsets of a simple graph $G$ on $n$ vertices…