1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.PR2023★ 1 cited
Connectivity of random graphs after centrality-based vertex removal
Manish Pandey, Remco van der Hofstad
Centrality measures aim to indicate who is important in a network. Various notions of `being important' give rise to different centrality measures. In this paper, we study how impo…
math.PR2021
Length of stationary Gaussian excursions
Arijit Chakrabarty, Manish Pandey, Sukrit Chakraborty
Given that a stationary Gaussian process is above a high threshold, the length of time it spends before going below that threshold is studied. The asymptotic order is determined by…