Research
My research lies in applied probability and network science, with a particular focus on large random networks and interacting random systems. A recurring theme in my work is understanding how local structure shapes global behavior, including connectivity, cascades, centrality rankings, and temporal network motifs.
Research Interests
- Probability theory
- Stochastic processes
- Random graphs
- Large deviations
- Local convergence
- Associative memory models
Publications
-
Length of stationary Gaussian excursions
-
Connectivity of random graphs after centrality-based vertex removal
-
Are giants in random digraphs “almost” local?
-
Communication protocol for a satellite-swarm interferometer for low-frequency radio astronomy
-
Modelling active particle motion from fluorescence correlation spectroscopy data
Preprints
-
Bringing order to network centrality measures
Thesis
-
Centrality measures and connectivity properties in large networks
Expository Writing
-
Centrality Measures: Who Is the Most Important in a Network?
Ongoing Work
- Cascades in networks
- Centrality comparison curves
- Hopfield models in geometric random graphs
- Locality properties of centrality measures
- Large-deviation analysis of sparse many-body systems in motion
- Central limit theorem for temporal motif counts
Important Links
For research-related inquiries, collaborations, or seminar invitations.
m.pandey@math.au.dkCurriculum Vitae
Academic CV including publications, positions, teaching, and awards.
Download CVThesis
Ph.D. thesis on centrality measures and connectivity properties in large networks.
View thesisGitHub
Code repositories, personal website source, and related academic projects.
Visit GitHub⬅️ Back to Home