Can I read Nilpotent Matrices in Random Graphs on EtoBox?

Nilpotent Matrices in Random Graphs by Monireh Va is a document available to read on EtoBox.

What is Nilpotent Matrices in Random Graphs about?

The document discusses nilpotent adjacency matrices and their use in counting cycles in random graphs. It defines a nilpotent adjacency matrix for a graph using an algebra where terms multiply to zero if they represent self-intersecting walks. Powers of this matrix can then be used to count cycles, with the trace of the kth power giving the number of k-cycles. This approach is extended to random graphs by assigning edge existence probabilities to the algebra

Author

Monireh Va

Language

EN