Transport Properties of Random Walks on??Scale-Free/Regular-Lattice Hybrid Networks, Journal of Statistical Physics, vol.71, issue.2 ,
DOI : 10.1007/s10955-007-9362-5
On random graphs [Fei95] Feige. A tight upper bound on the cover time for random walks on graphs RSA : Random Structures & Algorithms Monte Carlo sampling methods using Markov chains and their applications Bottleneck discovery and overlay management in network coded peer-to-peer systems, Publicationes Mathematicae INM '07 : Proceedings of the 2007 SIGCOMM workshop on Internet network management, pp.290-29797, 1959. ,
Search and replication in unstructured peer-to-peer networks ACM. [MAS06] Damon Mosk-Aoyama and Devavrat Shah Computing separable functions via gossip Peer counting and sampling in overlay networks : random walk methods, ICS '02 : Proceedings of the 16th international conference on Supercomputing PODC '06 : Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing PODC '06 : Proceedings of the twentyfifth annual ACM symposium on Principles of distributed computing ACM. [Moh97] B. Mohar. Some applications of laplace eigenvalues of graphs, pp.84-95, 1997. ,
Experiences in building and operating epost, a reliable peer-topeer application, EuroSys '06 : Proceedings of the 1st ACM SI- GOPS/EuroSys European Conference on Computer Systems ACM. [MR95] Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms, pp.147-159, 1995. ,
Random graphs as models of networks, 2002. ,
Random-walk-based estimates of transport properties in small specimens of composite materials, Phys. Rev. E, vol.67, issue.4, 2003. ,
Improved bounds for mixing rates of markov chains and multicommodity flow, LATIN : Latin American Symposium on Theoretical Informatics, 1992. ,
Critical nodes detection in mobile ad hoc network, AINA '06 : Proceedings of the 20th International Conference on Advanced Information Networking and Applications, pp.336-340, 2006. ,
On unbiased sampling for unstructured peer-topeer networks, IMC '06 : Proceedings of the 6th ACM SIG- COMM conference on Internet measurement, pp.27-40, 2006. ,
A simple min-cut algorithm ,