Related papers: Certifying numerical estimates of spectral gaps

We consider numerical approximations of spectral fractional Laplace-Beltrami problems on closed surfaces. The proposed numerical algorithms rely on their Balakrishnan integral representation and consist of a sinc quadrature coupled with…

Many statistical estimation procedures lead to nonconvex optimization problems. Algorithms to solve these are often guaranteed to output a stationary point of the optimization problem. Oracle inequalities are an important theoretical…

We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…

For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…

We address the inverse problem of Lagrangian identification based on trajecto-ries in the context of nonlinear optimal control. We propose a general formulation of the inverse problem based on occupation measures and complementarity in…

We consider the conic linear program given by a closed convex cone in an Euclidean space and a matrix, where vector on the right-hand-side of the constraint system and the vector defining the objective function are subject to change. Using…

A conjecture by D. Aldous, which can be formulated as a statement about the first nontrivial eigenvalue of the Laplacian of certain Cayley graphs on the symmetric group generated by transpositions, has been recently proven by Caputo,…

In this paper we investigate a spectra of the Laplacian matrix of cyclic groups using the properties of their characteristic polynomials. We have proved several assertions about the relationship between the spectra of different groups.

Adiabatic quantum computing is a framework for quantum computing that is superficially very different to the standard circuit model. However, it can be shown that the two models are computationally equivalent. The key to the proof is a…

We reformulate the problem of modularity maximization over the set of partitions of a network as a conic optimization problem over the completely positive cone, converting it from a combinatorial optimization problem to a convex continuous…

A classical theorem of Mihlin yields Lp estimates for spectral multipliers Lp(R^d) -> Lp(R^d); g -> F^{-1}[f(| |^2) Fg] in terms of L^\infty bounds of the multiplier function f and its weighted derivatives up to an order > d/2. This…

We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…

A chain of quantum subgroups of the quantum automorphism group of finite graphs has been introduced. It generalizes the construction of J. Bichon (see [3]) in a sense. A better bound of the non zero eigenvalues of the graph Laplacian has…

We prove for the first time that, if a linear inverse problem exhibits a group symmetry structure, gradient-based optimizers can be designed to exploit this structure for faster convergence rates. This theoretical finding demonstrates the…

We prove combination theorems in the spirit of Klein and Maskit in the context of discrete convergence groups acting geometrically finitely on their limit sets. As special cases, we obtain combination theorems for geometrically finite…

We study a version of the randomized Kaczmarz algorithm for solving systems of linear equations where the iterates are confined to the solution space of a selected subsystem. We show that the subspace constraint leads to an accelerated…

We consider a non-compact Riemannian periodic manifold such that the corresponding Laplacian has a spectral gap. By continuously perturbing the periodic metric locally we can prove the existence of eigenvalues in a gap. A lower bound on the…

Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover, a type of integer programming (IP) problem. A lattice-gas model on the Erd\"os-R\'enyi random graphs of $\alpha$-uniform…

We prove quadratic estimates for complex perturbations of Dirac-type operators, and thereby show that such operators have a bounded functional calculus. As an application we show that spectral projections of the Hodge--Dirac operator on…

In this paper we extend the traditional framework of noncommutative geometry in order to deal with spectral truncations of geometric spaces (i.e. imposing an ultraviolet cutoff in momentum space) and with tolerance relations which provide a…