Summary

Proceedings of the 2012 International Symposium on Nonlinear Theory and its Applications

2012

Session Number:A4L-B

Session:

Number:243

Strongly assortative networks: creation, structure and dynamics

Michael Small,  

pp.243-246

Publication Date:

Online ISSN:2188-5079

DOI:10.15248/proc.1.243

PDF download (759KB)

Finite realizations of archetypal complex networks (including, most notably, the preferential attachment model) are typically mildly disassortative — in part due to the attachment of the most recent nodes, with fewest links, directly to the hubs. In contrast, the extant collection of real world networks exhibits a very wide range of assortativity. In this paper we explore both this bias and the opposite end of the spectrum: what can be done to make strongly assortative networks, what do they look like and, what effect does this have on the dynamical behaviour of such systems.

[1] A. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.

[2] K. Judd and A. Mees. On selecting models for nonlinear time series. Physica D, 82:426-444, 1995.

[3] P. Li, J. Zhang, and M. Small. Emergence of scaling and assortative mixing through altruism. Physica A, 390:2192-2197, 2011.

[4] M. Newman. Networks: An Introduction. Oxford University Press, 2010.

[5] M. Small and C. Tse. Minimum description length neural networks for time series prediction. Physical Review E, 66:066701, 2002.

[6] M. Small, X. Xiao-Ke, J. Zhou, J. Zhang, and J. an Lu. Scale-free networks with high assortativity are not small-world. Physical Review E, 77(066112), 2008.

[7] D. J. Watts and S. H. Strogatz. Collective dynamics of ‘small-world' networks. Nature, 393:440-442, 1998.