Related papers: Graphical Representations and Worm Algorithms for …
Optimal control in general, and flatness-based control in particular, of robotic arms necessitate to compute the first and second time derivatives of the joint torques/forces required to achieve a desired motion. In view of the required…
Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…
We report lattice simulations of $\phi^4_2$ and $O(N)\,\phi^4$ models, performed by means of a Monte Carlo method based on the all-order strong coupling expansion (worm algorithm). The investigation of the non-perturbative features of the…
We prove Griffiths inequalities for the $O(N)$-spin model with inhomogeneous coupling constants and external magnetic field for any $N\geq 2$. This is achieved by using a representation of $O(N)$-spins in terms of random paths that reduces…
We study a two-parameter family of quantum spin systems on the complete graph, which is the most general model invariant under the complex orthogonal group. In spin $S=\frac{1}{2}$ it is equivalent to the XXZ model, and in spin $S=1$ to the…
We investigate in some detail an alternative simulation strategy for lattice field theory based on the so-called worm algorithm introduced by Prokof'ev and Svistunov in 2001. It amounts to stochastically simulating the strong coupling…
We study the O(3) sigma model in $D=2$ on the lattice with a Boltzmann weight linearized in $\beta$ on each link. While the spin formulation now suffers from a sign-problem the equivalent loop model remains positive and becomes particularly…
We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the…
We study the following geometric representation problem: Given a graph whose vertices correspond to axis-aligned rectangles with fixed dimensions, arrange the rectangles without overlaps in the plane such that two rectangles touch if the…
We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an $n$-vertex planar graph and two planar straight-line drawings of the graph…
Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…
The exact solution of the Ising model on the complete graph (CG) provides an important, though mean-field, insight for the theory of continuous phase transitions. Besides the original spin, the Ising model can be formulated in the…
How to efficiently represent a graph in computer memory is a fundamental data structuring question. In the present paper, we address this question from a combinatorial point of view. A representation of an $n$-vertex graph $G$ is called…
The current best practice for computing optimal transport (OT) is via entropy regularization and Sinkhorn iterations. This algorithm runs in quadratic time as it requires the full pairwise cost matrix, which is prohibitively expensive for…
We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…
We study three possible ways to circumvent the sign problem in the O(3) nonlinear sigma model in 1+1 dimensions. We compare the results of the worm algorithm to complex Langevin and multiparameter reweighting. Using the worm algorithm, the…
We reformulate the O(N) sigma model as a loop model whose configurations are the all-order strong coupling graphs of the original model. The loop configurations are represented by a pointer list in the computer and a Monte Carlo update…
A worm algorithm is proposed for the two-dimensional spin glasses. The method is based on a low-temperature expansion of the partition function. The low-temperature configurations of the spin glass on square lattice can be viewed as strings…
Circle graphs are the intersection graphs of chords in a circle. This paper presents the first sub-quadratic recognition algorithm for the class of circle graphs. Our algorithm is O(n + m) times the inverse Ackermann function, {\alpha}(n +…
We present a fast, hierarchical, and adaptive algorithm for Metropolis Monte Carlo simulations of systems with long-range interactions that reproduces the dynamics of a standard implementation exactly, i.e., the generated configurations and…