E. Bautista, P. Abry, and P. Gonçalves, L -PageRank for Semi-Supervised Learning, Conference Proceedings, vol.4, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02063780

R. Fontugne, E. Bautista, C. Petrie, Y. Nomura, P. Abry et al., BGP Zombies: an Analysis of Beacons Stuck Routes, PAM 2019 -20th Passive and Active Measurements Conference, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01970596

S. De-nigris, E. Bautista, P. Abry, K. Avrachenkov, and P. Gonçalves, Fractional Graph-based Semi-Supervised Learning, Proceedings of the 25th European Signal Processing Conference, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01586767

E. Bautista, S. De-nigris, P. Abry, K. Avrachenkov, and P. Gonçalves, We also monitor the beacon's visibility by means of a RIPEstat looking glass [148], so that every time a zombie outbreak is seen, we launch traceroute measurements towards beacon prefixes from Atlas probes located in zombie ASes, Proceedings of the 26th colloquium GRETSI, vol.5, 2017.

K. He, X. Zhang, S. Ren, and J. Sun, Deep residual learning for image recognition, Proceedings of the IEEE conference on computer vision and pattern recognition, pp.770-778, 2016.

R. C. Deo, Machine learning in medicine, Circulation, vol.132, issue.20, pp.1920-1930, 2015.

B. C. Bonoto, V. E. De-araújo, I. P. Godói, L. L. De-lemos, B. Godman et al., Efficacy of mobile apps to support the care of patients with diabetes mellitus: a systematic review and meta-analysis of randomized controlled trials, JMIR mHealth and uHealth, vol.5, issue.3, p.4, 2017.

J. E. Mück, B. Ünal, H. Butt, and A. K. Yetisen, Market and patent analyses of wearables in medicine, Trends in biotechnology, vol.37, issue.6, pp.563-566, 2019.

K. Avrachenkov, P. Gonçalves, A. Legout, and M. Sokol, Classification of content and users in bittorrent by semi-supervised learning methods, International Wireless Communications and Mobile Computing Conference (3rd International Workshop on Traffic Analysis and Classification), (Cyprus), 2012.
URL : https://hal.archives-ouvertes.fr/hal-00747641

A. Subramanya and J. Bilmes, Soft-supervised learning for text classification, Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP '08, pp.1090-1099, 2008.

W. Hu, J. Gao, J. Xing, C. Zhang, and S. Maybank, Semi-supervised tensor-based graph embedding learning and its application to visual discriminant tracking, IEEE transactions on pattern analysis and machine intelligence, vol.39, pp.172-188, 2016.

H. Cecotti, Active graph based semi-supervised learning using image matching: application to handwritten digit recognition, Pattern Recognition Letters, vol.73, pp.76-82, 2016.

F. De-morsier, M. Borgeaud, V. Gass, J. Thiran, and D. Tuia, Kernel low-rank and sparse graph for unsupervised and semi-supervised classification of hyperspectral images, IEEE Transactions on Geoscience and Remote Sensing, vol.54, issue.6, pp.3410-3420, 2016.

M. Sokol, Graph-based semi-supervised learning methods and quick detection of central nodes, 2014.
URL : https://hal.archives-ouvertes.fr/tel-00998394

R. Andersen, F. Chung, and K. Lang, Local graph partitioning using pagerank vectors, 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.475-486, 2006.

M. Belkin, I. Matveeva, and P. Niyogi, Regularization and semi-supervised learning on large graphs, International Conference on Computational Learning Theory, pp.624-638, 2004.

D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Schölkopf, Learning with local and global consistency, Advances in neural information processing systems, pp.321-328, 2004.

D. Zhou and C. J. Burges, Spectral clustering and transductive learning with multiple views, Proceedings of the 24th international conference on Machine learning, pp.1159-1166, 2007.

X. Zhou and M. Belkin, Semi-supervised learning by higher order regularization, Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, vol.15, pp.11-13, 2011.

R. Andersen, F. R. Chung, and K. J. Lang, Using pagerank to locally partition a graph, Internet Mathematics, vol.4, pp.35-64, 2007.

