Related papers: Laplacians on infinite graphs: Dirichlet and Neuma…

The Laplacian plays a major role in the mathematical analysis of partial differential equations. Recently, the work of J. Kigami, taken up by R. S. Strichartz, allowed the construction of an operator of the same nature, defined locally, on…

We consider a combinatorial Laplace operator on a sequence of discrete graphs which approximates the m-dimensional torus when the discretization parameter tends to infinity. We establish a polyhomogeneous expansion of the resolvent trace…

Let G be a graph on n vertices. The Laplacian matrix of G, denoted by L(G), is defined as L(G) = D(G) - A(G), where A(G) is the adjacency matrix of G and D(G) is the diagonal matrix of the vertex degrees of G. A graph G is said to be…

Consider a semigraph $G=(V,\,E)$; in this paper, we study the eigenvalues of the Laplacian matrix of $G$. We show that the Laplacian of $G$ is positive semi-definite, and $G$ is connected if and only if $\lambda_2 >0.$ Along the similar…

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…

The notion of network connectivity is used to characterize the robustness and failure tolerance of networks, with high connectivity being a desirable feature. In this paper, we develop a novel approach to the problem of identifying critical…

In this paper we develop the theory of variable exponent Hardy spaces associated with discrete Laplacians on infinite graphs. Our Hardy spaces are defined by square integrals, atomic and molecular decompositions. Also we study boundedness…

We establish various nodal domain theorems for $p$-Laplacians on signed graphs, which unify most of the existing results on nodal domains of graph $p$-Laplacians and arbitrary symmetric matrices. Based on our nodal domain estimates, we…

We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum…

In this thesis, we study Laplacian eigenfunctions on metric graphs, also known as quantum graphs. We restrict the discussion to standard quantum graphs. These are finite connected metric graphs with functions that satisfy Neumann vertex…

We consider a family of non-compact manifolds $X_\eps$ (``graph-like manifolds'') approaching a metric graph $X_0$ and establish convergence results of the related natural operators, namely the (Neumann) Laplacian $\laplacian {X_\eps}$ and…

We prove a central limit theorem for the components of the eigenvectors corresponding to the $d$ largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random dot product graph. As a corollary, we show that for…

We consider the signless $p$-Laplacian of a graph, a generalisation of the usual signless Laplacian (the case $p=2$). We show a Perron-Frobenius property and basic inequalites for the largest eigenvalue and provide upper and lower bounds…

There is a wealth of applied problems that can be posed as a dynamical system defined on a network with both attractive and repulsive interactions. Some examples include: understanding synchronization properties of nonlinear oscillator;,…

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…

Laplacian operators are classical objects that are fundamental in both pure and applied mathematics and are becoming increasingly prominent in modern computational and data science fields such as applied and computational topology and…

Inspired by persistent homology in topological data analysis, we introduce the homological eigenvalues of the graph $p$-Laplacian $\Delta_p$, which allows us to analyse and classify non-variational eigenvalues. We show the stability of…

We study the relationship between the symbol of the Dirichlet-to-Neumann operator associated with a connection Laplacian, and the geometry on and near the boundary. As a consequence, we show that the geometric data on the boundary, and when…

The set $S_{i,n}=\{0,1,2,\ldots,n-1,n\}\setminus\{i\}$, $1\leqslant i\leqslant n$ is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is $S_{i,n}$. The existence of such graphs was established…

The nodal set of a Laplacian eigenfunction forms a partition of the underlying manifold or graph. Another natural partition is based on the gradient vector field of the eigenfunction (on a manifold) or on the extremal points of the…