Related papers: Rooted Spiral Trees on Hyper-cubical lattices
As well known the rotation distance D(S,T) between two binary trees S, T of n vertices is the minimum number of rotations of pairs of vertices to transform S into T. We introduce the new operation of chain rotation on a tree, involving two…
Inspired by the seminal works of Khuller et al. (STOC 1994) and Chan (SoCG 2003) we study the bottleneck version of the Euclidean bounded-degree spanning tree problem. A bottleneck spanning tree is a spanning tree whose largest edge-length…
We present a fast Monte-Carlo algorithm for simulating epitaxial surface growth, based on the continuous-time Monte-Carlo algorithm of Bortz, Kalos and Lebowitz. When simulating realistic growth regimes, much computational time is consumed…
We present a Monte Carlo study of the bond and site directed (oriented) percolation models in $(d+1)$ dimensions on simple-cubic and body-centered-cubic lattices, with $2 \leq d \leq 7$. A dimensionless ratio is defined, and an analysis of…
We present a high-statistics Monte Carlo determination of the exponent gamma for self-avoiding walks on a Manhattan lattice in two dimensions. A conservative estimate is $\gamma \gtapprox 1.3425(3)$, in agreement with the universal value…
We perform Monte Carlo simulations to determine the average excluded area $<A_{ex}>$ of randomly oriented squares, randomly oriented widthless sticks and aligned squares in two dimensions. We find significant differences between our results…
Recently, Hegerfeld and Kratsch [ESA 2023] obtained the first tight algorithmic results for hard connectivity problems parameterized by clique-width. Concretely, they gave one-sided error Monte-Carlo algorithms that given a…
We have developed an improved algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 90. Analysis of the resulting series yields very accurate estimates of the connective…
The dual formulation of the compact U(1) lattice gauge theory in three spacetime dimensions allows to finely study the squared width and the profile of the confining flux tube on a wide range of physical interquark distances. The results…
Pure lattice SU(2) Yang-Mills theory in five dimensions is considered, where an extra dimension is compactified on a circle. Monte-Carlo simulations indicate that the theory possesses a continuum limit with a non-vanishing string tension if…
We study a maximization problem for geometric network design. Given a set of $n$ compact neighborhoods in $\mathbb{R}^d$, select a point in each neighborhood, so that the longest spanning tree on these points (as vertices) has maximum…
We carry out a high-precision simulation of the two-dimensional $SU(3)$ principal chiral model at correlation lengths $\xi$ up to $\sim 4 \times 10^5$, using a multi-grid Monte Carlo (MGMC) algorithm and approximately one year of Cray C-90…
Monte Carlo Tree Search is a popular method for solving decision making problems. Faster implementations allow for more simulations within the same wall clock time, directly improving search performance. To this end, we present an…
Given a graph $G=(V,E)$ with non-negative real edge lengths and an integer parameter $k$, the Min-Max k-Tree Cover problem seeks to find a set of at most $k$ subtrees of $G$, such that the union of the trees is the vertex set $V$. The…
We study the Restricted Solid on Solid (RSOS) model for surface growth in spatial dimension d=4 by means of a multi-surface coding technique that allows to analyze samples to analyze samples of size up to $256^4$ in the steady state regime.…
We introduce the \emph{leaf-excluded} percolation model, which corresponds to independent bond percolation conditioned on the absence of leaves (vertices of degree one). We study the leaf-excluded model on the square and simple-cubic…
We study the growth rate of the hard squares lattice gas, equivalent to the number of independent sets on the square lattice, and two related models - non-attacking kings and read-write isolated memory. We use an assortment of techniques…
We study self-avoiding walks on restricted square lattices, more precisely on the lattice strips $\mathbb{Z} \times \{-1,0,1\}$ and $\mathbb{Z}\times \{-1,0,1,2\}$. We obtain the value of the connective constant for the $\mathbb{Z} \times…
The quadratic minimum spanning tree problem and its variations such as the quadratic bottleneck spanning tree problem, the minimum spanning tree problem with conflict pair constraints, and the bottleneck spanning tree problem with conflict…
The classical branch-and-bound algorithm for the integer feasibility problem has exponential worst case complexity. We prove that it is surprisingly efficient on reformulated problems, in which the columns of the constraint matrix are…