SearcharxivSearch

arXiv subjects

S. Gago

Publications and source records attributed to S. Gago.

6 recordsLinked to original sources

Exploring ESS$\nu$SB Near Water Cherenkov Detector Designs Through Graph Neural Network Flavour Identification

The ESS$\nu$SB experiment aims to measure CP violation in the leptonic sector with high precision, necessitating robust reconstruction of neutrino events in the water Cherenkov (WC) detectors. In this work, we investigate the flavour identification potential of the proposed near WC detector using graph neural network (GNN)-based classification, with a focus on variations of key detector design parameters. In particular, we study whether a smaller and/or less instrumented detector can achieve the required classification performance. Using detailed Monte Carlo simulations of charged-current (CC) neutrino interactions, we train GNN classifiers to distinguish electron and muon neutrino CC events. We find that GNN-based classification remains accurate even for detector configurations with volumes up to a factor of eight smaller than the nominal design, with only moderate degradation in classification efficiency at fixed background rejection. The resulting loss in efficiency can largely be compensated by increased exposure time. Furthermore, we demonstrate that reduced photomultiplier tube (PMT) coverage in the nominal detector has a limited impact on classification performance, provided that coverage is maintained in regions of highest signal yield, in particular near the forward end-cap.

hep-ex

Study of Supernova Neutrinos at ESSnuSB

In this paper, we have studied the sensitivity of the ESSnuSB far detector to supernova neutrinos. ESSnuSB is a proposed long-baseline neutrino experiment in Sweden, which will use a 538 kt water Cherenkov detector to probe the leptonic phase $\delta_{\rm CP}$ by studying the second oscillation maximum. However, given the very large detector volume, it will have an excellent sensitivity to supernova neutrinos if a supernova explosion occurs during the run-time of ESSnuSB. Motivated by this, we first estimate the expected event rates at the ESSnuSB far detector for three different supernova flux models and then we probe its capability to distinguish these flux models. Additionally, we also investigate the impact of systematic errors and detector efficiency. Our results show that depending on the model of the supernova neutrinos, the expected number of events detected at Earth varies significantly. Our results also show that the ESSnuSB far detector may have excellent potential in distinguishing these flux models depending upon the distance of the supernova explosion, systematic errors and detector efficiency.

hep-ex

Group Inverse of the Laplacian of Connections of Networks

In previous works the group inverse of a network obtained by some perturbations, as the deletion of a vertex, the addition of a new vertex, contraction of an edge, etc. is obtained in terms of the group inverse of the original network. In this work, two given networks are connected with some new edges and the group inverse of the new network is related with the group inverses of the two original networks. In particular, the formula for the connection of two networks by just one edge is obtained, and besides the formula for the Kirchhoff index of this kind of network.

math.CO

The inverse matrix of some circulant matrices

We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the solution of boundary value problems associated to second order linear difffference equations. Consequently, we reduce the computational cost of the problem. In particular, we recover the inverses of some well known circulant matrices whose coeffifficients are arithmetic or geometric sequences, Horadam numbers among others. We also characterize when a general symmetric circulant and tridiagonal matrix is invertible and in this case, we compute explicitly its inverse.

math.CA

Green Operators of Networks with a new vertex

Any elliptic operator defines an automorphism on the orthogonal subspace to the eigenfunctions associated with the lowest eigenvalue, whose inverse is the orthogonal Green operator. In this study, we show that elliptic Schrödinger operators on networks that have been obtained by adding a new vertex to a given network, can be seen as perturbations of the Schrödinger operators on the initial network. Therefore, the Green function on the new network can be computed in terms of the Green function of the original network.

math.SP