Permutation-Equivariant Filtration Scheme
A filtration scheme whose process is invariant to permutations of vertex indices, meaning that topological features do not depend on the labeling order of vertices. Common examples include degree filtration and weight filtration. It is the general precondition under which global constraint satisfaction methods are applicable.
Timeline (last 90 days)
A permutation-equivariant filtering scheme means the filtering process remains invariant to permutations of vertex numbering, that is, the topological features of the graph do not depend on the label order of the vertices.
The global constraint satisfaction approach is applicable to any vertex-based permutation-equivariant filtering scheme and is minimal under degree filtering.
All Facts (2)
A permutation-equivariant filtering scheme means the filtering process remains invariant to permutations of vertex numbering, that is, the topological features of the graph do not depend on the label order of the vertices.
50%UnverifiedThe global constraint satisfaction approach is applicable to any vertex-based permutation-equivariant filtering scheme and is minimal under degree filtering.
50%