Related papers: Derandomised lattice rules for high dimensional in…
In this paper we investigate the integrability of two-dimensional partial difference equations using the newly developed techniques of study of the degree of the iterates. We show that while for generic, nonintegrable equations, the degree…
We investigate sampling laws for particle algorithms and the influence of these laws on the efficiency of particle approximations of marginal likelihoods in hidden Markov models. Among a broad class of candidates we characterize the…
For the purpose of uncertainty propagation a new quadrature rule technique is proposed that has positive weights, has high degree, and is constructed using only samples that describe the probability distribution of the uncertain parameters.…
Neural network decoding algorithms are recently introduced by Nachmani et al. to decode high-density parity-check (HDPC) codes. In contrast with iterative decoding algorithms such as sum-product or min-sum algorithms in which the weight of…
Fully symmetric positive interior (f-SPI) quadrature rules are key building blocks for high-order discretizations of partial differential equations, yet high-degree rules with few nodes remain scarce on reference elements commonly used in…
A polymer folding model on the square lattice is constructed with attractive contact interactions of strength 1/c^2, 0<c<1. The corresponding model on a dynamical random lattice, with freely fluctuating co-ordination number at each vertex,…
Sampling-based methods for motion planning, which capture the structure of the robot's free space via (typically random) sampling, have gained popularity due to their scalability, simplicity, and for offering global guarantees, such as…
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. In this article, we describe how "generalised" expectation values for a wide range of one-…
It is often unnoticed that the predominant way to use collocation methods is fundamentally flawed when applied to optimal control in robotics. Such methods assume that the system dynamics is given by a first order ODE, whereas robots are…
We study an optimal control problem under uncertainty, where the target function is the solution of an elliptic partial differential equation with random coefficients, steered by a control function. The robust formulation of the…
Logarithmic Conformal Field Theories (LCFT) play a key role, for instance, in the description of critical geometrical problems (percolation, self avoiding walks, etc.), or of critical points in several classes of disordered systems…
We propose a lattice action for two dimensional super Yang-Mills theory with a twisted N=2 supersymmetry. The extended supersymmetry is fully and exactly realized on the lattice. The method employed is quite general and its extension to the…
We present an algorithm for multivariate integration over cubes that is unbiased and has optimal order of convergence (in the randomized sense as well as in the worst case setting) for all Sobolev spaces $H^{r, mix}([0,1]^d)$ and…
QMC rules are equal weight quadrature rules for approximating integrals over $[0,1]^s$. One line of research studies the integration error of functions in the unit ball of so-called Korobov spaces, which are Hilbert spaces of periodic…
Randomized algorithms provide solutions to two ubiquitous problems: (1) the distributed calculation of a principal component analysis or singular value decomposition of a highly rectangular matrix, and (2) the distributed calculation of a…
A sharp version of the Balian-Low theorem is proven for the generators of finitely generated shift-invariant spaces. If generators $\{f_k\}_{k=1}^K \subset L^2(\mathbb{R}^d)$ are translated along a lattice to form a frame or Riesz basis for…
Binary embedding is the problem of mapping points from a high-dimensional space to a Hamming cube in lower dimension while preserving pairwise distances. An efficient way to accomplish this is to make use of fast embedding techniques…
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 study several separation axioms for $X$-top-lattices (i.e. a lattice $L$ for which a given subset $X\subseteq L\backslash \{1\}$ admits a \emph{% Zariski-like topology}). Such spaces are $T_{0}$ and usually far away from being $T_{2}.$…
This survey article describes a method for choosing uniformly at random from any finite set whose objects can be viewed as constituting a distributive lattice. The method is based on ideas of the author and David Wilson for using ``coupling…