Information Propagation Analysis of Social Network Using the Universality of Random Matrix

Explore this paper's citation graph

Summary

The results show that the worst-case speed of the information propagation changes at most 2 if the structure of a social network changes, and the universality of the normalized Laplacian matrix is clarified.

Type
article
Published
2017-12-07
Cited by
4
References
13
Access
Open access

Keywords

Laplacian matrix, Universality (dynamical systems), Spectral graph theory, Mathematics, Eigenvalues and eigenvectors

References

Cited by

Related papers