Related papers: Graphical Representations and Worm Algorithms for …
We consider a gauged O(n) spin model, n >= 2, in one dimension which contains both the pure O(n) and RP(n-1) models and which interpolates between them. We show that this model is equivalent to the non-interacting sum of the O(n) and Ising…
We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist $\tau =2$ local operator insertions corresponding to spin $N$. They contribute to the massive operator matrix elements in QCD describing…
Representations of multivariate functions with low-dimensional functions that depend on subsets of original coordinates (corresponding of different orders of coupling) are useful in quantum dynamics and other applications, especially where…
Given a persistence diagram with $n$ points, we give an algorithm that produces a sequence of $n$ persistence diagrams converging in bottleneck distance to the input diagram, the $i$th of which has $i$ distinct (weighted) points and is a…
We calculate the dynamic critical exponent for the Niedermayer algorithm applied to the two-dimensional Ising and XY models, for various values of the free parameter $E_0$. For $E_0=-1$ we regain the Metropolis algorithm and for $E_0=1$ we…
We study the dynamical simulation of open quantum spin chain with nearest neighboring coupling, where each spin in the chain is associated with a harmonic bath. This is an extension of our previous work [G. Wang and Z. Cai, J. Chem. Theory…
A $t$-ruling set of a graph $G = (V, E)$ is a vertex-subset $S \subseteq V$ that is independent and satisfies the property that every vertex $v \in V$ is at a distance of at most $t$ from some vertex in $S$. A \textit{maximal independent…
In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a variety of computational models including dynamic graph streams (where the input graph is defined by a sequence of edge/hyperedge insertions…
We extend our work for compression of currents and varifolds to a compression algorithm for the embedded normal cycles representation of shape, restricted to the constant normal kernel case, using the Nystrom approximation in Reproducing…
We formulate a new geometrical string on the euclidean lattice. It is possible to find such spin systems with local interaction which reproduce the same surface dynamics.In the three-dimensional case this spin system is a usual Ising…
A spin system is a framework in which the vertices of a graph are assigned spins from a finite set. The interactions between neighbouring spins give rise to weights, so a spin assignment can also be viewed as a weighted graph homomorphism.…
We describe approximation algorithms in Linial's classic LOCAL model of distributed computing to find maximum-weight matchings in a hypergraph of rank $r$. Our main result is a deterministic algorithm to generate a matching which is an…
A two-replica graphical representation and associated cluster algorithm is described that is applicable to ferromagnetic Ising systems with arbitrary fields. Critical points are associated with the percolation threshold of the graphical…
We define a new large $N$ limit for general $\text{O}(N)^{R}$ or $\text{U}(N)^{R}$ invariant tensor models, based on an enhanced large $N$ scaling of the coupling constants. The resulting large $N$ expansion is organized in terms of a…
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…
We define in this paper a class of three indices tensor models, endowed with $O(N)^{\otimes 3}$ invariance ($N$ being the size of the tensor). This allows to generate, via the usual QFT perturbative expansion, a class of Feynman tensor…
Modeling complex systems, like neural networks, simple liquids or flocks of birds, often works in reverse to textbook approaches: given data for which averages and correlations are known, we try to find the parameters of a given model…
A graphical representation of supersymmetry is presented. It clearly expresses the chiral flow appearing in SUSY quantities, by representing spinors by {\it directed lines} (arrows). The chiral suffixes are expressed by the directions (up,…
We provide the eigenfunctions for a quantum chain of $N$ conformal spins with nearest-neighbor interaction and open boundary conditions in the irreducible representation of $SO(1,5)$ of scaling dimension $\Delta = 2 - i \lambda$ and spin…
Given a graph of which the n vertices form a regular two-dimensional grid, and in which each (possibly weighted and/or directed) edge connects a vertex to one of its eight neighbours, the following can be done in O(scan(n)) I/Os, provided M…