Related papers: Graphical Representations and Worm Algorithms for …
Various topics related to the $O(N)$ model in one spacetime dimension (i.e. ordinary quantum mechanics) are considered. The focus is on a pedagogical presentation of quantum field theory methods in a simpler context where many exact results…
In this work, we study the trade-off between the running time of approximation algorithms and their approximation guarantees. By leveraging a structure of the `hard' instances of the Arora-Rao-Vazirani lemma [JACM'09], we show that the…
The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge…
Nonreversible Markov chains can outperform reversible chains in the Markov chain Monte Carlo method. Lifting is a versatile approach to introducing net stochastic flow in state space and constructing a nonreversible Markov chain. We present…
We determine the spaces of states of the two-dimensional $O(n)$ and $Q$-state Potts models with generic parameters $n,Q\in \mathbb{C}$ as representations of their known symmetry algebras. While the relevant representations of the conformal…
In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an…
We consider fractal curves in two-dimensional $Z_N$ spin lattice models. These are N states spin models that undergo a continuous ferromagnetic-paramagnetic phase transition described by the ZN parafermionic field theory. The main…
An orthogonal representation of a graph is an assignment of nonzero real vectors to its vertices such that distinct non-adjacent vertices are assigned to orthogonal vectors. We prove general lower bounds on the dimension of orthogonal…
We provide universally-optimal distributed graph algorithms for $(1+\varepsilon)$-approximate shortest path problems including shortest-path-tree and transshipment. The universal optimality of our algorithms guarantees that, on any $n$-node…
In this paper we consider graph algorithms in models of computation where the space usage (random accessible storage, in addition to the read only input) is sublinear in the number of edges $m$ and the access to input data is constrained.…
We present an algorithm in which the all-order strong coupling expansion of the Abelian U(1) gauge theory with Wilson plaquette action is sampled. In addition to the vacuum closed surface graphs of the partition function we propose to also…
In this paper, we study the controllability properties and the Lie algebra structure of networks of particles with spin immersed in an electro-magnetic field. We relate the Lie algebra structure to the properties of a graph whose nodes…
We develop a geometric representation for the ground state of the spin-1/2 quantum XXZ ferromagnetic chain in terms of suitably weighted random walks in a two-dimensional lattice. The path integral model so obtained admits a genuine…
A bipartite graph $G=(U,V,E)$ is convex if the vertices in $V$ can be linearly ordered such that for each vertex $u\in U$, the neighbors of $u$ are consecutive in the ordering of $V$. An induced matching $H$ of $G$ is a matching such that…
We investigate a kinetic Ising model with several single-spin flip dynamics (including Metropolis and heat-bath) on quenched and annealed random regular graphs. As expected, on the quenched structures all proposed algorithms reproduce the…
A graph $G$ is said to be a $(k,\ell)$-graph if its vertex set can be partitioned into $k$ independent sets and $\ell$ cliques. It is well established that the recognition problem for $(k,\ell)$-graphs is NP-complete whenever $k \geq 3$ or…
In this article, we have employed Monte Carlo simulations to study the Ising model on a two-dimensional additive small-world network (A-SWN). The system model consists of a LxL square lattice where each site of the lattice is occupied for a…
We present a general strategy to extend quantum cluster algorithms for S=1/2 spin systems, such as the loop algorithm, to systems with arbitrary size of spins. In general, the partition function of a high-S spin system is represented in…
Graphs are useful to interpret widely used image processing methods, e.g., bilateral filtering, or to develop new ones, e.g., kernel based techniques. However, simple graph constructions are often used, where edge weight and connectivity…
We present a distributed randomized algorithm finding Minimum Spanning Tree (MST) of a given graph in O(1) rounds, with high probability, in the Congested Clique model. The input graph in the Congested Clique model is a graph of n nodes,…