Möbius Inversion of Random Acyclic Directed Graphs

摘要

Suppose a random acyclic digraph has adjacency matrixAwith independent columns or independent rows. Then the mean Möbius inverse of the zeta matrixI+Ais the Möbius inverse of the mean zeta matrix, i.e.,E(I+A)−1=I+E(A)