Arun Kadavankandy is currently a postdoctoral researcher at CentraleSupélec, working with Romain Couillet. He obtained his Ph.D. at Inria Sophia Antipolis in July 2017, on the topic of 'Spectral analysis of random graphs with application to clustering and sampling' under the supervision of Konstantin Avrachenkov, Inria Sophia Antipolis and Laura Cottatellucci, Eurecom. He was an invited researcher at Moscow Institute of Physics and Technology and Yandex, Moscow in March 2017. His tutorial titled 'Clustering and Classification on Graphs' was accepted for presentation at the IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, 2017. His research interests include graph-based machine learning, random graph analysis, random matrix theory and distributed algorithms.
For a complete list, check out my CV
Characterization of L1 -norm Statistic for Anomaly Detection in Erdos Renyi Graphs
Arun Kadavankandy, Laura Cottatellucci and Konstantin Avrachenkov
55th IEEE Conference on Decision and Control(CDC) 2016 [paper]
PageRank in undirected random graphs
K. Avrachenkov, Arun Kadavankandy, L. Prostomokova, and A. Raigorovski
12th Workshop on algorithms and models for the Web graph [paper]
Spectral properties of random matrices for stochastic block model
K. Avrachenkov, L. Cottatellucci, Arun Kadavankandy
WiOpt 2015, IIT Bombay. [paper]
Comparison of random walk based techniques for estimating network averages
Vivek S. Borkar, K. Avrachenkov, Arun Kadavankandy and Jithin K. Sreedharan
5th International Conference on Computational Social Networks (CSoNet) 2016
[paper]