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

Path homology proposed by S.-T.Yau and his co-workers provides a new mathematical model for directed graphs and networks. Persistent path homology (PPH) extends the path homology with filtration to deal with asymmetry structures. However,…

We study the spectral gap of the Erd\H{o}s--R\'enyi random graph through the connectivity threshold. In particular, we show that for any fixed $\delta > 0$ if $$p \ge \frac{(1/2 + \delta) \log n}{n},$$ then the normalized graph Laplacian of…

We study the positive solutions of the Lane-Emden equation $-\Delta_{p}u=\lambda_{p}|u|^{q-2}u$ in $\Omega$ with homogeneous Dirichlet boundary conditions, where $\Omega\subset\mathbb{R}^{N}$ is a bounded and smooth domain, $N\geq2,$…

Persistent Laplacians are matrix operators that track how the shape and structure of data transform across scales and are popularly adopted in biology, physics, and machine learning. Their eigenvalues are concise descriptors of geometric…

We prove a Lichnerowicz type lower bound for the first nontrivial eigenvalue of the $p$-Laplacian on K\"ahler manifolds. Parallel to the $p = 2$ case, the first eigenvalue lower bound is improved by using a decomposition of the Hessian on…

In 2003, Del Pino and Dolbeault [14] and Gentil [19] investigated, independently, best constants and extremals associated to Euclidean Lp-entropy inequalities for p > 1. In this work, we present some contributions in the Riemannian context.…

A sign is introduced in the usual Laplacian on graphs and the corresponding analogue of the isoperimetric constant for this Laplacian is presented, i.e. a geometric quantity which enables to bound from above and below the first eigenvalue.…

We consider the action of the (combinatorial) Laplacian of a finite and simple graph on integer vectors. By a \emph{Laplacian monopole} we mean an image vector negative at exactly one coordinate associated with a vertex. We consider a…

Let $\Omega$ be a bounded, smooth domain. Supposing that $\alpha(p) + \beta(p) = p$, $\forall\, p \in \left(\frac{N}{s},\infty\right)$ and $\displaystyle\lim_{p \to \infty} \alpha(p)/{p} = \theta \in (0,1)$, we consider two systems for the…

In this paper, we investigate the Dirichlet problem of Laplacian on complete Riemannian manifolds. By constructing new trial functions, we obtain a sharp upper bound of the gap of the consecutive eigenvalues in the sense of the order, which…

In this paper we study the $L^p$ boundary value problems for $\mathcal{L}(u)=0$ in $\mathbb{R}^{d+1}_+$, where $\mathcal{L}=-\text{div}(A\nabla)$ is a second order elliptic operator with real and symmetric coefficients. Assume that $A$ is…

With the development of quantum algorithms, high-cost computations are being scrutinized in the hope of a quantum advantage. While graphs offer a convenient framework for multiple real-world problems, their analytics still comes with high…

As a generalization of graphs, hypergraphs are widely used to model higher-order relations in data. This paper explores the benefit of the hypergraph structure for the interpolation of point cloud data that contain no explicit structural…

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_N(\tfrac{i}{N},\tfrac{j}{N})$,…

Let $G$ be a graph with $p(G)$ pendant vertices and $q(G)$ quasi-pendant vertices. Denote by $m_{L(G)}(\lambda)$ the multiplicity of $\lambda$ as a Laplacian eigenvalue of $G$. Let $\overline{G}$ be the reduced graph of $G$, which can be…

Let $D, \Omega_1, ..., \Omega_m$ be irreducible bounded symmetric domains. We study local holomorphic maps from $D$ into $\Omega_1 \times... \Omega_m$ preserving the invariant $(p, p)$-forms induced from the normalized Bergman metrics up to…

This paper aims to compute and estimate the eigenvalues of the Hodge Laplacians on directed graphs. We have devised a new method for computing Hodge spectra with the following two ingredients. (I) We have observed that the product rule does…

Here, we study Hamilton-Jacobi-Bellman equations on graphs. These are meant to be the analog of any of the following types of equations in the continuum setting of partial differential and nonlocal integro-differential equations:…

A Boolean function $f:V \to \{-1,1\}$ on the vertex set of a graph $G=(V,E)$ is locally $p$-stable if for every vertex $v$ the proportion of neighbours $w$ of $v$ with $f(v)=f(w)$ is exactly $p$. This notion was introduced by Gross and…

We establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $\nu_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schr\"odinger operators…