Related papers: Rooted Spiral Trees on Hyper-cubical lattices
Using off-lattice noise reduction it is possible to estimate the asymptotic properties of diffusion-limited aggregation clusters grown in three dimensions with greater accuracy than would otherwise be possible. The fractal dimension of…
In projective dimension growth results, one bounds the number of rational points of height at most $H$ on an irreducible hypersurface in $\mathbb P^n$ of degree $d>3$ by $C(n)d^2 H^{n-1}(\log H)^{M(n)}$, where the quadratic dependence in…
The growth constant for two-dimensional self-avoiding walks on the honeycomb lattice was conjectured by Nienhuis in 1982, and since that time the corresponding results for the square and triangular lattices have been sought. For the square…
We examine self-avoiding walks in dimensions 4 to 8 using high-precision Monte-Carlo simulations up to length N=16384, providing the first such results in dimensions $d > 4$ on which we concentrate our analysis. We analyse the scaling…
We present Monte Carlo estimates for site and bond percolation thresholds in simple hypercubic lattices with 4 to 13 dimensions. For d<6 they are preliminary, for d >= 6 they are between 20 to 10^4 times more precise than the best previous…
An approximate numerical approach to spin models is proposed, in which the original lattice is transformed into a tree. This method is applied to the Edwards-Anderson spin glass model in two and three dimensions. It captures the…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…
We study bond percolation on the simple cubic (SC) lattice with various combinations of first, second, third, and fourth nearest-neighbors by Monte Carlo simulation. Using a single-cluster growth algorithm, we find precise values of the…
We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the $n$-dimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the…
Standard approaches for global optimization of non-convex functions, such as branch-and-bound, maintain partition trees to systematically prune the domain. The tree size grows exponentially in the number of dimensions. We propose new…
Motivated by recent claims of a proof that the length scale exponent for the end-to-end distance scaling of self-avoiding walks is precisely $7/12=0.5833...$, we present results of large-scale simulations of self-avoiding walks and…
We present a Monte Carlo study of the one-component $\phi^4$ model on the cubic lattice in three dimensions. Leading order scaling corrections are studied using the finite size scaling method. We compute the corrections to scaling exponent…
We study two-dimensional N=(2,2) SU(N) super Yang-Mills theory on Euclidean two-torus using Sugino's lattice regularization. We perform the Monte-Carlo simulation for N=2,3,4,5 and then extrapolate the result to N = infinity. With the…
We study the cubic fixed point for $N=3$ and $4$ by using finite size scaling applied to data obtained from Monte Carlo simulations of the $N$-component $\phi^4$ model on the simple cubic lattice. We generalize the idea of improved models…
Shrock and Wu have given numerical values for the exponential growth rate of the number of spanning trees in Euclidean lattices. We give a new technique for numerical evaluation that gives much more precise values, together with rigorous…
This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods…
The geometric $\delta$-minimum spanning tree problem ($\delta$-MST) is the problem of finding a minimum spanning tree for a set of points in a normed vector space, such that no vertex in the tree has a degree which exceeds $\delta$, and the…
A supersymmetric extension of the nonlinear O(3) sigma model in two spacetime dimensions is investigated by means of Monte Carlo simulations. We argue that it is impossible to construct a lattice action that implements both the O(3)…
For a lattice $\Lambda$ with $n$ vertices and dimension $d$ equal or higher than two, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present exact integral…
Corrections to scaling in the two-dimensional scalar phi^4 model are studied based on non-perturbative analytical arguments and Monte Carlo (MC) simulation data for different lattice sizes L (from 4 to 1536) and different values of the…