Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quasi-randomization tests for network interference (2403.16673v2)

Published 25 Mar 2024 in stat.ME and econ.EM

Abstract: Network interference amounts to the treatment status of one unit affecting the potential outcome of other units in the population. Testing for spillover effects in this setting makes the null hypothesis non-sharp. An interesting approach to tackling the non-sharp nature of the null hypothesis in this setup is constructing conditional randomization tests such that the null is sharp on the restricted population. Such approaches can pose computational challenges as finding these appropriate sub-populations based on experimental design can involve solving an NP-hard problem. In this paper, we view the network amongst the population as a random variable instead of being fixed. We propose a new approach that builds a conditional quasi-randomization test. We build the (non-sharp) null distribution of no spillover effects using random graph null models. We show that our method is exactly valid in finite samples under mild assumptions. Our method displays enhanced power over other methods, substantially improving cluster randomized trials. We illustrate our methodology to test for interference in a weather insurance adoption experiment run in rural China.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. Classes of small-world networks. Proceedings of the National Academy of Sciences, 97(21):11149–11152, 2000.
  2. Fast uniform generation of random graphs with given degree sequences. Random Structures & Algorithms, 59(3):291–314, 2021.
  3. Estimating average causal effects under general interference, with application to a social network experiment. The Annals of Applied Statistics, 11(4), December 2017. ISSN 1932-6157. doi: 10.1214/16-AOAS1005.
  4. Exact p-values for network interference. Journal of the American Statistical Association, 113(521):230–240, 2018.
  5. The number of graphs and a random graph with a given degree sequence. Random Structures & Algorithms, 42(3):301–348, 2013.
  6. Randomization tests for peer effects in group formation experiments. arXiv preprint arXiv:1904.02308, 2019a.
  7. Randomization tests of causal effects under interference. Biometrika, 106(2):487–494, 2019b.
  8. Why marketplace experimentation is harder than it seems: The role of test-control interference. In Proceedings of the fifteenth ACM Conference on Economics and Computation, pages 567–582, 2014.
  9. Linear social interactions models. Journal of Political Economy, 123(2):444–496, 2015.
  10. Reasoning about interference between units: A general framework. Political Analysis, 21(1):97–124, 2013.
  11. Social networks and the decision to insure. American Economic Journal: Applied Economics, 7(2):81–108, 2015.
  12. Random graphs with a given degree sequence. The Annals of Applied Probability, pages 1400–1435, 2011.
  13. David R Cox. Planning of experiments. Wiley Publication in Applied Statistics, 1958.
  14. Design and analysis of experiments in networks: Reducing bias from interference. Journal of Causal Inference, 5(1):20150021, 2017.
  15. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci, 5(1):17–60, 1960.
  16. Ronald Aylmer Fisher. Design of experiments. British Medical Journal, 1(3923):554, 1936.
  17. Configuring random graph models with fixed degree sequences. SIAM Review, 60(2):315–355, 2018.
  18. Causal inference in infectious diseases. Epidemiology, pages 142–151, 1995.
  19. Confidence intervals for partially identified parameters. Econometrica, 72(6):1845–1857, 2004.
  20. Causal Inference in Statistics, Social, and Biomedical Sciences. Cambridge University Press, 2015.
  21. Michael P Leung. Treatment and spillover effects under network interference. Review of Economics and Statistics, 102(2):368–380, 2020.
  22. Random graph asymptotics for treatment effect estimation under network interference. The Annals of Statistics, 50(4):2334–2358, 2022.
  23. Charles F Manski. Identification of endogenous social effects: The reflection problem. The Review of Economic Studies, 60(3):531–542, 1993.
  24. Charles F Manski. Identification of treatment response with social interactions. The Econometrics Journal, 16(1):S1–S23, 2013.
  25. Optimized null model for protein structure networks. PLoS One, 4(6):e5967, 2009.
  26. Mark EJ Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23):8577–8582, 2006.
  27. Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64(2):026118, 2001.
  28. Random graph models of social networks. Proceedings of the National Academy of Sciences, 99(suppl_1):2566–2572, 2002.
  29. On maximizing diffusion speed in social networks: impact of random seeding and clustering. ACM SIGMETRICS Performance Evaluation Review, 42(1):301–313, 2014.
  30. Testing for arbitrary interference on experimentation platforms. Biometrika, 106(4):929–940, 2019.
  31. A graph-theoretic approach to randomization tests of causal effects under general interference. Journal of the Royal Statistical Society Series B: Statistical Methodology, 84(1):174–204, 2022.
  32. Paul R Rosenbaum. Observational Studies. Springer Series in Statistics. Springer, 2002. ISBN 978-0-387-98967-9.
  33. Exploring community structure in biological networks with random graphs. BMC Bioinformatics, 15(1):1–14, 2014.
  34. Michael E Sobel. What do randomized studies of housing mobility demonstrate? causal inference in the face of interference. Journal of the American Statistical Association, 101(476):1398–1407, 2006.
  35. Estimation of causal peer influence effects. In International Conference on Machine Learning, pages 1489–1497. PMLR, 2013.
  36. Graph cluster randomization: Network exposure to multiple universes. In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 329–337, 2013.
  37. Random graphs with prescribed k-core sequences: A new null model for network analysis. In Proceedings of the Web Conference 2021, pages 367–378, 2021.
  38. Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In International Computing and Combinatorics Conference, pages 440–449. Springer, 2005.
  39. Collective dynamics of ‘small-world’ networks. Nature, 393(6684):440–442, 1998.

Summary

We haven't generated a summary for this paper yet.