Related papers: On stochastically sampling color configurations
Soft pp interactions are considered in the framework of the phenomenological model with color strings formation. Under the assumption, that the elementary collision is realized as interaction of two color dipoles, the total inelastic cross…
Fixed-parameter algorithms have been successfully applied to solve numerous difficult problems within acceptable time bounds on large inputs. However, most fixed-parameter algorithms are inherently \emph{sequential} and, thus, make no use…
The use of QCD calculations that include the resummation of soft-collinear logarithms via parton-shower algorithms is currently not possible in PDF fits due to the high computational cost of evaluating observables for each variation of the…
A Markovian shower algorithm based on "sector antennae" is presented and its main properties illustrated. Tree-level full-color matrix elements can be automatically incorporated in the algorithm and are re-interpreted as process-dependent 2…
We propose a method for matching the next-to-leading order (NLO) calculation of a given QCD process with a parton shower Monte Carlo (MC) simulation. The method has the following features: fully exclusive events are generated, with…
An important question concerning in-medium high-energy parton showers in a quark-gluon plasma or other QCD medium is whether consecutive splittings of the partons in a given shower can be treated as quantum mechanically independent, or…
Irregular computations on unstructured data are an important class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The…
We present a simple parton-shower model that replaces the explicit angular ordering of the coherent branching formalism with a differentially accurate simulation of soft-gluon radiation by means of a non-trivial dependence on azimuthal…
We present a procedure for efficiently sampling colors in the {\congest} model. It allows nodes whose number of colors exceeds their number of neighbors by a constant fraction to sample up to $\Theta(\log n)$ semi-random colors unused by…
The study of dileptons in high-energy heavy-ion collisions provides critical insights into the properties of the quark-gluon plasma and the thermal radiation emitted throughout its evolution. In the low-mass region, dileptons originate from…
In this talk, I show the automated Monte Carlo simulations at next-to-leading order in QCD as well as its matching to parton showers are already feasible within the framework of \MG5aMC. I briefly overview the recent activities and take the…
The MC@NLO method as implemented in the Sherpa MC generator is presented using the production of W-bosons in conjunction with up to three jets as an example. Corresponding results computed at next-to leading order in QCD and including…
In August 2023, more than 30 students joined the Special Remote DESY summer-school to work on projects of importance for LHC experiments. In a dedicated initiative, analyses that had not been incorporated into the RIVET package were…
We compare a NLO W gamma matrix element generator with the leading order calculation in Pythia . A matching scheme between a next-to-leading order W gamma matrix element generator by Baur et. al. and the Pythia parton shower is presented.…
We propose a general approach for the description of multijet events in the framework of QCD event generators. We introduce a new algorithm to match parton showers and arbitrary matrix elements for the production of any number of jets via…
The implementation of a new final-state parton-shower algorithm in the Pythia event generator is described. The shower algorithm, dubbed Apollo, combines central aspects of the Vincia antenna shower with the global transverse-recoil scheme…
Extending previous work on the predictions for the production of supersymmetric (SUSY) particles at the LHC, we present the fully differential calculation of the next-to-leading order (NLO) SUSY-QCD corrections to the production of squark…
The progressive hedging algorithm (PHA) is a cornerstone among algorithms for large-scale stochastic programming problems. However, its traditional implementation is hindered by some limitations, including the requirement to solve all…
We develop a new method to efficiently sample synthetic networks that preserve the d-hop neighborhood structure of a given network for any given d. The proposed algorithm trades off the diversity in network samples against the depth of the…
In recent times the algorithms for the simulation of hadronic collisions have been subject to two substantial improvements: the inclusion, within parton showering, of exact higher order tree level matrix elements (MEPS) and, separately,…