Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Clustering and the hyperbolic geometry of complex networks

Tools
- Tools
+ Tools

Candellero, Elisabetta and Fountoulakis, Nikolaos (2014) Clustering and the hyperbolic geometry of complex networks. In: Bonato , Anthony and Graham , Fan Chung and Prałat , Paweł , (eds.) Algorithms and Models for the Web Graph : 11th International Workshop, WAW 2014, Beijing, China, December 17-18, 2014, Proceedings. Lecture Notes in Computer Science, 8882 . Springer, pp. 1-12. ISBN 9783319131221

[img]
Preview
PDF
WRAP_1272725-st-260815-paper8waw14.pdf - Accepted Version - Requires a PDF viewer.

Download (507Kb) | Preview
Official URL: http://dx.doi.org/10.1007/978-3-319-13123-8_1

Request Changes to record.

Abstract

Clustering is a fundamental property of complex networks and it is the mathematical expression of a ubiquitous phenomenon that arises in various types of self-organized networks such as biological networks, computer networks or social networks. In this paper, we consider what is called the global clustering coefficient of random graphs on the hyperbolic plane. This model of random graphs was proposed recently by Krioukov et al. [22] as a mathematical model of complex networks, implementing the assumption that hyperbolic geometry underlies the structure of these networks. We do a rigorous analysis of clustering and characterize the global clustering coefficient in terms of the parameters of the model. We show how the global clustering coefficient can be tuned by these parameters, giving an explicit formula.

Item Type: Book Item
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science, Engineering and Medicine > Science > Statistics
Library of Congress Subject Headings (LCSH): Geometry, Hyperbolic, Computational complexity
Series Name: Lecture Notes in Computer Science
Publisher: Springer
ISBN: 9783319131221
ISSN: 0302-9743
Book Title: Algorithms and Models for the Web Graph : 11th International Workshop, WAW 2014, Beijing, China, December 17-18, 2014, Proceedings
Editor: Bonato , Anthony and Graham , Fan Chung and Prałat , Paweł
Official Date: 13 November 2014
Dates:
DateEvent
13 November 2014Published
Volume: 8882
Page Range: pp. 1-12
DOI: 10.1007/978-3-319-13123-8_1
Status: Peer Reviewed
Publication Status: Published
Date of first compliant deposit: 31 December 2015
Date of first compliant Open Access: 31 December 2015

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us