Related papers: Nodal domain theorems for $p$-Laplacians on signed…
In this paper, we consider the weighted graph matching problem with partially disclosed correspondences between a number of anchor nodes. Our construction exploits recently introduced node signatures based on graph Laplacians, namely the…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
We survey recent results on graphs and their Laplacians related to the behavior of the graph at large. In particular, we focus on Liouville theorems, recurrence and characterizations of Dirichlet forms via boundary terms.
The nodal domains of eigenvectors of the discrete Schrodinger operator on simple, finite and connected graphs are considered. Courant's well known nodal domain theorem applies in the present case, and sets an upper bound to the number of…
We study the number of nodal domains of toral Laplace eigenfunctions. Following Nazarov-Sodin's results for random fields and Bourgain's de-randomisation procedure we establish a precise asymptotic result for "generic" eigenfunctions. Our…
We provide upper and lower bounds on the smallest eigenvalue of grounded Laplacian matrices (which are matrices obtained by removing certain rows and columns of the Laplacian matrix of a given graph). The gap between the upper and lower…
We consider the Cauchy problem for the nonstationary discrete p-Laplacian with inhomogeneous density \r{ho}(x) on an infinite graph which supports the Sobolev inequality. For nonnegative solutions when p > 2, we prove the precise rate of…
We study sharp $p$-variational inequalities for the Hardy-Littlewood maximal operator on complete graphs, answering in the affirmative a question by Feng Liu and Qingying Xue. We also use computational assistance to find sharp constants in…
In this paper, we assume that $q>0$, $p>1$ and $s\in(0,1)$ , and consider the following nonlinear fractional p-Laplacian equations on finite graphs: \begin{equation*} \left\{ \begin{array}{lll} \partial_t u^q(x,t)+(-\Delta)_p^su=0,\\[15pt]…
On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity…
It is conjectured that the Laplacian spectrum of a graph is majorized by its conjugate degree sequence. In this paper, we prove that this majorization holds for a class of graphs including trees. We also show that a generalization of this…
We argue that the standard graph Laplacian is preferable for spectral partitioning of signed graphs compared to the signed Laplacian. Simple examples demonstrate that partitioning based on signs of components of the leading eigenvectors of…
Given a finite simple graph $\cG$ with $n$ vertices, we can construct the Cayley graph on the symmetric group $S_n$ generated by the edges of $\cG$, interpreted as transpositions. We show that, if $\cG$ is complete multipartite, the…
The celebrated Cheeger's Inequality establishes a bound on the edge expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and eigenvectors of the adjacency…
We establish the solvability of the $L^p$-Dirichlet and $L^{p^\prime}$-Neumann problems for the Laplacian for $p\in (\frac{n}{n-1}-\varepsilon,\frac{2n}{n-1}]$ for some $\varepsilon>0$ in $2$-sided chord-arc domains with unbounded boundary…
Let $B_2(p)$ be an $n$-dimensional smooth geodesic ball with Ricci curvature $\geq-(n-1)\kappa^2$ for some $\kappa\geq0$. We establish the Sobolev inequality and the uniform Neumann-Poincar\'e inequality on each minimal graph over $B_1(p)$…
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless Laplacian matrix. These bounds improve and extend previously known bounds.
In an attempt to characterize the structure of eigenvectors of random regular graphs, we investigate the correlations between the components of the eigenvectors associated to different vertices. In addition, we provide numerical…
The Neumann points of an eigenfunction $f$ on a quantum (metric) graph are the interior zeros of $f'$. The Neumann domains of $f$ are the sub-graphs bounded by the Neumann points. Neumann points and Neumann domains are the counterparts of…
We show how the spectrum of a graph Laplacian changes with respect to a certain type of rank-one perturbation. We apply our finding to give new short proofs of the spectral version of Kirchhoff's Matrix Tree Theorem and known derivations…