H. Acharya and M. Gouda, The weak network tracing problem, Proc. Int. Conference on Distributed Computing and Networking (ICDCN), pp.184-194, 2010.

H. Acharya and M. Gouda, On the hardness of topology inference, Proc. Int. Conference on Distributed Computing and Networking (ICDCN), pp.251-262, 2011.

H. B. Acharya and M. G. Gouda, A theory of network tracing, Proc. 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp.62-74, 2009.

D. Achlioptas, A. Clauset, D. Kempe, and C. Moore, On the bias of traceroute sampling: or, power-law degree distributions in regular graphs, Proc. 37th Annual ACM Symposium on Theory of Computing (STOC), pp.694-703, 2005.

N. Alon, Y. Emek, M. Feldman, and M. Tennenholtz, Economical graph discovery, Proc. 2nd Symposium on Innovations in Computer Science (ICS), 2011.

A. Anandkumar, A. Hassidim, and J. Kelner, Topology discovery of sparse random graphs with few participants, Proc. SIGMETRICS, 2011.

B. Augustin, X. Cuvellier, B. Orgogozo, F. Viger, T. Friedman et al., Avoiding traceroute anomalies with paris traceroute, Proc. 6th ACM SIGCOMM Conference on Internet Measurement (IMC), pp.153-158, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01097553

P. Barford, A. Bestavros, J. Byers, and M. Crovella, On the marginal utility of network topology measurements, Proc. 1st ACM SIGCOMM Workshop on Internet Measurement (IMW), pp.5-17, 2001.

A. Bestavros, J. W. Byers, and K. A. Harfoush, Inference and labeling of metric-induced network topologies, IEEE Trans. Parallel Distrib. Syst, vol.16, pp.1053-1065, 2005.

M. Buchanan, Data-bots chart the internet, Science, vol.813, issue.3, 2005.

B. Cheswick, H. Burch, and S. Branigan, Mapping and visualizing the internet, Proc. USENIX Annual Technical Conference (ATEC), 2000.

M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, Proc. SIGCOMM, pp.251-262, 1999.

M. Gunes and K. Sarac, Resolving anonymous routers in internet topology measurement studies, Proc. INFOCOM, 2008.

H. Acharya and M. Gouda, The weak network tracing problem, Proc. Int. Conference on Distributed Computing and Networking (ICDCN), pp.184-194, 2010.

H. Acharya and M. Gouda, On the hardness of topology inference, Proc. Int. Conference on Distributed Computing and Networking (ICDCN), pp.251-262, 2011.

M. Acharya and H. Nd-gouda, A theory of network tracing, Proc. 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp.62-74, 2009.

D. Achlioptas, A. Clauset, D. Kempe, and C. Moore, On the bias of traceroute sampling: or, powerlaw degree distributions in regular graphs, Proc. 37th Annual ACM Symposium on Theory of Computing (STOC), pp.694-703, 2005.

B. Ager, N. Chatzis, A. Feldmann, N. Sarrar, S. Uhlig et al., Anatomy of a large european ixp, Proc. ACM SIGCOMM, 2012.

R. Aipperspach, T. Rattenbury, A. Woodruff, and J. Canny, A quantitative method for revealing and comparing places in the home, Procs. of UbiComp'06, pp.1-18, 2006.

O. Allali, C. Magnien, and M. Latapy, Internal link prediction: A new approach for predicting links in bipartite graphs, Intelligent Data Analysis, vol.17, issue.1, pp.5-25, 2013.

C. Ambühl, M. Mastrolilli, and O. Svensson, Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut, SIAM J. Comput, vol.40, issue.2, pp.567-596, 2011.

A. Anandkumar, A. Hassidim, and J. Kelner, Topology discovery of sparse random graphs with few participants, Proc. SIGMETRICS, 2011.

, André Panisson. pymobility: python implementation of mobility models, 2015.

B. Augustin, X. Cuvellier, B. Orgogozo, F. Viger, T. Friedman et al., Avoiding traceroute anomalies with paris traceroute, Proc. 6th ACM SIGCOMM Conference on Internet Measurement (IMC), pp.153-158, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01097553

