Alessandro Celestini

Dr. Alessandro Celestini


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 February 2021 in Online Social Networks and Media
Verified
Journal Article
Closed access
SGStefano Guarino
Stefano Guarino
FPFrancesco Pierri
Francesco Pierri
MGMarco Di Giovanni
Marco Di Giovanni
ACAlessandro Celestini
Alessandro Celestini

26 April 2021 in Future Internet
Verified
Journal Article
Open access
PDF file
SGStefano Guarino
Stefano Guarino
EMEnrico Mastrostefano
Enrico Mastrostefano
MBMassimo Bernaschi
Massimo Bernaschi
ACAlessandro Celestini
Alessandro Celestini
MCMarco Cianfriglia
Marco Cianfriglia
LZLena Rebecca Zastrow
Lena Rebecca Zastrow
The definition of suitable generative models for synthetic yet realistic social networks is a widely studied problem in the literature. By not being tied to any real data, random graph models cannot capture all the subtleties of real networks and are inadequate for many practical contexts—including areas of research, such as computational epidemiology, which are recently high on the agenda. At the same time, the so-called contact networks describe interactions, rather than relationships, and are strongly dependent on the application and on the size and quality of the sample data used to infer them. To fill the gap between these two approaches, we present a data-driven model for urban social networks, implemented and released as open source software. By using just widely available aggregated demographic and social-mixing data, we are able to create, for a territory of interest, an age-stratified and geo-referenced synthetic population whose individuals are connected by “strong ties” of two types: intra-household (e.g., kinship) or friendship. While household links are entirely data-driven, we propose a parametric probabilistic model for friendship, based on the assumption that distances and age differences play a role, and that not all individuals are equally sociable. The demographic and geographic factors governing the structure of the obtained network, under different configurations, are thoroughly studied through extensive simulations focused on three Italian cities of different size.

19 June 2023 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MBMassimo Bernaschi
Massimo Bernaschi
ACAlessandro Celestini
Alessandro Celestini
FVFlavio Vella
Flavio Vella
PDPasqua D'Ambra
Pasqua D'Ambra
We present and release in open source format a sparse linear solver which efficiently exploits heterogeneous parallel computers. The solver can be easily integrated into scientific applications that need to solve large and sparse linear systems on modern parallel computers made of hybrid nodes hosting Nvidia Graphics Processing Unit (GPU) accelerators. The work extends previous efforts of some of the authors in the exploitation of a single GPU accelerator and proposes an implementation, based on the hybrid MPI-CUDA software environment, of a Krylov-type linear solver relying on an efficient Algebraic MultiGrid (AMG) preconditioner already available in the BootCMatchG library. Our design for the hybrid implementation has been driven by the best practices for minimizing data communication overhead when multiple GPUs are employed, yet preserving the efficiency of the GPU kernels. Strong and weak scalability results of the new version of the library on well-known benchmark test cases are discussed. Comparisons with the Nvidia AmgX solution show a speedup, in the solve phase, up to 2.0x.

1 April 2022 in World Wide Web
Verified
Journal Article
Open access
PDF file
MBMassimo Bernaschi
Massimo Bernaschi
ACAlessandro Celestini
Alessandro Celestini
MCMarco Cianfriglia
Marco Cianfriglia
SGStefano Guarino
Stefano Guarino
FLFlavio Lombardi
Flavio Lombardi
EMEnrico Mastrostefano
Enrico Mastrostefano
Tor is an open source software that allows accessing various kinds of resources, known as hidden services, while guaranteeing sender and receiver anonymity. Tor relies on a free, worldwide, overlay network, managed by volunteers, that works according to the principles of onion routing in which messages are encapsulated in layers of encryption, analogous to layers of an onion. The Tor Web is the set of web resources that exist on the Tor network, and Tor websites are part of the so-called dark web. Recent research works have evaluated Tor security, its evolution over time, and its thematic organization. Nevertheless, limited information is available about the structure of the graph defined by the network of Tor websites, not to be mistaken with the network of nodes that supports the onion routing. The limited number of entry points that can be used to crawl the network, makes the study of this graph far from being simple. In the present paper we analyze two graph representations of the Tor Web and the relationship between contents and structural features, considering three crawling datasets collected over a five-month time frame. Among other findings, we show that Tor consists of a tiny strongly connected component, in which link directories play a central role, and of a multitude of services that can (only) be reached from there. From this viewpoint, the graph appears inefficient. Nevertheless, if we only consider mutual connections, a more efficient subgraph emerges, that is, probably, the backbone of social interactions in Tor.

31 March 2023 in Journal of Computational Science
Verified
Journal Article
Open access
MBMassimo Bernaschi
Massimo Bernaschi
ACAlessandro Celestini
Alessandro Celestini
MCMarco Cianfriglia
Marco Cianfriglia
SGStefano Guarino
Stefano Guarino
GIGiuseppe F. Italiano
Giuseppe F. Italiano
LZLena Rebecca Zastrow
Lena Rebecca Zastrow

18 March 2013
Verified
Conference Paper
Open access
PDF file
ACAlessandro Celestini
Alessandro Celestini
RNRocco De Nicola
Rocco De Nicola
Francesco TiezziFrancesco Tiezzi
Francesco Tiezzi
Reputation systems are nowadays widely used to support decision making in networked systems. Parties in such systems rate each other and use shared ratings to compute reputation scores that drive their interactions. The existence of reputation systems with remarkable differences calls for formal approaches to their analysis. We present a verification methodology for reputation systems that is based on the use of the coordination language Klaim and related analysis tools. First, we define a parametric Klaim specification of a reputation system that can be instantiated with different reputation models. Then, we consider stochastic specification obtained by considering actions with random (exponentially distributed) duration. The resulting specification enables quantitative analysis of properties of the considered system. Feasibility and effectiveness of our proposal is demonstrated by reporting on the analysis of two reputation models