相关论文: Eigenvalues, inequalities and ergodic theory

We prove interlacing inequalities between spectral minimal energies of metric graphs built on Dirichlet and standard Laplacian eigenvalues, as recently introduced in [Kennedy et al, arXiv:2005.01126]. These inequalities, which involve the…

The onset of quantum ergodicity is often quantified by the average ratio of consecutive level spacings. The reference values for ergodic quantum systems have been obtained numerically from the spectra of large but finite-dimensional random…

We study randomly coloured graphs embedded into Euclidean space, whose vertex sets are infinite, uniformly discrete subsets of finite local complexity. We construct the appropriate ergodic dynamical systems, explicitly characterise ergodic…

We study two inexact methods for solutions of random eigenvalue problems in the context of spectral stochastic finite elements. In particular, given a parameter-dependent, symmetric matrix operator, the methods solve for eigenvalues and…

We study the ergodic properties of eigenfunctions of Schr\"odinger operators on a closed connected Riemannian manifold $M$ in case that the underlying Hamiltonian system possesses certain symmetries. More precisely, let $M$ carry an…

In this paper, to the best of our knowledge, we make the first attempt at studying the parametric semilinear elliptic eigenvalue problems with the parametric coefficient and some power-type nonlinearities. The parametric coefficient is…

This paper addresses the problem of computing the eigenvalues lying in the gaps of the essential spectrum of a periodic Schrodinger operator perturbed by a fast decreasing potential. We use a recently developed technique, the so called…

For graphs there exists a strong connection between spectral and combinatorial expansion properties. This is expressed, e.g., by the discrete Cheeger inequality, the lower bound of which states that $\lambda(G) \leq h(G)$, where…

Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…

This paper provides a general and abstract approach to approximate ergodic regimes of Markov and Feller processes. More precisely, we show that the recursive algorithm presented in Lamberton & Pages (2002) and based on simulation algorithms…

We consider the forward problem of uncertainty quantification for the generalised Dirichlet eigenvalue problem for a coercive second order partial differential operator with random coefficients, motivated by problems in structural…

The problem of determining the configuration of points from partial distance information, known as the Euclidean Distance Geometry (EDG) problem, is fundamental to many tasks in the applied sciences. In this paper, we propose two algorithms…

As a non-trivial extension of the celebrated Cheeger inequality, the higher-order Cheeger inequalities for graphs due to Lee, Oveis Gharan and Trevisan provide for each $k$ an upper bound for the $k$-way Cheeger constant in forms of…

The purpose of this work is to study spectral methods to approximate the eigenvalues of nonlocal integral operators. Indeed, even if the spatial domain is an interval, it is very challenging to obtain closed analytical expressions for the…

In [11], employing the technique of noncommutative interpolation, a maximal ergodic theorem in noncommutative Lp-spaces, 1 < p < infinity, was established and, among other things, corresponding maximal ergodic inequalities and individual…

In this paper, we study eigenvalues of the poly-Laplacian with arbitrary order on a bounded domain in an n-dimensional Euclidean space and obtain a lower bound for eigenvalues, which generalizes the results due to Cheng-Wei [5] and gives an…

The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…

In terms of layer potential methods, this paper is devoted to study the $L^2$ boundary value problems for nonhomogeneous elliptic operators with rapidly oscillating coefficients in a periodic setting. Under a low regularity assumption on…

We give a survey of the entropy theory of interval maps as it can be analyzed using ergodic theory, especially measures of maximum entropy and periodic points. The main tools are (i) a version of Hofbauer's Markov diagram, (ii) the…

This paper studies the size of the minimal gap between any two consecutive eigenvalues in the Dirichlet and in the Neumann spectrum of the standard Laplace operator on the Sierpinski gasket. The main result shows the remarkable fact that…