User profiles for Shirshendu Chatterjee
Shirshendu ChatterjeeAssociate Professor, City College of New York, CUNY Verified email at ccny.cuny.edu Cited by 528 |
Contact processes on random graphs with power law degree distributions have critical value 0
S Chatterjee, R Durrett - 2009 - projecteuclid.org
If we consider the contact process with infection rate λ on a random graph on n vertices with
power law degree distributions, mean field calculations suggest that the critical value λ c of …
power law degree distributions, mean field calculations suggest that the critical value λ c of …
Targeting the pregnane X receptor using microbial metabolite mimicry
…, JY Cui, H Gu, JC March, S Chatterjee… - EMBO molecular …, 2020 - embopress.org
The human PXR (pregnane X receptor), a master regulator of drug metabolism, has essential
roles in intestinal homeostasis and abrogating inflammation. Existing PXR ligands have …
roles in intestinal homeostasis and abrogating inflammation. Existing PXR ligands have …
Spectral clustering for multiple sparse networks: I
S Bhattacharyya, S Chatterjee - arXiv preprint arXiv:1805.10594, 2018 - arxiv.org
Although much of the focus of statistical works on networks has been on static networks,
multiple networks are currently becoming more common among network data sets. Usually, a …
multiple networks are currently becoming more common among network data sets. Usually, a …
Bacterial swarmers enriched during intestinal stress ameliorate damage
Background and Aims Bacterial swarming, a collective movement on a surface, has rarely
been associated with human pathophysiology. This study aims to define a role for bacterial …
been associated with human pathophysiology. This study aims to define a role for bacterial …
Multiple Phase Transitions in Long‐Range First‐Passage Percolation on Square Lattices
S Chatterjee, P S. Dey - Communications on Pure and Applied …, 2016 - Wiley Online Library
We consider a model of long‐range first‐passage percolation on the d‐dimensional square
lattice ℤd in which any two distinct vertices x,y ∊ ℤ d are connected by an edge having …
lattice ℤd in which any two distinct vertices x,y ∊ ℤ d are connected by an edge having …
Jigsaw percolation: What social networks can collaboratively solve a puzzle?
We introduce a new kind of percolation on finite graphs called jigsaw percolation. This
model attempts to capture networks of people who innovate by merging ideas and who solve …
model attempts to capture networks of people who innovate by merging ideas and who solve …
General community detection with optimal recovery conditions for multi-relational sparse networks with dependent layers
S Bhattacharyya, S Chatterjee - arXiv preprint arXiv:2004.03480, 2020 - arxiv.org
Multilayer and multiplex networks are becoming common network data sets in recent times.
We consider the problem of identifying the common community structure for a special type of …
We consider the problem of identifying the common community structure for a special type of …
Subcritical connectivity and some exact tail exponents in high dimensional percolation
S Chatterjee, J Hanson, P Sosoe - Communications in Mathematical …, 2023 - Springer
In high dimensional percolation at parameter p < p c \documentclass[12pt]{minimal} \usepackage{amsmath}
\usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \…
\usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \…
Consistent detection and optimal localization of all detectable change points in piecewise stationary arbitrarily sparse network-sequences
S Bhattacharyya, S Chatterjee… - arXiv preprint arXiv …, 2020 - arxiv.org
We consider the offline change point detection and localization problem in the context of
piecewise stationary networks, where the observable is a finite sequence of networks. We …
piecewise stationary networks, where the observable is a finite sequence of networks. We …
[HTML][HTML] A first order phase transition in the threshold θ≥ 2 contact process on random r-regular graphs and r-trees
S Chatterjee, R Durrett - Stochastic Processes and their Applications, 2013 - Elsevier
We consider the discrete time threshold-θ contact process on a random r-regular graph. We
show that if θ≥2, r≥θ+2, ϵ 1 is small and p≥p 1 (ϵ 1 ), then starting from all vertices …
show that if θ≥2, r≥θ+2, ϵ 1 is small and p≥p 1 (ϵ 1 ), then starting from all vertices …