PCPasquale Casaburi

Pasquale Casaburi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Pasquale Casaburi has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Largest eigenvalue and top eigenvector statistics of large Euclidean random matrices

    by Pasquale Casaburi, Pierpaolo Vivo

    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

    Data as Commodity: a Game-Theoretic Principle for Information Pricing

    by Pasquale Casaburi, Giovanni Piccioli, Pierpaolo Vivo

    Data is the central commodity of the digital economy. Unlike physical goods, it is non-rival, replicable at near-zero cost, and traded under heterogeneous licensing rules. These properties defy standard supply--demand theory and call for new pricing principles. We propose a game-theoretic approach in which the value of a data string emerges from strategic competition among N players betting on an underlying stochastic process, each holding partial information about past outcomes. A better-informed player faces a choice: exploit their informational advantage, or sell part of their dataset to less-informed competitors. By analytically computing the Nash equilibrium of the game, we determine the price range where the trade is beneficial to both buyer and seller. We uncover a rich landscape of market effects that diverge from textbook economics: first, prospective sellers and buyers can compete or jointly exploit the less informed competitors depending on the quality of data they hold. In a symbiotic regime, the seller can even share data for free while still improving her payoffs, showing that losing exclusivity does not necessarily reduce profit. Moreover, rivalry between well-informed players can paradoxically benefit uninformed ones, demonstrating that information abundance does not always translate to higher payoffs. We also show that the number of players influences the competition between informed parties: trades impossible in small markets become feasible in larger ones. These findings establish a theoretical foundation for the pricing of intangible goods in dynamically interacting digital markets, which are in need of robust valuation principles.