hidden - assigned and confirmed by the Study Dept.
Date of registration:
19.05.2023
Date of assignment:
01.06.2023
Confirmed by Study dept. on:
07.06.2023
Guidelines
The thesis consists of applying the Lanczos algorithm for the analysis of complex networks. In particular, it will explore its use for counting close walks by simple MatLab implementations.
References
- Benzi, Michele, and Paola Boito. "Quadrature rule-based bounds for functions of adjacency matrices." Linear Algebra and its Applications 433.3 (2010): 637-652.
- Estrada, Ernesto. The structure of complex networks: theory and applications. Oxford University Press, 2012.
- Golub, Gene H., and Gérard Meurant. Matrices, moments and quadrature with applications. Vol. 30. Princeton University Press, 2009.
Preliminary scope of work
Complex networks emerge from many applications, from social network analysis to city planning, to biotechnology. In the last years, Lanczos algorithm has been successfully used for complex network analysis, in particular, to determine the "most important" nodes in a network. The thesis will explore the use of this algorithm and its connection with counting the closed walks in a network.
Preliminary scope of work in English
Complex networks emerge from many applications, from social network analysis to city planning, to biotechnology. In the last years, Lanczos algorithm has been successfully used for complex network analysis, in particular, to determine the "most important" nodes in a network. The thesis will explore the use of this algorithm and its connection with counting the closed walks in a network.
- assigned and confirmed by the Study Dept.