Pith. sign in

REVIEW 1 major objections 3 minor 138 references

A Design-Based Minimax Theory for Network Experiments

T0 review · 1 major / 3 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read One graph determines the minimax risk of network experiments.

desk verdict A real minimax benchmark for network experiments with a clean conflict-graph reduction and new lower bounds, but the q=2 upper-bound proof is incomplete as written and the main-text corollaries drop a needed +1. read the letter →

arxiv 2608.04909 v1 pith:MBNLG6QQ submitted 2026-08-05 math.ST stat.MEstat.TH

Vardis Kandiros , Christopher Harshaw , Fredrik Sävje This is my paper · ORCID
classification math.STstat.MEstat.TH MSC 62C2062K9905C69
keywords networkexperimentscausalinferenceunderinterferenceminimaxriskconflictgrapharbitraryneighborhooddesign-basedtreatmenteffectestimation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper asks how accurately a network experiment can estimate a causal effect when the interference network is known in advance and the researcher may choose any design and any estimator. It establishes that under arbitrary neighborhood interference, the minimax mean-squared error depends on the network and the effect only through the conflict graph $H$, whose vertices are the estimand-relevant exposures and whose edges connect pairs of exposures that no treatment vector can reveal together. The main result bounds this risk as $\max(1/|I(H)|,\sqrt{d^*(H)}/n) \lesssim R(G,\tau,q) \lesssim \min_S Q(S,H)/n$, where $I(H)$ is the independence number, $d^*(H)$ is the critical degree, and $Q(S,H)$ is a regularized induced-subgraph objective. When specialized to the direct treatment effect and the global average treatment effect, the bounds become explicit rates in terms of the network and its two-hop graph, and for regular graphs both bounds are tight.

What carries the argument

The central object is the conflict graph $H$, whose $2n$ vertices are the estimand-relevant potential outcomes and whose edges join two exposures that cannot be observed in the same treatment assignment. The engine of the reduction is the equivalence between treatment vectors and independent sets of $H$: every realized treatment reveals an independent set of exposures, and every maximal independent set is exactly realizable by some treatment vector. This turns the experimental design problem into a minimax problem over measures on maximal independent sets. The lower bounds adapt Le Cam's method with design-adaptive mixtures of potential outcome functions, and the upper bounds are achieved by the Conflict Graph Design, an importance-ordered rule for resolving exposure conflicts, refined by deleting a small set of conflicted vertices to trade bias against variance.

What would settle it

Compute the exact minimax risk by brute force on a small network, such as a five-vertex star with the direct treatment effect at $q=2$: the paper's bounds predict $\Theta(1/n)$, so an exact value that is not between the stated lower and upper bounds would refute the characterization.

Watch

Extended reading notes

Core claim

The paper's central claim is that the fundamental statistical limit of a network experiment is a graph-theoretic quantity: for every contrastive estimand and moment restriction $q$, the minimax risk $R(G,\tau,q)$ equals $f_q(H)$, where $H$ is the conflict graph and $f_q$ is defined through a minimax problem over probability distributions on maximal independent sets of $H$. The paper does not identify $f_q$ in closed form, but it proves two-sided bounds that capture the minimax rate: independent-set structure gives the global lower bound, the critical degree gives the local lower bound, and a generalized Conflict Graph Design with a bias-variance tradeoff gives the upper bound. For the direct treatment effect the conflict graph is essentially the original network, while for the global average treatment effect it is close to the two-hop network, which is why the former is provably easier to estimate.

Load-bearing premise

The entire reduction rests on the assumption that outcomes depend on treatment only through each unit's exposure---the treatment pattern in its extended neighborhood---and that every maximal set of pairwise compatible exposures can be realized by some unconstrained treatment vector; if outcomes respond to more distant treatments, or if the design class forbids some treatment vectors, the conflict graph may not capture the minimax risk.

Editorial extensions

If this is right

  • No design or estimator can achieve worst-case mean-squared error below $\max(1/|I(H)|,\sqrt{d^*(H)}/n)$, so any procedure reaching the upper bound is minimax rate-optimal on that network and effect.
  • For the direct treatment effect, the minimax rate is between $\max(1/|I(G)|,\sqrt{d_{\mathrm{avg}}(G)}/n)$ and $\lambda(G)/n$; for the global average treatment effect it is between $\sqrt{d_{\mathrm{avg}}(G^2)}/n$ and $\lambda(G^2)/n$, so on random regular graphs the DTE is strictly easier than the GATE.
  • Stronger moment restrictions make the rate smaller, and on degree-heterogeneous conflict graphs the optimal procedure may delete a few central exposures: on a star at $q=2$, removing the center changes the rate from $n^{-1/2}$ to $n^{-1}$.
  • A polynomial-time approximation of the optimal deletion set achieves the upper bound up to a $\log^{2-2/q} n$ factor, so the benchmark is computable in practice.
  • On a uniformly random $d$-regular graph, the minimax rate for the direct effect is $d/n$ up to logarithmic factors, giving an average-case benchmark for network experiments.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the conflict-graph characterization extends to other exposure-mapping models, the same recipe gives a plug-in diagnostic: build $H$, compute its independence number, critical degree, and spectral objective, and read off whether a proposed design is near the fundamental limit.
  • The conjectured NP-hardness of computing $f_q(H)$ implies that exact minimax benchmarking may be infeasible in general; a natural next step, suggested but not developed in the paper, is a computationally efficient minimax rate that restricts procedures to polynomial time.
  • The DTE-GATE gap suggests an interpolation: estimands whose conflict graphs sit between $G$ and $G^2$, such as $k$-hop spillover effects, should have minimax rates interpolating between the two rates on regular graphs.
  • The bias-variance deletion idea implies that on heavy-tailed networks, deliberately ignoring the most conflicted exposures can recover parametric rates despite high-degree hubs; this could be tested by simulating the design on observed degree distributions.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 3 minor

