Related papers: Steady-State Spread Bounds for Graph Diffusion via…
Stable random variables are motivated by the central limit theorem for densities with (potentially) unbounded variance and can be thought of as natural generalizations of the Gaussian distribution to skewed and heavy-tailed phenomenon. In…
The aim of this paper is to propose a novel framework to infer the sheaf Laplacian, including the topology of a graph and the restriction maps, from a set of data observed over the nodes of a graph. The proposed method is based on sheaf…
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…
In this note we correct the proof of Proposition 4 in our paper "The Laplacian Spectrum of Large Graphs Sampled from Graphons" (arXiv:2004.09177) and we improve several results therein. To this end, we prove a new concentration lemma about…
In this paper, we consider the robustness of a basic model of a dynamical distribution network. In the first problem, i.e., optimal weight allocation, we minimize the H-inf- norm of the dynamical distribution network subject to allocation…
We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and…
Diffusion state distance (DSD) is a metric on the vertices of a graph, motivated by bioinformatic modeling. Previous results on the convergence of DSD to a limiting metric relied on the definition being based on symmetric or reversible…
In manifold learning, algorithms based on graph Laplacians constructed from data have received considerable attention both in practical applications and theoretical analysis. In particular, the convergence of graph Laplacians obtained from…
The celebrated Cheeger's Inequality establishes a bound on the edge expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and eigenvectors of the adjacency…
Graph-based semi-supervised learning is one of the most popular methods in machine learning. Some of its theoretical properties such as bounds for the generalization error and the convergence of the graph Laplacian regularizer have been…
The challenges of graph stream algorithms are twofold. First, each edge needs to be processed only once, and second, it needs to work on highly constrained memory. Diffusion degree is a measure of node centrality that can be calculated (for…
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…
The modeling of diffusion processes on graphs is the basis for many network science and machine learning approaches. Entropic measures of network-based diffusion have recently been employed to investigate the reversibility of these…
Graph diffusion models achieve state-of-the-art performance in graph generation but suffer from quadratic complexity in the number of nodes -- and much of their capacity is wasted modeling the absence of edges in sparse graphs. Inspired by…
When particles/molecules diffuse in systems that contain obstacles, the steady-state regime (during which the mean-square displacement scales linearly with time, $\left< r^2 \right> \sim t$) is preceded by a transient regime. It is common…
Stochastic reaction-diffusion models can be analytically studied on complex networks using the linear noise approximation. This is illustrated through the use of a specific stochastic model, which displays traveling waves in its…
Motivated by low energy consumption in geographic routing in wireless networks, there has been recent interest in determining bounds on the length of edges in the Delaunay graph of randomly distributed points. Asymptotic results are known…
Many tools from the field of graph signal processing exploit knowledge of the underlying graph's structure (e.g., as encoded in the Laplacian matrix) to process signals on the graph. Therefore, in the case when no graph is available, graph…
The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…
A new approach to the modeling of nonfree particle diffusion is presented. The approach uses a general setup based on geometric graphs (networks of curves), which means that particle diffusion in anything from arrays of barriers and pore…