Related papers: The Logarithmic Laplacian on General Graphs
In this paper, we study the semilinear elliptic equation of the form \begin{eqnarray*} -\Delta u+a(x)|u|^{p-2}u-b(x)|u|^{q-2}u=0 \end{eqnarray*} on lattice graphs $\mathbb{Z}^{N}$, where $N\geq 2$ and $2\leq p<q<+\infty$. By the…
We give a construction of a class of magnetic Laplacian operators on finite directed graphs. We study some general combinatorial and algebraic properties of operators in this class before applying the Harrell-Stubbe Averaged Variational…
Motivated by the problem of understanding theoretical bounds for the performance of the Belkin-Niyogi Laplacian eigencoordinate approach to dimension reduction in machine learning problems, we consider the convergence of random graph…
Laplacian matrices of graphs arise in large-scale computational applications such as machine learning; spectral clustering of images, genetic data and web pages; transportation network flows; electrical resistor circuits; and elliptic…
We provide bounds for the sequence of eigenvalues $\{\lambda_i(\Omega)\}_i$ of the Dirichlet problem $$ L_\Delta u=\lambda u\ \ {\rm in}\ \, \Omega,\quad\quad u=0\ \ {\rm in}\ \ \mathbb{R}^N\setminus \Omega,$$ where $L_\Delta$ is the…
In this article, we extend the notion of the Laplacian spread to simple directed graphs (digraphs) using the restricted numerical range. First, we provide Laplacian spread values for several families of digraphs. Then, we prove sharp upper…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
We investigate the multiplicity of solutions for a generalized poly-Laplacian system on weighted finite graphs and a generalized poly-Laplacian system with Dirichlet boundary value on weighted locally finite graphs, respectively, via the…
We investigate the space complexity of solving linear systems of equations. While all known deterministic or randomized algorithms solving a square system of $n$ linear equations in $n$ variables require $\Omega(\log^2 n)$ space, Ta-Shma…
An oriented hypergraph is an oriented incidence structure that generalizes and unifies graph and hypergraph theoretic results by examining its locally signed graphic substructure. In this paper we obtain a combinatorial characterization of…
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.…
The fractional Laplacian $(-\Delta)^{\alpha/2}$ is a non-local operator which depends on the parameter $\alpha$ and recovers the usual Laplacian as $\alpha \to 2$. A numerical method for the fractional Laplacian is proposed, based on the…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
The Weisfeiler-Leman (WL) algorithm is a well-known combinatorial procedure for detecting symmetries in graphs and it is widely used in graph-isomorphism tests. It proceeds by iteratively refining a colouring of vertex tuples. The number of…
We study solutions to $Lu=f$ in $\Omega\subset\mathbb R^n$, being $L$ the generator of any, possibly non-symmetric, stable L\'evy process. On the one hand, we study the regularity of solutions to $Lu=f$ in $\Omega$, $u=0$ in $\Omega^c$, in…
In this paper, we investigate the existence and uniqueness of a non-trivial solution for a class of nonlocal equations involving the fractional $p$-Laplacian operator defined on compact Riemannian manifold, namely,…
We consider the fractional Schrodinger equation with a logarithmic nonlinearity, when the power of the Laplacian is between zero and one. We prove global existence results in three different functional spaces: the Sobolev space…
Laplacian matrices of graphs arise in large-scale computational applications such as semi-supervised machine learning; spectral clustering of images, genetic data and web pages; transportation network flows; electrical resistor circuits;…
The Weisfeiler-Leman (WL) dimension of a graph is a measure for the inherent descriptive complexity of the graph. While originally derived from a combinatorial graph isomorphism test called the Weisfeiler-Leman algorithm, the WL dimension…
We show that the (normalized) symmetric Laplacian of a simple graph can be obtained from the partial trace over a pure bipartite quantum state that resides in a bipartite Hilbert space (one part corresponding to the vertices, the other…