1 citations · 2 across the 5 of their papers we have counts for
8 papers
Community detection using low-dimensional network embedding algorithms
Aman Barot, Shankar Bhamidi, Souvik Dhara
With the increasing relevance of large networks in important areas such as the study of contact networks for spread of disease, or social networks for their impact on geopolitics,…
Barely supercritical percolation on Poissonian scale-free networks
Souvik Dhara, Remco van der Hofstad
We study the giant component problem slightly above the critical regime for percolation on Poissonian random graphs in the scale-free regime, where the vertex weights and degrees h…
Multiscale genesis of a tiny giant for percolation on scale-free random graphs
Shankar Bhamidi, Souvik Dhara, Remco van der Hofstad
We study the critical behavior for percolation on inhomogeneous random networks on vertices, where the weights of the vertices follow a power-law distribution with exponent $τ\…
Critical percolation on scale-free random graphs: New universality class for the configuration model
Souvik Dhara, Remco van der Hofstad, Johan S. H. van Leeuwaarden
In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-…
A correction to Kallenberg's theorem for jointly exchangeable random measures
Christian Borgs, Jennifer T. Chayes, Souvik Dhara +1
Kallenberg (2005) provided a necessary and sufficient condition for the local finiteness of a jointly exchangeable random measure on . Here we note an additional condition…
Limits of Sparse Configuration Models and Beyond: Graphexes and Multi-Graphexes
Christian Borgs, Jennifer T. Chayes, Souvik Dhara +1
We investigate structural properties of large, sparse random graphs through the lens of "sampling convergence" (Borgs et. al. (2017)). Sampling convergence generalizes left converg…