Large Graphs and Networks

Research on large graphs and networks is conducted by 11 professors and about 30 PhD students and postdocs.

Principal Investigators :

Pierre-Antoine Absil, Vincent Blondel, Olivier Bonaventure, Jean-Charles Delvenne, Yves Deville, Pierre Dupont, Julien Hendrickx, Raphaël Jungers, Yurii Nesterov, Etienne Rivière, Marco Saerens

Research Labs :

Machine Learning Group, IP Networking Lab, Cloud and Large Scale computing group

Research Areas :

We look at some of the most recent and fundamental computational challenges raised by large networks. We study questions related to the classification, equilibria calculation, visualization, hierarchical reduction, analysis of dynamical properties and stochastic analysis of large networks. We also develop new analysis techniques allowing to extract useful information from graphs and networks, for example by detecting tightly connected groups within the network, finding the most prestigious nodes, categorizing unlabeled nodes thanks to some labeled ones, computing similarities between nodes, etc.

Applications include topics such as data-mining of text documents, web-searching, analysis of telephone, traffic and electricity networks. The Internet, the largest deployed network today, is of particular interest. Measurement and modeling tools and techniques that we develop allow us to obtain more accurate information about its organization (interconnections between Internet Service Providers, network topologies, ...) and to build realistic models of computer networks. We are using these tools and models to better understand the structure of the Internet, and also to evaluate the performance of new networking protocols.

Most recent publications

Below are listed the 10 most recent journal articles and conference papers produced in this research area. You also can access all publications by following this link : see all publications.

Journal Articles

1. Gerencser, Balazs; Hendrickx, Julien. Improved mixing rates of directed cycles by added connection. In: Journal of Theoretical Probability, Vol. 32, no. 2, p. 684-701 (2019). doi:10.1007/s10959-018-0861-x.

2. Dopico, Froilán M.; Pérez, Javier; Van Dooren, Paul. Block minimal bases ℓ-ifications of matrix polynomials. In: Linear Algebra and its Applications, Vol. 562, p. 163-204 (2019). doi:10.1016/j.laa.2018.10.010.

3. Beattie, Christopher A.; Mehrmann, Volker; Van Dooren, Paul. Robust port-Hamiltonian representations of passive systems. In: Automatica, Vol. 100, p. 182-186 (2019). doi:10.1016/j.automatica.2018.11.013.

4. Iutzeler, F.; Hendrickx, Julien. A generic online acceleration scheme for optimization algorithms via relaxation and inertia. In: Optimization Methods and Software, Vol. 34, no. 2, p. 383-405 (2019). doi:10.1080/10556788.2017.1396601.

5. Gerencser, Balazs; Hendrickx, Julien. Push sum with transmission failures. In: IEEE Transactions on Automatic Control, Vol. 64, no. 3, p. 1019-1033 (2018). doi:10.1109/TAC.2018.2836861.

6. Laudadio, Teresa; Mastronardi, Nicola; Van Dooren, Paul. The Generalized Schur Algorithm and Some Applications. In: Axioms, Vol. 7, no.4, p. 81 (2018). doi:10.3390/axioms7040081.

7. Dopico, Froilán M.; Lawrence, Piers W.; Pérez, Javier; Van Dooren, Paul. Block Kronecker linearizations of matrix polynomials and their backward errors. In: Numerische Mathematik, Vol. 140, no. 2, p. 373-426 (2018). doi:10.1007/s00211-018-0969-z.

8. Dopico, Froilán M.; Pérez, Javier; Van Dooren, Paul. Structured backward error analysis of linearized structured polynomial eigenvalue problems. In: Mathematics of Computation, Vol. 88, p. 1189-1228 (2018). doi:10.1090/mcom/3360.

9. Taylor, Adrien B.; Hendrickx, Julien; Glineur, François. Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization. In: Journal of Optimization Theory and Applications, Vol. 178, p. 455-476 (2018). doi:10.1007/s10957-018-1298-1.

10. Birpoutsoukis, Georgios; Csurcsia, Péter Zoltán; Schoukens, Johan. Efficient multidimensional regularization for Volterra series estimation. In: Mechanical Systems and Signal Processing, Vol. 104, p. 896-914 (2018). doi:10.1016/j.ymssp.2017.10.007.

Conference Papers

1. Dzyga, Michalina; Ferens, Robert; Gusev, Vladimir; Szykula, Marek. Attainable Values of Reset Thresholds. In: Leibniz International Proceedings in Informatics (LIPIcs). Vol. 83, no.40, p. 1-14 (2017). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik: Dagstuhl, Germany, 2017. doi:10.4230/LIPIcs.MFCS.2017.40.

2. Mauroy, Alexandre; Hendrickx, Julien. Spectral Identification of Networks with Inputs. In: Proceedings of the 56th IEEE Conference on Decision and Control (CDC 2017), 2017, p. 469-474.

3. Bazanella, Alexandre; Gevers, Michel; Hendrickx, Julien; Parraga, Adriane. Identifiability of dynamical networks: which nodes need be measured?. In: Proceedings of the 56th IEEE Conference on Decision and Control (CDC 2017), 2017, p. 5870-5875.

4. Taylor, Adrien; Hendrickx, Julien; Glineur, François. Performance Estimation Toolbox (PESTO): automated worst-case analysis of first-order optimization methods. In: Proceedings of the 56th IEEE Conference on Decision and Control (CDC 2017), 2017, p. 1278-1283. doi:10.1109/CDC.2017.8263832.

5. Abdelrahim, Mahmoud; Hendrickx, Julien; Heemels, Maurice. MAX-consensus in open multi-agent systems with gossip interactions. In: Proceedings of the 56th IEEE Conference on Decision and Control (CDC 2017), 2017, p. 4753-4758.

6. Hendrickx, Julien; Martin, Samuel. Open Multi-Agent Systems: Gossiping with Random Arrivals and Departures. In: Proceedings of the 56th IEEE Conference on Decision and Control (CDC 2017), 2017, p. 763-768.

7. Massart, Estelle M.; Chevallier, Sylvain. Inductive Means and Sequences Applied to Online Classification of EEG. In: Lecture Notes in Computer Science : Geometric Science of Information, springer,cham, 2017, 978-3-319-68445-1, p. 763-770. doi:10.1007/978-3-319-68445-1_88.

8. Peel, Leto. Graph-based semi-supervised learning for relational networks.

9. Gusev, Vladimir; Pribavkina, Elena V.. On Synchronizing Colorings and the Eigenvectors of Digraphs. In: Leibniz International Proceedings in Informatics (LIPIcs) (Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik), Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier: Dagstuhl, Germany, 2016, 978-3-95977-016-3, p. 48:1-48:14. doi:10.4230/LIPIcs.MFCS.2016.48.

10. Hendrickx, Julien; Martin, Samuel. Open Multi-Agent Systems : Gossiping with Deterministic Arrivals and Departures. doi:10.1109/ALLERTON.2016.7852357.