16 citations · 34 across the 10 of their papers we have counts for
10 papers
Tame sparse exponential random graphs
Suman Chakraborty, Remco van der Hofstad, Frank den Hollander
In this paper, we obtain a precise estimate of the probability that the sparse binomial random graph contains a large number of vertices in a triangle. The estimate of log of this…
Sparse random graphs with many triangles
Suman Chakraborty, Remco van der Hofstad, Frank den Hollander
In this paper we consider the Erdős-Rényi random graph in the sparse regime in the limit as the number of vertices tends to infinity. We are interested in what this graph looks…
A Central Limit Theorem for Diffusion in Sparse Random Graphs
Hamed Amini, Erhan Bayraktar, Suman Chakraborty
We consider bootstrap percolation and diffusion in sparse random graphs with fixed degrees, constructed by configuration model. Every node has two states: it is either active or in…
K-core in percolated dense graph sequences
Erhan Bayraktar, Suman Chakraborty, Xin Zhang
We determine the size of -core in a large class of dense graph sequences. Let be a sequence of undirected, -vertex graphs with edge weights $\{a^n_{i,j}\}_{i,j \in [n]}…
Graphon mean field systems
Erhan Bayraktar, Suman Chakraborty, Ruoyu Wu
We consider heterogeneously interacting diffusive particle systems and their large population limit. The interaction is of mean field type with weights characterized by an underlyi…
graph bootstrap percolation
Erhan Bayraktar, Suman Chakraborty
A graph percolates in the -bootstrap process if we can add all missing edges of in some order such that each edge creates a new copy of , where …
Site percolation on non-regular pseudo-random graphs
Suman Chakraborty
We study site percolation on a sequence of graphs on vertices where degree of each vertex is in the interval and the co-degree of every p…
Latent Association Mining in Binary Data
Carson Mosso, Kelly Bodwin, Suman Chakraborty +2
We consider the problem of identifying stable sets of mutually associated features in moderate or high-dimensional binary data. In this context we develop and investigate a method…
Weighted Exponential Random graph models: Scope and large network limits
Shankar Bhamidi, Suman Chakraborty, Skyler Cranmer +1
We study models of weighted exponential random graphs in the large network limit. These models have recently been proposed to model weighted network data arising from a host of app…
Large subgraphs in pseudo-random graphs
Anirban Basak, Shankar Bhamidi, Suman Chakraborty +1
We consider classes of pseudo-random graphs on vertices for which the degree of every vertex and the co-degree between every pair of vertices are in the intervals $(np - Cn^δ,n…