A. J. Aviv, M. Sherr, M. Blaze, and J. M. Smith, Evading cellular data monitoring with human movement networks, Proc. 5th USENIX Workshop Hot Topics on Security, 2010.

N. Bansal, K. Lee, V. Nagarajan, and M. Zafer, Minimum congestion mapping in a cloud, Proc. 30th PODC, pp.267-276, 2011.

A. Barabási and R. Albert, Emergence of Scaling in Random Networks, Science, vol.286, 1999.

P. Barford, A. Bestavros, J. Byers, and M. Crovella, On the marginal utility of network topology measurements, Proc. 1st ACM SIGCOMM Workshop on Internet Measurement (IMW), pp.5-17, 2001.

V. Part and . Bibliography,

F. Benbadis, J. Leguay, V. Borrel, M. Amorim, and T. Friedman, Millipede: a rollerblade positioning system, Procs. of ACM WiNTECH'06, pp.117-118, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01352506

A. R. Beresford and F. Stajano, Location privacy in pervasive computing, IEEE Pervasive computing, vol.1, pp.46-55, 2003.

M. Berlingerio, D. Koutra, T. Eliassi-rad, and C. Faloutsos, Network similarity via multiple social theories, Proc. IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp.1439-1440, 2013.

I. Bilogrevic, K. Huguenin, M. Jadliwala, F. Lopez, J. Hubaux et al., Inferring social ties in academic networks using short-range wireless communications, Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society, pp.179-188, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00853975

V. D. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, Journal of statistical mechanics: theory and experiment, issue.10, p.10008, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01146070

C. Boldrini, M. Conti, and A. Passarella, The sociable traveller: human travelling patterns in social-based mobility, Procs. of ACM MobiWAC'09, pp.34-41, 2009.

S. Borgatti and M. Everett, A graph-theoretic perspective on centrality, Social Networks, vol.28, issue.4, pp.466-484, 2006.

V. Borrel, F. Legendre, M. D. De-amorim, and S. Fdida, Simps: using sociology for personal mobility, IEEE/ACM Trans. Netw, vol.17, issue.3, pp.831-842, 2009.

U. Brandes and T. Erlebach, Network Analysis: Methodological Foundations, vol.3418, 2005.

C. Brown, C. Efstratiou, I. Leontiadis, D. Quercia, and C. Mascolo, Tracking serendipitous interactions: How individual cultures shape the office, Proceedings of the ACM Conference on Computer Supported Cooperative Work and Social Computing, 2014.

C. Brown, C. Efstratiou, I. Leontiadis, D. Quercia, C. Mascolo et al., The architecture of innovation: Tracking face-to-face interactions with ubicomp technologies, Proceedings of the ACM International Joint Conference on Pervasive and Ubiquitous Computing, 2014.

M. Buchanan, Data-bots chart the internet, Science, vol.813, issue.3, 2005.

A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro, Time-varying graphs and dynamic networks, International Journal of Parallel, Emergent and Distributed Systems, vol.27, issue.5, pp.387-408, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00854287

D. , Deterministic graph grammars. Logic and Automata, pp.169-250, 2008.

D. , On cayley graphs of algebraic structures, 2018.

A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass et al., Impact of human mobility on opportunistic forwarding algorithms, IEEE Transactions on Mobile Computing, vol.6, issue.6, pp.606-620, 2007.

B. Cheswick, H. Burch, and S. Branigan, Mapping and visualizing the internet, Proc. USENIX Annual Technical Conference (ATEC), 2000.

E. Cho, S. A. Myers, and J. Leskovec, Friendship and mobility: user movement in location-based social networks, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.1082-1090, 2011.

M. K. Chowdhury and R. Boutaba, A survey of network virtualization, vol.54, 2010.

F. R. Chung and L. Lu, Complex graphs and networks, vol.107, 2006.

N. S. Contractor, S. Wasserman, and K. Faust, Testing multitheoretical organizational networks: An analytic framework and empirical example, 2006.

D. J. Cook and L. B. Holder, Substructure discovery using minimum description length and background knowledge, J. Artif. Int. Res, vol.1, pp.231-255, 1994.

E. C. Costa, A. B. Vieira, K. Wehmuth, A. Ziviani, and A. P. Da-silva, Time centrality in dynamic complex networks, 2015.

