相关论文: A simple shower and matching algorithm
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…
We propose a simple scheme to start a parton-shower evolution description from a given jet configuration in $e^+ e^-$ annihilation events. This allows a convenient combination of the full angular information content of matrix elements with…
Parton showers are among the most widely used tools in collider physics. Despite their key importance, none so far has been able to demonstrate accuracy beyond a basic level known as leading logarithmic (LL) order, with ensuing limitations…
We present a formalism for the scattering of an arbitrary linear or acyclic branched structure build by joining mutually non-interacting arbitrary functional sub-units. The formalism consists of three equations expressing the structural…
High-quality simulated data is crucial for particle physics discoveries. Therefore, parton shower algorithms are a major building block of the data synthesis in event generator programs. However, the core algorithms used to generate parton…
A Monte-Carlo event-generator has been developed which is dedicated to simulate electron-positron annihilations. Especially a new approach for the combination of matrix elements and parton showers ensures the independence of the…
In this paper, I will explain in as simple and intuitive physical terms as possible what generalized parton distributions are, what new information about the structure of hadrons they convey and therefore what picture of the hadron will…
We present for the first time the full automation of collider predictions matched with parton showers at the next-to-leading accuracy in QCD within non-trivial extensions of the Standard Model. The sole inputs required from the user are the…
Motivated by the need to correct the potentially large kinematic errors in approximations used in the standard formulation of perturbative QCD, we reformulate deeply inelastic lepton-proton scattering in terms of gauge invariant, universal…
The choice of a factorization scheme suitable for Monte Carlo simulations of NLO initial state parton showers is discussed in this contribution.
Extraction of structure, in particular of group symmetries, is increasingly crucial to understanding and building intelligent models. In particular, some information-theoretic models of parsimonious learning have been argued to induce…
We show that the algorithm originally proposed by Collins and Knowles for spin correlations in the QCD parton shower can be used in order to include spin correlations between the production and decay of heavy particles in Monte Carlo event…
The Pairwise Markov Chain (PMC) is a probabilistic graphical model extending the well-known Hidden Markov Model. This model, although highly effective for many tasks, has been scarcely utilized for continuous value prediction. This is…
Modified Altarelli-Parisi splitting functions were recenty proposed to model multi-parton radiation in a dense medium and describe jet quenching, one of most striking features of heavy-ion collisions. We implement medium-modified splitting…
In this talk I gave a brief summary of leading order, next-to-leading order and shower calculations. I discussed the main ideas and approximations of the shower algorithms and the related matching schemes. I tried to focus on QCD issues and…
In this paper we consider the problem of computing the stationary distribution of nearly completely decomposable Markov processes, a well-established area in the classical theory of Markov processes with broad applications in the design,…
Learning permutations is fundamental to sorting, ranking, and matching, but existing differentiable methods based on entropy-regularized Sinkhorn produce a single softened solution and collapse under ambiguity. We present PermFlow, a…
Sparse inversion and classification problems are ubiquitous in modern data science and imaging. They are often formulated as non-smooth minimisation problems. In sparse inversion, we minimise, e.g., the sum of a data fidelity term and an…
The goal of this work is to formally abstract a Markov process evolving in discrete time over a general state space as a finite-state Markov chain, with the objective of precisely approximating its state probability distribution in time,…
Let each point of a homogeneous Poisson process in R^d independently be equipped with a random number of stubs (half-edges) according to a given probability distribution mu on the positive integers. We consider translation-invariant schemes…