Related papers: The Logarithmic Laplacian on General Graphs
We investigate the existence and concentration of normalized solutions for a $p$-Laplacian problem with logarithmic nonlinearity of type \[ \left\{ \begin{array}{ll} \displaystyle -\varepsilon^p\Delta_p u+V(x)|u|^{p-2}u=\lambda…
We prove upper bounds on the $L^p$ norms of eigenfunctions of the discrete Laplacian on regular graphs. We then apply these ideas to study the $L^p$ norms of joint eigenfunctions of the Laplacian and an averaging operator over a finite…
In this paper, we derive Li-Yau inequality for unbounded Laplacian on complete weighted graphs with the assumption of the curvature-dimension inequality $CDE'(n,K)$, which can be regarded as a notion of curvature on graphs. Furthermore, we…
We consider the fractional Laplacian operator $(-\Delta)^s$ (let $ s \in (0,1) $) on Euclidean space and investigate the validity of the classical integration-by-parts formula that connects the $ L^2(\mathbb{R}^d) $ scalar product between a…
Let $\{u_\lambda\}$ be a sequence of $L^2$-normalized Laplacian eigenfunctions on a compact two-dimensional smooth Riemanniann manifold $(M,g)$. We seek to get an $L^p$ restriction bounds of the Neumann data $ \lambda^{-1} \partial_\nu…
Modular graph functions associate to a graph an $SL(2,Z)$-invariant function on the upper half plane. We obtain the Fourier series of modular graph functions of arbitrary weight $w$ and two-loop order. The motivation for this work is to…
Integration by parts plays a crucial role in mathematical analysis, e.g., during the proof of necessary optimality conditions in the calculus of variations and optimal control. Motivated by this fact, we construct a new, right-weighted…
In this paper we are concerned with resolvent estimates for the Laplacian $\Delta$ in Euclidean spaces. Uniform resolvent estimates for $\Delta$ were shown by Kenig, Ruiz and Sogge \cite{KRS} who established rather a complete description of…
The fixed-point logic LREC= was developed by Grohe et al. (CSL 2011) in the quest for a logic to capture all problems decidable in logarithmic space. It extends FO+C, first-order logic with counting, by an operator that formalises a limited…
We develop physically admissible lattice models in the harmonic approximation which define by Hamilton's variational principle fractional Laplacian matrices of the forms of power law matrix functions on the n -dimensional periodic and…
Let $G$ be a simple graph with $n$ vertices and let $$C(G;x)=\sum_{k=0}^n(-1)^{n-k}c(G,k)x^k$$ denote the Laplacian characteristic polynomial of $G$. Then if the size $|E(G)|$ is large compared to the maximum degree $\Delta(G)$, Laplacian…
We provide sharp boundary regularity estimates for solutions to elliptic equations driven by an integro-differential operator obtained as the sum of a Laplacian with a nonlocal operator generalizing a fractional Laplacian. Our approach…
In this article, we show the existence of a unique entropy solution to the following problem: \begin{equation} \begin{split} (-\Delta)_{p,\alpha}^su&= f(x)h(u)+g(x) ~\text{in}~\Omega,\\ u&>0~\text{in}~\Omega,\\ u&=…
For a simple and connected graph, a new graph invariant $s_{\alpha}^{*}(G)$, defined as the sum of powers of the eigenvalues of the normalized Laplacian matrix, has been introduced by Bozkurt and Bozkurt in [7]. Lower and upper bounds have…
The (torsion) complexity of a finite edge-weighted graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When G is d-periodic (i.e., G has a free action of the rank-d free abelian…
The spectrum of the Laplacian of successive Barycentric subdivisions of a graph converges exponentially fast to a limit which only depends on the clique number of the initial graph and not on the graph itself. The proof uses an explicit…
Consider a surface $\Omega$ with a boundary obtained by gluing together a finite number of equilateral triangles, or squares, along their boundaries, equipped with a flat unitary vector bundle. Let $\Omega^{\delta}$ be the discretization of…
We consider modified Laplacian matrices of graphs, obtained by adding the identity matrix to the Laplacian matrix $L_G$ of a graph $G$. This results in a positive definite matrix $\tilde{L}_G$. The inverse of $\tilde{L}_G$ is a doubly…
We show that an arithmetic lattice $\Gamma$ in a semi-simple Lie group $G$ contains a torsion-free subgroup of index $\delta(v)$ where $v = \mu (G/\Gamma)$ is the co-volume of the lattice. We prove that $\delta$ is polynomial in general and…
We prove Poincar\'e and Plancherel-Polya inequalities for weighted {\ell}p -spaces on weighted graphs in which the constants are explicitly expressed in terms of some geometric characteristics of a graph. We use Poincar\'e type inequality…