The location of high-degree vertices in weighted recursive graphs with bounded random weights
Bas Lodewijks

TL;DR
This paper investigates the asymptotic location of high-degree vertices in weighted recursive graphs with bounded random weights, confirming a conjecture and extending known results from simpler models to more general graph structures.
Contribution
It establishes the existence of a critical exponent for the label size of maximum degree vertices in WRGs and extends prior results from RRT to weighted recursive graphs.
Findings
Existence of a critical exponent _m for label size growth.
Almost sure convergence of label size to n^{_m} for maximum degree vertices.
Joint convergence of degree and label for high-degree vertices in WRT models.
Abstract
We study the asymptotic growth rate of the label size of high-degree vertices in weighted recursive graphs (WRG) when the weights are i.i.d. almost surely bounded random variables, and as a result confirm a conjecture by Lodewijks and Ortgiese. WRGs are a generalisation of the random recursive tree (RRT) and directed acyclic graph model (DAG), in which vertices are assigned vertex-weights and where new vertices attach to predecessors, each selected independently with a probability proportional to the vertex-weight of the predecessor. Prior work established the asymptotic growth rate of the maximum degree of the WRG model and here we show that there exists a critical exponent , such that the typical label size of the maximum degree vertex equals almost surely as , the size of the graph, tends to infinity. These results extend and improve on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Complex Network Analysis Techniques · Markov Chains and Monte Carlo Methods