Summary. This paper develops a design-based minimax theory for estimating contrastive causal effects under arbitrary neighborhood interference on a known network. The central object is a conflict graph whose vertices are the estimand-relevant exposures and whose edges join exposures that cannot be observed in a single intervention. The main structural result (Proposition 2.2) shows that the minimax risk depends on the network and effect only through this conflict graph, via a reduction to a minimax problem over maximal independent sets. The paper then derives lower bounds using Le Cam's method (in terms of large induced independent sets and a critical degree) and upper bounds using a generalized Conflict Graph Design and a bias-variance tradeoff governed by a regularized induced-subgraph objective. Applications to the direct treatment effect and the global average treatment effect yield bounds in terms of the original graph and its two-hop graph, respectively. Tightness results for d-regular and random d-regular graphs are given, and conjectures about computational hardness are discussed.

Significance. If the results hold, this is a substantial contribution to the design-based network experiment literature. It provides the first general lower bounds on the minimax risk for network experiments, offering a benchmark relative to which existing procedures can be evaluated. The conflict graph characterization is elegant and appears to be a genuine reduction, not a restatement of the conclusion; the appendix reductions are detailed and the framework-level arguments appear sound. The upper bounds improve on prior work for q>2, and the bias-variance tradeoff yields better rates under degree heterogeneity. The paper is technically careful, with explicit constants and structured appendix proofs. The main reservation is a gap in the proof of the upper bound at q=2, which is central but likely repairable.

major comments (1)
  1. [Section C.1, Lemmas C.7 and C.9; Theorem 4.1] The proofs of Lemmas C.7 and C.9 apply Hölder's inequality with conjugate exponent q/(q−2), which is undefined at q=2. The displayed inequality in Lemma C.7, ∑ x_i^2/p_i ≤ (∑ x_i^q)^{2/q} (∑ p_i^{-q/(q-2)})^{(q-2)/q}, degenerates at q=2 and is false when the p_i are unequal. Since Theorem 4.1 is stated for all q≥2 and the proof of the theorem does not supply a separate argument for q=2, the upper-bound half of the central claim is not established as written for q=2. This gap propagates to Theorem 4.2 and Proposition 4.3, which inherit Theorem 4.1. The paper should either add a self-contained q=2 argument (for instance, the spectral argument used in Kandiros et al., 2024) or explicitly restrict the formal proof to q>2 and note that the q=2 case follows from that cited result.
minor comments (3)
  1. [Throughout, e.g., Section A.5 and Section C.3] There are several typos: "casual" should be "causal" in the proof sketch of Theorem 3.2, "constrastive" should be "contrastive" in the proof of Proposition 2.2, and "MMSE" should be "MSE" in the proof of Proposition 4.3.
  2. [Section 3.2, proof sketch of Theorem 3.2] The proof sketch considers a simplified estimand written as a sum of the two potential outcomes rather than a contrast; this is helpful for intuition but should be labeled clearly as a non-contrastive surrogate, since the formal statement concerns contrastive effects.
  3. [Appendix D.2, proof of Corollary D.2] The final sentence says the bound "yields the lower bound in the statement," but the derivation establishes the upper bound on the minimax risk; this should be corrected.

Circularity Check

0 steps flagged · score 1.0 of 10

Central minimax characterization and bounds are derived from first principles; self-citations are contextual and not load-bearing.

full rationale

The paper's central characterization (Proposition 2.2) is proved by explicit reductions in Appendix A.5: Lemmas A.8, A.9, and A.10 translate the network experiment into equivalent minimax problems over independent and maximal independent sets of the conflict graph, with Proposition A.6 providing an injective realization of maximal independent sets. No step defines the claimed risk in terms of itself; the function f_q is constructed as the risk of an explicit independent-set problem and then shown to equal R(G, tau, q). The lower bounds are likewise self-contained, built on a design-based Le Cam reduction with explicitly constructed mixture distributions over outcome functions. The upper bounds are obtained from an explicit Conflict Graph Design and modified Horvitz-Thompson estimator whose variance is analyzed in Lemmas C.5-C.9. Citations to the authors' prior work provide context and a q=2 comparison, but the derivations in the appendix do not import those results as premises. The q=2 Hölder-exponent issue noted in review is a proof gap rather than a circularity: it does not make any claimed output equal to an input by construction. Overall, no circular step is present; the manuscript's core claims are derived from first principles.

