Stationarity and Spectral Characterization of Random Signals on Simplicial Complexes

• URL: http://arxiv.org/abs/2602.03055v1
• Date: Tue, 03 Feb 2026 03:31:10 GMT
• Title: Stationarity and Spectral Characterization of Random Signals on Simplicial Complexes
• Authors: Madeline Navarro, Andrei Buciulea, Santiago Segarra, Antonio Marques,
• Abstract summary: We propose a probabilistic framework for random signals defined on simplicial complexes.<n>Specifically, we generalize the classical notion of stationarity.<n>We empirically demonstrate the practicality of these benefits through multiple synthetic and real-world simulations.
• Score: 45.01439616647312
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is increasingly common for data to possess intricate structure, necessitating new models and analytical tools. Graphs, a prominent type of structure, can encode the relationships between any two entities (nodes). However, graphs neither allow connections that are not dyadic nor permit relationships between sets of nodes. We thus turn to simplicial complexes for connecting more than two nodes as well as modeling relationships between simplices, such as edges and triangles. Our data then consist of signals lying on topological spaces, represented by simplicial complexes. Much recent work explores these topological signals, albeit primarily through deterministic formulations. We propose a probabilistic framework for random signals defined on simplicial complexes. Specifically, we generalize the classical notion of stationarity. By spectral dualities of Hodge and Dirac theory, we define stationary topological signals as the outputs of topological filters given white noise. This definition naturally extends desirable properties of stationarity that hold for both time-series and graph signals. Crucially, we properly define topological power spectral density (PSD) through a clear spectral characterization. We then discuss the advantages of topological stationarity due to spectral properties via the PSD. In addition, we empirically demonstrate the practicality of these benefits through multiple synthetic and real-world simulations.

Related papers

• Spectral Superposition: A Theory of Feature Geometry [1.3837984867394175]
  We develop a theory for studying the geometric structre of features by analyzing the spectra of weight derived matrices.<n>In toy models of superposition, we use this theory to prove that capacity saturation forces spectral localization.
  arXiv  Detail & Related papers  (2026-02-02T15:28:38Z)
• Matched Topological Subspace Detector [16.216899458761773]
  We propose Neyman-Pearson matched topological subspace detectors for signals defined at a single simplicial level (such as edges) or jointly across all levels of a simplicial complex.<n>We demonstrate the effectiveness of the proposed detectors on various real-world data, including foreign currency exchange networks.
  arXiv  Detail & Related papers  (2025-04-08T10:38:30Z)
• Generating Graphs via Spectral Diffusion [48.70458395826864]
  We present GGSD, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process.<n>An extensive set of experiments on both synthetic and real-world graphs demonstrates the strengths of our model against state-of-the-art alternatives.
  arXiv  Detail & Related papers  (2024-02-29T09:26:46Z)
• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• Dirac signal processing of higher-order topological signals [5.70896453969985]
  We propose an adaptive, unsupervised signal processing algorithm that learns to jointly filter topological signals supported on nodes, links and triangles. We test our algorithms on noisy synthetic data and noisy data of drifters in the ocean.
  arXiv  Detail & Related papers  (2023-01-12T13:53:27Z)
• Geometry Interaction Knowledge Graph Embeddings [153.69745042757066]
  We propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities.
  arXiv  Detail & Related papers  (2022-06-24T08:33:43Z)
• Graph Spectral Embedding using the Geodesic Betweeness Centrality [76.27138343125985]
  We introduce the Graph Sylvester Embedding (GSE), an unsupervised graph representation of local similarity, connectivity, and global structure. GSE uses the solution of the Sylvester equation to capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2022-05-07T04:11:23Z)
• Spectral embedding and the latent geometry of multipartite networks [47.18054692085814]
  Many networks are multipartite, meaning that they contain nodes of fundamentally different types.<n>This paper demonstrates that the node representations obtained via spectral embedding lie near type-specific low-dimensional subspaces of a higher-dimensional ambient space.<n>We propose a follow-on step after spectral embedding, to recover node representations in their intrinsic rather than ambient dimension.
  arXiv  Detail & Related papers  (2022-02-08T15:52:03Z)
• Improving Spectral Graph Convolution for Learning Graph-level Representation [27.76697047602983]
  We show that for learning representations of the entire graphs, the topological distance seems necessary since it characterizes the basic relations between nodes. By removing it, as well as the limitation of graph filters, the resulting new architecture significantly boosts performance on learning graph representations. It serves as an understanding that quantitatively measures the effects of the spectrum to input signals in comparison to the well-known spectral/low-pass filters.
  arXiv  Detail & Related papers  (2021-12-14T04:50:46Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• Spectral-Spatial Global Graph Reasoning for Hyperspectral Image Classification [50.899576891296235]
  Convolutional neural networks have been widely applied to hyperspectral image classification. Recent methods attempt to address this issue by performing graph convolutions on spatial topologies.
  arXiv  Detail & Related papers  (2021-06-26T06:24:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.