Related papers: Path Laplacian operators and superdiffusive proces…
Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…
Building on mathematical similarities between quantum mechanics and theories of diffusion-influenced reactions, we discuss how the propagator of a reacting molecule pair can be represented as a product of three factors in the Laplace…
For positive integers $d<k$ and $n$ divisible by $k$, let $m_{d}(k,n)$ be the minimum $d$-degree ensuring the existence of a perfect matching in a $k$-uniform hypergraph. In the graph case (where $k=2$), a classical theorem of Dirac says…
We consider the infinite-dimensional Lie group $\mathfrak G$ which is the semidirect product of the group of compactly supported diffeomorphisms of a Riemannian manifold $X$ and the commutative multiplicative group of functions on $X$. The…
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
A new class of relativistic diffusions encompassing all the previously studied examples has recently been introduced by C. Chevalier and F. Debbasch, both in a heuristic and analytic way. A pathwise approach of these processes is proposed…
The main object of this work is the top-dimensional Laplacian operator of a simplicial complex $K$. We study its spectral limiting behavior under a given non-trivial subdivision procedure $\text{div}$. It will be shown that in case…
We provide a class of self-adjoint Laplace operators on metric graphs with the property that the solutions of the associated wave equation satisfy the finite propagation speed property. The proof uses energy methods, which are adaptions of…
There are two main notions of a Laplacian operator associated with graphs: discrete graph Laplacians and continuous Laplacians on metric graphs (widely known as quantum graphs). Both objects have a venerable history as they are related to…
We generalize the normalized combinatorial Laplace operator for graphs by defining two Laplace operators for hypergraphs that can be useful in the study of chemical reaction networks. We also investigate some properties of their spectra.
We consider a bistable reaction-diffusion equation on a metric graph that is a generalization of the so-called star graphs. More precisely, our graph $\Omega$ consists of a bounded finite metric graph $D$ of arbitrary configuration and a…
A class of Laplace transforms is examined to show that particular cases of this class are associated with production-destruction and reaction-diffusion problems in physics, study of differences of independently distributed random variables…
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…
As a generalization of graphs, hypergraphs are widely used to model higher-order relations in data. This paper explores the benefit of the hypergraph structure for the interpolation of point cloud data that contain no explicit structural…
We present a new approach to the theory of k-forms on self-similar fractals. We work out the details for two examples, the standard Sierpinski gasket and the 3-dimensional Sierpinski gasket, but the method is expected to be effective for…
We present a novel approach of discretizing variable coefficient diffusion operators in the context of meshfree generalized finite difference methods. Our ansatz uses properties of derived operators and combines the discrete Laplace…
In this paper, we consider a relation between $k$-way expansion constant of a finite graph and the expansion constants of subgraphs in a $k$-partition of the graph. Using this relation, we show that a sequence of finite graphs which have…
We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…
The graph Laplacian is an important tool in Graph Signal Processing (GSP) as its eigenvalue decomposition acts as an analogue to the Fourier transform and is known as the Graph Fourier Transform (GFT). The line graph has a GFT that is a…
We establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $\nu_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schr\"odinger operators…