Adaptive randomization in network data
From MaRDI portal
Publication:6200871
DOI10.1214/23-ejs2159arXiv2009.01273OpenAlexW4391233531WikidataQ129402668 ScholiaQ129402668MaRDI QIDQ6200871
Unnamed Author, Fei-fang Hu, Zhixin Zhou
Publication date: 25 March 2024
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.01273
Lyapunov functionLamperti processadaptive randomization designnetwork-correlated outcomestime-varying Markov process
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- The unconstrained binary quadratic programming problem: a survey
- Rerandomization to improve covariate balance in experiments
- Balancing treatment allocation over continuous covariates: a new imbalance measure for mini\-mization
- Asymptotic properties of covariate-adaptive randomization
- Criteria for the recurrence or transience of stochastic process. I
- A global continuation algorithm for solving binary quadratic programming problems
- A solvable case of quadratic 0-1 programming
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Graph separation techniques for quadratic zero-one programming
- A nonparametric view of network models and Newman–Girvan and other modularities
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- An Application of an Urn Model to the Design of Sequential Controlled Clinical Trials
- Model-assisted design of experiments in the presence of network-correlated outcomes
- Analogues of Khintchine, Marcinkiewicz–Zygmund and Rosenthal Inequalities for Symmetric Statistics
- Identification of treatment response with social interactions
- Statistical Inference for Covariate-Adaptive Randomization Procedures
- Forcing a sequential experiment to be balanced
- Balancing Unobserved Covariates With Covariate-Adaptive Randomized Experiments
This page was built for publication: Adaptive randomization in network data
