English
Related papers

Related papers: Bi-Laplacians on graphs and networks

200 papers

Convolutional layers within graph neural networks operate by aggregating information about local neighbourhood structures; one common way to encode such substructures is through random walks. The distribution of these random walks evolves…

Machine Learning · Computer Science 2022-05-30 Csaba Toth , Darrick Lee , Celia Hacker , Harald Oberhauser

We consider an elliptic equation with the fractional Laplacian operator $(-\Delta)^{\frac{\alpha}{2}}$ in the dissipative term, a singular integral operator ${\bf A}(\cdot)$ in the nonlinear term, and an external source $f$. The key example…

Analysis of PDEs · Mathematics 2025-02-25 Oscar Jarrin

In graph signal processing, the graph adjacency matrix or the graph Laplacian commonly define the shift operator. The spectral decomposition of the shift operator plays an important role in that the eigenvalues represent frequencies and the…

Numerical Analysis · Computer Science 2016-11-09 Stephen Kruzick , Jose M. F. Moura

We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and…

Classical Analysis and ODEs · Mathematics 2016-03-08 Paul J. Koprowski

We demonstrate a method of associating the principal symbol at a $K$-point with a linear differential operator acting between modules over a commutative algebra, and we use it to define the ellipticity of a linear differential operator in a…

Commutative Algebra · Mathematics 2018-03-23 Sławomir Kapka

We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural…

Spectral Theory · Mathematics 2023-06-13 Jürgen Jost , Raffaella Mulas , Leo Torres

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…

Combinatorics · Mathematics 2015-12-02 Yong Lin , Gabor Lippner , Dan Mangoubi , Shing-Tung Yau

We investigate properties of Markov quasi-diffusion processes corresponding to elliptic operators $L=a^{ij}D_{ij}+b^{i}D_{i}$, acting on functions on $\mathbb{R}^{d}$, with measurable coefficients, bounded and uniformly elliptic $a$ and…

Probability · Mathematics 2020-04-01 N. V. Krylov

Consider a semigraph $G=(V,\,E)$; in this paper, we study the eigenvalues of the Laplacian matrix of $G$. We show that the Laplacian of $G$ is positive semi-definite, and $G$ is connected if and only if $\lambda_2 >0.$ Along the similar…

Combinatorics · Mathematics 2023-07-10 Pralhad M. Shinde

In this paper following the same methods in [M. Kadakal, O. Sh. Mukhtarov, Sturm-Liouville problems with discontinuities at two points, Comput. Math. Appl., 54 (2007) 1367-1379] we investigate discontinuous two-point boundary value problems…

Classical Analysis and ODEs · Mathematics 2013-04-23 Erdoğan Şen , Oktay Mukhtarov

Dynamical processes on networks are currently being considered in different domains of cross-disciplinary interest. Reaction-diffusion systems hosted on directed graphs are in particular relevant for their widespread applications, from…

Statistical Mechanics · Physics 2016-04-06 Silvia Contemori , Francesca Di Patti , Duccio Fanelli , Filippo Miele

We consider the Laplacian in $\mathbb{R}^n$ perturbed by a finite number of distant perturbations those are abstract localized operators. We study the asymptotic behaviour of the discrete spectrum as the distances between perturbations tend…

Mathematical Physics · Physics 2009-11-11 Denis I. Borisov

This paper provides a quantitative study of nonnegative solutions to nonlinear diffusion equations of porous medium-type of the form $\partial_t u + {\mathcal L}u^m=0$, $m>1$, where the operator ${\mathcal L}$ belongs to a general class of…

Analysis of PDEs · Mathematics 2018-03-16 Matteo Bonforte , Alessio Figalli , Juan Luis Vazquez

We perform quantitative spectral analysis of the self-adjoint Dirichlet Laplacian $\mathsf{H}$ on an unbounded, radially symmetric (generalized) parabolic layer $\mathcal{P}\subset\mathbb{R}^3$. It was known before that $\mathsf{H}$ has an…

Spectral Theory · Mathematics 2018-06-01 Pavel Exner , Vladimir Lotoreichik

Consider an elliptic self-adjoint pseudodifferential operator $A$ acting on $m$-columns of half-densities on a closed manifold $M$, whose principal symbol is assumed to have simple eigenvalues. Relying on a basis of pseudodifferential…

Analysis of PDEs · Mathematics 2022-01-12 Matteo Capoferri

In a finite-dimensional Euclidian space we consider a connected metric graph with the following property: each two cycles can have at most one common point. Such graphs are called A-graphs. On noncompact A-graph we consider a scattering…

Spectral Theory · Mathematics 2013-11-13 Mikhail Ignatyev

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…

Numerical Analysis · Mathematics 2022-08-15 Piero Deidda , Mario Putti , Francesco Tudisco

We establish optimal L^p bounds for the nontangential maximal function of the gradient of the solution to a second order elliptic operator in divergence form, possibly non-symmetric, with bounded measurable coefficients independent of the…

Analysis of PDEs · Mathematics 2007-05-23 Carlos E. Kenig , David J. Rule

In this article a class of additive invariant positive selfadjoint pseudodifferential unbounded operators on $L^{2}(\mathbb{A}_{f})$, where $\mathbb{A}_{f}$ is the ring of finite ad\'eles of the rational numbers, is considered to state a…

Analysis of PDEs · Mathematics 2018-05-31 V. A. Aguilar-Arteaga , S. Estala-Arias

Let $G$ be a simple connected simple graph of order $n$. The distance Laplacian matrix $D^{L}(G)$ is defined as $D^L(G)=Diag(Tr)-D(G)$, where $Diag(Tr)$ is the diagonal matrix of vertex transmissions and $D(G)$ is the distance matrix of…

Combinatorics · Mathematics 2022-10-20 Saleem Khan , S. Pirzada