Mutual attraction model for both assortative and disassortative weighted networks

Area of Science:

• Network Science
• Statistical Physics
• Complex Systems

Background:

• Complex networks often exhibit emergent properties arising from pairwise node interactions.
• Understanding the dynamics of weighted evolving networks is crucial for modeling real-world systems.

Purpose of the Study:

• To propose a novel mutual attraction model for characterizing weighted evolving networks.
• To demonstrate the model's ability to reproduce key network properties like scale-free distributions.

Main Methods:

• Development of a mathematical model incorporating initial attractiveness (A) and a mutual attraction mechanism (m).
• Simulations to validate theoretical predictions and analyze network characteristics.
• Analysis of degree, weight, strength distributions, clustering coefficient (C), and degree assortativity (r).

Main Results:

• The model naturally reproduces scale-free distributions for degree, weight, and strength.
• Achieved nontrivial clustering coefficient (C) and tunable degree assortativity (r) based on model parameters (m, A).
• Simulation results align with theoretical predictions.

Conclusions:

• The proposed mutual attraction model provides a general framework for weighted evolving networks.
• It unifies the characterization of both assortative and disassortative weighted networks.
• The model's flexibility allows for capturing diverse network behaviors.