Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs

\u3cp\u3eIn this paper we study weighted distances in scale-free spatial network models: hyperbolic random graphs, geometric inhomogeneous random graphs and scale-free percolation. In hyperbolic random graphs, n=Θ(e\u3csup\u3eR∕2\u3c/sup\u3e)vertices are sampled independently from the hyperbolic disk with radius R and two vertices are connected either when they are within hyperbolic distance R, or independently with a probability depending on the hyperbolic distance. In geometric inhomogeneous random graphs, and in scale-free percolation, each vertex is given an independent weight and location from an underlying measured metric space and Z\u3csup\u3ed\u3c/sup\u3e, respectively, and two vertices are connected independently with a probability that is a function of their distance and their weights. We assign independent and identically distributed (i.i.d.)weights to the edges of the obtained random graphs, and investigate the weighted distance (the length of the shortest weighted path)between two uniformly chosen vertices, called typical weighted distance. In scale-free percolation, we study the weighted distance from the origin of vertex-sequences with norm tending to infinity. In particular, we study the case when the parameters are so that the degree distribution in the graph follows a power law with exponent τ∈(2,3)(infinite variance), and the edge-weight distribution is such that it produces an explosive age-dependent branching process with power-law offspring distribution, that is, the branching process produces infinitely many individuals in finite time. We show that in all three models, typical distances within the giant/infinite component converge in distribution, that is, no re-scaling is necessary. This solves an open question in Hofstad and Komjáthy (2017). The main tools of our proof are to develop elaborate couplings of the models to infinite versions, to follow the shortest paths to infinity and then to connect these paths by using weight-dependent percolation on the graphs, that is, we delete edges attached to vertices with higher weight with higher probability. We realise the percolation using the edge-weights: only very short edges connected to high weight vertices are allowed to stay, hence establishing arbitrarily short upper bounds for connections.\u3c/p\u3