Pierpaolo Vivo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Pierpaolo Vivo has a total of 114 co-authors. Here are the top co-authors by number of shared publications:
Fabio Caccioli
Department of Computer Science, University College London, 66-72 Gower Street, London WC1E 6EA, United Kingdom
10 shared publicationsSatya N. Majumdar
LPTMS, CNRS, Université Paris-Sud, Université Paris-Saclay, 91405 Orsay, France
8 shared publicationsFrancesco Caravelli
7 shared publicationsSilvia Bartolucci
Department of Computer Science, University College London, 66-72 Gower Street, London WC1E 6EA, United Kingdom
7 shared publications- Silvia Bartolucci
UCL, London, United Kingdom
7 shared publications - Alessia Annibale
King's College London
6 shared publications
Latest Publications
- Open Access
- 27 August 2026
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 193 (9) , 118
Maximal Minimal Spacing for Random Points
From $$N+1$$ random points on a line we wish to select $$M+1$$ points so as to maximize the minimal spacing between them. We consider an initial configuration with independent and identically distributed spacings. Equivalently, the points are arrival times of a generic renewal process. For general spacing distributions, and for all $$M\le N$$ , we derive exact distributional identities for the maximal minimal spacing and obtain its asymptotic behavior. The problem admits a reformulation in terms of a threshold-resetting random walk. The walk advances by successive random increments and is reset to the origin upon exceeding a fixed threshold. The probability that the optimal spacing exceeds a given value coincides with the probability that the walk completes at least M reset cycles within N steps. This yields an exact representation in terms of first-passage functionals of the walk. The same mapping suggests a numerical scheme for the max-min spacing problem in the regime of large N and M , whose accuracy is tested against the exact results obtained here.- 27 August 2026
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 193 (9) , 118
Open AccessMaximal Minimal Spacing for Random Points
From $$N+1$$ random points on a line we wish to select $$M+1$$ points so as to maximize the minimal spacing between them. We consider an initial configuration with independent and identically distributed spacings. Equivalently, the points are arrival times of a generic renewal process. For general spacing distributions, and for all $$M\le N$$ , we derive exact distributional identities for the maximal minimal spacing and obtain its asymptotic behavior. The problem admits a reformulation in terms of a threshold-resetting random walk. The walk advances by successive random increments and is reset to the origin upon exceeding a fixed threshold. The probability that the optimal spacing exceeds a given value coincides with the probability that the walk completes at least M reset cycles within N steps. This yields an exact representation in terms of first-passage functionals of the walk. The same mapping suggests a numerical scheme for the max-min spacing problem in the regime of large N and M , whose accuracy is tested against the exact results obtained here. - Open Access
- 18 August 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (33) , 335002
Largest eigenvalue and top eigenvector statistics of large Euclidean random matrices
Euclidean random matrices arise in a wide range of physical systems where interactions are determined by spatial configurations, including disordered media and cooperative phenomena in atomic ensembles. Unlike classical random matrix ensembles, their entries are strongly correlated through the geometry of the underlying random points, making their analytical treatment challenging. While global spectral properties such as the spectral density are relatively well understood, much less is known about extremal eigenvalues and the associated eigenvectors, despite their central role in applications. Here we address the problem of characterizing the largest eigenvalue and the corresponding top eigenvector of large Euclidean random matrices with a generic symmetric kernel. For vectors in any dimension d ⩾ 1 drawn independently from a common distribution, we show that both quantities can be computed within a unified replica-based framework. In the large- N limit, the replica saddle-point equations reduce to an eigenvalue problem for a Fredholm integral operator determined by the kernel and by the underlying distribution. We then specialize this general formulation to the quadratic distance kernel, for which the Fredholm problem reduces to a finite set of d + 2 self-consistent equations. In this case, we obtain an explicit expression for the average largest eigenvalue, fully determined by low-order moments of the underlying distribution, and an analytical characterization of the density of the top eigenvector’s components. We further perform extensive numerical simulations that confirm these predictions. More broadly, our work provides a general framework to access extremal spectral properties of Euclidean random matrices.
- 18 August 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (33) , 335002
Open AccessLargest eigenvalue and top eigenvector statistics of large Euclidean random matrices
Euclidean random matrices arise in a wide range of physical systems where interactions are determined by spatial configurations, including disordered media and cooperative phenomena in atomic ensembles. Unlike classical random matrix ensembles, their entries are strongly correlated through the geometry of the underlying random points, making their analytical treatment challenging. While global spectral properties such as the spectral density are relatively well understood, much less is known about extremal eigenvalues and the associated eigenvectors, despite their central role in applications. Here we address the problem of characterizing the largest eigenvalue and the corresponding top eigenvector of large Euclidean random matrices with a generic symmetric kernel. For vectors in any dimension d ⩾ 1 drawn independently from a common distribution, we show that both quantities can be computed within a unified replica-based framework. In the large- N limit, the replica saddle-point equations reduce to an eigenvalue problem for a Fredholm integral operator determined by the kernel and by the underlying distribution. We then specialize this general formulation to the quadratic distance kernel, for which the Fredholm problem reduces to a finite set of d + 2 self-consistent equations. In this case, we obtain an explicit expression for the average largest eigenvalue, fully determined by low-order moments of the underlying distribution, and an analytical characterization of the density of the top eigenvector’s components. We further perform extensive numerical simulations that confirm these predictions. More broadly, our work provides a general framework to access extremal spectral properties of Euclidean random matrices.
- Open Access
- 29 July 2026
- Published by Elsevier in SSRN Electronic Journal
Queue & AI: When Faster Tasks Slow Down the Workflow
Quantifying the workplace productivity effects of Generative Artificial Intelligence is now central to economics, management, and public policy. The deployment of AI tools in customer service, writing, software development, and consulting operations has been reported to generate large per-task productivity gains, typically measured as tasks completed per worker-hour or reductions in mean handle time. We argue that such mean-based metrics can misrepresent AI's effects in workflows where tasks accumulate and compete for scarce human attention. AI assistance can generate a deceptive productivity signature: average completion times fall because AI tools typically supply a fast first draft, yet workflow-level performance deteriorates when a subset of AI errors escapes review and returns as costly downstream rework. We call this divergence between mean task speed and system-level delay the variance wedge. Depending on the operational parameters, the most time-efficient way to complete a workflow may undergo a transition between two task-processing regimes, a fully AI-assisted and a fully manual one. We formalize the mechanism as a queueing model and derive two main implications analytically. First, under congestion, reviewers rationally raise the risk threshold for checking AI outputs, reducing scrutiny precisely when it would matter the most. Second, AI assistance can stabilize an overloaded workflow only when (i) the fraction of tasks handled by AI exceeds a critical threshold, and (ii) the human attention required for review and expected rework is lower than the attention for manual completion, a requirement substantially more stringent than faster draft generation. These results suggest that AI deployment should be evaluated not only by average task speed, but by its overall effects on congestion, rework, and the robustness of human oversight under load.
- 29 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessQueue & AI: When Faster Tasks Slow Down the Workflow
Quantifying the workplace productivity effects of Generative Artificial Intelligence is now central to economics, management, and public policy. The deployment of AI tools in customer service, writing, software development, and consulting operations has been reported to generate large per-task productivity gains, typically measured as tasks completed per worker-hour or reductions in mean handle time. We argue that such mean-based metrics can misrepresent AI's effects in workflows where tasks accumulate and compete for scarce human attention. AI assistance can generate a deceptive productivity signature: average completion times fall because AI tools typically supply a fast first draft, yet workflow-level performance deteriorates when a subset of AI errors escapes review and returns as costly downstream rework. We call this divergence between mean task speed and system-level delay the variance wedge. Depending on the operational parameters, the most time-efficient way to complete a workflow may undergo a transition between two task-processing regimes, a fully AI-assisted and a fully manual one. We formalize the mechanism as a queueing model and derive two main implications analytically. First, under congestion, reviewers rationally raise the risk threshold for checking AI outputs, reducing scrutiny precisely when it would matter the most. Second, AI assistance can stabilize an overloaded workflow only when (i) the fraction of tasks handled by AI exceeds a critical threshold, and (ii) the human attention required for review and expected rework is lower than the attention for manual completion, a requirement substantially more stringent than faster draft generation. These results suggest that AI deployment should be evaluated not only by average task speed, but by its overall effects on congestion, rework, and the robustness of human oversight under load.
- Open Access
- 18 May 2026
- Published by Oxford University Press (OUP) in PNAS Nexus
- Vol. 5 (6) , pgag170
DebtStreamness: an ecological approach to credit flows in interfirm networks
Understanding how credit flows through interfirm networks is critical for assessing financial stability and systemic risk. In this study, we introduce DebtStreamness (DS), a metric inspired by trophic levels in ecological food webs, to quantify the position of firms within credit chains. By viewing credit as the primary energy source of the economy, we measure how far credit travels through interfirm relationships before reaching its final borrowers. Applying this framework to Uruguay’s interfirm credit and financial institutions-firm networks, using credit registry and survey data from the Central Bank, we find that credit chains are generally short, with a tiered structure in which some firms act as intermediaries, lending to others further along the chain. We also find that local network motifs such as loops can substantially increase a firm’s DS, even when its direct borrowing from financial institutions remains the same. Comparing our results with standard economic classifications based on input–output linkages, we find that DS captures distinct financial structures not visible through production data. We further validate our approach using two maximum-entropy network reconstruction methods, demonstrating the robustness of DS in capturing systemic credit structures. These results suggest that DS offers a complementary ecological perspective on systemic credit risk and highlights the role of hidden financial intermediation in firm networks.
- 18 May 2026
- Published by Oxford University Press (OUP) in PNAS Nexus
- Vol. 5 (6) , pgag170
Open AccessDebtStreamness: an ecological approach to credit flows in interfirm networks
Understanding how credit flows through interfirm networks is critical for assessing financial stability and systemic risk. In this study, we introduce DebtStreamness (DS), a metric inspired by trophic levels in ecological food webs, to quantify the position of firms within credit chains. By viewing credit as the primary energy source of the economy, we measure how far credit travels through interfirm relationships before reaching its final borrowers. Applying this framework to Uruguay’s interfirm credit and financial institutions-firm networks, using credit registry and survey data from the Central Bank, we find that credit chains are generally short, with a tiered structure in which some firms act as intermediaries, lending to others further along the chain. We also find that local network motifs such as loops can substantially increase a firm’s DS, even when its direct borrowing from financial institutions remains the same. Comparing our results with standard economic classifications based on input–output linkages, we find that DS captures distinct financial structures not visible through production data. We further validate our approach using two maximum-entropy network reconstruction methods, demonstrating the robustness of DS in capturing systemic credit structures. These results suggest that DS offers a complementary ecological perspective on systemic credit risk and highlights the role of hidden financial intermediation in firm networks.
- Open Access
- 13 April 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (17)
The most dispersed subset of random points in R d
Consider a population of N individuals, each having d ≥ 1 different traits, and an additive measure, called dispersion, which rewards large pairwise separations between traits. The goal is to select M ≤ N individuals such that their traits are as dispersed as possible. We compute analytically the full statistics (including large deviation tails) of the maximally achievable dispersion among sub-populations of size M when the traits are independent and identically distributed. Two complementary approaches are developed, one based on a mean-field theory for order statistics, and the other on the replica method from the field of disordered systems. In all dimensions d, and for rotationally symmetric distributions, the optimal subset for large populations consists of all points lying outside a d-dimensional ball whose radius is determined self-consistently. For a single trait (d = 1), the statistics of the maximal dispersion can be tackled for finite N, M as well. The formulae we obtained are corroborated by numerical simulations on small instances and by heuristic algorithms that find nearoptimal solutions.
- 13 April 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (17)
Open AccessThe most dispersed subset of random points in R d
Consider a population of N individuals, each having d ≥ 1 different traits, and an additive measure, called dispersion, which rewards large pairwise separations between traits. The goal is to select M ≤ N individuals such that their traits are as dispersed as possible. We compute analytically the full statistics (including large deviation tails) of the maximally achievable dispersion among sub-populations of size M when the traits are independent and identically distributed. Two complementary approaches are developed, one based on a mean-field theory for order statistics, and the other on the replica method from the field of disordered systems. In all dimensions d, and for rotationally symmetric distributions, the optimal subset for large populations consists of all points lying outside a d-dimensional ball whose radius is determined self-consistently. For a single trait (d = 1), the statistics of the maximal dispersion can be tackled for finite N, M as well. The formulae we obtained are corroborated by numerical simulations on small instances and by heuristic algorithms that find nearoptimal solutions.
- 2 August 2025
- Published by Springer Nature
- p. 187-234
Random Linear Systems with Quadratic Constraints: from Random Matrix Theory to Replicas and Back
- 2 August 2025
- Published by Springer Nature
- p. 187-234
Random Linear Systems with Quadratic Constraints: from Random Matrix Theory to Replicas and Back
- Open Access
- 2 June 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (22) , 225201
Statistics of the non-zero eigenvalues and singular values of low-rank random matrices with non-negative entries
We compute analytically the probability distribution and moments of the sum and product of the non-zero eigenvalues and singular values of random matrices with (i) non-negative entries, (ii) fixed rank, and (iii) prescribed sums of the entries in each row. Applications of such matrices are discussed in the context of Markov chains, economics and social networks to name a few. All results are valid at finite matrix size and are given in terms of the statistics of vectors of general Dirichlet random variables. Analytical results are corroborated by numerical simulations throughout with excellent agreement.
- 2 June 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (22) , 225201
Open AccessStatistics of the non-zero eigenvalues and singular values of low-rank random matrices with non-negative entries
We compute analytically the probability distribution and moments of the sum and product of the non-zero eigenvalues and singular values of random matrices with (i) non-negative entries, (ii) fixed rank, and (iii) prescribed sums of the entries in each row. Applications of such matrices are discussed in the context of Markov chains, economics and social networks to name a few. All results are valid at finite matrix size and are given in terms of the statistics of vectors of general Dirichlet random variables. Analytical results are corroborated by numerical simulations throughout with excellent agreement.
- Open Access
- 13 May 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (32)
Top eigenpair statistics of diluted Wishart matrices
Using the replica method, we compute the statistics of the top eigenpair of diluted covariance matrices of the form $\bm J = \bm X^T \bm X$, where $\bm X$ is a $N\times M$ sparse data matrix, in the limit of large $N,M$ with fixed ratio and a bounded number of nonzero entries. We allow for random non-zero weights, provided they lead to an isolated largest eigenvalue. By formulating the problem as the optimisation of a quadratic Hamiltonian constrained to the $N$-sphere at low temperatures, we derive a set of recursive distributional equations for auxiliary probability density functions, which can be efficiently solved using a population dynamics algorithm. The average largest eigenvalue is identified with a Lagrange parameter that governs the convergence of the algorithm, and the resulting stable populations are then used to evaluate the density of the top eigenvector's components. We find excellent agreement between our analytical results and numerical results obtained from direct diagonalisation.- 13 May 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (32)
Open AccessTop eigenpair statistics of diluted Wishart matrices
Using the replica method, we compute the statistics of the top eigenpair of diluted covariance matrices of the form $\bm J = \bm X^T \bm X$, where $\bm X$ is a $N\times M$ sparse data matrix, in the limit of large $N,M$ with fixed ratio and a bounded number of nonzero entries. We allow for random non-zero weights, provided they lead to an isolated largest eigenvalue. By formulating the problem as the optimisation of a quadratic Hamiltonian constrained to the $N$-sphere at low temperatures, we derive a set of recursive distributional equations for auxiliary probability density functions, which can be efficiently solved using a population dynamics algorithm. The average largest eigenvalue is identified with a Lagrange parameter that governs the convergence of the algorithm, and the resulting stable populations are then used to evaluate the density of the top eigenvector's components. We find excellent agreement between our analytical results and numerical results obtained from direct diagonalisation. - Open Access
- 5 March 2025
- Published by Elsevier in Journal of Economic Behavior & Organization
- Vol. 233
Correlation between upstreamness and downstreamness in random global value chains
- 5 March 2025
- Published by Elsevier in Journal of Economic Behavior & Organization
- Vol. 233
Open AccessCorrelation between upstreamness and downstreamness in random global value chains
- Open Access
- 21 January 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-17
Upstreamness and downstreamness in input–output analysis from local and aggregate information
Ranking sectors and countries within global value chains is of paramount importance to estimate risks and forecast growth in large economies. However, this task is often non-trivial due to the lack of complete and accurate information on the flows of money and goods between sectors and countries, which are encoded in input–output (I–O) tables. In this work, we show that an accurate estimation of the role played by sectors and countries in supply chain networks can be achieved without full knowledge of the I–O tables, but only relying on local and aggregate information, e.g., the total intermediate demand per sector. Our method, based on a rank-1 approximation to the I–O table, shows consistently good performance in reconstructing rankings (i.e., upstreamness and downstreamness measures for countries and sectors) when tested on empirical data from the world input–output database. Moreover, we connect the accuracy of our approximate framework with the spectral properties of the I–O tables, which ordinarily exhibit relatively large spectral gaps. Our approach provides a fast and analytically tractable framework to rank constituents of a complex economy without the need of matrix inversions and the knowledge of finer intersectorial details.
- 21 January 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-17
Open AccessUpstreamness and downstreamness in input–output analysis from local and aggregate information
Ranking sectors and countries within global value chains is of paramount importance to estimate risks and forecast growth in large economies. However, this task is often non-trivial due to the lack of complete and accurate information on the flows of money and goods between sectors and countries, which are encoded in input–output (I–O) tables. In this work, we show that an accurate estimation of the role played by sectors and countries in supply chain networks can be achieved without full knowledge of the I–O tables, but only relying on local and aggregate information, e.g., the total intermediate demand per sector. Our method, based on a rank-1 approximation to the I–O table, shows consistently good performance in reconstructing rankings (i.e., upstreamness and downstreamness measures for countries and sectors) when tested on empirical data from the world input–output database. Moreover, we connect the accuracy of our approximate framework with the spectral properties of the I–O tables, which ordinarily exhibit relatively large spectral gaps. Our approach provides a fast and analytically tractable framework to rank constituents of a complex economy without the need of matrix inversions and the knowledge of finer intersectorial details.