Self-learning Mutual Selection Model for Weighted Networks

Physics – Physics and Society

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, 5 figures

Scientific paper

In this paper, we propose a self-learning mutual selection model to characterize weighted evolving networks. By introducing the self-learning probability $p$ and the general mutual selection mechanism, which is controlled by the parameter $m$, the model can reproduce scale-free distributions of degree, weight and strength, as found in many real systems. The simulation results are consistent with the theoretical predictions approximately. Interestingly, we obtain the nontrivial clustering coefficient $C$ and tunable degree assortativity $r$, depending on the parameters $m$ and $p$. The model can unify the characterization of both assortative and disassortative weighted networks. Also, we find that self-learning may contribute to the assortative mixing of social networks.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Self-learning Mutual Selection Model for Weighted Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-learning Mutual Selection Model for Weighted Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-learning Mutual Selection Model for Weighted Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-507916

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.