activity
20152025
most citedGlobal lower mass-bound for critical configuration models in the heavy-tailed regime

5 citations · 12 across the 5 of their papers we have counts for

collaborators

12 papers

math.PR2025

Geometry of critical discrete structures: long-range percolation on the hierarchical lattice and the discrete torus

Arghyadeep Chatterjee, Sourish Maniyar, Sanchayan Sen

Consider (a) balls of growing volumes in the -dimensional hierarchical lattice, and (b) the -dimensional discrete torus on vertices. Place edges…

math.PR2023

Scaling limits and universality: Critical percolation on weighted graphs converging to an graphon

Jnaneshwar Baslingker, Shankar Bhamidi, Nicolas Broutin +2

We develop a general universality technique for establishing metric scaling limits of critical random discrete structures exhibiting mean-field behavior that requires four ingredie…

math.PR2020★ 4 cited

Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes

Shankar Bhamidi, Sanchayan Sen

A well-known open problem on the behavior of optimal paths in random graphs in the strong disorder regime, formulated by statistical physicists, and supported by a large amount of…

math.PR2020★ 5 cited

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…

math.PR2019★ 3 cited

On breadth-first constructions of scaling limits of random graphs and random unicellular maps

Grégory Miermont, Sanchayan Sen

We give alternate constructions of (i) the scaling limit of the uniform connected graphs with given fixed surplus, and (ii) the continuum random unicellular map (CRUM) of a given g…

math.PR2018

Geometry of the minimal spanning tree of a random -regular graph

Louigi Addario-Berry, Sanchayan Sen

The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about…