Related papers: Symmetric Matrices, Signed Graphs, and Nodal Domai…
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse…
The properties of a hypergraph explored through the spectrum of its unified matrix was made by the authors in [26]. In this paper, we introduce three different hypergraph matrices: unified Laplacian matrix, unified signless Laplacian…
Recent work of the authors and their collaborators has uncovered fundamental connections between the Dirichlet-to-Neumann map, the spectral flow of a certain family of self-adjoint operators, and the nodal deficiency of a Laplacian…
This work provides the first unifying theoretical framework for node (positional) embeddings and structural graph representations, bridging methods like matrix factorization and graph neural networks. Using invariant theory, we show that…
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as…
The concept of the integrated adjacency matrix for mixed graphs was first introduced in [9], where its spectral properties were analyzed in relation to the structural characteristics of the mixed graph. Building upon this foundation, this…
We study the nodal set of the Steklov eigenfunctions on the boundary of a smooth bounded domain in $\mathbb{R}^n$ - the eigenfunctions of the Dirichlet-to-Neumann map. Under the assumption that the domain $\Omega$ is $C^2$, we prove a…
We report our experiments in identifying large bipartite subgraphs of simple connected graphs which are based on the sign pattern of eigenvectors belonging to the extremal eigenvalues of different graph matrices: adjacency, signless…
Given a causal graph representing the data-generating process shared across different domains/distributions, enforcing sufficient graph-implied conditional independencies can identify domain-general (non-spurious) feature representations.…
We propose a novel node embedding of directed graphs to statistical manifolds, which is based on a global minimization of pairwise relative entropy and graph geodesics in a non-linear way. Each node is encoded with a probability density…
We prove the Pleijel theorem in non-collapsed RCD spaces, providing an asymptotic upper bound on the number of nodal domains of Laplacian eigenfunctions. As a consequence, we obtain that the Courant nodal domain theorem holds except at most…
Graphical domination was first introduced in [1] in the context of combinatorial threshold-linear networks (CTLNs). There it was shown that when a domination relationship exists between a pair of vertices in a graph, certain fixed points in…
In this paper we propose a spectral flow for graph Laplacians, and prove that it counts the number of nodal domains for a given Laplace eigenvector. This extends work done for Laplacians on $\mathbb{R}^n$ to the graph setting. We mention…
Frames are the most natural generalization of orthonormal bases that allow the inclusion of redundant systems. In this article, we introduce the concept of frames generated by graphs in finite-dimensional spaces and study their properties.…
According to a recent conjecture, isospectral objects have different nodal count sequences. We study generalized Laplacians on discrete graphs, and use them to construct the first non-trivial counter-examples to this conjecture. In…
We introduce a set of novel multiscale basis transforms for signals on graphs that utilize their "dual" domains by incorporating the "natural" distances between graph Laplacian eigenvectors, rather than simply using the eigenvalue ordering.…
In this paper, we develop the theory of Sobolev spaces on locally finite graphs, including completeness, reflexivity, separability, and Sobolev inequalities. Since there is no exact concept of dimension on graphs, classical methods that…
The nodal edge count of an eigenvector of the Laplacian of a graph is the number of edges on which it changes sign. This quantity extends to any real symmetric $n\times n$ matrix supported on a graph $G$ with $n$ vertices. The average nodal…
We define a general notion of a smooth invariant (central) ergodic measure on the space of paths of an $N$-graded graph (Bratteli diagram). It is based on the notion of standardness of the tail filtration in the space of paths, and the…
In a recent work by Gross, the following problem was stated and solved: given a measure $\mu$ with finite second moment, find a simply connected domain $U$ in $\CC$ such that the real part of a Brownian motion stopped when it leaves $U$ is…