English
Related papers

Related papers: Optimal Delocalization for Non--Hermitian Eigenvec…

200 papers

In this paper, we discuss a novel higher-order stabilization-free virtual element method for general second-order elliptic eigenvalue problems. Optimal a priori error estimates are derived for both the approximate eigenspace and…

Numerical Analysis · Mathematics 2026-04-07 Liangkun Xu , Shixi Wang , Yidu Yang , Hai Bi

A recent development in studies of random non-Hermitian quantum systems is reviewed. Delocalization was found to occur under a sufficiently large constant imaginary vector potential even in one and two dimensions. The phenomenon has a…

Statistical Mechanics · Physics 2015-06-25 Naomichi Hatano

Consider the chiral non-Hermitian random matrix ensemble with parameters $n$ and $v$ and the non Hermiticity parameter $\tau=0$ and let $(\zeta_i)_{1\le i\le n}$ be its $n$ eigenvalues with positive $x$-coordinate. Set $$X_n:=\sqrt{\log…

Probability · Mathematics 2025-01-17 Yutao Ma , Siyu Wang

In this paper we show that all nodes can be found optimally for almost all random Erd\H{o}s-R\'enyi ${\mathcal G}(n,p)$ graphs using continuous-time quantum spatial search procedure. This works for both adjacency and Laplacian matrices,…

Quantum Physics · Physics 2018-03-05 Adam Glos , Aleksandra Krawiec , Ryszard Kukulski , Zbigniew Puchała

Let $\mathcal{L}$ be a fixed $d$-dimensional lattice. We study the localization properties of solutions of the stationary Schr\"odinger equation with a positive $L^\infty$ potential on tori $\mathbb{R}^d/L\mathcal{L}$ in the limit, as…

Mathematical Physics · Physics 2022-09-21 Henrik Ueberschaer

For general non-Hermitian random matrices $X$ and deterministic deformation matrices $A$, we prove that the local eigenvalue statistics of $A+X$ close to the typical edge points of its spectrum are universal. Furthermore, we show that under…

Probability · Mathematics 2025-07-14 Andrew Campbell , Giorgio Cipolloni , László Erdős , Hong Chang Ji

We analyze convergence rates of norm-minimization-based outer approximation algorithms for convex vector optimization when the scalarization uses an $\ell_p$ norm with $p \in (1,\infty)$. While the Euclidean case ($p=2$) achieves the…

Optimization and Control · Mathematics 2026-05-18 Mohammed Alshahrani

We consider $N\times N$ random matrices of the form $H = W + V$ where $W$ is a real symmetric Wigner matrix and $V$ a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume subexponential decay for…

Probability · Mathematics 2015-09-29 Ji Oon Lee , Kevin Schnelli

In this paper, we give explicit descriptions of versions of (Local-) Backtracking Gradient Descent and New Q-Newton's method to the Riemannian setting.Here are some easy to state consequences of results in this paper, where X is a general…

Optimization and Control · Mathematics 2020-09-01 Tuyen Trung Truong

Local non-Hermitian (NH) quantum systems generically exhibit breakdown of Lieb-Robinson (LR) bounds, motivating study of whether new locality measures might shed light not seen by existing measures. In this paper we extend the standard…

Quantum Physics · Physics 2024-09-16 Brian Barch

In an instance of the minimum eigenvalue problem, we are given a collection of $n$ vectors $v_1,\ldots, v_n \subset {\mathbb{R}^d}$, and the goal is to pick a subset $B\subseteq [n]$ of given vectors to maximize the minimum eigenvalue of…

Data Structures and Algorithms · Computer Science 2024-01-26 Adam Brown , Aditi Laddha , Mohit Singh

This paper presents encoding and decoding algorithms for several families of optimal rank metric codes whose codes are in restricted forms of symmetric, alternating and Hermitian matrices. First, we show the evaluation encoding is the right…

Information Theory · Computer Science 2022-02-08 Wrya K. Kadir , Chunlei Li , Ferdinando Zullo

This paper considers the recovery of a rank $r$ positive semidefinite matrix $X X^T\in\mathbb{R}^{n\times n}$ from $m$ scalar measurements of the form $y_i := a_i^T X X^T a_i$ (i.e., quadratic measurements of $X$). Such problems arise in a…

Numerical Analysis · Mathematics 2016-06-02 Chris D. White , Sujay Sanghavi , Rachel Ward

We consider a general class of symmetric or Hermitian random band matrices $H=(h_{xy})_{x,y \in \llbracket 1,N\rrbracket^d}$ in any dimension $d\ge 1$, where the entries are independent, centered random variables with variances…

Probability · Mathematics 2020-08-19 Fan Yang , Jun Yin

Despite many applications, dimensionality reduction in the $\ell_1$-norm is much less understood than in the Euclidean norm. We give two new oblivious dimensionality reduction techniques for the $\ell_1$-norm which improve exponentially…

Data Structures and Algorithms · Computer Science 2021-08-09 Yi Li , David P. Woodruff , Taisuke Yasuda

We estimate the density and its derivatives using a local polynomial approximation to the logarithm of an unknown density $f$. The estimator is guaranteed to be nonnegative and achieves the same optimal rate of convergence in the interior…

Econometrics · Economics 2020-06-03 Joris Pinkse , Karl Schurter

In seminal work, Lov\'asz, Spencer, and Vesztergombi [European J. Combin., 1986] proved a lower bound for the hereditary discrepancy of a matrix $A \in \mathbb{R}^{m \times n}$ in terms of the maximum $|\det(B)|^{1/k}$ over all $k \times k$…

Data Structures and Algorithms · Computer Science 2021-11-03 Haotian Jiang , Victor Reis

This paper studies the delocalized regime of an ultrametric random operator whose independent entries have variances decaying in a suitable hierarchical metric on $\mathbb{N}$. When the decay-rate of the off-diagonal variances is…

Mathematical Physics · Physics 2019-08-28 Per von Soosten , Simone Warzel

We prove optimal boundary $C^{1,\alpha}$ regularity for viscosity solutions of degenerate fully nonlinear uniformly elliptic equations with oblique boundary conditions and Hamiltonian terms of the form \[ \begin{cases} |Du|^{\gamma}F(D^2 u)…

Analysis of PDEs · Mathematics 2026-05-05 Junior da Silva Bessa , Gleydson C. Ricarte

Given a graph $G=(V,E)$, a $\beta$-ruling set is a subset $S\subseteq V$ that is i) independent, and ii) every node $v\in V$ has a node of $S$ within distance $\beta$. In this paper we present almost optimal distributed algorithms for…

Data Structures and Algorithms · Computer Science 2026-04-03 Malte Baumecker , Yannic Maus , Jara Uitto
‹ Prev 1 3 4 5 6 7 10 Next ›