Related papers: On stochastically sampling color configurations
We study one of the key tools in data approximation and optimization: low-discrepancy colorings. Formally, given a finite set system $(X,\mathcal S)$, the \emph{discrepancy} of a two-coloring $\chi:X\to\{-1,1\}$ is defined as $\max_{S \in…
We present and discuss the development of an unconditionally stable algorithm used to solve the evolution equations of the Phase Field Crystal (PFC) model. This algorithm allows for an arbitrarily large algorithmic time step. As the basis…
Quantum error correction is an essential ingredient for reliable quantum computation for theoretically provable quantum speedup. Topological color codes, one of the quantum error correction codes, have an advantage against the surface codes…
We study the foundations of variational inference, which frames posterior inference as an optimisation problem, for probabilistic programming. The dominant approach for optimisation in practice is stochastic gradient descent. In particular,…
We have implemented two recently proposed dipole shower algorithms that have next-to-leading-logarithmic accuracy at leading colour in the Herwig event generator. We study their properties and compare them to Herwig's existing dipole and…
We introduce a novel algorithm that leverages stochastic sampling techniques to compute the perturbative triples correction in the coupled-cluster (CC) framework. By combining elements of randomness and determinism, our algorithm achieves a…
In this paper, we study various conceptual and practical aspects of using maximum-entropy reweighting to upgrade parton-shower event samples based on higher-accuracy theoretical constraints. Our approach produces strictly positive per-event…
It is a well known fact that sequential algorithms which exhibit a strong "local" nature can be adapted to the distributed setting given a legal graph coloring. The running time of the distributed algorithm will then be at least the number…
We show how a careful analysis of the behaviour of a parton shower Monte Carlo in the vicinity of the soft and collinear regions allows one to formulate a modified MC@NLO-matching prescription that reduces the number of negative-weight…
We present an implementation of an explainable and physics-aware machine learning model capable of inferring the underlying physics of high-energy particle collisions using the information encoded in the energy-momentum four-vectors of the…
New sets of CMS underlying-event parameters ("tunes") are presented for the PYTHIA8 event generator. These tunes use the NNPDF3.1 parton distribution functions (PDFs) at leading (LO), next-to-leading (NLO), or next-to-next-to-leading (NNLO)…
Let $C_1,\dots,C_{d+1}\subset \mathbb{R}^d$ be $d+1$ point sets, each containing the origin in its convex hull. We call these sets color classes, and we call a sequence $p_1, \dots, p_{d+1}$ with $p_i \in C_i$, for $i = 1, \dots, d+1$, a…
We discuss the necessary steps for implementing an angularly ordered (AO) electroweak (EW) parton shower in Herwig 7 multi-purpose event generator. This includes calculating the helicity-dependent quasi-collinear EW branching functions that…
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to…
We report on a high-precision calculation of the Bhabha process in Quantum Electrodynamics, of interest for precise luminosity determination of electron-positron colliders involved in R measurements in the region of hadronic resonances. The…
Regressing the illumination of a scene from the representations of object appearances is popularly adopted in computational color constancy. However, it's still challenging due to intrinsic appearance and label ambiguities caused by unknown…
Probabilistic solvers for ordinary differential equations (ODEs) provide efficient quantification of numerical uncertainty associated with simulation of dynamical systems. Their convergence rates have been established by a growing body of…
We present the Chromatic Persistence Algorithm (CPA), an event-driven method for computing persistent cohomological features of weighted graphs via graphic arrangements, a classical object in computational geometry. We establish rigorous…
This paper introduces a natural generalization of the classical edge coloring problem in graphs that provides a useful abstraction for two well-known problems in multicast switching. We show that the problem is NP-hard and evaluate the…
The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…