Related papers: The Logarithmic Laplacian on General Graphs
In this article the problem to be studied is the following $$ (P) \left\{ \begin{array}{rcll} u_t+(-\D^s_{p}) u & = & f(x,t) & \text{ in } \O_{T}\equiv \Omega \times (0,T), \\ u & = & 0 & \text{ in }(\ren\setminus\O) \times (0,T), \\ u &…
On even-dimensional Euclidean space for integer powers of the Laplace operator greater than or equal to half the dimension, a fundamental solution of the polyharmonic equation has binomial and logarithmic behavior. Gegenbauer polynomial…
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 $G$ be a graph of order $n$ and let $\mathcal{L}(G,\lambda)=\sum_{k=0}^n (-1)^{k}c_{k}(G)\lambda^{n-k}$ be the characteristic polynomial of its Laplacian matrix. Motivated by Ili\'{c} and Ili\'{c}'s conjecture [A. Ili\'{c}, M. Ili\'{c},…
We investigate a generalized poly-Laplacian system with a parameter on weighted finite graph, a generalized poly-Laplacian system with a parameter and Dirichlet boundary value on weighted locally finite graphs, and a $(p,q)$-Laplacian…
In this paper, we consider three typical problems on a locally finite connected graph. The first one is to study the Bochner formula for the Laplacian operator on a locally finite connected graph. We use the Bochner formula to derive the…
The (torsion) complexity of a finite signed 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 ${\mathbb Z}^d$-action by graph…
In this paper, we are concerned with the following equation involving higher-order fractional Lapalacian \begin{equation*} \left\{\begin{aligned} &(-\Delta)^{p+{\frac{\alpha}{2}}}u(x)=u_+^\gamma~~ \mbox{ in }\mathbb{R}^n,\\…
We prove the Bochner-Weitzenb\"ock formula for the (nonlinear) Laplacian on general Finsler manifolds and derive Li-Yau type gradient estimates as well as parabolic Harnack inequalities. Moreover, we deduce Bakry-\'Emery gradient estimates.…
We study two different types of gluing for graphs: interface (obtained by choosing a common subgraph as the gluing component) and bridge gluing (obtained by adding a set of edges to the given subgraphs). We introduce formulae for computing…
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…
In this paper, we introduce a novel first-order derivative for functions on a lattice graph, and establish its weak (1, 1) estimate as well as strong (p, p) estimate for p > 1 in weighted spaces. This derivative is designed to reconstruct…
On $\mathbb{R}^n,$ a classical result due to Bourgain establishes the restricted weak $(\frac{n}{n-1},1)$ inequality for the full maximal function $M_F^{d\sigma}$ associated to the spherical averages. In this work we present an extension to…
The monopole-dimer model is a signed variant of the monomer-dimer model which has determinantal structure. We extend the monopole-dimer model for planar graphs (Math. Phys. Anal. Geom., 2015) to Cartesian products thereof and show that the…
We develop the theory of torsional rigidity -- a quantity routinely considered for Dirichlet Laplacians on bounded planar domains -- for Laplacians on metric graphs with at least one Dirichlet vertex. Using a variational characterization…
We introduce excess logarithmic residues for one-dimensional holomorphic foliations tangent to a divisor. They arise from the comparison between the logarithmic normal sheaf and the ordinary normal sheaf of the foliation, and measure the…
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…
We use classical Fourier analysis along with tools from the spectral theory of Automorphic forms to derive an asymptotic formula with a strong error term for the number of integer solutions $(a, b, c, d)$ inside the expanding box $[-X,X]^4$…
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…
Based on matrix perturbation theory, closed-form analytic expansions are studied for a Laplacian eigenvalue of an undirected, possibly weighted graph, which is close to a unique degree in that graph. An approximation is presented to provide…