Related papers: Effective Erd\H{o}s--Wintner for Cantor numeration…
Tensor networks have been an important concept and technique in many research areas, such as quantum computation and machine learning. We study the exponential complexity of contracting tensor networks on two special graph structures:…
We consider ensembles of Wigner matrices, whose entries are (up to the symmetry constraints) independent and identically distributed random variables. We show the convergence of the Stieltjes transform towards the Stieltjes transform of the…
Tensor factorization with hard and/or soft constraints has played an important role in signal processing and data analysis. However, existing algorithms for constrained tensor factorization have two drawbacks: (i) they require…
We construct a soft thresholding operation for rank reduction of hierarchical tensors and subsequently consider its use in iterative thresholding methods, in particular for the solution of discretized high-dimensional elliptic problems. The…
We prove strengthenings of the Birkhoff Ergodic Theorem for weakly mixing and strongly mixing measure preserving systems. We show that our pointwise theorem for weakly mixing systems is strictly stronger than the Wiener-Wintner Theorem. We…
We study the graph alignment problem over two independent Erd\H{o}s-R\'enyi graphs on $n$ vertices, with edge density $p$ falling into two regimes separated by the critical window around $p_c=\sqrt{\log n/n}$. Our result reveals an…
We extend several $g$-type theorems for connected, orientable homology manifolds without boundary to manifolds with boundary. As applications of these results we obtain K\"uhnel-type bounds on the Betti numbers as well as on certain…
Periodogram methods are widely used for the estimation of power- and cross-spectra, of which Welch's method is the most popular. Previous studies have analyzed the variance of the power spectra estimates and developed analytical probability…
We present an efficient algorithm to compute permanents, mixed discriminants and hyperdeterminants of structured matrices and multidimensional arrays (tensors). We describe the sparsity structure of an array in terms of a graph, and we…
As a variant of the celebrated Szemer\'edi--Trotter theorem, Guth and Katz proved that $m$ points and $n$ lines in $\mathbb{R}^3$ with at most $\sqrt{n}$ lines in a common plane must determine at most $O(m^{1/2}n^{3/4})$ incidences for…
This paper is concerned with the numerical computation of the harmonic-measure distribution function, or $h$-function for short, associated with a particular planar domain. This function describes the hitting probability of a Brownian…
The Arnold-Winther element successfully discretizes the Hellinger-Reissner variational formulation of linear elasticity; its development was one of the key early breakthroughs of the finite element exterior calculus. Despite its great…
We propose a high-precision numerical quadrature framework based on local Fourier extension (LFE) approximations. The method constructs, on each subinterval, a truncated-SVD stabilized local Fourier continuation of the integrand on an…
In this article, we design and analyze a Hybrid High-Order (HHO) finite element approximation for a class of strongly nonlinear boundary value problems. We consider an HHO discretization for a suitable linearized problem and show its…
We investigate the numerical approximation to the Euler-Bernoulli (E-B) beams and plates with nonlinear nonlocal strong damping, which describes the damped mechanical behavior of beams and plates in real applications. We discretize the…
Many recent tensor network algorithms apply unitary operators to parts of a tensor network in order to reduce entanglement. However, many of the previously used iterative algorithms to minimize entanglement can be slow. We introduce an…
In this paper, we study sliding window decoding of braided convolutional codes (BCCs) in the context of a streaming application, where decoder error propagation can be a serious problem. A window extension algorithm and a resynchronization…
We develop a numerical methodology for the computation of entanglement measures for mixed quantum states. Using the well-known Schr\"odinger-HJW theorem, the computation of convex roof entanglement measures is reframed as a search for…
In this work we start the investigation of tight complexity bounds for connectivity problems parameterized by cutwidth assuming the Strong Exponential-Time Hypothesis (SETH). Van Geffen et al. posed this question for odd cycle transversal…
We consider the classical coupled, combined-field integral equation formulations for time-harmonic acoustic scattering by a sound soft bounded obstacle. In recent work, we have proved lower and upper bounds on the $L^2$ condition numbers…