Related papers: Non-Markovian heat flows on directed hypergraphs
The development of simple and fast hypergraph spectral methods has been hindered by the lack of numerical algorithms for simulating heat diffusions and computing fundamental objects, such as Personalized PageRank vectors, over hypergraphs.…
Diffuse interface methods have recently been introduced for the task of semi-supervised learning. The underlying model is well-known in materials science but was extended to graphs using a Ginzburg--Landau functional and the graph…
In this paper we propose a spectral flow for graph Laplacians, and prove that it counts the number of nodal domains for a given Laplace eigenvector. This extends work done for Laplacians on $\mathbb{R}^n$ to the graph setting. We mention…
We introduce nonlocal dynamics on directed networks through the construction of a fractional version of a nonsymmetric Laplacian for weighted directed graphs. Furthermore, we provide an analytic treatment of fractional dynamics for both…
Subdiffusion on graphs is often modeled by time-fractional diffusion equations, yet its structural and dynamical consequences remain unclear. We show that subdiffusive transport on graphs is a memory-driven process generated by a random…
I extend the methods in "Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs, with Paul Christiano, Jonathan Kelner, Daniel Spielman, and Shang-Hua Teng" to directed graphs with a variation of…
In a previous work, the authors introduced a Lin-Lu-Yau type Ricci curvature for directed graphs referring to the formulation of the Chung Laplacian. The aim of this note is to provide a von Renesse-Sturm type characterization of our lower…
We consider the problem of heat diffusion in branched systems and networks on the basis of a model described in terms of heat equation on metric graphs. Using the explicit analytical solutions of the latter, evolution of the temperature…
We discuss Neumann problems for self-adjoint Laplacians on (possibly infinite) graphs. Under the assumption that the heat semigroup is ultracontractive we discuss the unique solvability for non-empty subgraphs with respect to the vertex…
It is now well known that ultracontractive properties of semigroups with infinitesimal generator given by an undirected graph Laplacian operator can be obtained through an understanding of the geometry of the underlying infinite weighted…
We study the physical Laplacian and the corresponding heat flow on an infinite, locally finite graph with possibly unbounded valence.
Though commonly found in the real world, directed networks have received relatively less attention from the literature in which concerns their topological and dynamical characteristics. In this work, we develop a magnetic Laplacian-based…
We investigate fast diffusions on finite directed graphs. We prove results in a way dual to presented in Bobrowski, A. Ann. Henri Poincar\'e (2012) 13(6): 1501-1510 and Bobrowski, A., Morawska, K. DCDS-B (2012), 17(7): 2313-2327, and obtain…
We construct self-adjoint Laplacians and symmetric Markov semigroups on hyperbolic attractors, endowed with Gibbs $u$-measures. If the measure has full support, we can also conclude the existence of an associated symmetric diffusion…
This paper introduces gradient, adjoint, and $p$-Laplacian definitions for oriented hypergraphs as well as differential and averaging operators for unoriented hypergraphs. These definitions are used to define gradient flows in the form of…
Hypergraphs are useful mathematical models for describing complex relationships among members of a structured graph, while hyperdigraphs serve as a generalization that can encode asymmetric relationships in the data. However, obtaining…
We construct self-adjoint Laplacians and symmetric Markov semigroups on partially hyperbolic attractors and on hyperbolic attractors with singularities, endowed with Gibbs u-measures. If the measure has full support, we can also guarantee…
Heat diffusion describes the process by which heat flows from areas with higher temperatures to ones with lower temperatures. This concept was previously adapted to graph structures, whereby heat flows between nodes of a graph depending on…
We introduce a sub-Riemannian analogue of the Bence-Merriman-Osher diffusion driven algorithm and show that it leads to weak solutions of the horizontal mean curvature flow of graphs over sub-Riemannian Carnot groups. The proof follows the…
We consider mass concentration properties of Laplace eigenfunctions $\varphi_\lambda$, that is, smooth functions satisfying the equation $-\Delta \varphi_\lambda = \lambda \varphi_\lambda$, on a smooth closed Riemannian manifold. Using a…