Related papers: Derandomised lattice rules for high dimensional in…
We study numerical integration of smooth functions defined over the $s$-dimensional unit cube. A recent work by Dick et al. (2019) has introduced so-called extrapolated polynomial lattice rules, which achieve the almost optimal rate of…
We propose a new formulation which realizes exact twisted supersymmetry for all the supercharges on a lattice by twisted superspace formalism. We show explicit examples of N=2 twisted supersymmetry invariant BF and Wess-Zumino models in two…
We derive a sharp scaling law for deviations of edge-isoperimetric sets in the lattice $\mathbb Z^d$ from the limiting Wulff shape in arbitrary dimensions. As the number $n$ of elements diverges, we prove that the symmetric difference to…
This paper investigates the construction of space-filling designs for computer experiments. The space-filling property is characterized by the covering and separation radii of a design, which are integrated through the unified criterion of…
We present a quasi-integrable two-dimensional lattice equation: i.e., a partial difference equation which satisfies a criterion of integrability, singularity confinement, although it has a chaotic aspect in the sense that the degrees of its…
In this paper we give explicit constructions of point sets in the $s$ dimensional unit cube yielding quasi-Monte Carlo algorithms which achieve the optimal rate of convergence of the worst-case error for numerically integrating high…
We study numerical integration of functions depending on an infinite number of variables. We provide lower error bounds for general deterministic linear algorithms and provide matching upper error bounds with the help of suitable multilevel…
In this paper we analyze the approximation of multivariate integrals over the Euclidean plane for functions which are analytic. We show explicit upper bounds which attain the exponential rate of convergence. We use an infinite grid with…
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…
We study random packings of $2\times2$ squares with centers on the square lattice $\mathbb{Z}^{2}$, in which the probability of a packing is proportional to $\lambda$ to the number of squares. We prove that for large $\lambda$, typical…
A key goal in the design of probabilistic inference algorithms is identifying and exploiting properties of the distribution that make inference tractable. Lifted inference algorithms identify symmetry as a property that enables efficient…
In high-dimensional model selection problems, penalized simple least-square approaches have been extensively used. This paper addresses the question of both robustness and efficiency of penalized model selection methods, and proposes a…
Several variants of the recently proposed Density Matrix Embedding Theory (DMET) [G. Knizia and G. K-L. Chan, Phys. Rev. Lett. 109, 186404 (2012)] are formulated and tested. We show that spin symmetry breaking of the lattice mean-field…
Strict inequalities in mixed-integer linear optimization can cause difficulties in guaranteeing convergence and exactness. Utilizing that optimal vertex solutions follow a lattice structure we propose a rounding rule for strict inequalities…
This paper studies the multivariate approximation of functions in weighted Korobov spaces using multiple rank-1 lattice rules. It has been shown by K\"{a}mmerer and Volkmer (2019) that algorithms based on multiple rank-1 lattices achieve…
In a one-dimensional lattice, the induced metric (from a noncommutative geometry calculation) breaks translation invariance. This leads to some inconsistencies among different spectator frames, in the observation of the hoppings of a test…
The notion of quantum symmetry has recently been extended to include reduced-dimensional transformations and algebraic structures beyond groups. Such generalized symmetries lead to exotic phases of matter and excitations that defy Landau's…
Mixture models whose components have skewed hypercube contours are developed via a generalization of the multivariate shifted asymmetric Laplace density. Specifically, we develop mixtures of multiple scaled shifted asymmetric Laplace…
In many areas of research it is interesting how lattices can be filled with particles that have no nearest neighbors, or they are in limited quantities. Examples may be found in statistical physics, chemistry, materials science, discrete…
In lattice field theory, the interactions of elementary particles can be computed via high-dimensional integrals. Markov-chain Monte Carlo (MCMC) methods based on importance sampling are normally efficient to solve most of these integrals.…