Assumptions & free parameters 1 free parameters · 7 assumptions · 1 invented entities

The central claim rests on standard domain assumptions (ANI, unrestricted binary designs, q-th moment restrictions) plus a chain of reductions to the conflict graph. The free parameters are analytical proof constants whose values do not affect the rates. The paper introduces no speculative physical or ontological entities; the conflict graph is a fully specified combinatorial object.

free parameters (1)
  • Analytical constants in proofs and designs = C = 2 (CGD), delta <= 0.026, d_TV threshold 7/8, c_sum >= 1.36e-3, lower-bound prefactors 1.05e-5 and 6.6e-7
    Hand-chosen to satisfy explicit inequalities in Appendices B and C. They are proof constants, not fitted to data, and the claimed rates are invariant to their exact values, but they are parameters the derivations are tuned around.
assumptions (7)
  • domain assumption Arbitrary neighborhood interference: each unit's outcome depends on the treatment vector only through the set of treated units in its extended neighborhood (Definition 1).
    Makes potential outcomes exposure-indexed, which is what allows the conflict graph on exposures to summarize the experiment. Entered at Definition 1 and used throughout, e.g., in Proposition A.6.
  • domain assumption Unrestricted experimental designs: the researcher may implement any probability distribution over {0,1}^n, including the maximal-independent-set-realizing interventions of Proposition A.6.
    The minimax optimum is taken over all designs; the reduction chain (Lemmas A.8 through A.10) and the upper-bound designs use interventions that realize arbitrary maximal independent sets. Restricted design classes would change the rates.
  • domain assumption Moment-restricted outcome class M(G,tau,q): q-th moments (q >= 2) of estimand-relevant potential outcomes bounded, irrelevant outcomes free; worst case is over this class.
    The rates interpolate between q = 2 and q = infinity, and the lower-bound mixtures (Definition 3, Appendix B) concentrate outcome mass on few exposures exactly as the q-norm allows.
  • standard math Le Cam's method and the total-variation testing bound (Proposition 3.1).
    Classical minimax technique; the design-based adaptation is proved in Appendix B.1 and is the engine of both lower bounds.
  • standard math Spectral and norm inequalities: average degree of an induced subgraph is at most its largest eigenvalue; Holder, Jensen, and elementary product/ratio inequalities used in Lemma B.4 and Lemmas C.1, C.7 through C.9.
    Used in the importance-ordering lemma and the variance bounds for the Conflict Graph Design.
  • standard math External approximation algorithms for Partial Vertex Cover (Gandhi et al. 2004, 2-approximation) and Partial Eigenvalue Cover (Saha et al. 2015, O(log n)-approximation with spectral slack).
    Load-bearing only for Proposition 4.3 (polynomial-time log-factor-optimal design).
  • standard math External results on random regular graphs and finite geometry: independence number of random d-regular graphs (Cooper et al. 2002; Frieze and Luczak 1992) and existence and structure of generalized quadrangles (Tits 1959; Payne and Thas 2009).
    Load-bearing only for the tightness results in Section 5 (Corollaries 5.3, 5.4 and Proposition 5.2).
invented entities (1)
  • Conflict graph H: vertices are estimand-relevant exposures {(e_{i,1}, e_{i,0})}, edges between exposures that cannot be observed under any single intervention
    purpose: Encodes the unobservability structure of potential outcomes; the paper proves the minimax risk is exactly a function of H and bounds it via H's independence number, critical degree, and spectrum
    A definitional construction from (G, tau) with all properties derived in the paper; it is the object of study rather than a postulated entity, so no out-of-paper falsifiable handle is claimed or needed.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Design-Based Minimax Theory for Network Experiments." pith.science (2026). https://pith.science/paper/MBNLG6QQ

@misc{pith2026260804909,
  author       = {Pith},
  title        = {Pith review of: A Design-Based Minimax Theory for Network Experiments},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/MBNLG6QQ}},
  note         = {Machine review of arXiv:2608.04909}
}
read the original abstract

Network experiments are used throughout the social and medical sciences to investigate causal effects under the presence of interference. While a large body of work has developed improved statistical procedures, the fundamental limits of statistical estimation in these settings is less well understood. In this paper, we develop and investigate a design-based theory of minimax risk for network experiments under an arbitrary neighborhood interference model. Our notion of minimax risk describes the optimal precision among all statistical procedures for investigating a particular causal effect on the observed interference network. We show that the minimax risk is a function of the corresponding conflict graph, which captures inherent unobservability of estimand-relevant potential outcomes given the observed interference network. Our main contribution is a series of upper and lower bounds on the minimax rate in terms of local and global connectivity properties of the conflict graph. To illustrate their utility, we apply these general results to obtain minimax analyses for two commonly studied effects: the direct treatment effect and global average treatment effect.

