48 citations · 161 across the 20 of their papers we have counts for
22 papers
Cascade Surviving Cores via Local Limits
Souvik Dhara, Manish Pandey, Leonard J. Schulman
We consider a general class of cascading processes on marked networks, in which vertices are iteratively deleted according to a local vertex property. Under marked local-weak conve…
Waning Immunity Fails to Restore a Positive Epidemic Threshold on Power-Law Networks
Zihao He, Souvik Dhara, Debankur Mukherjee
In a seminal work, Chatterjee and Durrett (2009) established that for the SIS epidemic process on random graphs with power-law degree distributions, the infection survives for an e…
The Power of Two Matrices in Spectral Algorithms for Community Recovery
Souvik Dhara, Julia Gaudio, Elchanan Mossel +1
Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the…
Spectral Algorithms Optimally Recover Planted Sub-structures
Souvik Dhara, Julia Gaudio, Elchanan Mossel +1
Spectral algorithms are an important building block in machine learning and graph algorithms. We are interested in studying when such algorithms can be applied directly to provide…
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 $τ\…
Spectral Recovery of Binary Censored Block Models
Souvik Dhara, Julia Gaudio, Elchanan Mossel +1
Community detection is the problem of identifying community structure in graphs. Often the graph is modeled as a sample from the Stochastic Block Model, in which each vertex belong…
On -to- norms of random matrices with nonnegative entries: Asymptotic normality and -bounds for the maximizer
Souvik Dhara, Debankur Mukherjee, Kavita Ramanan
For an matrix , the operator norm is defined as $$\|A_n\|_{r\to p}:= \sup_{\mathbf{x}\in\mathbb{R}^n:\|\mathbf{x} \|_r\leq 1 } \|A_n\mathbf{x} \|_p\quad\t…
Global lower mass-bound for critical configuration models in the heavy-tailed regime
Shankar Bhamidi, Souvik Dhara, Remco van der Hofstad +1
We establish the global lower mass-bound property for the largest connected components in the critical window for the configuration model when the degree distribution has an infini…
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…
Large deviation for uniform graphs with given degrees
Souvik Dhara, Subhabrata Sen
Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Pri…
Critical Percolation on Random Networks with Prescribed Degrees
Souvik Dhara
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cel…
Optimal Service Elasticity in Large-Scale Distributed Systems
Debankur Mukherjee, Souvik Dhara, Sem Borst +1
A fundamental challenge in large-scale cloud networks and data centers is to achieve highly efficient server utilization and limit energy consumption, while providing excellent use…
Universality for critical heavy-tailed network models: Metric structure of maximal components
Shankar Bhamidi, Souvik Dhara, Remco van der Hofstad +1
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed…
Heavy-tailed configuration models at criticality
Souvik Dhara, Remco van der Hofstad, Johan S. H. van Leeuwaarden +1
We study the critical behavior of the component sizes for the configuration model when the tail of the degree distribution of a randomly chosen vertex is a regularly-varying functi…
Corrected mean-field model for random sequential adsorption on random geometric graphs
Souvik Dhara, Johan S. H. van Leeuwaarden, Debankur Mukherjee
A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the -dimensional Euclidean…
Phase transitions of extremal cuts for the configuration model
Souvik Dhara, Debankur Mukherjee, Subhabrata Sen
The -section width and the Max-Cut for the configuration model are shown to exhibit phase transitions according to the values of certain parameters of the asymptotic degree dist…
Critical window for the configuration model: finite third moment degrees
Souvik Dhara, Remco van der Hofstad, Johan S. H. van Leeuwaarden +1
We investigate the component sizes of the critical configuration model, as well as the related problem of critical percolation on a supercritical configuration model. We show that,…
Generalized random sequential adsorption on Erdős-Rényi random graphs
Souvik Dhara, Johan S. H. van Leeuwaarden, Debankur Mukherjee
We investigate Random Sequential Adsorption (RSA) on a random graph via the following greedy algorithm: Order the vertices at random, and sequentially declare each vertex eithe…