Related papers: Hypergraph $p$-Laplacians and Scale Spaces
We present a general graph-based modeling abstraction for optimization that we call an OptiGraph. Under this abstraction, any optimization problem is treated as a hierarchical hypergraph in which nodes represent optimization subproblems and…
We introduce submodular hypergraphs, a family of hypergraphs that have different submodular weights associated with different cuts of hyperedges. Submodular hypergraphs arise in clustering applications in which higher-order structures carry…
Urban mobility forecast and analysis can be addressed through grid-based and graph-based models. However, graph-based representations have the advantage of more realistically depicting the mobility networks and being more robust since they…
We describe operators driving the time evolution of singular diffusion on finite graphs whose vertices are allowed to carry masses. The operators are defined by the method of quadratic forms on suitable Hilbert spaces. The model also covers…
Higher-order relations are widespread in nature, with numerous phenomena involving complex interactions that extend beyond simple pairwise connections. As a result, advancements in higher-order processing can accelerate the growth of…
This is a tutorial and survey paper for nonlinear dimensionality and feature extraction methods which are based on the Laplacian of graph of data. We first introduce adjacency matrix, definition of Laplacian matrix, and the interpretation…
The gradient-flow dynamics of an arbitrary geometric quantity is derived using a generalization of Darcy's Law. We consider flows in both Lagrangian and Eulerian formulations. The Lagrangian formulation includes a dissipative modification…
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…
We consider diffusion on discrete measure spaces as encoded by Markovian semigroups arising from weighted graphs. We study whether the graph is uniquely determined if the diffusion is given up to order isomorphism. If the graph is recurrent…
We introduce a general framework for undirected graphical models. It generalizes Gaussian graphical models to a wide range of continuous, discrete, and combinations of different types of data. The models in the framework, called exponential…
In a recent breakthrough STOC~2015 paper, a continuous diffusion process was considered on hypergraphs (which has been refined in a recent JACM 2018 paper) to define a Laplacian operator, whose spectral properties satisfy the celebrated…
The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…
We explicitly construct parameter transformations between gradient flows in metric spaces, called curves of maximal slope, having different exponents when the associated function satisfies a suitable convexity condition. These…
Graph Laplacians computed from weighted adjacency matrices are widely used to identify geometric structure in data, and clusters in particular; their spectral properties play a central role in a number of unsupervised and semi-supervised…
The study of hypergraphs has received a lot of attention over the past few years, however up until recently there has been no interest in systems where higher order interactions are not undirected. In this article we introduce the notion of…
We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…
A directed hypergraph (dihypergraph) consists of a set of vertices and a set of hyperarcs, where each hyperarc is partitioned into a head and a tail. Directed hypergraphs are useful in many applications, including the study of chemical…
Topological landscape is introduced for networks with functions defined on the nodes. By extending the notion of gradient flows to the network setting, critical nodes of different indices are defined. This leads to a concise and…
Let $G$ be a weakly connected directed graph with asymmetric graph Laplacian ${\cal L}$. Consensus and diffusion are dual dynamical processes defined on $G$ by $\dot x=-{\cal L}x$ for consensus and $\dot p=-p{\cal L}$ for diffusion. We…
In recent work [1] we uncovered intriguing connections between Otto's characterisation of diffusion as entropic gradient flow [16] on one hand and large-deviation principles describing the microscopic picture (Brownian motion) on the other.…