Related papers: Eigenvalue bounds for independent sets

In this paper we solve the eigenvalue problem of stochastic Hamiltonian system with boundary conditions. Firstly, we extend the results in S. Peng \cite{peng} from time-invariant case to time-dependent case, proving the existence of a…

In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest…

This work is concerned with finite range bounds on the variance of individual eigenvalues of random covariance matrices, both in the bulk and at the edge of the spectrum. In a preceding paper, the author established analogous results for…

We consider an inverse boundary value problem for the Maxwell's equations with a given data assumed to be known only in accessible part $\Gamma$ of the boundary. We aim to prove an uniqueness result using the Dirichlet to Neumann map with…

Eigenvalues of a graph are the eigenvalues of the corresponding (0,1)-adjacency matrix. The second largest eigenvalue lambda_2 provides significant information on characteristics and structure of graphs. Therefore, finding bounds for…

Lieb has shown a lower bound on the smallest Dirichlet eigenvalue of the Laplace operator in terms of a generalized inradius. We derive similar bounds for Robin eigenvalues, for eigenvalues of the polyharmonic operator and the sub-Laplacian…

In this paper we give a new characterization of the dual polar graphs, extending the work of Brouwer and Wilbrink on regular near polygons. Also as a consequence of our characterization we confirm a conjecture of the authors on…

We introduce the the fractional Laplacian on a subgraph of a graph with Dirichlet boundary condition. For a lattice graph, we prove the upper and lower estimates for the sum of the first $k$ Dirichlet eigenvalues of the fractional…

The D-eigenvalues {\mu}_1,{\mu}_2,...,{\mu}_{n} of a connected graph G are the eigenvalues of its distance matrix. The distance Estrada index of G is defined in [15] as DEE=DEE(G)=\Sigma_{i=1}^n e^{{\mu}_{i}} In this paper, we give better…

We prove that for every integer $d \ge 3$, the median eigenvalues of any graph of maximum degree $d$ are bounded above by $\sqrt{d-1}$. We also prove that, in three separate cases, the median eigenvalues of a graph of maximum degree $d$ are…

We establish some estimates of the the angular derivatives from below for holomorphic self-maps of the unit disk at one and two fixed points of the unit circle provided there is no fixed point inside the unit disk. The results complement…

We study Extremal Combinatorics problems where local properties are used to derive global properties. That is, we consider a given configuration where every small piece of the configuration satisfies some restriction, and use this local…

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

We present a finer quantitative version of an observation due to Breuillard, Green, Guralnick and Tao which tells that for finite non-bipartite Cayley graphs, once the nontrivial eigenvalues of their normalized adjacency matrices are…

We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph $G_N$ with vertex set $[N] = \{1,\dots,N\}$ for which the pair of vertices $i,j \in [N]$, $i\neq j$, is connected by an edge with probability $r(\tfrac{i}{N},\tfrac{j}{N})$,…

We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.

Inspired by the Erd\H{o}s R\'enyi model, we propose a new model for freesquare random monomial ideals generated by edges and covers of a graph. This permit us to investigate the conditions of normality for which we obtain asymptotic…

Eigenvalues of a graph are of high interest in graph analytics for Big Data due to their relevance to many important properties of the graph including network resilience, community detection and the speed of viral propagation. Accurate…

We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.

We obtain bounds on the complex eigenvalues of non-self-adjoint Schr\"odinger operators with complex potentials, and also on the complex resonances of self-adjoint Schr\"odinger operators. Our bounds are compared with numerical results, and…