Adaptive randomization in network data

DOI10.1214/23-EJS2159MaRDI QIDQ6200871zbMATH OpenOpenAlexWikidataFDO

Authors Zhixin Zhou, Ping Li, Feifang Hu

Publication date 25 March 2024

Published in Electronic Journal of Statistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2009.01273, https://projecteuclid.org/journals/electronic-journal-of-statistics/volume-18/issue-1/Adaptive-randomization-in-network-data/10.1214/23-EJS2159.full

zbMATH Keywords

Lyapunov functionLamperti processadaptive randomization designnetwork-correlated outcomestime-varying Markov process

Mathematics Subject Classification ID

Statistics (62-XX)

Abstract: Network data have appeared frequently in recent research. For example, in comparing the effects of different types of treatment, network models have been proposed to improve the quality of estimation and hypothesis testing. In this paper, we focus on efficiently estimating the average treatment effect using an adaptive randomization procedure in networks. We work on models of causal frameworks, for which the treatment outcome of a subject is affected by its own covariate as well as those of its neighbors. Moreover, we consider the case in which, when we assign treatments to the current subject, only the subnetwork of existing subjects is revealed. New randomized procedures are proposed to minimize the mean squared error of the estimated differences between treatment effects. In network data, it is usually difficult to obtain theoretical properties because the numbers of nodes and connections increase simultaneously. Under mild assumptions, our proposed procedure is closely related to a time-varying inhomogeneous Markov chain. We then use Lyapunov functions to derive the theoretical properties of the proposed procedures. The advantages of the proposed procedures are also demonstrated by extensive simulations and experiments on real network data.

Cites work

• scientific article; zbMATH DE number 3137858 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• A global continuation algorithm for solving binary quadratic programming problems
• A nonparametric view of network models and Newman–Girvan and other modularities
• A solvable case of quadratic 0-1 programming
• An Application of an Urn Model to the Design of Sequential Controlled Clinical Trials
• Analogues of Khintchine, Marcinkiewicz–Zygmund and Rosenthal Inequalities for Symmetric Statistics
• Asymptotic properties of covariate-adaptive randomization
• Balancing Unobserved Covariates With Covariate-Adaptive Randomized Experiments
• Balancing treatment allocation over continuous covariates: a new imbalance measure for mini\-mization
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Continuous approaches for solving discrete optimization problems
• Criteria for the recurrence or transience of stochastic process. I
• Forcing a sequential experiment to be balanced
• Graph separation techniques for quadratic zero-one programming
• Identification of treatment response with social interactions
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• Model-assisted design of experiments in the presence of network-correlated outcomes
• Probabilistic GRASP-tabu search algorithms for the UBQP problem
• Rerandomization to improve covariate balance in experiments
• Statistical inference for covariate-adaptive randomization procedures
• The unconstrained binary quadratic programming problem: a survey

This page was built for publication: Adaptive randomization in network data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200871)