Related papers: Non-Markovian Monte Carlo Algorithm for the Constr…
In this paper we present solutions of evolution equations for inclusive distribution of gluons as produced by jet traversing quark-gluon plasma. We reformulate the original equations in such a form that the virtual and unresolved-real…
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…
Parton branching methods underlie the Monte Carlo (MC) generators, being therefore of key importance for obtaining high energy physics predictions. We construct a new parton branching algorithm which for the first time incorporates the…
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…
The next-to-leading order (NLO) evolution of the parton distribution functions (PDF's) in QCD is the "industry standard" in the lepton-hadron and hadron-hadron collider data analysis. The standard NLO DGLAP evolution is formulated for…
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…
QCD jets produced in heavy-ion collisions at LHC or RHIC energies partially evolve inside the produced hot and dense quark gluon plasma, offering unique opportunities to study QCD splitting processes in different backgrounds. Induced…
Stochastic gradient Markov chain Monte Carlo (MCMC) algorithms have received much attention in Bayesian computing for big data problems, but they are only applicable to a small class of problems for which the parameter space has a fixed…
Markov chain Monte Carlo (MCMC) algorithms are ubiquitous in Bayesian computations. However, they need to access the full data set in order to evaluate the posterior density at every step of the algorithm. This results in a great…
Monte Carlo event generators for hard hadronic collisions depend on the evolution of parton showers backwards from a high-scale subprocess to the hadronization scale. The evolution is treated as a branching process with a sequence of…
Markov chain Monte Carlo (MCMC) algorithms provide a very general recipe for estimating properties of complicated distributions. While their use has become commonplace and there is a large literature on MCMC theory and practice, MCMC users…
It is the central goal of our studies to describe parton fragmentation in the hot and dense medium of a quark gluon plasma (QGP). Under the assumption that the medium is not static and homogeneous, knowledge about the temporal evolution of…
Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo (MCMC) approach that exhibits favourable exploration properties in high-dimensional models such as neural networks. Unfortunately, HMC has limited use in large-data regimes and…
Optimizing or sampling complex cost functions of combinatorial optimization problems is a longstanding challenge across disciplines and applications. When employing family of conventional algorithms based on Markov Chain Monte Carlo (MCMC)…
The next-to-leading order (NLO) evolution of the parton distribution functions (PDFs) in QCD is a common tool in the lepton-hadron and hadron-hadron collider data analysis. The standard NLO DGLAP evolution is formulated for inclusive…
Many problems require to approximate an expected value by some kind of Monte Carlo (MC) sampling, e.g. molecular dynamics (MD) or simulation of stochastic reaction models (also termed kinetic Monte Carlo (kMC)). Often, we are furthermore…
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…
The QCDNUM program numerically solves the evolution equations for parton densities and fragmentation functions in perturbative QCD. Un-polarised parton densities can be evolved up to next-to-next-to-leading order in powers of the strong…
Quasi-Monte Carlo (QMC) methods for estimating integrals are attractive since the resulting estimators typically converge at a faster rate than pseudo-random Monte Carlo. However, they can be difficult to set up on arbitrary posterior…
Hamiltonian Monte Carlo (HMC) is a popular Markov chain Monte Carlo (MCMC) algorithm that generates proposals for a Metropolis-Hastings algorithm by simulating the dynamics of a Hamiltonian system. However, HMC is sensitive to large time…