Testing of random matrices

Details Testing of random matrices Testing of random matrices

2011-04-22

arxiv.org/abs/1104.4419v1

Acta Universitatis Sapientiae, Informatica, 3, 1 (2011) 99--126

Computer Science

Discrete Mathematics

Scientific paper

Let $n$ be a positive integer and $X = [x_{ij}]_{1 \leq i, j \leq n}$ be an $n \times n$\linebreak \noindent sized matrix of independent random variables having joint uniform distribution $$\hbox{Pr} {x_{ij} = k \hbox{for} 1 \leq k \leq n} = \frac{1}{n} \quad (1 \leq i, j \leq n) \koz. $$ A realization $\mathcal{M} = [m_{ij}]$ of $X$ is called \textit{good}, if its each row and each column contains a permutation of the numbers $1, 2,..., n$. We present and analyse four typical algorithms which decide whether a given realization is good.

Affiliated with

Also associated with

No associations

Rating

Testing of random matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Testing of random matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Testing of random matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-330678