相关论文: Persistent Combinatorial Model of the Restricted S…
Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…
A number of problems can be formulated as prediction on graph-structured data. In this work, we generalize the convolution operator from regular grids to arbitrary graphs while avoiding the spectral domain, which allows us to handle graphs…
We propose two-channel critically-sampled filter banks for signals on undirected graphs that utilize spectral domain sampling. Unlike conventional approaches based on vertex domain sampling, our transforms have the following desirable…
Representational limits of message-passing graph neural networks (MP-GNNs), e.g., in terms of the Weisfeiler-Leman (WL) test for isomorphism, are well understood. Augmenting these graph models with topological features via persistent…
A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-vertex-deleted subgraphs, known as the deck of G. The Reconstruction Conjecture (RC) posits that every finite simple graph with at least…
In this paper we study the stability properties of aggregation graph neural networks (Agg-GNNs) considering perturbations of the underlying graph. An Agg-GNN is a hybrid architecture where information is defined on the nodes of a graph, but…
This paper focuses on the analysis of stratified steady periodic water waves that contain stagnation points. The initial step involves transforming the free-boundary problem into a quasilinear pseudodifferential equation through a conformal…
Geometric variations like rotation, scaling, and viewpoint changes pose a significant challenge to visual understanding. One common solution is to directly model certain intrinsic structures, e.g., using landmarks. However, it then becomes…
Counting short cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) codes. There are two computational approaches to count short cycles (with…
We propose representation of configurational physical quantities and microscopic structures for multicomponent system on lattice, by extending a concept of generalized Ising model (GIM) to graph theory. We construct graph Laplacian (and…
For a filtered simplicial complex $K$ embedded in $\mathbb{R}^{d+1}$, the merge tree of the complement of $K$ induces a forest structure on the persistent homology $H_d(K)$ via Alexander duality. We prove that the connected components of…
Graph alignment, the problem of identifying corresponding nodes across multiple graphs, is fundamental to numerous applications. Most existing unsupervised methods embed node features into latent representations to enable cross-graph…
This paper investigates the \textbf{graphical $r$-Stirling numbers of the first kind}, denoted by $\str{G}{k}$, which enumerate partitions of a vertex set $V(G)$ into $k$ disjoint cycles such that $r$ specified vertices occupy distinct…
Graph neural networks (GNNs) have emerged as a powerful tool for nonlinear processing of graph signals, exhibiting success in recommender systems, power outage prediction, and motion planning, among others. GNNs consists of a cascade of…
While message passing graph neural networks result in informative node embeddings, they may suffer from describing the topological properties of graphs. To this end, node filtration has been widely used as an attempt to obtain the…
In this work, we introduce a filtration on temporal graphs based on $\delta$-temporal motifs (recurrent subgraphs), yielding a multi-scale representation of temporal structure. Our temporal filtration allows tools developed for filtered…
This paper focuses on spectral filters on graphs, namely filters defined as elementwise multiplication in the frequency domain of a graph. In many graph signal processing settings, it is important to transfer a filter from one graph to…
For simply-laced Kac-Moody algebras $\frak g$, Stembridge (2003) proposed a `local' axiomatization of crystal graphs of representations of $U_q(\frak g)$. In this paper we propose axioms for edge-2-colored graphs which characterize the…
We study the design of graph filters to implement arbitrary linear transformations between graph signals. Graph filters can be represented by matrix polynomials of the graph-shift operator, which captures the structure of the graph and is…
For a general linear supergroup $G=GL(m|n)$, we consider a natural isomorphism $\phi: G \to U^-\times G_{ev} \times U^+$, where $G_{ev}$ is the even subsupergroup of $G$, and $U^-$, $U^+$ are appropriate odd unipotent subsupergroups of $G$.…