In this paper, we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for ...

This is a preview. Log in through your library . Abstract In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a ...

Efficiently and quickly chewing through one trillion edges of a complex graph is no longer in itself a standalone achievement, but doing so on a single node, albeit with some acceleration and ...