Related papers: 'carlomat', A program for automatic computation of…
The current status of CARLOMAT, a program for automatic computation of the lowest order cross sections of multiparticle reactions is described, the results of comparisons with other multipurpose Monte Carlo programs are shown and some new…
Version 2 of 'carlomat', a program for automatic computation of the lowest order cross sections of multiparticle reactions, is described. The substantial modifications with respect to version 1 of the program include: generation of a single…
Modifications of CARLOMAT, a program for automatic computation of the lowest order cross sections of multiparticle reactions, that include an abridgement of the phase space integration routine, an interface to parton density functions,…
New developments in CARLOMAT, a program for automatic computation of the lowest order cross sections, are presented. They include improvements of the phase integration routines and implementation of extensions of the standard model, such as…
A new version of CARLOMAT that allows to generate automatically the Monte Carlo programs dedicated to the description of the processes e+e- -> hadrons at low center-of-mass energies is presented. The program has been substantially modified…
Monte Carlo simulations are based on the manipulation of random numbers to evaluate probable outcomes, with applicability in a variety of different fields. By assigning probabilities, which can be determined a priori, to various events, it…
Multidimensional phase space integrals must be calculated in order to obtain predictions for total or differential cross sections, or to simulate unweighted events of multiparticle reactions. The corresponding matrix elements, already in…
Inspired by the latest developments in multilevel Monte Carlo (MLMC) methods and randomised sketching for linear algebra problems we propose a MLMC estimator for real-time processing of matrix structured random data. Our algorithm is…
The computation of higher order processes very often involves a large number of diagrams. In addition, it is in general not possible to solve the occurring integrals explicitly and expansions in small quantities have to be performed. This…
Monte Carlo sampling is a powerful toolbox of algorithmic techniques widely used for a number of applications wherein some noisy quantity, or summary statistic thereof, is sought to be estimated. In this paper, we survey the literature for…
In Monte Carlo particle transport codes, it is often important to adjust reaction cross sections to reduce the variance of calculations of relatively rare events, in a technique known as non-analogous Monte Carlo. We present the theory and…
We briefly describe a new general algorithm for carrying out QCD calculations to next-to-leading order in perturbation theory. The algorithm can be used for computing arbitrary jet cross sections in arbitrary processes and can be…
Hamiltonian Monte Carlo is a widely used algorithm for sampling from posterior distributions of complex Bayesian models. It can efficiently explore high-dimensional parameter spaces guided by simulated Hamiltonian flows. However, the…
In this note I illustrate the program MINT, a FORTRAN program for Monte Carlo adaptive integration and generation of unweighted distributions.
The first version of a computer program "eett6f" for calculating cross sections of e+e- -> 6 fermions processes relevant for a t\bar{t}-pair production and decay at centre of mass energies typical for linear colliders is presented. "eett6f…
A computer program ee4fgamma for calculating cross sections of any four fermion final state of e+e--annihilation at high energy and the corresponding bremsstrahlung reaction that is possible in the framework of the Standard Model is…
Random batch algorithms are constructed for quantum Monte Carlo simulations. The main objective is to alleviate the computational cost associated with the calculations of two-body interactions, including the pairwise interactions in the…
Sampling from complicated probability distributions is a hard computational problem arising in many fields, including statistical physics, optimization, and machine learning. Quantum computers have recently been used to sample from…
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…
We develop a biased Monte Carlo algorithm to measure probabilities of rare events in cluster-cluster aggregation for arbitrary collision kernels. Given a trajectory with a fixed number of collisions, the algorithm modifies both the waiting…