English
Related papers

Related papers: Grassmannian Persistence Diagrams: Special Propert…

200 papers

A $k$-polar Grassmannian is the geometry having as pointset the set of all $k$-dimensional subspaces of a vector space $V$ which are totally isotropic for a given non-degenerate bilinear form $\mu$ defined on $V.$ Hence it can be regarded…

Information Theory · Computer Science 2018-04-11 Ilaria Cardinali , Luca Giuzzi

We introduce a persistence-type invariant for finite weighted graphs based on combinatorial multivector dynamics. For each threshold parameter, a relation matrix determines a graph multivector field, whose induced directed dynamics admits a…

Dynamical Systems · Mathematics 2026-03-03 Donald Woukeng

The objective of this paper is to examine the asymptotic behavior of persistence diagrams associated with \v{C}ech filtration. A persistence diagram is a graphical descriptor of a topological and algebraic structure of geometric objects. We…

Probability · Mathematics 2021-09-15 Takashi Owada

In this paper, we study the Grassmannian of n-dimensional subspaces of a 2n-dimensional vector space and its infinite-dimensional analogues. Such a Grassmannian can be endowed with two binary relations (adjacent and distant), with pencils…

Algebraic Geometry · Mathematics 2024-02-13 Andrea Blunck , Hans Havlicek

Imaging systems are represented as linear operators, and their singular value spectra describe the structure recoverable at the operator level. Building on an operator-based information-theoretic framework, this paper introduces a minimal…

Information Theory · Computer Science 2026-01-06 Charles Wood

Topological methods for data analysis present opportunities for enforcing certain invariances of broad interest in computer vision, including view-point in activity analysis, articulation in shape analysis, and measurement invariance in…

Computer Vision and Pattern Recognition · Computer Science 2018-07-30 Anirudh Som , Kowshik Thopalli , Karthikeyan Natesan Ramamurthy , Vinay Venkataraman , Ankita Shukla , Pavan Turaga

We introduce persistence spheres, a novel functional representation of persistence diagrams. Unlike existing embeddings (such as persistence images, landscapes, or kernel methods), persistence spheres provide a bi-continuous mapping: they…

Machine Learning · Computer Science 2025-10-01 Matteo Pegoraro

In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set (m,n)-graphs (i.e. graphs with n vertices and m edges) and some operations on graphs that are monotone with respect to…

Combinatorics · Mathematics 2013-12-24 Alexander Kelmans

The Vietoris-Rips filtration is a versatile tool in topological data analysis. It is a sequence of simplicial complexes built on a metric space to add topological structure to an otherwise disconnected set of points. It is widely used…

Computational Geometry · Computer Science 2013-03-07 Donald R. Sheehy

In this paper, we study Riemannian zeroth-order optimization in settings where the underlying Riemannian metric $g$ is geodesically incomplete, and the goal is to approximate stationary points with respect to this incomplete metric. To…

Machine Learning · Computer Science 2026-04-14 Shaocong Ma , Heng Huang

Let $n$ be a positive integer. We provide an explicit geometrically motivated $1$-Lipschitz map from the space of persistence diagrams on $n$ points (equipped with the Bottleneck distance) into the Hilbert space $\ell^2$. Such maps are a…

Metric Geometry · Mathematics 2025-10-28 Atish Mitra , Ziga Virk

When a category $\mathcal{C}$ satisfies certain conditions, we define the notion of rank invariant for arbitrary poset-indexed functors $F:\mathbf{P} \rightarrow \mathcal{C}$ from a category theory perspective. This generalizes the standard…

Algebraic Topology · Mathematics 2021-08-10 Woojin Kim , Facundo Memoli

This paper develops the idea of homology for 1-parameter families of topological spaces. We express parametrized homology as a collection of real intervals with each corresponding to a homological feature supported over that interval or,…

Algebraic Topology · Mathematics 2019-03-20 Gunnar Carlsson , Vin de Silva , Sara Kalisnik , Dmitriy Morozov

We define affine growth diagrams consisting of $GL_m$ dominant weights that label the vertices of a staircase-shaped grid. These are also called cylindrical growth diagrams as defined by Speyer and White in the case of partitions. The…

Combinatorics · Mathematics 2020-05-01 Tair Akhmejanov

This work introduces the Grassmannian Diffusion Maps, a novel nonlinear dimensionality reduction technique that defines the affinity between points through their representation as low-dimensional subspaces corresponding to points on the…

Machine Learning · Computer Science 2021-06-02 K. R. M. dos Santos , D. G. Giovanis , M. D. Shields

Classical spectral graph theory relies on the symmetry of the adjacency and Laplacian operators, which guarantees orthogonal eigenbases and energy-preserving Fourier transforms. However, real-world networks are intrinsically directed and…

Rings and Algebras · Mathematics 2025-12-16 Chandrasekhar Gokavarapu

We consider a Laplacian on periodic discrete graphs. Its spectrum consists of a finite number of bands. In a class of periodic 1-forms, i.e., functions defined on edges of the periodic graph, we introduce a subclass of minimal forms with a…

Spectral Theory · Mathematics 2019-05-28 E. Korotyaev , N. Saburova

One of the most animated themes of multidimensional persistence is the comparison between invariants. The matching distance between persistent Betti numbers functions (or rank invariants), is among the most studied metrics in this context,…

Algebraic Topology · Mathematics 2024-07-09 Patrizio Frosini , Eloy Mósig García , Nicola Quercioli , Francesca Tombari

Matrix reduction is the standard procedure for computing the persistent homology of a filtered simplicial complex with $m$ simplices. Its output is a particular decomposition of the total boundary matrix, from which the persistence diagrams…

Computational Geometry · Computer Science 2023-10-17 Matthew Piekenbrock , Jose A. Perea

In image set classification, a considerable progress has been made by representing original image sets on Grassmann manifolds. In order to extend the advantages of the Euclidean based dimensionality reduction methods to the Grassmann…

Computer Vision and Pattern Recognition · Computer Science 2022-01-25 Rui Wang , Xiao-Jun Wu , Kai-Xuan Chen , Josef Kittler