I am currently a Schramm fellow at Microsoft Research New England and MIT Mathematics . In this academic year, I am working with Christian Borgs and Jennifer Chayes on graph limits and their applications on complex networks. I completed my PhD at Eindhoven University of Technology under the supervision of Remco van der Hofstad and Johan van Leeuwaarden. My PhD thesis is based on critical behavior of percolation on random graphs with given degree distribution. Here is a copy of my thesis.

Research Interest

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.

Schramm fellow

Microsoft Research New England

MIT Mathematics

s<lastname> (at) mit.edu

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.

Academic Background

    • Schramm postdoctoral fellow, MIT Mathematics, 2019--2021.
    • Schramm postdoctoral fellow, Microsoft research lab New England, 2018--2019.
    • Research intern, Microsoft research lab New England, 2017.
    • PhD in Mathematics (Cum Laude), Eindhoven University of Technology, 2014--2018.
    • Masters degree in Statistics, Indian Statistical Institute, 2012--2014.
    • Bachelors degree in Statistics, Ramakrishna Mission Residential College, Narendrapur, 2009--2012.

dblp, Google scholar, ORCID.