Steady and ranging sets in graph persistence

09/15/2020
by   Mattia G. Bergomi, et al.
0

Generalised persistence functions (gp-functions) are defined on (ℝ, ≤)-indexed diagrams in a given category. A sufficient condition for stability is also introduced. In the category of graphs, a standard way of producing gp-functions is proposed: steady and ranging sets for a given feature. The example of steady and ranging hubs is studied in depth; their meaning is investigated in three concrete networks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2022

A Geometric Condition for Uniqueness of Fréchet Means of Persistence Diagrams

The Fréchet mean is an important statistical summary and measure of cent...
research
05/30/2022

Relative Interlevel Set Cohomology Categorifies Extended Persistence Diagrams

The extended persistence diagram introduced by Cohen-Steiner, Edelsbrunn...
research
10/26/2018

Generalized Persistence Diagrams for Persistence Modules over Posets

When a category C satisfies certain conditions, we define the notion of ...
research
02/19/2019

Approximating Continuous Functions on Persistence Diagrams Using Template Functions

The persistence diagram is an increasingly useful tool arising from the ...
research
03/03/2022

Reconstruction of univariate functions from directional persistence diagrams

We describe a method for approximating a single-variable function f usin...
research
07/10/2018

On the choice of weight functions for linear representations of persistence diagrams

Persistence diagrams are efficient descriptors of the topology of a poin...

Please sign up or login with your details

Forgot password? Click here to reset