Related papers: Recovering the lattice from its random perturbatio…
We develop a novel, fundamental and surprisingly simple randomized iterative method for solving consistent linear systems. Our method has six different but equivalent interpretations: sketch-and-project, constrain-and-approximate, random…
We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…
A numerical method is proposed to solve the full-Eulerian time-dependent Vlasov-Poisson system in high dimension. The algorithm relies on the construction of a tensor decomposition of the solution whose rank is adapted at each time step.…
We propose a new second-order accurate lattice Boltzmann scheme that solves the quasi-static equations of linear elasticity in two dimensions. In contrast to previous works, our formulation solves for a single distribution function with a…
PhaseLift, proposed by E.J. Cand\`{e}s et al., is one convex relaxation approach for phase retrieval. The relaxation enlarges the solution set from rank one matrices to positive semidefinite matrices. In this paper, a relaxation is employed…
We introduce a new class of algorithms for finding a short vector in lattices defined by codes of co-dimension $k$ over $\mathbb{Z}_P^d$, where $P$ is prime. The co-dimension $1$ case is solved by exploiting the packing properties of the…
Diagrammatic techniques to compute perturbatively the spectral properties of Euclidean Random Matrices in the high-density regime are introduced and discussed in detail. Such techniques are developed in two alternative and very different…
We propose and test several tensor network based algorithms for reconstructing the ground state of an (unknown) local Hamiltonian starting from a random sample of the wavefunction amplitudes. These algorithms, which are based on completing…
On the basis of physical considerations we propose a one-dimensional discrete lattice model for the density relaxation of granular materials under tapping. Solving the difference equation numerically, we find a logarithmic time-dependence…
In the framework of perturbation theory, it is possible to put chiral gauge theories on the lattice without violating the gauge symmetry or other fundamental principles, provided the fermion representation of the gauge group is…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
We present an analytical model to investigate the mechanics of 2-dimensional lattices composed of elastic beams of non-uniform cross-section. Our approach is based on reducing a lattice to a single beam subject to the action of a set of…
We reformulate the Hamiltonian approach to lattice gauge theories such that, at the classical level, the gauge group does not act canonically, but instead as a Poisson-Lie group. At the quantum level, it then gets promoted to a quantum…
We investigate first-passage percolation on the lattice $\Z^d$ for dimensions $d \geq 2$. Each edge $e$ of the graph is assigned an independent copy of a non-negative random variable $\tau$. We only assume $\P[\tau=0]0$ is explicit) for the…
In this talk we discuss a novel method, that we have presented in Ref. [1], to extract hadronic spectral densities from lattice correlators by using deep learning techniques. Hadronic spectral densities play a crucial role in the study of…
We study the recovery of the underlying graphs or permutations for tensors in the tensor ring or tensor train format. Our proposed algorithms compare the matricization ranks after down-sampling, whose complexity is $O(d\log d)$ for $d$-th…
We present an easy proof of Polya's theorem on random walks: with the probability one a random walk on the two-dimensional lattice returns to the starting point.
We discuss the use of renormalization counterterms to restore the chiral gauge symmetry in a lattice theory of Wilson fermions. We show that a large class of counterterms can be implemented automatically by making a simple modification to…
Random geometric graphs are random graph models defined on metric measure spaces. A random geometric graph is generated by first sampling points from a metric space and then connecting each pair of sampled points independently with a…
A lattice derivative is defined as a discrete Fourier transform of momentum on a finite lattice. Species doublers are removed with anti-periodic boundary conditions. U(1) chiral transformation is modified to reproduce chiral anomaly. Chiral…