◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Anirban Chatterjee

4 papers hereh-index 29 citations8 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author3

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • math.PR2
  • math.ST1
  • stat.ME1
same name
  • Anirban Chatterjee — 5 papers, h 2
  • Anirban Chatterjee — 1 paper, h 3
  • Anirban Chatterjee — 1 paper, h 1
  • Anirban Chatterjee — 1 paper, h 1
  • Anirban Chatterjee — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

collaborators

4 papers

math.PR2026

Scaling Limits for Ising Models on Inhomogeneous Random Graphs and Applications

Sanchayan Bhowal, Anirban Chatterjee, Somabha Mukherjee

In this paper, we derive quenched scaling limits for linear functionals and the empirical spin field of Ising models on inhomogeneous random graphs generated by a graphon (encompas…

stat.ME2026

Conditional Mean Independence and Global Sensitivity Analysis using Nearest Neighbor Graphs

Anirban Chatterjee, Ziang Niu, Bhaswar B. Bhattacharya

Quantifying how well a conditional mean function explains a response is central to many statistical tasks, such as model evaluation and feature screening. A basic nonparametric mea…

math.ST2026

Ising Models on Inhomogeneous Random Graphs: Inference, Local Asymptotic Minimaxity, and Limit of Experiments

Somabha Mukherjee, Sanchayan Bhowal, Anirban Chatterjee +1

In this paper, we develop an inferential framework with sharp asymptotic optimality guarantees for Ising models on inhomogeneous random graphs in the subcritical parameter regime.…

math.PR2026

Asymptotic Normality of Subgraph Counts in Sparse Inhomogeneous Random Graphs

Sayak Chatterjee, Anirban Chatterjee, Abhinav Chakraborty +1

In this paper, we derive the asymptotic distribution of the number of copies of a fixed graph H in a random graph Gn​ sampled from a sparse graphon model. Specifically, we prov…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.