Figures

Figures reproduced from arXiv: 2608.04909 by the authors.

Figure 1
Figure 1. An illustration of the relevant exposures that define the global and direct effects. Red and blue correspond to treated and untreated units. Definition 1. The arbitrary neighborhood interference model M(G) contains all functions y : Ω → R n satisfying the following condition: yi(z) = yi(z ′ ) for all subjects i ∈ [n] and interventions z, z′ ∈ Ω with zj = z ′ j for all j ∈ Ne(i). The ANI model is an example of an exp… view at source ↗
Figure 2
Figure 2. An illustration of a network G and conflict graphs for the DTE and GATE. there will be a conflict between ei,1 and ei,0 because a subject cannot be treated and untreated under any intervention. Thus, the conflict graph H is simply a matching of the 2n exposures. • Direct Treatment Effect: Recall that ei,1 is the exposure that subject i is treated and all of its neighbors are untreated while ei,0 is the exposure that… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

138 extracted references · 36 canonical work pages

  1. [1]

    The Twelfth International Conference on Learning Representations , year=

    Independent-Set Design of Experiments for Estimating Treatment and Spillover Effects under Network Interference , author=. The Twelfth International Conference on Learning Representations , year=

  2. [2]

    Biometrika , volume =

    Basse, Guillaume W and Airoldi, Edoardo M , title =. Biometrika , volume =. 2018 , month =

    2018

  3. [3]

    Management Science , volume =

    Candogan, Ozan and Chen, Chen and Niazadeh, Rad , title =. Management Science , volume =. 2024 , doi =

    2024

  4. [4]

    Low-order outcomes and clustered designs: combining design and analysis for causal inference under network interference , year =

    Matthew Eichhorn and Samir Khan and Johan Ugander and Christina. Low-order outcomes and clustered designs: combining design and analysis for causal inference under network interference , year =. 2405.07979 , eprintclass =

    arXiv

  5. [5]

    Basse and Edoardo M

    Guillaume W. Basse and Edoardo M. Airoldi , title =. Sociological Methodology , number =. 2018 , doi =

    2018

  6. [6]

    The Annals of Statistics , number =

    Chien-Fu Wu , title =. The Annals of Statistics , number =. 1981 , doi =

    1981

  7. [7]

    Management Science , volume =

    Bojinov, Iavor and Simchi-Levi, David and Zhao, Jinglong , title =. Management Science , volume =. 2023 , doi =

    2023

  8. [8]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume =

    Kallus, Nathan , title =. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume =. 2018 , doi =

    2018

