
Complete EdgeColored Permutation Graphs
We introduce the concept of complete edgecolored permutation graphs as ...
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)...
read it

Roots multiplicity without companion matrices
We show a method for constructing a polynomial interpolating roots' mult...
read it

Vertex deletion into bipartite permutation graphs
A permutation graph can be defined as an intersection graph of segments ...
read it

Graph Independence Testing
Identifying statistically significant dependency between variables is a ...
read it

DeepPermNet: Visual Permutation Learning
We present a principled approach to uncover the structure of visual data...
read it

Reparameterizing the Birkhoff Polytope for Variational Permutation Inference
Many matching, tracking, sorting, and ranking problems require probabili...
read it
A Blind Permutation Similarity Algorithm
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 nonpermutation similar matrices are distinct within a few iterations, typically four or less.
READ FULL TEXT
Comments
There are no comments yet.