P. Covington, J. Adams, and E. Sargin, Deep neural networks for youtube recommendations, RecSys, 2016.

D. J. Crandall, L. Backstrom, D. Cosley, S. Suri, D. Huttenlocher et al., Inferring social ties from geographic coincidences, Proceedings of the National Academy of Sciences, vol.107, issue.52, pp.22436-22441, 2010.

M. Cunche, M. Kaafar, and R. Boreli, Linking wireless devices using information contained in wi-fi probe requests, Pervasive and Mobile Computing, vol.11, pp.56-69, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00816374

L. Dall'asta, I. Alvarez-hamelin, A. Barrat, A. Vázquez, and A. Vespignani, Exploring networks with traceroute-like probes: Theory and simulations, Theoretical Computer Science, vol.355, issue.1, pp.6-24, 2006.

W. Dong, D. Olguin-olguin, B. Waber, T. Kim, and A. S. Pentland, Mapping organizational dynamics with body sensor networks, International Workshop on Wearable and Implantable Body Sensor Networks, vol.0, pp.130-135, 2012.

N. Eagle, A. S. Pentland, and D. Lazer, Inferring friendship network structure by using mobile phone data, Proceedings of the National Academy of Sciences, vol.106, issue.36, pp.15274-15278, 2009.

N. Eagle and A. , Sandy) Pentland. Reality mining: sensing complex social systems, Personal Ubiquitous Comput, vol.10, issue.4, pp.255-268, 2006.

P. Erd?s and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci, vol.5, pp.17-61, 1960.

P. T. Eugster, R. Guerraoui, S. B. Handurukande, P. Kouznetsov, and A. Kermarrec, Lightweight probabilistic broadcast, ACM Transactions on Computer Systems (TOCS), vol.21, issue.4, pp.341-374, 2003.

G. Even, M. Medina, G. Schaffrath, and S. Schmid, Competitive and deterministic embeddings of virtual networks, Proc. ICDCN, 2012.

C. Faloutsos, D. Koutra, and J. T. Vogelstein, DELTACON: A principled massive-graph similarity function, Proc. 13th SIAM International Conference on Data Mining (SDM), pp.162-170, 2013.

M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, Proc. SIGCOMM, pp.251-262, 1999.

J. Fan and M. H. Ammar, Dynamic topology configuration in service overlay networks: A study of reconfiguration policies, Proc. IEEE INFOCOM, 2006.

V. Part and . Bibliography,

J. Ferlez, C. Faloutsos, J. Leskovec, D. Mladenic, and M. Grobelnik, Monitoring network evolution using mdl, International Conference on Data Engineering (ICDE), pp.1328-1330, 2008.

D. Fraiman, N. Fraiman, and R. Fraiman, Nonparametric statistics of dynamic networks with distinguishable nodes, Test, vol.26, issue.3, pp.546-573, 2017.

A. Galati and C. Greenhalgh, Human mobility in shopping mall environments, Proceedings of the Second International Workshop on Mobile Opportunistic Networking, MobiOpp '10, pp.1-7, 2010.

S. Gao, J. Ma, W. Shi, and G. Zhan, Ltppm: a location and trajectory privacy protection mechanism in participatory sensing, Wireless Communications and Mobile Computing, vol.15, issue.1, pp.155-169, 2015.

X. Gao, B. Xiao, D. Tao, and X. Li, A survey of graph edit distance, Pattern Anal. Appl, vol.13, issue.1, pp.113-129, 2010.

P. Gill, M. Arlitt, Z. Li, and A. Mahanti, The flattening internet topology: Natural evolution, unsightly barnacles or contrived collapse? Passive and Active Network Measurement, pp.1-10, 2008.

N. J. Gotelli and G. R. Graves, Null models in ecology. online resources, 1996.

M. S. Granovetter, The strength of weak ties, Social networks, pp.347-367, 1977.

J. Guillaume and M. Latapy, Complex network metrology. Complex systems, vol.16, p.83, 2005.

M. Gunes and K. Sarac, Resolving anonymous routers in internet topology measurement studies, Proc. INFOCOM, 2008.

