Related papers: A Blind Permutation Similarity Algorithm
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
A wide class of Bayesian models involve unidentifiable random matrices that display rotational ambiguity, with the Gaussian factor model being a typical example. A rich variety of Markov chain Monte Carlo (MCMC) algorithms have been…
Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very…
Given a set $\mathcal{C}=\{C_i\}_{i=1}^m$ of square matrices, the matrix blind joint block diagonalization problem (BJBDP) is to find a full column rank matrix $A$ such that $C_i=A\Sigma_iA^\text{T}$ for all $i$, where $\Sigma_i$'s are all…
An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…
We present the implementation of an algorithm for graph isomorphism testing, based on ideas about number of walks (of sufficiently large length) between vertices. The algorithm is expanded for strongly regular graphs (SRG-s) by testing the…
The use of complex networks as a modern approach to understanding the world and its dynamics is well-established in literature. The adjacency matrix, which provides a one-to-one representation of a complex network, can also yield several…
A mixed multigraph is obtained from an undirected multigraph by orienting a subset of its edges. In this paper, we study a new Hermitian matrix representation of mixed multigraphs, give an introduction to cospectral operations on mixed…
Nonclassical symmetries and reductions of polynomial equations and systems of polynomial equations are considered. It is shown that specific polynomial equations having "hidden" symmetries can be reduced to classical symmetric systems of…
We introduce the \emph{intersection orbital graph} $\Gamma(G_1, G_2; \Omega)$ associated with two permutation groups $G_1, G_2 \leq \mathrm{Sym}(\Omega)$ on a finite set $\Omega$.
In this paper, we introduce a variational Bayesian algorithm (VBA) for image blind deconvolution. Our generic framework incorporates smoothness priors on the unknown blur/image and possible affine constraints (e.g., sum to one) on the blur…
We give under weak assumptions a complete combinatorial characterization of identifiability for linear mixtures of finite alphabet sources, with unknown mixing weights and unknown source signals, but known alphabet. This is based on a…
Let K be an arbitrary field, and a,b,c,d be elements of K such that the polynomials t^2-at-b and t^2-ct-d are split in K[t]. Given a square matrix M with entries in K, we give necessary and sufficient conditions for the existence of two…
We obtain, using exponential quadratic sums, explicit expressions for the number of double persymmetric matrices with entries in F_2 of given rank. (A matix [a(i,j)) is persymmetric if a(i,j) = a(r,s) for i+j = r+s)
The eigenstates of a diagonalizable PT-symmetric Hamiltonian satisfy unconventional completeness and orthonormality relations. These relations reflect the properties of a pair of bi-orthonormal bases associated with non-hermitean…
We study the block-coordinate forward-backward algorithm in which the blocks are updated in a random and possibly parallel manner, according to arbitrary probabilities. The algorithm allows different stepsizes along the block-coordinates to…
For a given nonnegative matrix $A=(A_{ij})$, the matrix scaling problem asks whether $A$ can be scaled to a doubly stochastic matrix $D_1AD_2$ for some positive diagonal matrices $D_1,D_2$.The Sinkhorn algorithm is a simple iterative…
In this short note, we provide an explicit formula to compute every colored double Tornheim's series by using double polylogarithm values at roots of unity. When the colors are given by $\pm 1$ our formula is different from that of Tsumura…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
A simple iterative scheme is proposed for locating the parameter values for which a 2-parameter family of real symmetric matrices has a double eigenvalue. The convergence is proved to be quadratic. An extension of the scheme to complex…