Related papers: Stability of lattice rules and polynomial lattice …
An off-lattice Monte Carlo algorithm for solutions of equilibrium polymers (EP) is proposed. At low and moderate densities this is shown to reproduce faithfully the (static) properties found recently for flexible linear EP using a lattice…
In this review we discuss the general features of maximally twisted lattice QCD. In particular, we illustrate how automatic O(a) improvement can be achieved and how it is possible to set up a lattice regularization scheme where the problem…
Lattice simulations are an important class of problems in crystalline solids, surface science, alloys, adsorption, absorption, separation, catalysis, to name a few. We describe a fast computational method for performing lattice…
Recent developments of high-order CCM have been to extend existing formalism and codes to $s \ge \frac 12$ for both the ground and excited states, and independently to "generalised" expectation values for a wide range of one- and two-body…
The theory of Monotone Comparative Statics (MCS) has traditionally required a lattice structure, excluding certain multidimensional environments such as mixed-strategy games where this property fails. We show that this structure is not…
Quasi-Monte Carlo (QMC) is a powerful method for evaluating high-dimensional integrals. However, its use is typically limited to distributions where direct sampling is straightforward, such as the uniform distribution on the unit hypercube…
Lattice networks are indispensable to study heterogeneous materials such as concrete or rock as well as textiles and woven fabrics. Due to the discrete character of lattices, they quickly become computationally intensive. The QuasiContinuum…
In the lattice approach to Loop Quantum Gravity on a fixed graph computations tend to be involved and are rarely analytically manageable. But, when interested in the expectation values of coherent states on the lattice which are sharply…
The lattice regularization of QCD provides us with the most systematic way of computing non-perturbative properties of hadrons directly from the first principles of QCD. The recent rapid development of parallel computers has enabled us to…
Several proposals for quantum computation utilize a lattice type architecture with qubits trapped by a periodic potential. For systems undergoing many body interactions described by the Bose-Hubbard Hamiltonian, the ground state of the…
Recently MV18 identified and initiated work on the new problem of understanding structural relationships between the lattices of solutions of two "nearby" instances of stable matching. They also gave an application of their work to finding…
We present a universal parameter-free quantum Monte Carlo (QMC) algorithm designed to simulate arbitrary spin-$1/2$ Hamiltonians. To ensure the convergence of the Markov chain to equilibrium for every conceivable case, we devise a clear and…
Monte Carlo (MC) simulations of lattice models are a widely used way to compute thermodynamic properties of substitutional alloys. A limitation to their more widespread use is the difficulty of driving a MC simulation in order to obtain the…
We develop efficient algorithms for optimizing piecewise smooth (PWS) functions where the underlying partition of the domain into smooth pieces is \emph{unknown}. For PWS functions satisfying a quadratic growth (QG) condition, we propose a…
Calculating the properties of baryon resonances from quantum chromodynamics requires evaluating the temporal correlations between hadronic operators using integrations over field configurations weighted by a phase associated with the…
An efficient Quantum Monte Carlo algorithm for the simulation of bosonic systems on a lattice in a grand canonical ensemble is proposed. It is based on the mapping of bosonic models to the spin models in the limit of the infinite total spin…
Quasi-Monte Carlo (QMC) methods are applied to multi-level Finite Element (FE) discretizations of elliptic partial differential equations (PDEs) with a random coefficient, to estimate expected values of linear functionals of the solution.…
One of the tasks in color image processing and computer vision is to recover clean data from partial observations corrupted by noise. To this end, robust quaternion matrix completion (QMC) has recently attracted more attention and shown its…
The status of Lattice QCD is reviewed with respect to results that are relevant to Standard Model phenomenology. I argue that in a few simple cases all (or almost all) systematic errors from the lattice calculation are under control.…
In the random case setting, scrambled polynomial lattice rules as discussed in \cite{BD10} enjoy more favourable strong tractablility properties than scrambled digital nets. This short note discusses the application of scrambled polynomial…