R. Andersen and F. Chung, Detecting sharp drops in pagerank and a simplified local partitioning algorithm, Theory and Applications of Models of Computation, pp.1-12, 2007.

G. Jeh and J. Widom, Scaling personalized web search, Proceedings of the 12th international conference on World Wide Web, pp.271-279, 2003.

T. Maehara, T. Akiba, Y. Iwata, and K. Kawarabayashi, Computing personalized pagerank quickly by exploiting graph structures, Proceedings of the VLDB Endowment, vol.7, pp.1023-1034, 2014.

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

P. Berkhin, Bookmark-coloring algorithm for personalized pagerank computing, Internet Mathematics, vol.3, issue.1, pp.41-62, 2006.

E. Isufi, A. Loukas, A. Simonetto, and G. Leus, Autoregressive moving average graph filtering, IEEE Transactions on Signal Processing, vol.65, issue.2, pp.274-288, 2016.

D. I. Shuman, P. Vandergheynst, and P. Frossard, Chebyshev polynomial approximation for distributed signal processing, 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS), pp.1-8, 2011.

M. Yoon, W. Jin, and U. Kang, Fast and accurate random walk with restart on dynamic graphs with guarantees, International World Wide Web Conferences Steering Committee, pp.409-418, 2018.

N. Ohsaka, T. Maehara, and K. Kawarabayashi, Efficient pagerank tracking in evolving networks, Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.875-884, 2015.

B. Hayes, Computing science: Graph theory in practice: Part i, American Scientist, vol.88, issue.1, pp.9-13, 2000.

J. M. Harris, J. L. Hirst, and M. J. Mossinghoff, Combinatorics and graph theory, vol.2, 2008.

R. Albert, H. Jeong, and A. Barabási, Internet: Diameter of the world-wide web, nature, vol.401, issue.6749, p.130, 1999.

J. Scott, Social network analysis, Sociology, vol.22, issue.1, pp.109-127, 1988.

P. Gai and S. Kapadia, Contagion in financial networks, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.466, issue.2120, pp.2401-2423, 2010.

F. Wang, U. Srinivasan, S. Uddin, and S. Chawla, Application of network analysis on healthcare, Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp.596-603, 2014.

J. Rual, K. Venkatesan, T. Hao, T. Hirozane-kishikawa, A. Dricot et al., Towards a proteome-scale map of the human protein-protein interaction network, Nature, vol.437, issue.7062, p.1173, 2005.

Z. Zhang and M. Chow, Convergence analysis of the incremental cost consensus algorithm under different communication network topologies in a smart grid, IEEE Transactions on Power Systems, vol.27, issue.4, pp.1761-1768, 2012.

J. Costantine, S. Al-saffar, C. G. Christodoulou, K. Y. Kabalan, and A. El-hajj, The analysis of a reconfigurable antenna with a rotating feed using graph models, IEEE Antennas and Wireless Propagation Letters, vol.8, pp.943-946, 2009.

B. Krishnamachari, D. Estrin, and S. B. Wicker, The impact of data aggregation in wireless sensor networks, ICDCS workshops, vol.578, 2002.

R. M. Gray, Toeplitz and circulant matrices: A review, Foundations and Trends® in Communications and Information Theory, vol.2, issue.3, pp.155-239, 2006.

A. Condon and R. M. Karp, Algorithms for graph partitioning on the planted partition model, Random Structures & Algorithms, vol.18, issue.2, pp.116-140, 2001.

D. Ghoshdastidar and A. Dukkipati, Consistency of spectral partitioning of uniform hypergraphs under planted partition model, Advances in Neural Information Processing Systems, pp.397-405, 2014.

C. Tsourakakis, Streaming graph partitioning in the planted partition model, Proceedings of the 2015 ACM on Conference on Online Social Networks, pp.27-35, 2015.

E. Mossel, J. Neeman, and A. Sly, Reconstruction and estimation in the planted partition model, Probability Theory and Related Fields, vol.162, pp.431-461, 2015.

A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications, Physical Review E, vol.84, issue.6, p.66106, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00661643

E. and A. , Community detection and stochastic block models: Recent developments, Journal of Machine Learning Research, vol.18, issue.177, pp.1-86, 2018.

