3 papers
math.PR2026
Clustering without geometry in sparse networks with independent edges
Alessio Catanzaro, Remco van der Hofstad, Diego Garlaschelli
The coexistence of sparsity and clustering (non-vanishing average fraction of triangles per node) is one of the few structural features that, irrespective of finer details, are ubi…
cond-mat.stat-mech2025
Renormalization of Interacting Random Graph Models
Alessio Catanzaro, Diego Garlaschelli, Subodh P. Patil
Random graphs offer a useful mathematical representation of a variety of real world complex networks. Exponential random graphs, for example, are particularly suited towards genera…
cond-mat.stat-mech2025
A General Solution for Network Models with Pairwise Edge Coupling
Alessio Catanzaro, Subodh Patil, Diego Garlaschelli
Network Models with couplings between link pairs are the simplest models for a class of networks with Higher Order interactions. In this paper we give an analytic, general solution…