Related papers: Exotic eigenvalues and analytic resolvent for a gr…

This paper investigates structural changes in the parameters of first-order autoregressive models by analyzing the edge eigenvalues of the precision matrices. Specifically, edge eigenvalues in the precision matrix are observed if and only…

We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…

Let $H=(V,E)$ be an $r$-uniform hypergraph with the vertex set $V$ and the edge set $E$. For $1\leq s \leq r/2$, we define a weighted graph $G^{(s)}$ on the vertex set ${V\choose s}$ as follows. Every pair of $s$-sets $I$ and $J$ is…

We study small perturbations of the Dirichlet problems for second order elliptic equations that degenerate on the boundary. The limit of the solution, as the perturbation tends to zero, is calculated. The result is based on a certain…

Motivated by the study of high energy Steklov eigenfunctions, we examine the semi-classical Robin Laplacian. In the two dimensional situation, we determine an effective operator describing the asymptotic distribution of the negative…

We study the behaviour of extremal eigenvalues of the Dirichlet biharmonic operator over rectangles with a given fixed area. We begin by proving that the principal eigenvalue is minimal for a rectangle for which the ratio between the…

The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…

We consider the normalized adjacency matrix of a random $d$-regular graph on $N$ vertices with any fixed degree $d\geq 3$ and denote its eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We establish…

The eccentricity matrix $\varepsilon(G)$ of a graph $G$ is constructed from the distance matrix of $G$ by keeping only the largest distances for each row and each column. This matrix can be interpreted as the opposite of the adjacency…

We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.

In this paper, we study the restrictions of both the harmonic functions and the eigenfunctions of the symmetric Laplacian to edges of pre-gaskets contained in the Sierpinski gasket. For a harmonic function, its restriction to any edge is…

In this paper we present an iterative method, inspired by the inverse iteration with shift technique of finite linear algebra, designed to find the eigenvalues and eigenfunctions of the Laplacian with homogeneous Dirichlet boundary…

Given i.i.d.\ samples $X_n =\{ x_1, \dots, x_n \}$ from a distribution supported on a low dimensional manifold ${M}$ embedded in Eucliden space, we consider the graph Laplacian operator $\Delta_n$ associated to an $\varepsilon$-proximity…

We study the low energy resolvent of the Hodge Laplacian on a manifold equipped with a fibred boundary metric. We determine the precise asymptotic behavior of the resolvent as a fibred boundary (aka $\phi$-) pseudodifferential operator when…

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

A graph property is said to be elusive ( evasive) if every algorithm testing this property by asking questions of the form "is there an edge between vertices x and y" requires, in the worst case, to ask about all pairs of vertices. The…

The eccentricity matrix of a simple connected graph is obtained from the distance matrix by only keeping the largest distances for each row and each column, whereas the remaining entries become zero. This matrix is also called the…

We consider real symmetric or complex hermitian random matrices with correlated entries. We prove local laws for the resolvent and universality of the local eigenvalue statistics in the bulk of the spectrum. The correlations have fast decay…

We consider the negative Dirichlet Laplacian on an infinite waveguide embedded in $\RR^2$, and finite segments thereof. The waveguide is a perturbation of a periodic strip in terms of a sequence of independent identically distributed random…

For a given graph $\mathcal{G}$ of order $n$ with $m$ edges, and a real symmetric matrix associated to the graph, $M\left(\mathcal{G}\right)\in\mathbb{R}^{n\times n}$, the interlacing graph reduction problem is to find a graph…