Raising Graphs From Randomness to Reveal Information Networks
R\'obert P\'alovics, Andr\'as A. Bencz\'ur

TL;DR
This paper investigates the relationship between average degree growth and the power-law degree distribution exponent in evolving information networks, revealing limitations of existing models and proposing a new combined growth model.
Contribution
It introduces a novel model combining exponential growth and homophily-based edge addition to explain observed network properties.
Findings
Power-law degree distribution exponent decreases as average degree increases.
Existing models cannot simultaneously explain both phenomena.
The proposed model captures the joint behavior observed in real networks.
Abstract
We analyze the fine-grained connections between the average degree and the power-law degree distribution exponent in growing information networks. Our starting observation is a power-law degree distribution with a decreasing exponent and increasing average degree as a function of the network size. Our experiments are based on three Twitter at-mention networks and three more from the Koblenz Network Collection. We observe that popular network models cannot explain decreasing power-law degree distribution exponent and increasing average degree at the same time. We propose a model that is the combination of exponential growth, and a power-law developing network, in which new "homophily" edges are continuously added to nodes proportional to their current homophily degree. Parameters of the average degree growth and the power-law degree distribution exponent functions depend on the ratio…
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.
