Degree Filtration
A permutation-equivariant filtration scheme based on vertex degree that adds vertices or edges in order of vertex degree, and is used to construct the filtration process in persistent homology.
Timeline (last 90 days)
The local iterative generation method iteratively constructs a degree-based persistence-diagram-equivalent graph; the researchers prove that each output exactly realizes the target persistence diagram, and that every degree-based persistence-diagram-equivalent graph is reachable.
The global constraint satisfaction approach is applicable to any vertex-based permutation-equivariant filtering scheme and is minimal under degree filtering.
All Facts (2)
The local iterative generation method iteratively constructs a degree-based persistence-diagram-equivalent graph; the researchers prove that each output exactly realizes the target persistence diagram, and that every degree-based persistence-diagram-equivalent graph is reachable.
50%UnverifiedThe global constraint satisfaction approach is applicable to any vertex-based permutation-equivariant filtering scheme and is minimal under degree filtering.
50%