Sushovan Majhi
Visiting Assistant Professor
George Washington University, D.C.
I am currently a visiting assistant professor of Data Science at GWU.
Prior to GWU, I was a postdoc researcher and MIDS lecturer at the University of California, Berkeley.
Welcome to my homepage. The site showcases my research and software projects, occasional tutorials, sporadic rants, and more.
Find my CV here.
What’s New
Education

Doctor of Philosophy in Mathematics
Tulane University, New Orleans, USA2020 
Master of Science in Mathematics
Tata Institute of Fundamental Research, Bangalore, India2012 
Bachelor of Science (Hons. in Mathematics)
Ramakrishna Mission Vidyamandira, Calcutta University, India2009
Research
My research primarily revolves around the interface of mathematics and computer science. More specifically, my research is motivated by theoretical problems arising in topological data analysis (TDA), computational and applied topology, and computational geometry. I am also interested in solving reallife problems using tools from algebraic topology and geometry. My research interest also extends to applying TDA to other fields of science, like statistical finance and dynamical systems.
Research Interests:
 Topological Data Analysis
 Computational Topology
 Applied Algebraic Topology
 Computational Geometry
 Pattern and Shape Matching
 Statistical Finance
To know more, visit my RESEARCH page.
Teaching
My teaching interests span a broad spectrum of fields—including foundations of data science, statistics, machine learning, computer science, topological data analysis. Here are some courses I have taught:
 Introduction to statistics (undergraduate, Tulane University)
 Statistics for data science (graduate, UC Berkeley)
 Topological data analysis (graduate, NIT Sikkim, India)
 Data mining (graduate, George Washington University)
 Computer science foundations (graduate, George Washington University)
 Algorithm design (graduate, George Washington University)
Software and Computing
I am a coding hobbyist. I enjoy solving online coding challenges. Although Java is my favorite programming language, I usually code in JavaScript, Python, and R. Some of them are listed here.
Shape Reconstruction
To complement my research, I implemented my topological reconstruction algorithm for planar metric graphs in this library. The library is written in JavaScript and made available to users as a webapp.
Invited Talks and Presentations
I had been a big fan of Beamer for quite some time. Who wouldn’t be when it comes to presenting slides full of math symbols? Although the math looked fancy and the audience was happy, the \LaTeXbased framework had also disappointed me quite often. I found the framework too restrictive to customize; my slides looked exactly like others’!
Features, that were lacking in Beamer during the time I broke up with it, were shining in Reveal JS. Since then, I have been using it, customizing it, and relishing it. Although, I prefer to edit the source code for my slides in Quarto and output them in Reveal JS format.
List of my talks and presentations:

Aug 1, 2023A Taste of Topological Data Analysis (TDA): Reconstruction of Shapes
ICFAI, Tripura
Links: [url]Abstract
Topological data analysis (TDA) is a growing field of study that helps address data analysis questions. TDA is deemed a better alternative to traditional statistical approaches when the data inherit a topological and geometric structure. Most of the modern technologies at our service rely on ‘geometric shapes’ in some way or the other. Be it the Google Maps showing you the fastest route to your destination or the 3D printer on your desk creating an exact replica of a relic—shapes are being repeatedly sampled, reconstructed, and compared by intelligent machines. In this talk, we will catch a glimpse of how some of the famous topological concepts—like persistent homology, VietorisRips and Cech complexes, Nerve Lemma, etc—lend themselves well to the reconstruction of shapes from a noisy sample. 
Sep 30, 2021A Taste of Topological Data Analysis (TDA): Reconstruction of Shapes
Hunter College, New York
Links: [url]Abstract
Topological data analysis (TDA) is a growing field of study that helps address data analysis questions. TDA is deemed a better alternative to traditional statistical approaches when the data inherit a topological and geometric structure. Most of the modern technologies at our service rely on ‘geometric shapes’ in some way or the other. Be it the Google Maps showing you the fastest route to your destination or the 3D printer on your desk creating an exact replica of a relic—shapes are being repeatedly sampled, reconstructed, and compared by intelligent machines. In this talk, we will catch a glimpse of how some of the famous topological concepts—like persistent homology, VietorisRips and Cech complexes, Nerve Lemma, etc—lend themselves well to the reconstruction of shapes from a noisy sample. 
Aug 8, 2019Shape Reconstruction
Tulane University
Links: [url]Abstract
Most of the modern technologies at our service rely on ‘shapes’ in some way or other. Be it the Google Maps showing you the fastest route to your destination eluding a crash or the 3D printer on your desk creating an exact replica of a relic; shapes are being repeatedly sampled, reconstructed, and compared by intelligent machines. With the advent of modern sampling technologies, shape reconstruction and comparison techniques have matured profoundly over the last decade. 
Dec 3, 2016Music, Machine, and Mathematics
Tulane University
Links: [pdf] 
Sep 8, 2015The Mathematical Mechanic
Graduate Colloquium, Tulane University
Links: [pdf] 
Sep 1, 2021Shape Comparison and GromovHausdorff Distance
Tulane University
Links: [url]Abstract
The GromovHausdorff distance between any two metric spaces was first introduced by M. Gromov in the context of Riemannian manifolds. This distance measure has recently received an increasing attention from researchers in the field of topological data analysis. In applications, shapes are modeled as abstract metric spaces, and the GromovHausdorff distance has been shown to provide a robust and natural framework for shape comparison. In this talk, we will introduce the notion and address the difficulties in computing the distance between two Euclidean pointclouds. In the light of our recent findings, we will also describe an O(n log n)time approximation algorithm for GromovHausdorff distance on the real line with an approximation factor of 5/4. 
Apr 16, 2016Computational Complexity
Graduate Colloquium, Tulane University
Links: [pdf]