A. N. Langville and C. D. Meyer, Google's PageRank and beyond: The science of search engine rankings, 2011.

M. E. Newman, A measure of betweenness centrality based on random walks, Social networks, vol.27, issue.1, pp.39-54, 2005.

M. H. Ribeiro, P. H. Calais, V. A. Almeida, and W. Meira, everything i disagree with is# fakenews": Correlating political polarization and spread of misinformation, 2017.

P. Pons and M. Latapy, Computing communities in large networks using random walks, International symposium on computer and information sciences, pp.284-293, 2005.

W. Wei and B. Selman, Accelerating random walks, International Conference on Principles and Practice of Constraint Programming, pp.216-232, 2002.

M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random structures & algorithms, vol.6, pp.161-180, 1995.

F. Neumann and C. Witt, Ant colony optimization and the minimum spanning tree problem, Theoretical Computer Science, vol.411, issue.25, pp.2406-2413, 2010.

D. Aldous and J. A. Fill, Reversible markov chains and random walks on graphs, 2002.

L. Lovász, Random walks on graphs: A survey, Combinatorics, Paul erdos is eighty, vol.2, issue.1, pp.1-46, 1993.

S. Chen, A. Sandryhaila, G. Lederman, Z. Wang, J. M. Moura et al., Signal inpainting on graphs via total variation minimization, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.8267-8271, 2014.

G. Arvanitis, A. S. Lalos, K. Moustakas, and N. Fakotakis, Feature preserving mesh denoising based on graph spectral processing, IEEE transactions on visualization and computer graphics, vol.25, issue.3, pp.1513-1527, 2019.

M. Onuki, S. Ono, M. Yamagishi, and Y. Tanaka, Graph signal denoising via trilateral filter on graph spectral domain, IEEE Transactions on Signal and Information Processing over Networks, vol.2, issue.2, pp.137-148, 2016.

E. Isufi, A. Loukas, A. Simonetto, and G. Leus, Autoregressive moving average graph filtering, IEEE Transactions on Signal Processing, vol.65, issue.2, pp.274-288, 2017.

A. G. Marques, S. Segarra, G. Leus, and A. Ribeiro, Stationary graph processes and spectral estimation, IEEE Transactions on Signal Processing, vol.65, issue.22, pp.5911-5926, 2017.

S. Chen, A. Sandryhaila, and J. Kova?evi?, Distributed algorithm for graph signal inpainting, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.3731-3735, 2015.

S. K. Narang, A. Gadde, and A. Ortega, Signal processing techniques for interpolation in graph structured data, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, pp.5445-5449, 2013.

M. Tsitsvero, S. Barbarossa, and P. Lorenzo, Signals on graphs: Uncertainty principle and sampling, IEEE Transactions on Signal Processing, vol.64, issue.18, pp.4845-4860, 2016.

N. Perraudin and P. Vandergheynst, Stationary signal processing on graphs, IEEE Transactions on Signal Processing, vol.65, issue.13, pp.3462-3477, 2017.

N. Tremblay and P. Borgnat, Graph wavelets for multiscale community mining, IEEE Transactions on Signal Processing, vol.62, issue.20, pp.5227-5239, 2014.

M. Rizkallah, X. Su, T. Maugey, and C. Guillemot, Graph-based transforms for predictive light field compression based on super-pixels, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.1718-1722, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01737332

C. Zhang, D. Florencio, and C. Loop, Point cloud attribute compression with graph transform, 2014 IEEE International Conference on Image Processing (ICIP), pp.2066-2070, 2014.

M. Defferrard, X. Bresson, and P. Vandergheynst, Convolutional neural networks on graphs with fast localized spectral filtering, Advances in neural information processing systems, pp.3844-3852, 2016.

M. Zhang, Z. Cui, M. Neumann, and Y. Chen, An end-to-end deep learning architecture for graph classification, Thirty-Second AAAI Conference on Artificial Intelligence, 2018.

A. Elmoataz, O. Lezoray, and S. Bougleux, Nonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing, IEEE Transactions on Image Processing, vol.17, pp.1047-1060, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00163573

D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains, 2012.

