1. Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 482–491 (2003)
2. Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proc. 23 Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM (2004)
3. Lecture Notes in Computer Science;I.A. Wagner,1998
4. Jerrum, M., Sinclair, A.: The markov chain monte carlo method: an approach to approximate counting and integration. In: Hochbaum, D. (ed.) Approximations for NP-hard Problems, pp. 482–520. PWS Publishing, Boston (1997)
5. Avin, C., Brito, C.: Efficient and robust query processing in dynamic environments using random walk techniques. In: Proc. of the third international symposium on Information processing in sensor networks, pp. 277–286 (2004)