Sanchayan Sen

h-index: 9
Citations: 355
Publications: 33

About

Sanchayan Sen is a researcher at the Courant Institute of Mathematical Sciences. Focusing on network optimization and spectral graph theory, he has published seven papers between 2019 and 2023, including works on heavy-tailed configuration models, critical random graphs, and geometric properties of minimal spanning trees.

Research areas

Mathematics
Combinatorics
Geometry
Discrete mathematics
Physics

Publications (33)

Sorted by most cited.

Sort:

Critical window for the configuration model: finite third moment degrees
2017
View DOI
45 cites
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
2017
View DOI
40 cites
Continuum limit of critical inhomogeneous random graphs
2016
View DOI
39 cites
Heavy-tailed configuration models at criticality
2020
View DOI
33 cites
Minimal spanning trees and Stein’s method
2017
View DOI
32 cites
Universality for critical heavy-tailed network models: Metric structure of maximal components
2020
View DOI
24 cites
Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
2019
View DOI
15 cites
Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
2016
View DOI
9 cites
Geometry of the minimal spanning tree of a random 3-regular graph
2021
View DOI
8 cites
Minimal spanning trees and Stein's method
2013
View DOI
7 cites
Global lower mass-bound for critical configuration models in the heavy-tailed regime
2022
View DOI
6 cites
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
2015
View DOI
6 cites
Global lower mass-bound for critical configuration models in the heavy-tailed regime
2020
View DOI
5 cites
Geometry of the minimal spanning tree of a random $3$-regular graph
2018
View DOI
5 cites
A probabilistic approach to the leader problem in random graphs
2017
View DOI
5 cites
The speed of a biased walk on a Galton–Watson tree without leaves is monotonic with respect to progeny distributions for high values of bias
2015
View DOI
5 cites
Limiting Spectral Distribution of
2011
5 cites
On breadth‐first constructions of scaling limits of random graphs and random unicellular maps
2022
View DOI
4 cites
A probabilistic approach to the leader problem in random graphs
2020
View DOI
4 cites
Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
2020
View DOI
4 cites
On the largest component in the subcritical regime of the Bohman-Frieze process
2013
View DOI
4 cites
Finite Diagonal Random Matrices
2011
View DOI
4 cites
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
2020
View DOI
3 cites
On breadth-first constructions of scaling limits of random graphs and random unicellular maps
2019
View DOI
3 cites
Continuum limit of critical inhomogeneous random graphs
2014
View DOI
2 cites
Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
2024
View DOI
0 cites
A Security and Privacy Validation Methodology for E-Health Systems Using Cloud Storage
2024
View DOI
0 cites
Scaling limits and universality: Critical percolation on weighted graphs converging to an 𝐿³ graphon
2024
View DOI
0 cites
Scaling limits and universality: Critical percolation on weighted graphs converging to an $L^3$ graphon
2023
View DOI
0 cites
Critical random graphs and the differential equations technique
2017
View DOI
0 cites
Critical configuration models with infinite third-moment degrees
2016
0 cites
On the largest component in the subcritical regime of the Bohman-Frieze process
2016
View DOI
0 cites
Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős-Rényi random graph
2014
View DOI
0 cites