Related papers: The Logarithmic Laplacian on General Graphs

We present a thorough study of the theoretical properties and devise efficient algorithms for the \emph{persistent Laplacian}, an extension of the standard combinatorial Laplacian to the setting of pairs (or, in more generality, sequences)…

We introduce the the fractional Laplacian on a subgraph of a graph with Dirichlet boundary condition. For a lattice graph, we prove the upper and lower estimates for the sum of the first $k$ Dirichlet eigenvalues of the fractional…

This paper is devoted to the Laplacian operator of fractional order $s\in (0,1)$ in several dimensions. We consider the equation $(-\Delta)^su=f(x,u)$ in $\Omega$, $u=0$ in $\Omega^c$ and establish a representation formula for partial…

We establish an asymptotic formula for the logarithmic mean value of a 1-bounded multiplicative function that is sharp in many cases of interest. We derive from it a variety of applications, making progress on several old problems. As a…

We study the fractional Laplacian $(-\Delta)^{\sigma/2}$ on the $n$-dimensional torus $\mathbb{T}^n$, $n\geq1$. First, we present a general extension problem that describes \textit{any} fractional power $L^\gamma$, $\gamma>0$, where $L$ is…

In this paper, we study the fractional $p$-Laplacian Choquard equation $$ (-\Delta)_{p}^{s} u+h(x)|u|^{p-2} u=\left(R_{\alpha} *F(u)\right)f(u) $$ on lattice graphs $\mathbb{Z}^d$, where $s\in(0,1)$, $ p\geq 2$, $\alpha \in(0, d)$ and…

Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include…

The 1D discrete fractional Laplacian operator on a cyclically closed (periodic) linear chain with finitenumber $N$ of identical particles is introduced. We suggest a "fractional elastic harmonic potential", and obtain the $N$-periodic…

In even-dimensional Euclidean space for integer powers of the Laplacian greater than or equal to the dimension divided by two, a fundamental solution for the polyharmonic equation has logarithmic behavior. We give two approaches for…

Let $ G=(V,E) $ be a connected finite graph and $ \Delta $ the usual graph Laplacian. In this paper, we consider a generalized self-dual Chern-Simons equation on the graph $G$ \begin{eqnarray}\label{one1}…

We study Laplacians associated to a graph and single out a class of such operators with special regularity properties. In the case of locally finite graphs, this class consists of all selfadjoint, non-negative restrictions of the standard…

Let $L_\nu = -\partial_x^2-(\nu-1)x^{-1} \partial_x$ be the Bessel operator on the half-line $X_\nu = [0,\infty)$ with measure $x^{\nu-1} \,\mathrm{d} x$. In this work we study singular integral operators associated with the Laplacian…

Our primary motivation is existence and uniqueness for the obstacle problem on graphs. That is, we look for unique solutions to the problem $Lu = \chi_{\{u>0\}}$, where $L$ is the Laplacian matrix associated to a graph, and $u$ is a…

In this paper we obtain logarithmic Hardy and Rellich inequalities on general Lie groups. In the case of graded groups, we also show their refinements using the homogeneous Sobolev norms. In fact, we derive a family of weighted logarithmic…

We prove essentially optimal $L^p(\mathbb{R})$-estimates for variational variants of the maximal Fourier multiplier operators considered by Bourgain in his work on pointwise convergence of polynomial ergodic averages. As a corollary of our…

Inspired by the linear Schr\"odinger operator, we consider a generalized $p$-Laplacian operator on discrete graphs and present new results that characterize several spectral properties of this operator with particular attention to the nodal…

The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…

An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called ``ice-type…

We consider a generalization of the diffusion equation on graphs. This generalized diffusion equation gives rise to both normal and superdiffusive processes on infinite one-dimensional graphs. The generalization is based on the $k$-path…

In this paper we study the problem \[ \begin{cases} -\Delta_d u = \mu_0 &\text{ in } G\\ u = 0 &\text{ on } \partial G \end{cases} \] where, $\Delta_d$ represent the discret Laplacian, and $\mu_0$ it is a measure defined in the vertex of…