Related papers: NoBLE for lattice trees and lattice animals
We consider spectral quantities in lattice QCD and determine the asymptotic behavior of their discretization errors. Wilson fermion with O$(a)$-improvement, (M\"obius) Domain wall fermion (DWF), and overlap Dirac operators are considered in…
We consider the double-dimer model in the upper-half plane discretized by the square lattice with mesh size $\delta$. For each point $x$ in the upper half-plane, we consider the random variable $N_\delta(x)$ given by the number of the…
We show a new framework for constructing good distance lattices from high dimensional expanders. For error-correcting codes, which have a similar flavor as lattices, there is a known framework that yields good codes from expanders. However,…
We use the lace expansion to prove an infra-red bound for site percolation on the hypercubic lattice in high dimension. This implies the triangle condition and allows us to derive several critical exponents that characterize mean-field…
In this paper we study threshold-one contact processes on lattices and regular trees. The asymptotic behavior of the critical infection rates as the degrees of the graphs growing to infinity are obtained. Defining \lambda_c as the supremum…
High-dimensional data analysis has motivated a spectrum of regularization methods for variable selection and sparse modeling, with two popular classes of convex ones and concave ones. A long debate has been on whether one class dominates…
One of the central challenges in the study of human motor control and learning is the degrees-of-freedom problem. Although the dynamical systems approach (DSA) has provided valuable insights into addressing this issue, its application has…
Gait recognition, which aims at identifying individuals by their walking patterns, has achieved great success based on silhouette. The binary silhouette sequence encodes the walking pattern within the sparse boundary representation.…
The study of matter fields on an ensemble of random geometries is a difficult problem still in need of new methods and ideas. We will follow a point of view inspired by probability theory techniques that relies on an expansion of the two…
Extended-range percolation on various regular lattices, including all eleven Archimedean lattices in two dimensions, and the simple cubic (SC), body-centered cubic (BCC), and face-centered cubic (FCC) lattices in three dimensions, is…
Nuclear lattice effective field theory (NLEFT) provides an efficient ab initio framework for computing low-lying states via imaginary-time projection. However, the extraction of unstable resonances, especially those with broad widths,…
We use the lace expansion to give a simple proof that the critical two-point function for weakly self-avoiding walk on $\mathbb{Z}^d$ has decay $|x|^{-(d-2)}$ in dimensions $d>4$. The proof uses elementary Fourier analysis and the…
We first study a model, introduced recently in \cite{ES}, of a critical branching random walk in an IID random environment on the $d$-dimensional integer lattice. The walker performs critical (0-2) branching at a lattice point if and only…
We present an extension of Monte Carlo Tree Search (MCTS) that strongly increases its efficiency for trees with asymmetry and/or loops. Asymmetric termination of search trees introduces a type of uncertainty for which the standard upper…
Robotic locomotion research typically draws from biologically inspired leg designs, yet many human-engineered settings can benefit from non-anthropomorphic forms. TARS3D translates the block-shaped 'TARS' robot from Interstellar into a 0.25…
A comprehensive analysis of tadpole-improved SU(2) lattice gauge theory is made. Simulations are done on isotropic and anisotropic lattices, with and without improvement. Two tadpole renormalization schemes are employed, one using average…
In the context of legged robots, adaptive behavior involves adaptive balancing and adaptive swing foot reflection. While adaptive balancing counteracts perturbations to the robot, adaptive swing foot reflection helps the robot to navigate…
The Lasso is a method for high-dimensional regression, which is now commonly used when the number of covariates $p$ is of the same order or larger than the number of observations $n$. Classical asymptotic normality theory does not apply to…
Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…
Percolation on a five-dimensional simple hypercubic (sc(5)) lattice with extended neighborhoods is investigated by means of extensive Monte Carlo simulations, using an effective single-cluster growth algorithm. The critical exponents,…