相关论文: A simple shower and matching algorithm
We discuss the theoretical bases that underpin the automation of the computations of tree-level and next-to-leading order cross sections, of their matching to parton shower simulations, and of the merging of matched samples that differ by…
In the era of precision physics measurements at the LHC, efficient and exhaustive estimations of theoretical uncertainties play an increasingly crucial role. In the context of Monte Carlo (MC) event generators, the estimation of such…
Fitting probabilistic models to data is often difficult, due to the general intractability of the partition function. We propose a new parameter fitting method, Minimum Probability Flow (MPF), which is applicable to any parametric model. We…
In this thesis, we present automated, process-independent methods for the calculation of QED real radiative corrections. We review the construction of a parton shower based on Catani-Seymour dipole subtraction, and thus detail the…
Standard dipole parton showers are known to yield incorrect subleading-colour contributions to the leading (double) logarithmic terms for a variety of observables. In this work, concentrating on final-state showers, we present two simple,…
Double parton scattering (DPS) processes in which there is a perturbative $1\to2$ splitting in both protons overlap with loop corrections to single parton scattering (SPS). Any fundamental theoretical treatment of DPS needs to address this…
In this talk, we discuss recent developments in combining parton showers and fixed-order calculations. We focus on the UNNLOPS method for matching next-to-next-to-leading order computations to the parton shower, and we present results from…
We consider a model of transverse momentum production in which non-perturbative smearing takes place throughout the perturbative evolution, by a simple modification to an initial state parton shower algorithm. Using this as the important…
We develop a novel Monte Carlo parton branching algorithm based on the Gribov-Levin-Ryskin (GLR) equation. The formulations of both forward evolution and backward evolution for the GLR equation are presented. The results from the Monte…
Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…
We propose a new subtraction scheme for next-to-leading order QCD calculations. Our scheme is based on the momentum mapping and on the splitting functions derived in the context of an improved parton shower formulation. Compared to standard…
Parton shower event generators typically approximate evolution of QCD color so that only contributions that are leading in the limit of an infinite number of colors are retained. Our parton shower generator, Deductor, has used an "LC+"…
Colour evolution and parton branching at the amplitude level have become important theoretical frameworks to improve parton showers, and are algorithms in their own right: they complement shower development by resummation algorithms capable…
We introduce a simple procedure that resolves the long-standing question of how to account for single-logarithmic spin-correlation effects in parton showers not just in the collinear limit, but also in the soft wide-angle limit, at leading…
We formulate a collinear partonic shower algorithm that achieves next-to-single-logarithmic (NSL, $\alpha_s^n L^{n-1}$) accuracy for collinear-sensitive non-singlet fragmentation observables. This entails the development of an algorithm for…
We consider $ZZ$ production in hadronic collisions and present state-of-the-art predictions in QCD perturbation theory matched to parton showers. Next-to-next-to-leading order corrections to the quark-initiated channel are combined with…
We compare different procedures for combining fixed-order tree-level matrix-element generators with parton showers. We use the case of W-production at the Tevatron and the LHC to compare different implementations of the so-called CKKW and…
A new method to construct event-generators based on next-to-leading order QCD matrix-elements and leading-logarithmic parton showers is proposed. Matrix elements of loop diagram as well as those of a tree level can be generated using an…
Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical data analysis and signal processing and (ii) characterising classes of dynamical…
We quantify uncertainties in the Monte-Carlo simulation of inclusive and dijet final states, which arise from using the MC@NLO technique for matching next-to-leading order parton level calculations and parton showers. We analyse a large…