Dynamic, smallworld social network generation through ...
24
Dynamic, small-world social network generation through local agent interactions Article (Accepted Version) http://sro.sussex.ac.uk De Caux, Robert, Smith, Christopher, Kniveton, Dominic, Black, Richard and Philippides, Andrew (2014) Dynamic, small-world social network generation through local agent interactions. Complexity, 19 (6). pp. 44-53. ISSN 1076-2787 This version is available from Sussex Research Online: http://sro.sussex.ac.uk/id/eprint/68738/ This document is made available in accordance with publisher policies and may differ from the published version or from the version of record. If you wish to cite this item you are advised to consult the publisher’s version. Please see the URL above for details on accessing the published version. Copyright and reuse: Sussex Research Online is a digital repository of the research output of the University. Copyright and all moral rights to the version of the paper presented here belong to the individual author(s) and/or other copyright owners. To the extent reasonable and practicable, the material made available in SRO has been checked for eligibility before being made available. Copies of full text items generally can be reproduced, displayed or performed and given to third parties in any format or medium for personal research or study, educational, or not-for-profit purposes without prior permission or charge, provided that the authors, title and full bibliographic details are credited, a hyperlink and/or URL is given for the original metadata page and the content is not changed in any way.
Transcript of Dynamic, smallworld social network generation through ...
Dynamic, smallworld social network generation through local agent interactions
Article (Accepted Version)
http://sro.sussex.ac.uk
De Caux, Robert, Smith, Christopher, Kniveton, Dominic, Black, Richard and Philippides, Andrew (2014) Dynamic, small-world social network generation through local agent interactions. Complexity, 19 (6). pp. 44-53. ISSN 1076-2787
This version is available from Sussex Research Online: http://sro.sussex.ac.uk/id/eprint/68738/
This document is made available in accordance with publisher policies and may differ from the published version or from the version of record. If you wish to cite this item you are advised to consult the publisher’s version. Please see the URL above for details on accessing the published version.
Copyright and reuse: Sussex Research Online is a digital repository of the research output of the University.
Copyright and all moral rights to the version of the paper presented here belong to the individual author(s) and/or other copyright owners. To the extent reasonable and practicable, the material made available in SRO has been checked for eligibility before being made available.
Copies of full text items generally can be reproduced, displayed or performed and given to third parties in any format or medium for personal research or study, educational, or not-for-profit purposes without prior permission or charge, provided that the authors, title and full bibliographic details are credited, a hyperlink and/or URL is given for the original metadata page and the content is not changed in any way.
0
10
20
30
40
50
60
70
1000 2000 3000 4000 5000 6000 7000 8000 9000 10000
S score as a function of maximum node age
Clustering percentageMean shortest path
Average node degreeS score
0
10
20
30
40
50
60
70
0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2
S score as a function of global gravity
0
10
20
30
40
50
60
70
0 0.002 0.004 0.006 0.008 0.01 0.012 0.014 0.016 0.018 0.02
S score as a function of global range
Clustering percentageMean shortest path
Average node degreeS score
0
10
20
30
40
50
60
70
0 1 2 3 4 5 6 7 8 9 10
S score as a function of local range
0 10
20 30
40 50
60 70 0
2 4
6 8
10
0
5
10
15
20
0
2
4
6
8
10
0 10 20 30 40 50 60 70
0
0.2
0.4
0.6
0.8
1
0 2000 4000 6000 8000 10000
Unconstrained agent movement
4+432
0
0.2
0.4
0.6
0.8
1
0 2000 4000 6000 8000 10000
Agent movement constrained by neighbours
4+432
0
0.2
0.4
0.6
0.8
1
0 100 200 300 400 500 600 700 800 900 1000
N1N2N3N4
