Related papers: Sudakov evolution without unitarity
We present an implementation of a parton shower algorithm for hadron colliders and electron-positron colliders based on the dipole factorisation formulae. The algorithm treats initial-state partons on equal footing with final-state partons.…
We consider a gedanken experiment of the scattering of a current off a large nucleus to study the gluon saturation at the small-x limit and compute the Sudakov factor of this process through a one-loop calculation. The differential cross…
A detailed case study of $\gamma$-hadron segregation for a ground based atmospheric Cherenkov telescope is presented. We have evaluated and compared various supervised machine learning methods such as the Random Forest method, Artificial…
The performance of pre-trained masked diffusion models is often constrained by their sampling procedure, which makes decisions irreversible and struggles in low-step generation regimes. We introduce a novel sampling algorithm that works…
Scalar features in time-dependent fluid flow are traditionally visualized using 3D representation, and their topology changes over time are often conveyed with abstract graphs. Using such techniques, however, the structural details of…
The Marchenko method retrieves the responses to virtual sources in the subsurface, accounting for all orders of multiples. The method is based on two integral representations for focusing and Green's functions. In discretized form these…
This paper develops a unified and computationally efficient method for change-point estimation along the time dimension in a non-stationary spatio-temporal process. By modeling a non-stationary spatio-temporal process as a piecewise…
We extend the randomized singular value decomposition (SVD) algorithm \citep{Halko2011finding} to estimate the SVD of a shifted data matrix without explicitly constructing the matrix in the memory. With no loss in the accuracy of the…
We show that the use of Sudakov variables greatly simplifies the study of the solutions to the scattering equations in the Cachazo-He-Yuan formalism. We work in the center-of-mass frame for the two incoming particles, which partially fixes…
We propose a method to generate 3D shapes using point clouds. Given a point-cloud representation of a 3D shape, our method builds a kd-tree to spatially partition the points. This orders them consistently across all shapes, resulting in…
We demonstrate that the method of interleaved resampling in the context of parton showers can tremendously improve the statistical convergence of weighted parton shower evolution algorithms. We illustrate this by several examples showing…
Monte Carlo methods are widely used in particle physics to integrate and sample probability distributions (differential cross sections or decay rates) on multi-dimensional phase spaces. We present a Neural Network (NN) algorithm optimized…
We study phaseless sampling in spline spaces generated by B-splines with arbitrary knots. For real spline spaces, we give a necessary and sufficient condition for a sequence of sampling points to admit a local phase retrieval of any…
The rapid and accurate evaluation of convolutions with singular kernels plays crucial roles in a wide range of scientific and engineering applications. Building on the recently introduced Truncated Fourier Filtering method for smooth…
Separation of variables (SoV) is a special property of integrable models which ensures that the wavefunction has a very simple factorised form in a specially designed basis. Even though the factorisation of the wavefunction was recently…
It has been observed by several authors that well-known periodization strategies like tent or Chebychev transforms lead to remarkable results for the recovery of multivariate functions from few samples. So far, theoretical guarantees are…
The goal of this paper is to present a new efficient image segmentation method based on evolutionary computation which is a model inspired from human behavior. Based on this model, a four layer process for image segmentation is proposed…
An individual-based model of an infinite system of point particles in $\mathbb{R}^d$ is proposed and studied. In this model, each particle at random produces a finite number of new particles and disappears afterwards. The phase space for…
The Markov entropy decomposition (MED) is a recently-proposed, cluster-based simulation method for finite temperature quantum systems with arbitrary geometry. In this paper, we detail numerical algorithms for performing the required steps…
We discuss a unified approach to stochastic optimization of pseudo-Boolean objective functions based on particle methods, including the cross-entropy method and simulated annealing as special cases. We point out the need for auxiliary…