Related papers: Path Laplacian operators and superdiffusive proces…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
Quantum walks generated by the adjacency matrix or the Laplacian are known to exhibit low transfer fidelity on general graphs. In this paper, we study continuous-time quantum walks governed by the generalized Laplacian operator L_k = A+kD,…
A central problem in data analysis is the low dimensional representation of high dimensional data, and the concise description of its underlying geometry and density. In the analysis of large scale simulations of complex dynamical systems,…
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in…
The $k$-parallel subdivision graph $S_k(G)$ is generated from $G$ which each edge of $G$ is replaced by $k$ parallel paths of length 2. The $2k$-parallel subdivision graph $S_{2k}(G)$ is constructed from $G$ which each edge of $G$ is…
A construction of a pseudo-differential operator on non-archimedean local fields invariant under a finite group action is given together with the solution of the corresponding Cauchy problem. This construction is applied to parts of the…
We study nonlinear elliptic equations for operators corresponding to non-stable L\'evy diffusions. We include a sum of fractional Laplacians of different orders. Such operators are infinitesimal generators of non-stable (i.e., non…
In this paper we study existence and uniqueness of solutions for a very general class of doubly nonlinear diffusion equations on metric graphs, which provide the appropriate mathematical framework to describe complex tubular networks in…
We construct admissible circulant Laplacian matrix functions as generators for strictly increasing random walks on the integer line. These Laplacian matrix functions refer to a certain class of Bernstein functions. The approach has…
We study the $p$-independence of spectra of Laplace operators on graphs arising from regular Dirichlet forms on discrete spaces. Here, a sufficient criterion is given solely by a uniform subexponential growth condition. Moreover, under a…
The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…
We study a transmission problem, in population dynamics, between two juxtaposed habitats. In each habitat, we consider a generalized diffusion equation composed by the Laplace operator and a biharmonic term. We consider that the…
In network science, the interplay between dynamical processes and the underlying topologies of complex systems has led to a diverse family of models with different interpretations. In graph signal processing, this is manifested in the form…
In this paper, we present GGSD, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process. Specifically, we propose to use a denoising model to sample eigenvectors and…
There has been recent work [Louis STOC 2015] to analyze the spectral properties of hypergraphs with respect to edge expansion. In particular, a diffusion process is defined on a hypergraph such that within each hyperedge, measure flows from…
Diffusing a graph signal at multiple scales requires computing the action of the exponential of several multiples of the Laplacian matrix. We tighten a bound on the approximation error of truncated Chebyshev polynomial approximations of the…
We study the properties of the ``Rigid Laplacian'' operator, that is we consider solutions of the Laplacian equation in the presence of fixed truncation errors. The dynamics of convergence to the correct analytical solution displays the…
We consider Laplace operators on periodic discrete graphs perturbed by guides, i.e., graphs which are periodic in some directions and finite in other ones. The spectrum of the Laplacian on the unperturbed graph is a union of a finite number…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
Given i.i.d. observations uniformly distributed on a closed submanifold of the Euclidean space, we study higher-order generalizations of graph Laplacians, so-called Hodge Laplacians on graphs, as approximations of the Laplace-Beltrami…