Related papers: Geometric and spectral analysis on weighted digrap…

Spectral geometric methods have brought revolutionary changes to the field of geometry processing. Of particular interest is the study of the Laplacian spectrum as a compact, isometry and permutation-invariant representation of a shape.…

We complete the analysis of the extremal eigenvalues of the the adjacency matrix $A$ of the Erd\H{o}s-R\'enyi graph $G(N,d/N)$ in the critical regime $d \asymp \log N$ of the transition uncovered in [arXiv:1704.02953,arXiv:1704.02945],…

An arithmetical structure on a finite and connected graph G is a pair (d, r) of positive integer vectors such that r is primitive (the gcd of its entries is 1) and (diag(d) - A)r = 0, where A is the adjacency matrix of G. In this article,…

Let $\grad$, $\curl$, and $\dv$ be the graph-theoretic analogues of the gradient, curl, and divergence operators from multivariate calculus. The graph Laplacian $-\dv \grad$ gives rise to the celebrated Laplacian matrix, while the matrix…

We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure…

Let $\mathbb{Q}_{k,n}$ be the set of the connected $k$-uniform weighted hypergraphs with $n$ vertices, where $k,n\geq 3$. For a hypergraph $G\in \mathbb{Q}_{k,n}$, let $\mathcal{A}(G)$, $\mathcal{L} (G)$ and $\mathcal{Q} (G)$ be its…

We completely characterize the conditions under which a complex unitary number is an eigenvalue of the non-backtracking matrix of an undirected graph. Further, we provide a closed formula to compute its geometric multiplicity and describe…

In this note we consider $k$-regular multigraphs, where the possible edge multiplicities are controlled. These structures are considered in a question recently posed by Brendan McKay. We express the generating functions using the scalar…

By natural way the hierarchy structure is introduced on directed graphs with weighted adjacencies. Embedded system of algebras of subsets of the set of vertices of such digraph and it's consolidations, which vertices are the elementary sets…

A number of recent papers have considered signed graph Laplacians, a generalization of the classical graph Laplacian, where the edge weights are allowed to take either sign. In the classical case, where the edge weights are all positive,…

Let $ \Phi=(G, \varphi) $ be a connected complex unit gain graph ($ \mathbb{T} $-gain graph) on a simple graph $ G $ with $ n $ vertices and maximum vertex degree $ \Delta $. The associated adjacency matrix and degree matrix are denoted by…

We describe noncommutative geometric aspects of twisted deformations, in particular of the spheres in Connes and Landi [8] and in Connes and Dubois Violette [7], by using the differential and integral calculus on these spaces that is…

Let $G$ be a connected graph on $n$ vertices with adjacency matrix $A_G$. Associated to $G$ is a polynomial $d_G(x_1,\dots, x_n)$ of degree $n$ in $n$ variables, obtained as the determinant of the matrix $M_G(x_1,\dots,x_n)$, where…

A weighted digraph is a digraph such that every arc is assigned a nonnegative number, called the weight of the arc. The weighted outdegree of a vertex $v$ in a weighted digraph $D$ is the sum of the weights of the arcs with $v$ as their…

Differential calculus on discrete spaces is studied in the manner of non-commutative geometry by representing the differential calculus by an operator algebra on a suitable Krein space. The discrete analogue of a (pseudo-)Riemannian metric…

Consider a $d\times d$ matrix $M$ whose rows are independent centered non-degenerate Gaussian vectors $\xi_1,...,\xi_d$ with covariance matrices $\Sigma_1,...,\Sigma_d$. Denote by $\mathcal{E}_i$ the location-dispersion ellipsoid of…

We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.

The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…

We review the properties of eigenvectors for the graph Laplacian matrix, aiming at predicting a specific eigenvalue/vector from the geometry of the graph. After considering classical graphs for which the spectrum is known, we focus on…

We analyze a variational time discretization of geodesic calculus on finite- and certain classes of infinite-dimensional Riemannian manifolds. We investigate the fundamental properties of discrete geodesics, the associated discrete…