Show all 138 references
  1. [9]

    The Annals of Statistics , number =

    Yuchen Hu and Stefan Wager , title =. The Annals of Statistics , number =. 2023 , doi =

    2023

  2. [10]

    Journal of Causal Inference , doi =

    Exploiting neighborhood interference with low-order interactions under unit randomized design , author =. Journal of Causal Inference , doi =

  3. [11]

    Aislinn and McIntosh, Craig and Özler, Berk , title =

    Baird, Sarah and Bohren, J. Aislinn and McIntosh, Craig and Özler, Berk , title =. The Review of Economics and Statistics , volume =. 2018 , month =

    2018

  4. [12]

    Leung , title =

    Michael P. Leung , title =. The Annals of Statistics , number =. 2022 , doi =

    2022

  5. [13]

    Airoldi and Fabrizia Mealli , title =

    Laura Forastiere and Edoardo M. Airoldi and Fabrizia Mealli , title =. Journal of the American Statistical Association , volume =. 2021 , publisher =

    2021

  6. [14]

    , title =

    Stone, Charles J. , title =. The Annals of Statistics , year =

  7. [15]

    Farrell, R. H. , title =. The Annals of Mathematical Statistics , year =

  8. [16]

    The Annals of Statistics , year =

    Yang, Yuhong and Barron, Andrew , title =. The Annals of Statistics , year =

  9. [17]

    and Johnstone, Iain M

    Donoho, David L. and Johnstone, Iain M. , title =. Probability Theory and Related Fields , year =

  10. [18]

    and Yu, Bin , title =

    Raskutti, Garvesh and Wainwright, Martin J. and Yu, Bin , title =. IEEE Transactions on Information Theory , year =

  11. [19]

    and Zhou, Harrison H

    Zhang, Anderson Y. and Zhou, Harrison H. , title =. The Annals of Statistics , year =

  12. [20]

    Tony and Zhang, Cun-Hui and Zhou, Harrison H

    Cai, T. Tony and Zhang, Cun-Hui and Zhou, Harrison H. , title =. The Annals of Statistics , year =

  13. [21]

    Ogburn and Oleg Sofrygin and Iván Díaz and Mark J

    Elizabeth L. Ogburn and Oleg Sofrygin and Iván Díaz and Mark J. van der Laan , title =. Journal of the American Statistical Association , volume =. 2024 , publisher =

    2024

  14. [22]

    Proceedings of the 30th International Conference on Machine Learning , pages =

    Estimation of Causal Peer Influence Effects , author =. Proceedings of the 30th International Conference on Machine Learning , pages =. 2013 , editor =

    2013

  15. [23]

    Journal of the American Statistical Association , volume =

    Michael E Sobel , title =. Journal of the American Statistical Association , volume =. 2006 , doi =

    2006

  16. [24]

    On the Application of Probability Theory to Agricultural Experiments

    Neyman, Jerzy , journal =. On the Application of Probability Theory to Agricultural Experiments. 1923 , note =

    1923

  17. [25]

    2020 , note =

    Zahra Fatemi and Elena Zheleva , title =. 2020 , note =

    2020

  18. [26]

    Airoldi , title =

    Vishesh Karwa and Edoardo M. Airoldi , title =. 2018 , eprinttype =. 1810.08259v1 , eprintclass =

    2018 arXiv

  19. [27]

    2026 , eprint=

    Causal clustering: design of cluster experiments under network interference , author=. 2026 , eprint=

    2026

  20. [28]

    , title =

    Sinclair, Betsy and McConnell, Margaret and Green, Donald P. , title =. American Journal of Political Science , volume =

  21. [29]

    Aronow , title =

    Elizabeth Levy Paluck and Hana Shepherd and P.M. Aronow , title =. 2016 , journal =

    2016

  22. [30]

    Journal of the European Economic Association , volume =

    Blattman, Christopher and Green, Donald P and Ortega, Daniel and Tobón, Santiago , title =. Journal of the European Economic Association , volume =

  23. [31]

    The Annals of Applied Statistics , volume=

    Estimating average causal effects under general interference, with application to a social network experiment , author=. The Annals of Applied Statistics , volume=. 2017 , publisher=. doi:10.1214/16-AOAS1005 , url=

    2017 doi

  24. [32]

    arXiv preprint arXiv:2411.10908 , year=

    The Conflict Graph Design: Estimating causal effects under arbitrary neighborhood interference , author=. arXiv preprint arXiv:2411.10908 , year=

  25. [33]

    Combinatorics, Probability and Computing , volume=

    Random regular graphs of non-constant degree: Independence and chromatic number , author=. Combinatorics, Probability and Computing , volume=. 2002 , publisher=

    2002

  26. [34]

    The Annals of Applied Statistics , pages=

    Agnostic notes on regression adjustments to experimental data: Reexamining Freedman's critique , author=. The Annals of Applied Statistics , pages=. 2013 , publisher=

    2013

  27. [35]

    1985 , publisher=

    Mathematical theory of statistics: statistical experiments and asymptotic decision theory , author=. 1985 , publisher=

    1985

  28. [36]

    arXiv preprint arXiv:1902.05616 , year=

    Dualizing Le Cam's method for functional estimation, with applications to estimating the unseens , author=. arXiv preprint arXiv:1902.05616 , year=

    1902 arXiv

  29. [37]

    Lecture Notes for ECE598YW (UIUC) , volume=

    Lecture notes on information-theoretic methods for high-dimensional statistics , author=. Lecture Notes for ECE598YW (UIUC) , volume=

  30. [38]

    Journal of Algorithms , volume=

    Approximation algorithms for partial covering problems , author=. Journal of Algorithms , volume=. 2004 , publisher=

    2004

  31. [39]

    Proceedings of the 2015 SIAM International Conference on Data Mining , pages=

    Approximation algorithms for reducing the spectral radius to control epidemic spread , author=. Proceedings of the 2015 SIAM International Conference on Data Mining , pages=. 2015 , organization=

    2015

  32. [40]

    Journal of Combinatorial Theory, Series B , volume=

    On the independence and chromatic numbers of random regular graphs , author=. Journal of Combinatorial Theory, Series B , volume=. 1992 , publisher=

    1992

  33. [41]

    arXiv preprint arXiv:1605.00000 , year=

    Maximum independent sets on random regular graphs , author=. arXiv preprint arXiv:1605.00000 , year=

  34. [42]

    Random Structures & Algorithms , volume=

    Random regular graphs of high degree , author=. Random Structures & Algorithms , volume=. 2001 , publisher=

    2001

  35. [43]

    2009 , publisher=

    Finite generalized quadrangles , author=. 2009 , publisher=

    2009

  36. [44]

    Sur la trialit

    Tits, Jacques , journal=. Sur la trialit

  37. [45]

    , author=

    Estimating causal effects of treatments in randomized and nonrandomized studies. , author=. Journal of educational Psychology , volume=. 1974 , publisher=

    1974

  38. [46]

    Journal of the American statistical Association , volume=

    Statistics and causal inference , author=. Journal of the American statistical Association , volume=. 1986 , publisher=

    1986

  39. [47]

    The Econometrics Journal , volume=

    Identification of treatment response with social interactions , author=. The Econometrics Journal , volume=. 2013 , publisher=

    2013

  40. [48]

    2015 , publisher=

    Causal inference in statistics, social, and biomedical sciences , author=. 2015 , publisher=

    2015

  41. [49]

    2010 , publisher=

    Causal inference , author=. 2010 , publisher=

    2010

  42. [50]

    2024 , publisher=

    A first course in causal inference , author=. 2024 , publisher=

    2024

  43. [51]

    URL https://web

    Causal inference: A statistical learning approach , author=. URL https://web. stanford. edu/swager/causal\_inf\_book. pdf , year=

  44. [52]

    Advances in Applied Mathematics , volume=

    On regression adjustments to experimental data , author=. Advances in Applied Mathematics , volume=. 2008 , publisher=

    2008

  45. [53]

    On regression adjustments in experiments with several treatments , author=

  46. [54]

    , author=

    Justifying the use and increasing the power of at test for a randomized experiment with a convenience sample. , author=. Psychological methods , volume=. 1999 , publisher=

    1999

  47. [55]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Rerandomization and regression adjustment , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2020 , publisher=

    2020

  48. [56]

    Biometrika , volume=

    Regression adjustment in completely randomized experiments with a diverging number of covariates , author=. Biometrika , volume=. 2021 , publisher=

    2021

  49. [57]

    Rerandomization to improve covariate balance in experiments , author=

  50. [58]

    Journal of Causal Inference , volume=

    A class of unbiased estimators of the average treatment effect in randomized experiments , author=. Journal of Causal Inference , volume=. 2013 , publisher=

    2013

  51. [59]

    Sharp bounds on the variance in randomized experiments , author=

  52. [60]

    2018 , publisher=

    Double/debiased machine learning for treatment and structural parameters , author=. 2018 , publisher=

    2018

  53. [61]

    2006 , publisher=

    Targeted maximum likelihood learning , author=. 2006 , publisher=

    2006

  54. [62]

    2011 , publisher=

    Targeted learning: causal inference for observational and experimental data , author=. 2011 , publisher=

    2011

  55. [63]

    1993 , publisher=

    Efficient and adaptive estimation for semiparametric models , author=. 1993 , publisher=

    1993

  56. [64]

    2003 , publisher=

    Unified methods for censored longitudinal data and causality , author=. 2003 , publisher=

    2003

  57. [65]

    2006 , publisher=

    Semiparametric theory and missing data , author=. 2006 , publisher=

    2006

  58. [66]

    Probability and statistics: essays in honor of David A

    Higher order influence functions and minimax estimation of nonlinear functionals , author=. Probability and statistics: essays in honor of David A. Freedman , volume=. 2008 , publisher=

    2008

  59. [67]

    Electronic journal of statistics , volume=

    Semiparametric minimax rates , author=. Electronic journal of statistics , volume=

  60. [68]

    Annals of statistics , volume=

    Minimax rates for heterogeneous causal effect estimation , author=. Annals of statistics , volume=

  61. [69]

    Electronic Journal of Statistics , volume=

    Towards optimal doubly robust estimation of heterogeneous causal effects , author=. Electronic Journal of Statistics , volume=. 2023 , publisher=

    2023

  62. [70]

    Biometrika , volume=

    Characterization of parameters with a mixed bias property , author=. Biometrika , volume=. 2021 , publisher=

    2021

  63. [71]

    The Annals of Statistics , volume=

    Minimax estimation of a functional on a structured high-dimensional model , author=. The Annals of Statistics , volume=. 2017 , publisher=

    2017

  64. [72]

    The Annals of Statistics , volume=

    Orthogonal statistical learning , author=. The Annals of Statistics , volume=. 2023 , publisher=

    2023

  65. [73]

    The Annals of statistics , pages=

    Bayesian inference for causal effects: The role of randomization , author=. The Annals of statistics , pages=. 1978 , publisher=

    1978

  66. [74]

    2009 , publisher=

    Introduction to Nonparametric Estimation , author=. 2009 , publisher=

    2009

  67. [75]

    2000 , publisher=

    Asymptotic statistics , author=. 2000 , publisher=

    2000

  68. [76]

    The Annals of Statistics , pages=

    Estimation of integral functionals of a density , author=. The Annals of Statistics , pages=. 1995 , publisher=

    1995

  69. [77]

    Festschrift for Lucien Le Cam: research papers in probability and statistics , pages=

    Assouad, fano, and le cam , author=. Festschrift for Lucien Le Cam: research papers in probability and statistics , pages=. 1997 , publisher=

    1997

  70. [78]

    arXiv preprint arXiv:2311.10076 , year=

    A decorrelation method for general regression adjustment in randomized experiments , author=. arXiv preprint arXiv:2311.10076 , year=

    arXiv

  71. [79]

    Statistics and probability: essays in honor of CR Rao

    Minimax estimation in simple random sampling , author=. Statistics and probability: essays in honor of CR Rao. North-Holland Publishing Company , pages=

  72. [80]

    The Annals of Statistics , volume=

    A Minimax Property of the Sample Mean in Finite Populations , author=. The Annals of Statistics , volume=. 1981 , publisher=

    1981

  73. [81]

    The Annals of Statistics , volume=

    The best strategy for estimating the mean of a finite population , author=. The Annals of Statistics , volume=. 1979 , publisher=

    1979

  74. [82]

    The Annals of Mathematical Statistics , pages=

    Bayes and minimax procedures in sampling from finite and infinite populations--I , author=. The Annals of Mathematical Statistics , pages=. 1959 , publisher=

    1959

  75. [83]

    Some decision-theoretic aspects of sampling , author=

  76. [84]

    1979 , publisher=

    Theory of games and statistical decisions , author=. 1979 , publisher=

    1979

  77. [85]

    2012 , publisher=

    Minimax solutions in sampling from finite populations , author=. 2012 , publisher=

    2012

  78. [86]

    Dicussion Paper , pages=

    Minimax strategies and asymptotical minimax strategies in survey sampling , author=. Dicussion Paper , pages=

  79. [87]

    Journal of the Royal Statistical Society , volume=

    On the Two Different Aspects of the Representative Method: The Method of Stratified Sampling and the Method of Purposive Selection , author=. Journal of the Royal Statistical Society , volume=. 1934 , publisher=

    1934

  80. [88]

    1977 , publisher=

    Sampling Techniques , author=. 1977 , publisher=

    1977

  81. [89]

    The Annals of Mathematical Statistics , volume=

    Finite Population Sampling--On Labels in Estimation , author=. The Annals of Mathematical Statistics , volume=. 1970 , publisher=

    1970

  82. [90]

    1977 , publisher=

    Foundations of inference in survey sampling , author=. 1977 , publisher=

    1977

  83. [91]

    2009 , booktitle =

    Chapter 41 - Some Decision-Theoretic Aspects of Finite Population Sampling , editor =. 2009 , booktitle =. doi:https://doi.org/10.1016/S0169-7161(09)00241-7 , url =

    2009 doi

  84. [92]

    Journal of the american statistical association , volume=

    Toward causal inference with interference , author=. Journal of the american statistical association , volume=. 2008 , publisher=

    2008

  85. [93]

    The review of economic studies , volume=

    Identification of endogenous social effects: The reflection problem , author=. The review of economic studies , volume=. 1993 , publisher=

    1993

  86. [94]

    Journal of econometrics , volume=

    Identification of peer effects through social networks , author=. Journal of econometrics , volume=. 2009 , publisher=

    2009

  87. [95]

    Statistical methods in medical research , volume=

    On causal inference in the presence of interference , author=. Statistical methods in medical research , volume=. 2012 , publisher=

    2012

  88. [96]

    Journal of the american statistical association , volume=

    Large sample randomization inference of causal effects in the presence of interference , author=. Journal of the american statistical association , volume=. 2014 , publisher=

    2014

  89. [97]

    Political Analysis , volume=

    Reasoning about interference between units: A general framework , author=. Political Analysis , volume=. 2013 , publisher=

    2013

  90. [98]

    2013 , series =

    Ugander, Johan and Karrer, Brian and Backstrom, Lars and Kleinberg, Jon , title =. 2013 , series =

    2013

  91. [99]

    Journal of Causal Inference , year =

    Randomized graph cluster randomization , author =. Journal of Causal Inference , year =

  92. [100]

    Pillai and Alexander Volfovsky , title =

    Ravi Jagadeesan and Natesh S. Pillai and Alexander Volfovsky , title =. Annals of Statistics , year =

  93. [101]

    Sussman and Edoardo M

    Daniel L. Sussman and Edoardo M. Airoldi , title =. 2017 , archivePrefix =. 1702.03578v1 , primaryClass =

    2017 arXiv

  94. [102]

    2021 , eprinttype =

    Evan Munro and Stefan Wager and Xu Kuang , title =. 2021 , eprinttype =. 2109.11647 , eprintclass =

    2021 arXiv

  95. [103]

    The Annals of Statistics , number =

    Shuangning Li and Stefan Wager , title =. The Annals of Statistics , number =

  96. [104]

    Average Treatment Effects in the Presence of Unknown Interference , year =

    Fredrik S. Average Treatment Effects in the Presence of Unknown Interference , year =. Annals of Statistics , volume =

  97. [105]

    Causal inference with misspecified exposure mappings: separating definitions and assumptions , journal =

    Fredrik S. Causal inference with misspecified exposure mappings: separating definitions and assumptions , journal =. 2023 , issn =

    2023

  98. [106]

    Leung , title =

    Michael P. Leung , title =. 2022 , journal =

    2022

  99. [107]

    Handbook of statistical methods for precision medicine , pages=

    Semiparametric doubly robust targeted double machine learning: a review , author=. Handbook of statistical methods for precision medicine , pages=. 2024 , publisher=

    2024

  100. [108]

    Journal of the American Statistical Association , volume=

    Exact p-values for network interference , author=. Journal of the American Statistical Association , volume=. 2018 , publisher=

    2018

  101. [109]

    Sociological Methods & Research , volume=

    A general method for detecting interference between units in randomized experiments , author=. Sociological Methods & Research , volume=. 2012 , publisher=

    2012

  102. [110]

    Biometrika , volume=

    Randomization tests of causal effects under interference , author=. Biometrika , volume=. 2019 , publisher=

    2019

  103. [111]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    A graph-theoretic approach to randomization tests of causal effects under general interference , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2022 , publisher=

    2022

  104. [112]

    Econometrica , volume=

    Randomization tests for peer effects in group formation experiments , author=. Econometrica , volume=. 2024 , publisher=

    2024

  105. [113]

    arXiv preprint arXiv:2501.07722 , year=

    Ml-assisted randomization tests for detecting treatment effects in a/b experiments , author=. arXiv preprint arXiv:2501.07722 , year=

    arXiv

  106. [114]

    arXiv preprint arXiv:2312.01234 , year=

    On the admissibility of horvitz-thompson estimator for estimating causal effects under network interference , author=. arXiv preprint arXiv:2312.01234 , year=

  107. [115]

    Proceedings of the International AAAI Conference on Web and Social Media , volume=

    Minimizing interference and selection bias in network experiment design , author=. Proceedings of the International AAAI Conference on Web and Social Media , volume=

  108. [116]

    2011 , publisher=

    Random graphs , author=. 2011 , publisher=

    2011

  109. [117]

    arXiv preprint arXiv:2210.08698 , year=

    A design-based Riesz representation framework for randomized experiments , author=. arXiv preprint arXiv:2210.08698 , year=

    arXiv

  110. [118]

    1998 , publisher=

    Theory of point estimation , author=. 1998 , publisher=

    1998

  111. [119]

    2012 , publisher=

    Asymptotic methods in statistical decision theory , author=. 2012 , publisher=

    2012

  112. [120]

    URL: https://https://web

    Lecture notes on statistics and information theory , author=. URL: https://https://web. stanford. edu/class/stats311/lecture-notes. pdf , year=

  113. [121]

    Journal of the American statistical Association , volume=

    A generalization of sampling without replacement from a finite universe , author=. Journal of the American statistical Association , volume=. 1952 , publisher=

    1952

  114. [122]

    ACM Sigact News , volume=

    Introduction to the Theory of Computation , author=. ACM Sigact News , volume=. 1996 , publisher=

    1996

  115. [123]

    Communications of the ACM , volume=

    The status of the P versus NP problem , author=. Communications of the ACM , volume=. 2009 , publisher=

    2009

  116. [124]

    Proceedings of 37th Conference on Foundations of Computer Science , pages=

    Clique is hard to approximate within n/sup 1-/spl epsiv , author=. Proceedings of 37th Conference on Foundations of Computer Science , pages=. 1996 , organization=

    1996

  117. [125]

    Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , pages=

    Linear degree extractors and the inapproximability of max clique and chromatic number , author=. Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , pages=

  118. [126]

    2025 , month =

    Regression Adjustment for Randomized Network Experiments , author =. 2025 , month =

    2025

  119. [127]

    Journal of Computer and System Sciences , volume=

    On the complexity of k-SAT , author=. Journal of Computer and System Sciences , volume=. 2001 , publisher=

    2001

  120. [128]

    Journal of Machine Learning Research , volume=

    Community detection and stochastic block models: recent developments , author=. Journal of Machine Learning Research , volume=

  121. [129]

    Journal of the London mathematical Society , volume=

    The eigenvalues of a graph and its chromatic number , author=. Journal of the London mathematical Society , volume=. 1967 , publisher=

    1967

  122. [130]

    2013 , publisher=

    Algebraic graph theory , author=. 2013 , publisher=

    2013

  123. [131]

    2005 , publisher=

    Introduction to quadratic forms over fields , author=. 2005 , publisher=

    2005

  124. [132]

    University of Georgia , volume=

    Quadratic forms chapter I: Witt’s theory , author=. University of Georgia , volume=

  125. [133]

    arXiv preprint arXiv:2605.09726 , year=

    On the Impossibility of Specification Testing of Interference Models Based on Exposure Mappings , author=. arXiv preprint arXiv:2605.09726 , year=

    arXiv

  126. [134]

    arXiv preprint arXiv:2605.20572 , year=

    Minimax unbiased estimation for finite populations with bounded outcomes , author=. arXiv preprint arXiv:2605.20572 , year=

    arXiv

  127. [135]

    ACM Sigact News , volume=

    Approximation algorithms for NP-hard problems , author=. ACM Sigact News , volume=. 1997 , publisher=

    1997

  128. [136]

    Complexity of computer computations , pages=

    Reducibility among combinatorial problems , author=. Complexity of computer computations , pages=. 1972 , publisher=

    1972

  129. [137]

    Theory of Computing , volume=

    Inapproximability of vertex cover and independent set in bounded degree graphs , author=. Theory of Computing , volume=. 2011 , publisher=

    2011

  130. [138]

    the electronic journal of combinatorics , pages=

    Short cycles in random regular graphs , author=. the electronic journal of combinatorics , pages=

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.