相关论文: Expansion in Distance Matrices

Let M be a bounded domain of a Euclidian space with smooth boundary. We relate the Cheeger constant of M and the conductance of a neighborhood graph defined on a random sample from M. By restricting the minimization defining the latter over…

The spread of a real symmetric matrix is defined as the difference between its largest and smallest eigenvalue. The study of graph-related matrices has attracted considerable attention, leading to a substantial body of findings. In this…

Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…

A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…

This paper focuses on the concentration properties of the spectral norm of the normalized Laplacian matrix for Erd\H{o}s-R\'enyi random graphs. First, We achieve the optimal bound that can be attained in the further question posed by Le et…

A strongly regular graph with parameters $(n,d,a,c)$ is a $d$-regular graph of order $n$, in which every pair of adjacent vertices has exactly $a$ common neighbor(s) and every pair of nonadjacent vertices has exactly $c$ common neighbor(s).…

Let $Q(G)=D(G)+A(G)$ be the signless Laplacian matrix of a simple graph of order $n$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix of $G$, respectively. In this paper, we present a sharp upper bound for…

This short note aims at (re)proving that the symmetrically normalized graph Laplacian $L=\Id - D^{-1/2}WD^{-1/2}$ (from a graph defined from a Gaussian weighting kernel on a sampled smooth manifold) converges towards the continuous Manifold…

The distance signless Laplacian matrix of a graph $G$ is define as $Q(G)=$Tr$(G)+D(G)$, where Tr$(G)$ and $D(G)$ are the diagonal matrix of vertex transmissions and the distance matrix of $G$, respectively. Denote by $E_G(v)$ the set of all…

Let $G=(V(G) ,E(G))$ be a digraph without loops and multiarcs, where $V(G)=\{v_1,v_2,\ldots,v_n\}$ and $E(G)$ are the vertex set and the arc set of $G$, respectively. Let $d_i^{+}$ be the outdegree of the vertex $v_i$. Let $A(G)$ be the…

For a simple graph $G$, the generalized adjacency matrix $A_{\alpha}(G)$ is defined as $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G), \alpha\in [0,1]$, where $A(G)$ is the adjacency matrix and $D(G)$ is the diagonal matrix of vertex degrees of…

Euclidean distance matrices (EDM) are symmetric nonnegative matrices with several interesting properties. In this article, we introduce a wider class of matrices called generalized Euclidean distance matrices (GDMs) that include EDMs. Each…

A connected graph $G$ of diameter ${\rm diam}(G) \ge \ell$ is $\ell$-distance-balanced if $|W_{xy}|=|W_{yx}|$ for every $x,y\in V(G)$ with $d_{G}(x,y)=\ell$, where $W_{xy}$ is the set of vertices of $G$ that are closer to $x$ than to $y$.…

A Laplacian matrix is a square matrix whose row sums are zero. We study the limiting eigenvalue distribution of a Laplacian matrix formed by taking a random elliptic matrix and subtracting the diagonal matrix containing its row sums. Under…

Let $G$ be a strongly connected and balanced directed graph. The Laplacian matrix of $G$ is then the matrix (not necessarily symmetric) $L:=D-A$, where $A$ is the adjacency matrix of $G$ and $D$ is the diagonal matrix such that the row sums…

Given a graph $G$, the exponential distance matrix is defined entry-wise by letting the $(u,v)$-entry be $q^{\text{dist}(u,v)}$, where $\text{dist}(u,v)$ is the distance between the vertices $u$ and $v$ with the convention that if vertices…

The enhanced power graph of a group $G$ is the graph $\mathcal{G}_E(G)$ with vertex set $G$ and edge set $ \{(u,v): u, v \in \langle w \rangle,~\mbox{for some}~ w \in G\}$. In this paper, we compute the spectrum of the distance matrix of…

We present enumeration results on the number of connected graphs up to 10 vertices for which there is at least one other graph with the same spectrum (a cospectral mate), or at least one other graph with the same Smith normal form…

Laplacian eigenvectors capture natural community structures on graphs and are widely used in spectral clustering and manifold learning. The use of Laplacian eigenvectors as embeddings for the purpose of multiscale graph comparison has…

The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in…