Measuring the mixing time of social graphs
Proceedings of the 10th annual conference on Internet measurement (IMC '10)
By Aaram Yun, Abedelaziz Mohaisen, Yongdae Kim
Issue Date:November 2010
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networks are fast mixing, and many recently proposed designs of such systems make c...