Approximating the Operating Characteristics of Bayesian Uncertainty Directed Trial Designs

Bayesian response adaptive clinical trials are currently evaluating experimental therapies for several diseases. Adaptive decisions, such as pre-planned variations of the randomization probabilities, attempt to accelerate the development of new treatments. The design of response adaptive trials, in most cases, requires time consuming simulation studies to describe operating characteristics, such as type I/II error rates, across plausible scenarios. We investigate large sample approximations of pivotal operating characteristics in Bayesian Uncertainty directed trial Designs (BUDs). A BUD trial utilizes an explicit metric u to quantify the information accrued during the study on parameters of interest, for example the treatment effects. The randomization probabilities vary during time to minimize the uncertainty summary u at completion of the study. We provide an asymptotic analysis (i) of the allocation of patients to treatment arms and (ii) of the randomization probabilities. For BUDs with outcome distributions belonging to the natural exponential family with quadratic variance function, we illustrate the asymptotic normality of the number of patients assigned to each arm and of the randomization probabilities. We use these results to approximate relevant operating characteristics such as the power of the BUD. We evaluate the accuracy of the approximations through simulations under several scenarios for binary, time-to-event and continuous outcome models.

Interacting urns on a finite directed graph

We introduce a general two-colour interacting urn model on a finite directed graph, where each urn at a node reinforces all the urns in its out-neighbours according to a fixed, non-negative, and balanced reinforcement matrix. We show that the fraction of balls of either colour converges almost surely to a deterministic limit if either the reinforcement is not of Pólya type or the graph is such that every vertex with non-zero in-degree can be reached from some vertex with zero in-degree. We also obtain joint central limit theorems with appropriate scalings. Furthermore, in the remaining case when there are no vertices with zero in-degree and the reinforcement is of Pólya type, we restrict our analysis to a regular graph and show that the fraction of balls of either colour converges almost surely to a finite random limit, which is the same across all the urns.

Interacting nonlinear reinforced stochastic processes: Synchronization or non-synchronization

The rich-get-richer rule reinforces actions that have been frequently chosen in the past. What happens to the evolution of individuals’ inclinations to choose an action when agents interact? Interaction tends to homogenize, while each individual dynamics tends to reinforce its own position. Interacting stochastic systems of reinforced processes have recently been considered in many papers, in which the asymptotic behavior is proven to exhibit almost sure synchronization. In this paper we consider models where, even if interaction among agents is present, absence of synchronization may happen because of the choice of an individual nonlinear reinforcement. We show how these systems can naturally be considered as models for coordination games or technological or opinion dynamics.

Multiple drawing multi-colour urns by stochastic approximation

A classical Pólya urn scheme is a Markov process where the evolution is encoded by a replacement matrix (Ri, j)1 ≤ i, j ≤ d. At every discrete time-step, we draw a ball uniformly at random, denote its colour c, and replace it in the urn together with Rc, j balls of colour j (for all 1 ≤ j ≤ d). We study multiple drawing Pólya urns, where the replacement rule depends on the random drawing of a set of m balls from the urn (with or without replacement). Many particular examples of this situation have been studied in the literature, but the only general results are due to Kuba and Mahmoud (2017). These authors proved second-order asymptotic results in the two-colour case, under the so-called balance and affinity assumptions, the latter being somewhat artificial. The main idea of this work is to apply stochastic approximation methods to this problem, which enables us to prove analogous results to Kuba and Mahmoud, but without the artificial affinity hypothesis, and, for the first time in the literature, in the d-colour case (d ≥ 3). We also provide some partial results in the two-colour nonbalanced case, the novelty here being that the only results for this case currently in the literature are for particular examples.