Inhomogeneous random graphs with infinite-mean fitness variables

Abstract

We consider an inhomogeneous Erdős-Rényi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of the graph. This model was recently investigated in the physics literature in Garuccio et al. (2020) as a scale-invariant random graph within the context of network renormalization. From a mathematical perspective, the model fits in the class of scale-free inhomogeneous random graphs whose asymptotic geometrical features have been recently attracting interest. While for this type of graphs several results are known when the underlying vertex variables have finite mean and variance, here instead we consider the case of one-sided stable variables with necessarily infinite mean. To simplify our analysis, we assume that the variables are sampled from a Pareto distribution with parameter $\alpha \in (0,1)$. We start by characterizing the asymptotic distributions of the typical degrees and some related observables. In particular, we show that the degree of a vertex converges in distribution, after proper scaling, to a mixed Poisson law. We then show that correlations among degrees of different vertices are asymptotically non-vanishing, but at the same time a form of asymptotic tail independence is found when looking at the behavior of the joint Laplace transform around zero. Moreover, we present some findings concerning the asymptotic density of wedges and triangles and show a cross-over for the existence of dust (i.e. disconnected vertices).

substantially revised version. The previous version had some errors and they are fixed now in the present version

References in corpus (14)

• Origins of fractality in the growth of complex networks
• The phase transition in inhomogeneous random graphs
• Class of correlated random networks with hidden variables
• Network Geometry
• Spectral coarse-graining of complex networks
• Multiscale unfolding of real networks by geometric renormalization
• Self-organized network evolution coupled to extremal dynamics
• Laplacian Renormalization Group for heterogeneous networks
• Local clustering in scale-free networks with hidden variables
• Renormalization flows in complex networks
• Structures in supercritical scale-free percolation
• Detecting hyperbolic geometry in networks: why triangles are not enough
• Network Renormalization
• Multiscale network renormalization: scale-invariance without geometry