March 22, 2022
In this article we will explore Dirichlet Laplace eigenvalues on balls on spherically symmetric manifolds. We will compare any Dirichlet Laplace eigenvalue with the corresponding Dirichlet Laplace eigenvalue on balls in Euclidean space with the same radius. As a special case we will show that the Dirichlet Laplace eigenvalues on balls with small radius on the sphere are smaller than the corresponding eigenvalues on the Euclidean ball with the same radius. While the opposite i...
October 30, 2017
We prove upper bounds on the $L^p$ norms of eigenfunctions of the discrete Laplacian on regular graphs. We then apply these ideas to study the $L^p$ norms of joint eigenfunctions of the Laplacian and an averaging operator over a finite collection of algebraic rotations of the $2$-sphere. Under mild conditions, such joint eigenfunctions are shown to satisfy for large $p$ the same bounds as those known for Laplace eigenfunctions on a surface of non-positive curvature.
October 21, 2010
Recently, Sogge-Zelditch and Colding-Minicozzi gave new power law lower bounds on the size of the nodal sets of eigenfunctions. The purpose of this short note is to point out a third method to obtain a power law lower bound on the volume of the nodal sets. Our method is based on the Donnelly-Fefferman growth bound for eigenfunctions and a growth vs. volume relation we proved in a previous work.
June 24, 2006
We study the spectral measure of large Euclidean random matrices. The entries of these matrices are determined by the relative position of $n$ random points in a compact set $\Omega_n$ of $\R^d$. Under various assumptions we establish the almost sure convergence of the limiting spectral measure as the number of points goes to infinity. The moments of the limiting distribution are computed, and we prove that the limit of this limiting distribution as the density of points goes...
September 9, 2008
In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bipartition is given. We state a conjectured solution, which is an analog of the Brualdi- Hoffman conjecture for general graphs, and prove the conjecture in some special cases.
September 19, 2018
This article is concerned with properties of delocalization for eigenfunctions of Schr\"odinger operators on large finite graphs. More specifically, we show that the eigenfunctions have a large support and we assess their lp-norms. Our estimates hold for any fixed, possibly irregular graph, in prescribed energy regions, and also for certain sequences of graphs such as N-lifts.
July 10, 2008
The logarithmic Sobolev inequality for the Hamming cube {0,1}^n states that for any real-valued function f on the cube holds E(f,f) \ge 2 Ent(f^2), where E(f,f) is the appropriate Dirichlet form (also known as "sum of influences"). We show that the constant C = 2 at the right hand side of this inequality can be replaced by a function C(rho) depending on rho = Ent(f^2) / (n Ef^2). The function C is an increasing convex function taking [0,log 2] to [2, 2/log 2]. We present ...
May 14, 2005
Let $m>1$ be an integer, $B_m$ the set of all unit vectors of $\Bbb R^m$ pointing in the direction of a nonzero integer vector of the cube $[-1, 1]^m$. Denote by $s_m$ the radius of the largest ball contained in the convex hull of $B_m$. We determine the exact value of $s_m$ and obtain the asymptotic equality $s_m\sim\frac{2}{\sqrt{\log m}}$.
January 6, 2010
The d-dimensional Hamming torus is the graph whose vertices are all of the integer points inside an a_1 n X a_2 n X ... X a_d n box in R^d (for constants a_1, ..., a_d > 0), and whose edges connect all vertices within Hamming distance one. We study the size of the largest connected component of the subgraph generated by independently removing each vertex of the Hamming torus with probability 1-p. We show that if p=\lambda / n, then there exists \lambda_c > 0, which is the pos...
July 19, 2020
We derive bounds for the ball $L_p$-discrepancies in the Hamming space for $0<p<\infty$ and $p=\infty$. Sharp estimates of discrepancies have been obtained for many spaces such as the Euclidean spheres and more general compact Riemannian manifolds. In the present paper, we show that the behavior of discrepancies in the Hamming space differs fundamentally because the volume of the ball in this space depends on its radius exponentially while such a dependence for the Riemannian...