X. Zhu and A. B. Goldberg, Introduction to semi-supervised learning, Synthesis lectures on artificial intelligence and machine learning, vol.3, issue.1, pp.1-130, 2009.

A. Subramanya and P. P. Talukdar, Graph-based semi-supervised learning, Synthesis Lectures on Artificial Intelligence and Machine Learning, vol.8, pp.1-125, 2014.

M. Zhao, R. H. Chan, T. W. Chow, and P. Tang, Compact graph based semi-supervised learning for medical diagnosis in alzheimers disease, IEEE Signal Processing Letters, vol.21, pp.1192-1196, 2014.

J. A. Suykens and J. Vandewalle, Least squares support vector machine classifiers, vol.9, pp.293-300, 1999.

U. and V. Luxburg, A tutorial on spectral clustering, Statistics and computing, vol.17, issue.4, pp.395-416, 2007.

Y. Bengio, O. Delalleau, and N. L. Roux, Label Propagation and Quadratic Criterion, pp.193-216, 2006.

X. Mai, Methods of random matrix for large dimensional statistical learning, 2019.

K. Avrachenkov, A. Mishenin, P. Gonçalves, and M. Sokol, Generalized optimization framework for graph-based semi-supervised learning, Proceedings of the 2012 SIAM International Conference on Data Mining, pp.966-974, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00633818

X. Mai and R. Couillet, Revisiting and improving semi-supervised learning: A large dimensional approach, ICASSP 2019 -2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.3547-3551, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02139979

B. Nadler, N. Srebro, and X. Zhou, Statistical analysis of semi-supervised learning: The limit of infinite unlabelled data, Advances in Neural Information Processing Systems, pp.1330-1338, 2009.

F. R. Chung and F. C. Graham, Spectral graph theory. No. 92, 1997.

L. Lovász and M. Simonovits, The mixing rate of markov chains, an isoperimetric inequality, and computing the volume, Proceedings [1990] 31st annual symposium on foundations of computer science, pp.346-354, 1990.

D. A. Spielman and S. Teng, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, Proceedings of the STOC, vol.4, 2004.

Z. Xiaojin and G. Zoubin, Learning from labeled and unlabeled data with label propagation, 2002.

X. Zhu, Z. Ghahramani, and J. D. Lafferty, Semi-supervised learning using gaussian fields and harmonic functions, Proceedings of the 20th International conference on Machine learning (ICML-03), pp.912-919, 2003.

M. Szummer and T. Jaakkola, Partially labeled classification with markov random walks, Advances in neural information processing systems, pp.945-952, 2002.

M. Belkin and P. Niyogi, Using manifold stucture for partially labeled classification, Advances in neural information processing systems, pp.953-960, 2003.

S. Baluja, R. Seth, D. Sivakumar, Y. Jing, J. Yagnik et al., Video suggestion and discovery for youtube: taking random walks through the view graph, Proceedings of the 17th international conference on World Wide Web, pp.895-904, 2008.

P. P. Talukdar and K. Crammer, New regularized algorithms for transductive learning, Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp.442-457, 2009.

M. Orbach and K. Crammer, Graph-based transduction with confidence, Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp.323-338, 2012.

A. Subramanya and J. Bilmes, Semi-supervised learning with measure propagation, Journal of Machine Learning Research, vol.12, pp.3311-3370, 2011.

T. H. Haveliwala, Topic-sensitive pagerank, Proceedings of the 11th international conference on World Wide Web, pp.517-526, 2002.

K. Avrachenkov, P. Gonçalves, and M. Sokol, On the choice of kernel and labelled data in semi-supervised learning methods, International Workshop on Algorithms and Models for the Web-Graph, pp.56-67, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00924132

B. Girault, Signal Processing on Graphs-Contributions to an Emerging Field, 2015.
URL : https://hal.archives-ouvertes.fr/tel-01256044

C. Hu, L. Cheng, J. Sepulcre, G. E. Fakhri, Y. M. Lu et al., A graph theoretical regression model for brain connectivity learning of alzheimer's disease, 2013 IEEE 10th International Symposium on Biomedical Imaging, pp.616-619, 2013.

S. T. Roweis and L. K. Saul, Nonlinear dimensionality reduction by locally linear embedding, science, vol.290, issue.5500, pp.2323-2326, 2000.

