-
Complete Edge-Colored Permutation Graphs
We introduce the concept of complete edge-colored permutation graphs as ...
04/15/2020 ∙ by Tom Hartmann, et al. ∙
0
∙
share
read it
-
The Four Point Permutation Test for Latent Block Structure in Incidence Matrices
Transactional data may be represented as a bipartite graph G:=(L ∪ R, E)...
10/04/2018 ∙ by R W R Darling, et al. ∙
0
∙
share
read it
-
Roots multiplicity without companion matrices
We show a method for constructing a polynomial interpolating roots' mult...
03/17/2017 ∙ by Przemysław Koprowski, et al. ∙
0
∙
share
read it
-
Vertex deletion into bipartite permutation graphs
A permutation graph can be defined as an intersection graph of segments ...
10/22/2020 ∙ by Łukasz Bożyk, et al. ∙
0
∙
share
read it
-
Graph Independence Testing
Identifying statistically significant dependency between variables is a ...
06/09/2019 ∙ by Junhao Xiong, et al. ∙
0
∙
share
read it
-
DeepPermNet: Visual Permutation Learning
We present a principled approach to uncover the structure of visual data...
04/10/2017 ∙ by Rodrigo Santa Cruz, et al. ∙
0
∙
share
read it
-
Reparameterizing the Birkhoff Polytope for Variational Permutation Inference
Many matching, tracking, sorting, and ranking problems require probabili...
10/26/2017 ∙ by Scott W. Linderman, et al. ∙
0
∙
share
read it
A Blind Permutation Similarity Algorithm
03/26/2020 ∙ by Eric Barszcz, et al. ∙
0
∙
share
This paper introduces a polynomial blind algorithm that determines when two square matrices, A and B, are permutation similar. The shifted and translated matrices (A+β I+γ J) and (B+β I+γ J) are used to color the vertices of two square, edge weighted, rook's graphs. Then the orbits are found by repeated symbolic squaring of the vertex colored and edge weighted adjacency matrices. Multisets of the diagonal symbols from non-permutation similar matrices are distinct within a few iterations, typically four or less.
READ FULL TEXT
Comments
There are no comments yet.