A. Haider, R. Potter, and A. Nakao, Challenges in resource allocation in network virtualization, Proc. ITC Specialist Seminar on Network Virtualization, 2009.

K. Herrmann, Modeling the sociological aspects of mobility in ad hoc networks, Procs. of ACM MSWIM'03, pp.128-129, 2003.

I. Houidi, W. Louati, and D. Zeghlache, A distributed virtual network mapping algorithm, Proc. IEEE ICC, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01343135

P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft et al., Pocket switched networks and human mobility in conference environments, Procs. of WDTN'05, pp.244-251, 2005.

E. Inc, Estimote beacons, 2016.

R. Jin, C. Wang, D. Polshakov, S. Parthasarathy, and G. , Discovering frequent topological structures from graph datasets, Proc. ACM SIGKDD, pp.606-611, 2005.

X. Jin, W. Yiu, S. Chan, and Y. Wang, Network topology inference based on end-to-end measurements, IEEE Journal on Selected Areas in Communications, vol.24, issue.12, pp.2182-2195, 2006.

D. Kamisaka, T. Watanabe, S. Muramatsu, A. Kobayashi, and H. Yokoyama, Estimating position relation between two pedestrians using mobile phones, Procs. of Pervasive Computing'12, pp.307-324, 2012.

M. Killijian, R. Pasqua, M. Roy, G. Trédan, and C. Zanon, Souk: Spatial observation of human kinetics, Computer Networks, vol.111, pp.109-119, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01372329

M. Killijian, M. Roy, G. Trédan, and C. Zanon, Souk: social observation of human kinetics, Proceedings of the 2013 ACM international joint conference on Pervasive and ubiquitous computing, pp.193-196, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00839520

B. Kim, J. Ha, S. Lee, S. Kang, Y. Lee et al., Adnext: a visitpattern-aware mobile advertising system for urban commercial complexes, Proceedings of the 12th Workshop on Mobile Computing Systems and Applications, pp.7-12, 2011.

H. Kim and R. Anderson, Temporal node centrality in complex networks, Physical Review E, vol.85, issue.2, p.26107, 2012.

M. Köhler, S. N. Patel, J. W. Summet, E. P. Stuntebeck, and G. D. Abowd, Tracksense: infrastructure free precise indoor positioning using projected patterns, Procs. of Pervasive computing'07, pp.334-350, 2007.

G. Kossinets and D. J. Watts, Empirical analysis of an evolving social network, Science, vol.311, issue.5757, pp.88-90, 2006.

F. Kuhn, T. Moscibroda, and R. Wattenhofer, Unit disk graph approximation, Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC '04, pp.17-23, 2004.

J. Kunegis, On the spectral evolution of large networks, 2011.

J. Kunegis, KONECT -The Koblenz Network Collection, Proc. Int. Conf. on World Wide Web Companion, pp.1343-1350, 2013.

C. Labovitz, A. Ahuja, S. Venkatachary, and R. Wattenhofer, The impact of internet policy and topology on delayed routing convergence, Proc. 20th IEEE INFOCOM, vol.1, pp.537-546, 2001.

A. Lakhina, J. Byers, M. Crovella, and P. Xie, Sampling biases in ip topology measurements, Proc. 22nd IEEE INFOCOM, vol.1, pp.332-341, 2003.

V. Lenders, J. Wagner, and M. May, Analyzing the impact of mobility in ad hoc networks, Procs. of ACM RealMan'06, pp.39-46, 2006.

K. Lerman, R. Ghosh, and J. H. Kang, Centrality metric for dynamic networks, Mining and Learning with Graphs, 2010.

J. Leskovec, J. Kleinberg, and C. Faloutsos, Graph evolution: Densification and shrinking diameters, ACM Transactions on Knowledge Discovery from Data (TKDD), vol.1, issue.1, 2007.

D. Liben-nowell and J. Kleinberg, The link prediction problem for social networks, Proc. 12th International Conference on Information and Knowledge Management (CIKM), 2003.

N. Linial, E. London, and Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica, vol.15, issue.2, pp.215-245, 1995.

J. Lischka and H. Karl, A virtual network mapping algorithm based on subgraph isomorphism detection, Proc. ACM SIGCOMM VISA, 2009.

