Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userStreamlining resummed QCD calculations using Monte Carlo integration
108
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Some of the most arduous and error-prone aspects of precision resummed calculations are related to the partonic hard process, having nothing to do with the resummation. In particular, interfacing to parton-distribution functions, combining various channels, and performing the phase space integration can be limiting factors in completing calculations. Conveniently, however, most of these tasks are already automated in many Monte Carlo programs, such as MadGraph, Alpgen or Sherpa. In this paper, we show how such programs can be used to produce distributions of partonic kinematics with associated color structures representing the hard factor in a resummed distribution. These distributions can then be used to weight convolutions of jet, soft and beam functions producing a complete resummed calculation. In fact, only around 1000 unweighted events are necessary to produce precise distributions. A number of examples and checks are provided, including $e^+e^-$ two- and four-jet event shapes, $n$-jettiness and jet-mass related observables at hadron colliders. Attached code can be used to modify MadGraph to export the relevant leading-order hard functions and color structures for arbitrary processes.
rate research
Read More
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 open questions instead of making a inventory of the existing programs.
The principles behind the computation of protein-ligand binding free energies by Monte Carlo integration are described in detail. The simulation provides gas-phase binding free energies that can be converted to aqueous energies by solvation corrections. The direct integration simulation has several characteristics beneficial to free-energy calculations. One is that the number of parameters that must be set for the simulation is small and can be determined objectively, making the outcome more deterministic, with respect to choice of input conditions, as compared to perturbation methods. Second, the simulation is free from assumptions about the starting pose or nature of the binding site. A final benefit is that binding free energies are a direct outcome of the simulation, and little processing is required to determine them. The well-studied T4 lysozyme experimental free energy data and crystal structures were used to evaluate the method.
We present a method of solution of the Bartels-Kwiecinski-Praszalowicz (BKP) equation based on the numerical integration of iterated integrals in transverse momentum and rapidity space. As an application, our procedure, which makes use of Monte Carlo integration techniques, is applied to obtain the gluon Green function in the odderon case at leading order. The same approach can be used for more complicated scenarios.
An implementation of the Monte Carlo (MC) phase space generators coupled with adaptive MC integration/simulation program FOAM is presented. The first program is a modification of the classic phase space generator GENBOD interfaced with the adaptive sampling integrator/generator FOAM. On top of this tool the algorithm suitable for generation of the phase space for an reaction with two leading particles is presented (double-peripheral process with central production of particles). At the same time it serves as an instructive example of construction of a self-adaptive phase space generator/integrator with a modular structure for specialized particle physics calculations.
The steadily increasing size of scientific Monte Carlo simulations and the desire for robust, correct, and reproducible results necessitates rigorous testing procedures for scientific simulations in order to detect numerical problems and programming bugs. However, the testing paradigms developed for deterministic algorithms have proven to be ill suited for stochastic algorithms. In this paper we demonstrate explicitly how the technique of statistical hypothesis testing, which is in wide use in other fields of science, can be used to devise automatic and reliable tests for Monte Carlo methods, and we show that these tests are able to detect some of the common problems encountered in stochastic scientific simulations. We argue that hypothesis testing should become part of the standard testing toolkit for scientific simulations.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
