有向图和双随机转移矩阵关系的探讨
摘要:When does a digraph admit a doubly stochastic adjacency matrix Doubly Stochastic: 对于每一个节点,如果输入权重和输出权重都等于1,那么就是双随机的有向图。简而言之,如果允许双重随机邻接矩阵的有向图,称为具有双重随机性质
阅读全文
posted @ 2019-05-11 21:48
posted @ 2019-05-11 21:48
posted @ 2019-05-11 21:39
posted @ 2019-05-11 21:36
posted @ 2019-05-11 21:26
posted @ 2019-05-11 15:36