Hello Ian and Valerio, I also have worked on measuring mixing time on social networks; you can find a paper I wrote with Yves Roudier where we suggest that networks that the factor that has the most impact in determining mixing time in a social graph is whether creating a link requires people to meet physically: http://www.eurecom.fr/fr/publication/2900/download/rs-publi-2900.pdf . Subsequent works, such as the one linked by Valerio (which, strangely enough, does not cite us even if the first author had contacted me for clarifications on our work), seem to corroborate that idea.
cheers matteo 2014-06-24 21:58 GMT+02:00 Valerio Schiavoni <[email protected]>: > Hello iang, > the "fast mixing” property of a social graph is an indicator of how > quickly a random walk on that graph approaches the stationary distribution. > > You could read for example: > http://syssec.kaist.ac.kr/~yongdaek/doc/imc2010.pdf > > best, > valerio > > > On Tue, Jun 24, 2014 at 9:31 PM, ianG <[email protected]> wrote: > >> Hi all, >> >> would anyone be able to explain what it means for a social graph to be >> *fast mixing* ? >> >> Preferably without needing to have read hundreds of papers... A pointer >> to one nice descriptive paper would be ok. >> >> iang >> _______________________________________________ >> p2p-hackers mailing list >> [email protected] >> http://lists.zooko.com/mailman/listinfo/p2p-hackers >> > > > _______________________________________________ > p2p-hackers mailing list > [email protected] > http://lists.zooko.com/mailman/listinfo/p2p-hackers > > -- matteo
_______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
