Characterizing continuous time random walks on time varying graphs

Performance Evaluation Review

Volumn 40, Issue 1 SPEC. ISS., 2012, Pages 307-318

  Figueiredo, Daniel ^a   Nain, Philippe ^b   Ribeiro, Bruno ^c   De Souza E Silva, Edmundo ^a   Towsley, Don ^c  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b INRIA   (France)

^c UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

continuous time random walks; dynamic graphs; random walks; stationary distribution; time scale separation; time varying graphs

Indexed keywords

CONTINUOUS TIME RANDOM WALKS; DYNAMIC GRAPH; RANDOM WALK; STATIONARY DISTRIBUTION; TIME SCALE SEPARATION; TIME VARYING;

COMPUTER SYSTEMS;

LAPLACE TRANSFORMS;

EID: 84864644140     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2254756.2254794     Document Type: Conference Paper

References (20)

1. Utku Günay Acer, Petros Drineas, and Alhussein A. Abouzeid. Random walks in time-graphs. In MobiOpp, pp. 93-100, 2010.
2. C. Avin, M. Koucky, and Z. Lotker. How to explore a fast-changing world. (on the cover time of dynamic graphs). In ICALP, pp. 121-132, 2008.
3. Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, and Riccardo Silvestri. Communication in dynamic radio networks. In PODC, pp. 205-214. 2007.
4. Andrea E.F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, and Riccardo Silvestri. Flooding time in edge-markovian dynamic graphs. In PODC, pp. 213-222. ACM, 2008.
5. Daniel Figueiredo, Philippe Nain, Bruno Ribeiro, Edmundo de Souza e Silva, and Don Towsley. Characterizing random walks on general time varying graphs. Technical Report UM-CS-2012-011, 2012.
6. P. Franken, D. Konig, U. Arndt, and V. Schmidt. Queues and Point Processes. J. Wileyl, 1982.
7. M. Gjoka, M. Kurant, C. Butts, and A. Markopoulou. A walk in Facebook: Uniform sampling of users in online social networks. In INFOCOM, 2010.
8. S.M. Hedetniemi, S.T. Hedetniemi, and A.L.Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18(4):319-349, 1988.
9. R. Horn and C. Johnson. Matrix analysis. Technical report, Cambridge University Press, 1985.
10. D. Kempe and J. Kleinberg. Protocols and impossibility results for gossip-based communication mechanisms. In FOCS, pp. 471-480, 2002.
11. A. N. Kolmogorov and S. V. Fomin. Introductory Real Analysis. Dover, 1975.
12. Laurent Massoulié, Erwan Le Merrer, Anne-Marie Kermarrec, and Ayalvadi Ganesh. Peer counting and sampling in overlay networks: random walk methods. In PODC, pp. 123-132, 2006.
13. P. Moyal. A generalized backwards scheme for solving non monotonic stochastic recursions. Arxiv preprint arXiv:1009.1235, Sept. 2010.
14. M.E.J. Newman. A measure of betweenness centrality based on random walks. Social Networks, 27(1):39-54, 2005.
15. B. Pittel. On spreading a rumor. SIAM Journal on Applied Mathematics, 47(1):213-223, 1987.
16. A. H. Rasti, M. Torkjazi, R. Rejaie, N. Duffield, W. Willinger, and D. Stutzbach. Respondent-driven sampling for characterizing unstructured overlays. In INFOCOM Mini-Conference, 2009.
17. B. Ribeiro and D. Towsley. Estimating and sampling graphs with multidimensional random walks. In SIGCOMM IMC, Nov 2010.
18. Bruno Ribeiro, Daniel Figueiredo, Edmundo de Souza e Silva, and Don Towsley. Characterizing continuous-time random walks on dynamic networks. SIGMETRICS, 39(1):343-344, June 2011.
19. Albert N. Shiryaev. Probability. Springer, 2nd edition, 1995.
20. Daniel Stutzbach, Reza Rejaie, Nick Duffield, Subhabrata Sen, and Walter Willinger. On unbiased sampling for unstructured peer-to-peer networks. IEEE/ACM Trans. Netw., 17:377-390, April 2009.