Generate independent Bernoulli random variables above the diagonal and set everything else to zero. Taking the strict upper triangle of a random square array gives each allowed entry probability of being one:
import numpy as np
rng = np.random.default_rng(2024)


def rand_triu(n):
    return np.triu(rng.integers(0, 2, size=(n, n)), k=1)


example = rand_triu(10)
print(example)
0 1 0 0 0 0 1 1 1 1
0 0 1 0 0 0 1 0 0 0
0 0 0 1 1 0 0 1 1 0
0 0 0 0 1 1 1 1 0 0
0 0 0 0 0 0 1 1 1 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
Every matrix returned in this way is a nilpotent matrix; randomness affects its nilpotency index, not the fact of the nilpotent property.

Ancestors (13)

  1. a
  2. B5
  3. Paper 2
  4. 2024
  5. Past exam of the mathematical and Computational Biology course of the University of Cambridge
  6. Mathematical and Computational Biology course of the University of Cambridge
  7. Year 2 of the natural sciences course of the University of Cambridge
  8. Year of the natural sciences course of the University of Cambridge
  9. Natural sciences course of the University of Cambridge
  10. Course of the University of Cambridge
  11. University of Cambridge
  12. List of universities
  13. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version