Related papers: Markovian Monte Carlo solutions of the one-loop CC…
We present two Monte Carlo algorithms of the Markovian type which solve the modified QCD evolution equations at the NLO level. The modifications with respect to the standard DGLAP evolution concern the argument of the strong coupling…
We present the program EvolFMC v.2 that solves the evolution equations in QCD for the parton momentum distributions by means of the Monte Carlo technique based on the Markovian process. The program solves the DGLAP-type evolution as well as…
We discuss precision Monte Carlo (MC) calculations for solving the QCD evolution equations up to the next-to-leading-order (NLO) level. They employ forward Markovian Monte Carlo algorithms, which provide rigorous solutions of the above…
This work covers methodology of solving QCD evolution equation of the parton distribution using Markovian Monte Carlo (MMC) algorithms in a class of models ranging from DGLAP to CCFM. One of the purposes of the above MMCs is to test the…
We present precision Monte Carlo calculations solving the QCD evolution equations up to the next-to-leading-order (NLO) level. They employ forward Markovian Monte Carlo (FMC) algorithms, which provide the rigorous solutions of the QCD…
We present the exact and precise (~0.1%) numerical solution of the QCD evolution equations for the parton distributions in a wide range of $Q$ and $x$ using Monte Carlo (MC) method, which relies on the so-called Markovian algorithm. We…
We present the constrained Monte Carlo (CMC) algorithm for the QCD evolution. The constraint resides in that the total longitudinal energy of the emissions in the MC and in the underlying QCD evolution is predefined (constrained). This CMC…
A general formalism was introduced for reorganization of QCD evolution equations and derivation of hierarchical solution to DGLAP equation. The hierarchical solution separates two types of parton emissions: the flavour changing emissions…
We revisit the challenging problem of finding an efficient Monte Carlo (MC) algorithm solving the constrained evolution equations for the initial-state QCD radiation. The type of the parton (quark, gluon) and the energy fraction x of the…
The Markov Chain Monte Carlo (MCMC) algorithm is a widely recognised as an efficient method for sampling a specified posterior distribution. However, when the posterior is multi-modal, conventional MCMC algorithms either tend to become…
A novel class of non-reversible Markov chain Monte Carlo schemes relying on continuous-time piecewise-deterministic Markov Processes has recently emerged. In these algorithms, the state of the Markov process evolves according to a…
We solve CCFM evolution equation numerically using the CohRad program based on Monte Carlo methods. We discuss the effects of removing soft emissions and non-Sudakov form factor by comparing the obtained distributions as functions of…
Recently there have been exciting developments in Monte Carlo methods, with the development of new MCMC and sequential Monte Carlo (SMC) algorithms which are based on continuous-time, rather than discrete-time, Markov processes. This has…
We are reporting on the ongoing effort of the Monte Carlo (MC) modelling of NLO DGLAP QCD evolution in the fully unintegrated form. The resulting parton shower MC is performing on its own the NLO QCD evolution, contrary to all known…
A new class of the constrained Monte Carlo (CMC) algorithms for the QCD evolution equation was recently discovered. The constraint is imposed on the type and the total longitudinal energy of the parton exiting QCD evolution and entering a…
The Parton Branching (PB) approach describes the evolution of transverse momentum dependent (TMD) parton densities. We propose to extend the PB method by including TMD splitting functions, instead of the DGLAP splitting functions which…
In this article we consider Bayesian estimation of static parameters for a class of partially observed McKean-Vlasov diffusion processes with discrete-time observations over a fixed time interval. This problem features several obstacles to…
In most sampling algorithms, including Hamiltonian Monte Carlo, transition rates between states correspond to the probability of making a transition in a single time step, and are constrained to be less than or equal to 1. We derive a…
Markov Chain Monte Carlo (MCMC) is a computational approach to fundamental problems such as inference, integration, optimization, and simulation. The field has developed a broad spectrum of algorithms, varying in the way they are motivated,…
Markov Chain Monte Carlo (MCMC) methods have become a cornerstone of many modern scientific analyses by providing a straightforward approach to numerically estimate uncertainties in the parameters of a model using a sequence of random…