High Energy QCD at NLO: from light-cone wave function to JIMWLK evolution

Soft components of the light cone wave-function of a fast moving projectile hadron is computed in perturbation theory to third order in QCD coupling constant. At this order, the Fock space of the soft modes consists of one-gluon, two-gluon, and a quark-antiquark states. The hard component of the wave-function acts as a non-Abelian background field for the soft modes and is represented by a valence charge distribution that accounts for non-linear density effects in the projectile. When scattered off a dense target, the diagonal element of the S-matrix reveals the Hamiltonian of high energy evolution, the JIMWLK Hamiltonian. This way we provide a new direct derivation of the JIMWLK Hamiltonian at the Next-to-Leading Order.Comment: 83 pages, 15 figures; explanatory comments added, published versio

Q-learning with censored data

We develop methodology for a multistage decision problem with flexible number of stages in which the rewards are survival times that are subject to censoring. We present a novel Q-learning algorithm that is adjusted for censored data and allows a flexible number of stages. We provide finite sample bounds on the generalization error of the policy learned by the algorithm, and show that when the optimal Q-function belongs to the approximation space, the expected survival time for policies obtained by the algorithm converges to that of the optimal policy. We simulate a multistage clinical trial with flexible number of stages and apply the proposed censored-Q-learning algorithm to find individualized treatment regimens. The methodology presented in this paper has implications in the design of personalized medicine trials in cancer and in other life-threatening diseases.Comment: Published in at http://dx.doi.org/10.1214/12-AOS968 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

A Greedy Partition Lemma for Directed Domination

A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \in V(D) \setminus S$ has an adjacent vertex $v$ in $S$ with $v$ directed to $u$. The directed domination number of $D$, denoted by $\gamma(D)$, is the minimum cardinality of a directed dominating set in $D$. The directed domination number of a graph $G$, denoted $\Gamma_d(G)$, which is the maximum directed domination number $\gamma(D)$ over all orientations $D$ of $G$. The directed domination number of a complete graph was first studied by Erd\"{o}s [Math. Gaz. 47 (1963), 220--222], albeit in disguised form. In this paper we prove a Greedy Partition Lemma for directed domination in oriented graphs. Applying this lemma, we obtain bounds on the directed domination number. In particular, if $\alpha$ denotes the independence number of a graph $G$, we show that $\alpha \le \Gamma_d(G) \le \alpha(1+2\ln(n/\alpha))$.Comment: 12 page

Conformal symmetry of JIMWLK Evolution at NLO

We construct the Next to Leading Order JIMWLK Hamiltonian for high energy evolution in ${\cal N}=4$ SUSY theory, and show that it possesses conformal invariance, even though it is derived using sharp cutoff on rapidity variable. The conformal transformation properties of Wilson lines are not quite the naive ones, but at NLO acquire an additional anomalous piece. We construct explicitly the inversion symmetry generator. We also show how to construct for every operator $O$, including the Hamiltonian itself, its "conformal extension" $\cal O$, such that it transforms under the inversion in the naive way.Comment: 20 page