L. Lovasz, Random walks on graphs: A survey, Paul Erdos in Eighty, vol.2, 1993.

G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn et al., Pregel: a system for large-scale graph processing, Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp.135-146, 2010.

N. Mckeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson et al., Openflow: enabling innovation in campus networks, SIGCOMM Comput. Commun. Rev, vol.38, pp.69-74, 2008.

E. L. Merrer and G. Trédan, The topological face of recommendation: models and application to bias detection, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02082867

V. Part and . Bibliography,

E. L. Merrer and G. Trédan, Uncovering influence cookbooks: Reverse engineering the topological impact in peer ranking services, Proceedings of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing, pp.1413-1418, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01644568

R. Milo, S. Shen-orr, S. Itzkovitz, N. Kashtan, D. Chklovskii et al., Network motifs: Simple building blocks of complex networks, SCIENCE, 2001.

J. L. Moreno and H. H. Jennings, Who shall survive? Nervous and mental disease publishing co, 1934.

M. Musolesi and C. Mascolo, Designing mobility models based on social network theory. SIGMO-BILE Mob, Comput. Commun. Rev, vol.11, issue.3, pp.59-70, 2007.

P. V. Nikitin and K. Rao, Performance limitations of passive uhf rfid systems, IEEE Antennas and Propagation Society International Symposium, vol.1011, 2006.

A. Olteanu, K. Huguenin, R. Shokri, and J. Hubaux, Quantifying the effect of co-location information on location privacy, Privacy Enhancing Technologies, pp.184-203, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00978629

T. Opsahl and P. Panzarasa, Clustering in weighted networks, Social networks, vol.31, issue.2, pp.155-163, 2009.

L. Page, S. Brin, R. Motwani, and T. Winograd, The pagerank citation ranking: Bringing order to the web, 1999.

R. Pasqua, Inference and models of personal data : social mobility, spatial proximity. Theses, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01416982

A. Passarella, M. Conti, C. Boldrini, and R. I. Dunbar, Modelling inter-contact times in social pervasive networks, Proc. ACM MSWiM '11, pp.333-340, 2011.

S. Patel, K. Truong, and G. Abowd, Powerline positioning: A practical sub-room-level indoor location system for domestic use, Procs. of UbiComp'06, pp.441-458, 2006.

V. Paxson, End-to-end routing behavior in the internet, ACM SIGCOMM Computer Communication Review, vol.26, pp.25-38, 1996.

Y. Pignolet, S. Schmid, and G. Tredan, Misleading stars: what cannot be measured in the internet? Distributed computing, vol.26, pp.209-222, 2013.

Y. A. Pignolet, G. Tredan, and S. Schmid, Misleading Stars: What Cannot Be Measured in the Internet?, Proc. DISC, 2011.

G. Pirkl and P. Lukowicz, Robust, low cost indoor positioning using magnetic resonant coupling, Procs. of ACM UbiComp'12, pp.431-440, 2012.

J. M. Plotkin and J. W. Rosenthal, How to obtain an asymptotic expansion of a sequence from an analytic identity satisfied by its generating function, J. Austral. Math. Soc. Ser. A, 1994.

I. Poese, B. Frank, B. Ager, G. Smaragdakis, and A. Feldmann, Improving content delivery using provider-aided distance information, Proc. ACM IMC, 2010.

N. B. Priyantha, A. Chakraborty, and H. Balakrishnan, The cricket location-support system, Procs. of ACM Mobicom'00, pp.32-43, 2000.

N. Przulj, Biological network comparison using graphlet degree distribution, Bioinformatics, 2007.

P. Rimbert, Données personnelles, une affaire politique (in french), In Le Monde diplomatiqueSeptembre, p.3, 2016.

T. Ristenpart, E. Tromer, H. Shacham, and S. Savage, Hey, you, get off of my cloud: exploring information leakage in third-party compute clouds, Proc. 16th ACM CCS, pp.199-212, 2009.

N. Robertson and P. Seymour, Graph minors. xx. wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, issue.2, pp.325-357, 2004.

M. Roy, G. Tredan, and C. Zanon, Souk: Social & spatial observation of human kinetics, 2016.

