Related papers: Path Laplacian operators and superdiffusive proces…
The Laplacian matrix and its pseudo-inverse for a strongly connected directed graph is fundamental in computing many properties of a directed graph. Examples include random-walk centrality and betweenness measures, average hitting and…
Graph-based semi-supervised learning usually involves two separate stages, constructing an affinity graph and then propagating labels for transductive inference on the graph. It is suboptimal to solve them independently, as the correlation…
We consider uniformly subelliptic operators on certain unimodular Lie groups of polynomial growth. It was shown by Saloff-Coste and Stroock that classical results of De Giorgi, Nash, Moser, Aronson extend to this setting. It was then…
Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient…
Laplacian operators are classical objects that are fundamental in both pure and applied mathematics and are becoming increasingly prominent in modern computational and data science fields such as applied and computational topology and…
We derive an explicit formula for the fundamental solution $K_{T_{q+1}}(x,x_{0};t)$ to the discrete-time diffusion equation on the $(q+1)$-regular tree $T_{q+1}$ in terms of the discrete $I$-Bessel function. We then use the formula to…
We consider a one-dimensional diffusion process with coefficients that are periodic outside of a finite 'interface region'. The question investigated in this article is the limiting long time / large scale behaviour of such a process under…
In this paper, continuous-time master equations with finite states employed in nonequilibrium statistical mechanics are formulated in the language of discrete geometry. In this formulation, chains in algebraic topology are used, and master…
We establish conditions for which graph Laplacians $\Delta_{\lambda,\epsilon}$ on compact, boundaryless, smooth submanifolds $\mathcal{M}$ of Euclidean space are semiclassical pseudodifferential operators ($\Psi$DOs): essentially, that the…
Several variants of the graph Laplacian have been introduced to model non-local diffusion processes, which allow a random walker to {\textquotedblleft jump\textquotedblright} to non-neighborhood nodes, most notably the transformed path…
We present a numerical and partially analytical study of classical particles obeying a Langevin equation that describes diffusion on a surface modeled by a two dimensional potential. The potential may be either periodic or random. Depending…
Models of network diffusion typically rely on the Laplacian matrix, capturing interactions via direct connections. Beyond direct interactions, information in many systems can also flow via indirect pathways, where influence typically…
We first develop a general framework for Laplace operators defined in terms of the combinatorial structure of a simplicial complex. This includes, among others, the graph Laplacian, the combinatorial Laplacian on simplicial complexes, the…
A {\em k-generalized Dyck path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of horizontal-steps $(k, 0)$ for a given integer $k\geq 0$, up-steps $(1,1)$, and…
Diffusion models are state-of-the-art methods in generative modeling when samples from a target probability distribution are available, and can be efficiently sampled, using score matching to estimate score vectors guiding a Langevin…
We propose a Laplacian based on general inner product spaces, which we call the inner product Laplacian. We show the combinatorial and normalized graph Laplacians, as well as other Laplacians for hypergraphs and directed graphs, are special…
We report on recent progress in the study of nonlinear diffusion equations involving nonlocal, long-range diffusion effects. Our main concern is the so-called fractional porous medium equation, $\partial_t u +(-\Delta)^{s}(u^m)=0$, and some…
We propose an algebraic framework for generalized graph Laplacians which unifies the study of resistor networks, the critical group, and the eigenvalues of the Laplacian and adjacency matrices. Given a graph with boundary $G$ together with…
In this paper, we study the graph-theoretic analogues of vector Laplacian (or Helmholtz operator) and vector Laplace equation. We determine the graph matrix representation of vector Laplacian and obtain the dimension of solution space of…
The $p$-Laplacian for graphs, as well as the vertex Laplace operator and the hyperedge Laplace operator for the general setting of oriented hypergraphs, are generalized. In particular, both a vertex $p$-Laplacian and a hyperedge…