Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-23T22:15:07.202Z Has data issue: false hasContentIssue false
  • English
  • Français

TOPOLOGY OF COMPLEX NETWORKS: MODELS AND ANALYSIS

Part of: Discrete mathematics in relation to computer science Applied homological algebra and category theory Graph theory Operations research and management science

Published online by Cambridge University Press:  05 January 2017

CORRIE JACOBIEN CARSTENS
CORRIE JACOBIEN CARSTENS*
Affiliation:
Korteweg-de Vries Institute for Mathematics, University of Amsterdam, Science Park 105, 1098 XG Amsterdam, The Netherlands email [email protected]
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Keywords

random graphscomplex networksnetwork modelschain complexes

MSC classification

Primary: 05C82: Small world graphs, complex networks
Secondary: 05C80: Random graphs 55U15: Chain complexes 68R10: Graph theory (including graph drawing) 90B15: Network models, stochastic
Type
Abstracts of Australasian PhD Theses
Information
Bulletin of the Australian Mathematical Society , Volume 95 , Issue 2 , April 2017 , pp. 347 - 349
Copyright
© 2017 Australian Mathematical Publishing Association Inc. 

References

Carstens, C. J., ‘Motifs in directed acyclic networks’, in: SITIS 2013, Ninth International Conference on Signal-Image Technology Internet-Based Systems (eds. Yetongnon, K., Dipanda, A. and Chbeir, R.) (IEEE Computer Society, Tokyo, 2013), 605–611.Google Scholar
Carstens, C. J., ‘A uniform random graph model for directed acyclic networks and its effect on motif-finding’, J. Complex Networks 2 (2014), 419–430.Google Scholar
Carstens, C. J., ‘Proof of uniform sampling of binary matrices with fixed row sums and column sums for the fast curveball algorithm’, Phys. Rev. E 91 (2015), article ID 042812.Google Scholar
Carstens, C. J. and Horadam, K. J., ‘Persistent homology of collaboration networks’, Math. Probl. Eng. 2013 (2013), article ID 815035.Google Scholar
Hecker, A., Carstens, C. J. and Horadam, K. J., ‘Neighbourhood distinctiveness: an initial study’, in: Complex Networks VI, Studies in Computational Intelligence, 597 (Springer International, Switzerland, 2015), 99–110.Google Scholar
Jeffers, J., Horadam, K. J., Carstens, C. J., Rao, A. and Boztas, S., ‘Influence neighbourhoods in CiteSeer: a case study’, in: SITIS 2013, Ninth International Conference on Signal-Image Technology Internet-Based Systems (eds. Yetongnon, K., Dipanda, A. and Chbeir, R.) (IEEE Computer Society, Tokyo, 2013), 612–618.Google Scholar