I am currently a PhD student in the Department of Mathematics and Computer Science, Eindhoven University of Technology. My supervisors are Remco van der Hofstad and Johan S.H. van Leeuwaarden. Currently, I am affiliated to the NETWORKS program, supported by The Netherlands Organization for Scientific Research (NWO).
Broad interests: Random graphs, Graphons, Stochastic processes, Combinatorial probability.
Recent works/focus on: Graphon limits for sparse random graphs, Percolation on random graphs, Cut problems on random graphs, Large scale parallel server systems.
Doctoral Candidate (PhD)
Dept. of Math. and Comp. Sc.
Eindhoven University of Technology
P.O. Box 513, 5600MB, Eindhoven
s (dot) <lastname> (at) tue.nl
I am a mathematician specializing in probability theory. I have always been fascinated by problems that originate from some other field like computer science, physics, statistics where probability theory can yield key insight. Recently, my research interest lies in the intersection of probability theory and combinatorics with the primary aim to understand the interplay between the structural properties of networks and stochastic processes on them. More specifically, I am working on asymptotic (random) structures that describe random networks locally and globally.
Here is a recent copy of my CV.
– Research intern, Microsoft research lab New England, 2017.
– PhD in Mathematics, Eindhoven University of Technology, 2014--2018 (expected).
– Masters degree in Statistics, Indian Statistical Institute, 2012--2014.
– Bachelors degree in Statistics, Ramakrishna Mission Residential College, Narendrapur, 2009--2012.