Related papers: Generalizing the Hypergraph Laplacian via a Diffus…
Obtaining sparse, interpretable representations of observable data is crucial in many machine learning and signal processing tasks. For data representing flows along the edges of a graph, an intuitively interpretable way to obtain such…
We reconsider the problem of diffusion of particles at constant speed and present a generalization of the Telegrapher process to higher dimensional stochastic media ($d>1$), where the particle can move along $2^d$ directions. We derive the…
Graph diffusion models have made significant progress in learning structured graph data and have demonstrated strong potential for predictive tasks. Existing approaches typically embed node, edge, and graph-level features into a unified…
This work focuses on exploring the potential benefits of introducing a nonlinear Laplacian in Sheaf Neural Networks for graph-related tasks. The primary aim is to understand the impact of such nonlinearity on diffusion dynamics, signal…
By using a general version of curvature condition, derivative inequalities are established for a large class of subelliptic diffusion semigroups. As applications, the Harnack/cost-entropy/cost-variance inequalities for the diffusion…
Diffusion models have achieved remarkable success in image and video generation. In this work, we demonstrate that diffusion models can also \textit{generate high-performing neural network parameters}. Our approach is simple, utilizing an…
This paper introduces a novel hierarchical autoencoder that maps 3D models into a highly compressed latent space. The hierarchical autoencoder is specifically designed to tackle the challenges arising from large-scale datasets and…
Fluid diffusion in unsaturated porous media manifests strong hysteresis effects due to surface tension on the liquid-gas interface. We describe hysteresis in the pressure-saturation relation by means of the Preisach operator, which makes…
Models describing transport and diffusion processes occurring along the edges of a graph and interlinked by its vertices have been recently receiving a considerable attention. In this paper we generalize such models and consider a network…
The spectral properties of the Laplacian operator on ``small-world'' lattices, that is mixtures of unidimensional chains and random graphs structures are investigated numerically and analytically. A transfer matrix formalism including a…
In the limit of a nonlinear diffusion model involving the fractional Laplacian we get a "mean field" equation arising in superconductivity and superfluidity. For this equation, we obtain uniqueness, universal bounds and regularity results.…
In this article, we extend the notion of the Laplacian spread to simple directed graphs (digraphs) using the restricted numerical range. First, we provide Laplacian spread values for several families of digraphs. Then, we prove sharp upper…
Learning the distribution of data on Riemannian manifolds is crucial for modeling data from non-Euclidean space, which is required by many applications in diverse scientific fields. Yet, existing generative models on manifolds suffer from…
Graph convolutional neural networks (GCNs) operate by aggregating messages over local neighborhoods given the prediction task under interest. Many GCNs can be understood as a form of generalized diffusion of input features on the graph, and…
We introduce a semigroup framework for Laplacians on directed hypergraphs, extending the classical heat flow models on graphs and establishing hypergraphs as prototypical models for non-Markovian diffusion. We apply spectral surgery methods…
This work investigates the effects of the choice of momentum diffusion operator on the evolution of multiphase fluid systems resolved with Meshless Lagrangian Methods (MLM). Specifically, the effects of a non-zero viscosity gradient at…
A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…
We consider Lagrangian coherent structures (LCSs) as the boundaries of material subsets whose advective evolution is metastable under weak diffusion. For their detection, we first transform the Eulerian advection-diffusion equation to…
This work considers a server that processes $J$ classes using the generalized processor sharing discipline with base weight vector $\alpha=(\alpha _1,...,\alpha_J)$ and redistribution weight vector $\beta=(\beta_1,...,\beta_J)$. The…
Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…