Scale-free networks with self-growing weight
Takuma Tanaka, Toshio Aoyagi

TL;DR
This paper introduces a new weighted scale-free network model where link weights grow independently of node attachment, allowing for analytical derivation of properties and better modeling of certain social networks.
Contribution
The paper proposes a novel self-growing weight mechanism in scale-free networks, enhancing understanding of weight distribution and network evolution.
Findings
Weight distribution follows a specific analytical form
Model accurately describes some social networks
Links' weights grow independently of node attachment
Abstract
We present a novel type of weighted scale-free network model, in which the weight grows independently of the attachment of new nodes. The evolution of this network is thus determined not only by the preferential attachment of new nodes to existing nodes but also by self-growing weight of existing links based on a simple weight-driven rule. This model is analytically tractable, so that the various statistical properties, such as the distribution of weight, can be derived. Finally, we found that some type of social networks is well described by this model.
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
TopicsModular Robots and Swarm Intelligence · Evolutionary Algorithms and Applications
