Status:
+44 1865 273580
Research groups:
Address
University of Oxford
Andrew Wiles Building
Radcliffe Observatory Quarter
Woodstock Road
Oxford
OX2 6GG
Research interests:
My research interests lie in applying tools from linear algebra, matrix theory and dynamical systems to study networks and complex systems. In particular, my work involves the Laplacian matrix and its eigenvalues, graph effective resistances and graph embeddings. In my latest project I am looking at discrete curvature on graphs, based on the effective resistance.
I will be finishing my DPhil in June 2022 and am happy to hear about relevant postdoc opportunities.
If you're interested in networks, be sure to check out the weekly Networks Seminar! Past talks are now also on Youtube.
Further details:
Teaching:
B6.3 Integer Programming
B8.4 Information Theory
B8.5 Graph Theory
C5.4 Networks
Major / recent publications:
Clustering for epidemics on networks: a geometric approach, 2021 (link)(pdf)
B. Prasse, K. Devriendt, P. Van Mieghem
Effective resistance is more than distance: Laplacians, Simplices and the Schur complement, 2021 [submitted](pdf)
K. Devriendt
Nonlinear consensus on networks: equilibria, effective resistance and trees of motifs, 2021 (link)(pdf)
M. Homs-Dones, R. Lambiotte, K. Devriendt
Variance and covariance of distributions on graphs, 2021 [accepted](pdf)
K. Devriendt, S. Martin-Gutierrez, R. Lambiotte
Non-linear network dynamics with consensus-dissensus bifurcation, 2021 (link, pdf)
K. Devriendt, R. Lambiotte
Constructing Laplacian matrices with Soules vectors: inverse eigenvalue problem and applications, 2019 [preprint](pdf)
K. Devriendt, R. Lambiotte, P. Van Mieghem
Tighter spectral bounds for the cut size, based on Laplacian eigenvectors, 2019 (link, pdf)
K. Devriendt, P. Van Mieghem
The simplex geometry of graphs, 2019 (link, pdf)
K. Devriendt, P. Van Mieghem
Nodal vulnerability to targeted attacks in power grids, 2018 (link, pdf)
H. Cetinay, K. Devriendt, P. Van Mieghem
Unified mean-field framework for SIS epidemics on networks, based on graph partitioning and the isoperimetric inequality, 2017 (link, pdf)
K. Devriendt, P. Van Mieghem
Pseudoinverse of the Laplacian and best spreader node in a network, 2017 (link, pdf)
P. Van Mieghem, K. Devriendt, H. Cetinay