Random walks in time-graphs

2nd International Workshop on Mobile Opportunistic Networking, MobiOpp 2010

Volumn , Issue , 2010, Pages 93-100

  Acer, Utku Günay ^a   Drineas, Petros ^b   Abouzeid, Alhussein A ^b  

^a INRIA   (France)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Dynamic networks; Structural properties; Tensors; Time graphs

Indexed keywords

ADJACENCY MATRICES; DYNAMIC NETWORK; DYNAMIC NETWORKS; END-TO-END CONNECTIVITY; HITTING TIME; HOMOGENOUS MARKOV CHAIN; MATRIX; NETWORK CONNECTIVITY; ONLINE OPTIMIZATION; PROTOCOL PARAMETERS; RANDOM WALK; REACHABILITY; SINGULAR VALUES; SOURCE-DESTINATION PAIRS; SPECTRAL GAP; SPEED OF CONVERGENCE;

GRAPHIC METHODS; MARKOV PROCESSES; TELECOMMUNICATION SERVICES; TENSORS; TOPOLOGY;

WIRELESS NETWORKS;

EID: 77952893317     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1755743.1755761     Document Type: Conference Paper

References (22)

1. ACER, U. G., KALYANARAMAN, S., AND ABOUZEID, A. A. Weak State Routing for Large Scale Dynamic Networks. MobiCom '07: Proceedings of the 13th Annual ACM International Conference on Mobile Computing and Networking (2007), 290-301.
2. BEN JDIDIA, M., ROBARDET, C., AND FLEURY, E. Communities detection and analysis of their dynamics in collaborative networks. 2nd International Conference on Digital Information Management, ICDIM 2 (2007), 744-749.
3. BISNIK, N., AND ABOUZEID, A. A. Optimizing random walk search algorithms in p2p networks. Computer Networks 51, 6 (2007), 1499-1514.
4. CAMP, T., BOLENG, J., AND DAVIES, V. A survey of mobility models for ad hoc network research. Wireless Communications and Mobile Computing 2, 5 (2002), 483-502. (Pubitemid 135713186)
5. FERREIRA, A. Building a reference combinatorial model for manets. IEEE Network 18, 5 (2004), 24-29.
6. GKANTSIDIS, C., MIHAIL, M., AND SABERI, A. Random walks in peer-to-peer networks. Proceedings - IEEE INFOCOM 1 (2004), 120-130.
7. GROSSGLAUSER, M., AND TSE, D. N. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Transactions on Networking 10, 4 (2002), 477-486. (Pubitemid 35000391)
8. KOLDA, T. G. Orthogonal tensor decompositions. SIAM Journal on Matrix Analysis and Applications 23 (2001), 243-255.
9. KUMAR, R., NOVAK, J., RAGHAVAN, P., AND TOMKINS, A. On the bursty evolution of blogspace. World Wide Web 8, 2 (2005), 159-178
10. KWAK, B.-J., SONG, N.-O., AND MILLER, L. E. A standard measure of mobility for evaluating mobile ad hoc network performance. IEICE Transactions on Communications E86-B, 11 (2003), 3236-3243.
11. LEIBOVICI, D., AND SABATIER, R. A singular value decomposition of a k-way array for a principal component analysis of multiway data, pta-k. Linear Algebra and Its Applications 269, 1-3 (1998), 307-329. (Pubitemid 128387565)
12. LESKOVEC, J., KLEINBERG, J., AND FALOUTSOS, C. Graphs over time: Densification laws, shrinking diameters and possible explanations. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2005), 177-187.
13. LINIAL, N., AND WIGDERSON, A. Expander graphs and their applications. Lecture Notes, The Hebrew University, Israel, 2003.
14. LV, Q., CAO, P., COHEN, E., LI, K., AND SHENKER, S. Search and replication in unstructured peer-to-peer networks. Proceedings of the International Conference on Supercomputing (2002), 84-95.
15. MAHONEY, M. W., MAGGIONI, M., AND DRINEAS, P. Tensor-cur decompositions for tensor-based data. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006), pp. 327-336.
16. PALLA, G., BARABASI, A., AND VICSEK, T. Quantifying social group evolution. Nature 446 (April 2007), 664-667.
17. PLATIS, A., LIMNIOS, N., AND LE DU, M. Hitting time in a finite non-homogeneous markov chain with applications. Applied Stochastic Models and Data Analysis 14, 3 (1998), 241-253.
18. SCHERRER, A., BORGNAT, P., FLEURY, E., GUILLAUME, J.-L., AND ROBARDET, C. Description and simulation of dynamic mobility networks. Computer Networks 52, 15 (2008), 2842-2858.
19. SPYROPOULOS, T., PSOUNIS, K., AND RAGHAVENDRA, C. S. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. Proceedings of ACM SIGCOMM 2005 Workshops: Conference on Computer Communications (2005), 252-259.
20. VAHDAT, A., AND BECKER, D. Epidemic Routing for Partially Connected Ad Hoc Networks. Tech. rep., Department of Computer Science, Duke University, Durham, NC, 2000.
21. ZHANG, T., AND GOLUB, G. H. Rank-one approximation to high order tensors. SIAM J. Matrix Anal. Appl. 23, 2 (2001), 534-550.
22. ZHANG, Z. Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges. Communications Surveys & Tutorials, IEEE 8, 1 (2006), 24-37.