X. Mai and R. Couillet, The counterintuitive mechanism of graph-based semisupervised learning in the big data regime, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2017.
URL : https://hal.archives-ouvertes.fr/hal-01957754

S. Fortunato, Community detection in graphs, Physics reports, vol.486, issue.3-5, pp.75-174, 2010.

S. B. Seidman, Network structure and minimum degree, Social networks, vol.5, issue.3, pp.269-287, 1983.

M. E. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical review E, vol.69, issue.2, p.26113, 2004.

M. Stoer and F. Wagner, A simple min-cut algorithm, Journal of the ACM (JACM), vol.44, issue.4, pp.585-591, 1997.

P. Elias, A. Feinstein, and C. Shannon, A note on the maximum flow through a network, IRE Transactions on Information Theory, vol.2, issue.4, pp.117-119, 1956.

Y. Wei and C. Cheng, Towards efficient hierarchical designs by ratio cut partitioning, 1989 IEEE International Conference on Computer-Aided Design, pp.298-301, 1989.

J. Shi and J. Malik, Normalized cuts and image segmentation, p.107, 2000.

M. Fiedler, Algebraic connectivity of graphs, Czechoslovak mathematical journal, vol.23, issue.2, pp.298-305, 1973.

F. Chung, Four proofs for the Cheeger inequality and graph partition algorithms, Proceedings of ICCM, 2007.

F. Chung, Pagerank as a discrete green?s function, Geometry and Analysis I ALM, vol.17, pp.285-302, 2010.

A. Tsiatas, Diffusion and Clustering on Large Graphs, 2012.

K. Avrachenkov, V. Dobrynin, D. Nemirovsky, S. K. Pham, and E. Smirnova, Pagerank based clustering of hypertext document collections, Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, pp.873-874, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00565355

F. Chung, P. Horn, and A. Tsiatas, Distributing antidote using pagerank vectors, Internet Mathematics, vol.6, issue.2, pp.237-254, 2009.

F. C. Graham and A. Tsiatas, Finding and visualizing graph clusters using pagerank optimization, International Workshop on Algorithms and Models for the Web-Graph, pp.86-97, 2010.

F. Chung, P. Horn, and J. Hughes, Multi-commodity allocation for dynamic demands using pagerank vectors, International Workshop on Algorithms and Models for the Web-Graph, pp.138-152, 2012.

F. Chung, A. Tsiatas, and W. Xu, Dirichlet pagerank and trust-based ranking algorithms, International Workshop on Algorithms and Models for the Web-Graph, pp.103-114, 2011.

A. Z. Broder, R. Lempel, F. Maghoul, and J. Pedersen, Efficient pagerank approximation via graph aggregation, Information Retrieval, vol.9, issue.2, pp.123-138, 2006.

F. Chung and W. Zhao, A sharp pagerank algorithm with applications to edge ranking and graph sparsification, International Workshop on Algorithms and Models for the Web-Graph, pp.2-14, 2010.

A. P. Riascos and J. L. Mateos, Fractional dynamics on networks: Emergence of anomalous diffusion and lévy flights, Phys. Rev. E, vol.90, p.32809, 2014.

A. P. Riascos and J. L. Mateos, Long-range navigation on complex networks using lévy random walks, Physical Review E, vol.86, issue.5, p.56110, 2012.

P. Zhang, C. Moore, and L. Zdeborova, Phase transitions in semisupervised clustering of sparse networks, Physical review. E, Statistical, nonlinear, and soft matter physics, vol.90, p.2014

Y. Lecun, L. Bottou, Y. Bengio, and P. Haffner, Gradient-based learning applied to document recognition, Proceedings of the IEEE, vol.86, pp.2278-2324, 1998.

D. Hond and L. Spacek, Distinctive descriptions for face processing, 1997.

D. Greene and P. Cunningham, Practical solutions to the problem of diagonal dominance in kernel document clustering, Proceedings of the 23rd International Conference on Machine Learning, ICML '06, pp.377-384, 2006.

S. H. Rice, A stochastic version of the price equation reveals the interplay of deterministic and stochastic processes in evolution, BMC evolutionary biology, vol.8, issue.1, p.262, 2008.