L. Ryan, J. Mulholland, and A. Agoston, Talking ties: Reflecting on network visualisation and qualitative interviewing, Sociological Research Online, vol.19, issue.2, pp.1-12, 2014.

G. Schaffrath, S. Schmid, and A. Feldmann, Optimizing long-lived cloudnets with migrations, Proc. IEEE/ACM UCC, 2012.

G. Schaffrath, C. Werle, P. Papadimitriou, A. Feldmann, R. Bless et al., Network virtualization architecture: Proposal and initial prototype, Proc. ACM SIGCOMM VISA, 2009.

F. Schreiber and H. Schwöbbermeyer, Frequency concepts and pattern detection for the analysis of motifs in networks, Transactions on Computational Systems Biology, vol.3, pp.89-104, 2005.

N. Shah, D. Koutra, T. Zou, B. Gallagher, and C. Faloutsos, Timecrunch: Interpretable dynamic graph summarization, Proc. ACM SIGKDD, pp.1055-1064, 2015.

R. Shokri, G. Theodorakopoulos, J. Boudec, and J. Hubaux, Quantifying location privacy, 2011 IEEE Symposium on Security and Privacy, pp.247-262, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01266229

A. Soifer, B. Grünbaum, P. Johnson, and C. Rousseau, The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators, 2008.

S. Soundarajan, T. Eliassi-rad, and B. Gallagher, A guide to selecting a network similarity method, Proc. SIAM International Conference on Data Mining, 2014.

N. Spring, R. Mahajan, D. Wetherall, and T. Anderson, Measuring isp topologies with rocketfuel, IEEE/ACM Trans. Netw, vol.12, issue.1, pp.2-16, 2004.

A. Steger and N. C. Wormald, Generating random regular graphs quickly. Combinatorics, Probability and Computing, vol.8, 1999.

J. Stehlé, N. Voirin, A. Barrat, C. Cattuto, L. Isella et al., High-resolution measurements of face-to-face contact patterns in a primary school, PLoS ONE, vol.6, issue.8, 2011.

J. Sun, C. Faloutsos, S. Papadimitriou, and P. S. Yu, Graphscope: parameter-free mining of large time-evolving graphs, Proc. ACM SIGKDD, pp.687-696, 2007.

T. M. Tabirca, K. N. Brown, and C. J. Sreenan, Snapshot centrality indices in dynamic fifo networks, Journal of Mathematical Modelling and Algorithms, vol.10, issue.4, pp.371-391, 2011.

H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin, The impact of routing policy on internet paths, Proc. 21st IEEE INFOCOM, vol.2, pp.736-742, 2002.

J. Travers and S. Milgram, The small world problem, Psychology Today, vol.1, issue.1, pp.61-67, 1967.

. Ubisense, Series 7000 ip sensors. ubisense.net/en/media/pdfs/factsheets_pdf/83188_ series_7000_ip_sensors

V. Part and . Bibliography,

W. Ur-rehman, E. Lara, and S. Saroiu, Cilos: a cdma indoor localization system, Procs. of ACM UbiComp'08, pp.104-113, 2008.

T. Washio and H. Motoda, State of the art of graph-based data mining, SIGKDD Explor. Newsl, vol.5, pp.59-68, 2003.

S. Wernicke, Efficient detection of network motifs, IEEE/ACM Trans. Comput. Biol. Bioinformatics, vol.3, issue.4, pp.347-359, 2006.

S. H. Yang, B. Long, A. Smola, N. Sadagopan, Z. Zheng et al., Like like alike: joint friendship and interest propagation in social networks, Conference on World Wide Web (WWW), 2011.

B. Yao, R. Viswanathan, F. Chang, and D. Waddington, Topology inference in the presence of anonymous routers, Proc. 22nd IEEE INFOCOM, pp.353-363, 2003.

S. Zhang, Z. Qian, J. Wu, and S. Lu, An opportunistic resource sharing and topology-aware mapping framework for virtual networks, Proc. IEEE INFOCOM, 2012.

X. Zhao, A. Sala, C. Wilson, X. Wang, S. Gaito et al., Multi-scale dynamics in a massive online social network, Proc. ACM IMC, 2012.