相关论文: Homological eigenvalues of graph $p$-Laplacians

Given a length function on the edge set of a finite graph, we define a vertex-weight and an edge-weight in terms of it and consider the corresponding graph Laplacian. In this paper, we consider the problem of maximizing the first nonzero…

Let $\Omega\subset \mathbb{R}^n$ be a bounded $C^1$ domain and $p>1$. For $\alpha>0$, define the quantity \[ \Lambda(\alpha)=\inf_{u\in W^{1,p}(\Omega),\, u\not\equiv 0} \Big(\int_\Omega |\nabla u|^p\,\mathrm{d}x - \alpha…

In this paper we study the eigenvalues of the laplacian matrices of the cyclic graphs with one edge of weight $\alpha$ and the others of weight $1$. We denote by $n$ the order of the graph and suppose that $n$ tends to infinity. We notice…

Let $(M^n, g, e^{-f}dv)$ be a smooth metric measure space of dimensional $n$. Suppose that $v$ is a positive weighted $p$-eigenfunctions associated to the eigenvalues $\lambda_{1,p}$ on $M$, namely $$ e^{f}div(e^{-f}|\nabla v|^{p-2}\nabla…

We present two graph quantities Psi(G,S) and Psi_2(G) which give constant factor estimates to the Dirichlet and Neumann eigenvalues, lambda(G,S) and lambda_2(G), respectively. Our techniques make use of a discrete Hardy-type inequality.

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…

In 2018, by Ramsey and Hoffman theory, Koolen, Yang, and Yang presented a structural result on graphs with smallest eigenvalue at least $-3$ and large minimum degree. In this study, we depart from the conventional use of Ramsey theory and…

For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…

We present a systematic study of the regularity phenomena for NIP hypergraphs and connections to the theory of (locally) generically stable measures, providing a model-theoretic hypergraph version of the results from [L. Lov\'asz, B.…

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.…

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…

We discuss several properties of eigenvalues and eigenfunctions of the $p$-Laplacian on a ball subject to zero Dirichlet boundary conditions. Among main results, in two dimensions, we show the existence of nonradial eigenfunctions which…

We answer a question of Jakobson and Nadirashvili on the asymptotic behavior of the $L^p$ norms of positive and negative parts of eigenfunctions of the Laplacian. More precisely, we show that there exists a sequence of eigenfunctions…

We consider the so-called \emph{discrete $p$-Laplacian}, a nonlinear difference operator that acts on functions defined on the nodes of a possibly infinite graph. We study the associated nonlinear Cauchy problem and identify the generator…

We consider the eigenvalue problem for the {\it fractional $p-$Laplacian} in an open bounded, possibly disconnected set $\Omega \subset \mathbb{R}^n$, under homogeneous Dirichlet boundary conditions. After discussing some regularity issues…

The smallest nonzero eigenvalue of the normalized Laplacian matrix of a graph has been extensively studied and shown to have many connections to properties of the graph. We here study a generalization of this eigenvalue, denoted $\lambda(G,…

We develop the basic theory of eigenvalues of $p$-adic random matrices, analogous to the classical theory for random matrices over $\mathbb{R}$ and $\mathbb{C}$. Such eigenvalue statistics were proposed as a model for the zeroes of $p$-adic…

Let $p$ be a real number greater than one and let $G$ be a connected graph of bounded degree. In this paper we introduce the $p$-harmonic boundary of $G$. We use this boundary to characterize the graphs $G$ for which the constant functions…

The $k$-token graph $F_k(G)$ of a graph $G$ on $n$ vertices is the graph whose vertices are the ${n\choose k}$ $k$-subsets of vertices from $G$, two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices…