arXiv subjects

G. Innocenti

Publications and source records attributed to G. Innocenti.

3 recordsLinked to original sources

arXiv2025

Physics with high-luminosity proton-nucleus collisions at the LHC

The physics case for the operation of high-luminosity proton-nucleus ($pA$) collisions during Run 3 and 4 at the LHC is reviewed. The collection of $\mathcal{O}$(1-10 pb$^{-1}$) of proton-lead ($p$Pb) collisions at the LHC will provide unique physics opportunities in a broad range of topics including proton and nuclear parton distribution functions (PDFs and nPDFs), generalised parton distributions (GPDs), transverse momentum dependent PDFs (TMDs), low-$x$ QCD and parton saturation, hadron spectroscopy, baseline studies for quark-gluon plasma and parton collectivity, double and triple parton scatterings (DPS/TPS), photon-photon collisions, and physics beyond the Standard Model (BSM); which are not otherwise as clearly accessible by exploiting data from any other colliding system at the LHC. This report summarises the accelerator aspects of high-luminosity $pA$ operation at the LHC, as well as each of the physics topics outlined above, including the relevant experimental measurements that motivate -- much -- larger $pA$ datasets.

hep-ph↗

arXiv2011

Model Identification of a Network as Compressing Sensing

In many applications, it is important to derive information about the topology and the internal connections of dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology, and unveiling an unknown structure as the estimate of a "sparse Wiener filter". A geometric interpretation of the problem in a pre-Hilbert space for wide-sense stochastic processes is provided. We cast the problem as the optimization of a cost function where a set of parameters are used to operate a trade-off between accuracy and complexity in the final model. The problem of reducing the complexity is addressed by fixing a certain degree of sparsity and finding the solution that "better" satisfies the constraints according to the criterion of approximation. Applications starting from real data and numerical simulations are provided.

math.DS↗

arXiv2008

Econometrics as Sorcery

The paper deals with the problem of identifying the internal dependencies and similarities among a large number of random processes. Linear models are considered to describe the relations among the time series and the energy associated to the corresponding modeling error is the criterion adopted to quantify their similarities. Such an approach is interpreted in terms of graph theory suggesting a natural way to group processes together when one provides the best model to explain the other. Moreover, the clustering technique introduced in this paper will turn out to be the dynamical generalization of other multivariate procedures described in literature.

q-fin.ST↗