Z. Zhan, R. Hu, X. Gao, and N. Huai, Fast incremental pagerank on dynamic networks, International Conference on Web Engineering, pp.154-168, 2019.

T. Haveliwala, Efficient computation of pagerank, tech. rep, 1999.

Y. Fujiwara, M. Nakatsuji, T. Yamamuro, H. Shiokawa, and M. Onizuka, Efficient personalized pagerank with accuracy assurance, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.15-23, 2012.

B. Bahmani, K. Chakrabarti, and D. Xin, Fast personalized pagerank on mapreduce, Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp.973-984, 2011.

D. Fogaras, B. Rácz, K. Csalogány, and T. Sarlós, Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments, Internet Mathematics, vol.2, issue.3, pp.333-358, 2005.

K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova, Monte carlo methods in pagerank computation: When one iteration is sufficient, SIAM Journal on Numerical Analysis, vol.45, issue.2, pp.890-904, 2007.

B. Bahmani, A. Chowdhury, and A. Goel, Fast incremental and personalized pagerank, Proceedings of the VLDB Endowment, vol.4, pp.173-184, 2010.

I. C. Ipsen and R. S. Wills, Mathematical properties and analysis of google?s pagerank, Bol. Soc. Esp. Mat. Apl, vol.34, pp.191-196, 2006.

N. Tremblay, P. Gonçalves, and P. Borgnat, Design of graph filters and filterbanks, Cooperative and Graph Signal Processing, pp.299-324, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01675375

B. N. Parlett, H. Simon, and L. Stringer, On estimating the largest eigenvalue with the lanczos algorithm, Mathematics of computation, vol.38, issue.157, pp.153-165, 1982.

A. K. Jain, J. Mao, and K. M. Mohiuddin, Artificial neural networks: A tutorial, Computer, vol.29, issue.3, pp.31-44, 1996.

T. N. Kipf and M. Welling, Semi-supervised classification with graph convolutional networks, 2016.

F. Wu, T. Zhang, A. H. Souza, C. Fifty, T. Yu et al., Simplifying graph convolutional networks, 2019.

M. Niepert, M. Ahmed, and K. Kutzkov, Learning convolutional neural networks for graphs, International conference on machine learning, pp.2014-2023, 2016.

Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel, Gated graph sequence neural networks, 2015.

, Dynamic sbm python class

J. W. Stewart and I. , inter-domain routing in the Internet, vol.4, 1998.

A. Dhamdhere, D. D. Clark, A. Gamero-garrido, M. Luckie, R. K. Mok et al., Inferring persistent interdomain congestion, Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, pp.1-15, 2018.

M. S. Kang and V. D. Gligor, Routing bottlenecks in the internet: Causes, exploits, and countermeasures, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp.321-333, 2014.

A. Milolidakis, R. Fontugne, and X. Dimitropoulos, Detecting network disruptions at colocation facilities, IEEE INFOCOM 2019-IEEE Conference on Computer Communications, pp.2161-2169, 2019.

A. Marder and J. M. Smith, Map-it: Multipass accurate passive inferences from traceroute, Proceedings of the 2016 Internet Measurement Conference, pp.397-411, 2016.

M. Luckie, A. Dhamdhere, B. Huffaker, and D. Clark, Bdrmap: Inference of borders between ip networks, Proceedings of the 2016 Internet Measurement Conference, pp.381-396, 2016.

A. Marder, M. Luckie, A. Dhamdhere, B. Huffaker, and J. M. Smith, Pushing the boundaries with bdrmapit: Mapping router ownership at internet scale, Proceedings of the Internet Measurement Conference, pp.56-69, 2018.

Z. M. Mao, R. Bush, T. G. Griffin, and M. Roughan, Ripe ncc, ris raw data, Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, pp.1-14, 2003.

C. Villamizar, R. Govindan, and R. Chandra, Bgp route flap damping, 1998.

S. Sangli, Y. Rekhter, R. Fernando, J. Scudder, and E. Chen, Graceful restart mechanism for bgp, tech. rep, 2007.

, Ripe ncc, ripestat: Bgp looking glass

, Ripe ncc, atlas