Related papers: Local ultrametric approximation of graph distance …
We present a novel probabilistic approach for generating multi-fidelity data while accounting for errors inherent in both low- and high-fidelity data. In this approach a graph Laplacian constructed from the low-fidelity data is used to…
The ubiquity of massive graph data sets in numerous applications requires fast algorithms for extracting knowledge from these data. We are motivated here by three electrical measures for the analysis of large small-world graphs $G = (V, E)$…
We describe approximation algorithms in Linial's classic LOCAL model of distributed computing to find maximum-weight matchings in a hypergraph of rank $r$. Our main result is a deterministic algorithm to generate a matching which is an…
We introduce a local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations. The proposed method is based on a coarse grid and iteratively improves the solution's accuracy by solving local elliptic problems in…
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…
This work studies the spectral convergence of graph Laplacian to the Laplace-Beltrami operator when the graph affinity matrix is constructed from $N$ random samples on a $d$-dimensional manifold embedded in a possibly high dimensional…
Several graph data mining, signal processing, and machine learning downstream tasks rely on information related to the eigenvectors of the associated adjacency or Laplacian matrix. Classical eigendecomposition methods are powerful when the…
We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
We study directed, weighted graphs $G=(V,E)$ and consider the (not necessarily symmetric) averaging operator $$ (\mathcal{L}u)(i) = -\sum_{j \sim_{} i}{p_{ij} (u(j) - u(i))},$$ where $p_{ij}$ are normalized edge weights. Given a vertex $i…
In the manifold setting, we provide a series of spectral convergence results quantifying how the eigenvectors and eigenvalues of the graph Laplacian converge to the eigenfunctions and eigenvalues of the Laplace-Beltrami operator in the…
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…
Graph-based approximation methods are of growing interest in many areas, including transportation, biological and chemical networks, financial models, image processing, network flows, and more. In these applications, often a basis for the…
Results regarding off-diagonal Gaussian upper heat kernel bounds on discrete weighted graphs with possibly unbounded geometry are summarized and related. After reviewing uniform upper heat kernel bounds obtained by Carlen, Kusuoka, and…
Partitioning a graph into three pieces, with two of them large and connected, and the third a small ``separator'' set, is useful for improving the performance of a number of combinatorial algorithms. This is done using the second…
Using methods from algebraic graph theory and convex optimization, we study the relationship between local structural features of a network and spectral properties of its Laplacian matrix. In particular, we derive expressions for the…
In this work, we study the maximum matching problem from the perspective of sensitivity. The sensitivity of an algorithm $A$ on a graph $G$ is defined as the maximum Wasserstein distance between the output distributions of $A$ on $G$ and on…
Consider the twin problems of estimating the connection probability matrix of an inhomogeneous random graph and the graphon of a W-random graph. We establish the minimax estimation rates with respect to the cut metric for classes of block…
In this paper we improve the spectral convergence rates for graph-based approximations of Laplace-Beltrami operators constructed from random data. We utilize regularity of the continuum eigenfunctions and strong pointwise consistency…
To construct dispersion relations for diffusion or oscillation processes on random networks, it is necessary to obtain effective length scales for the eigenvectors of a graph Laplacian matrix, whose eigenvalues represent inverse time…