Abstract

Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown that those real networks can be adequately modeled as random geometric graphs in hyperbolic spaces. In this paper, we present a computer program to generate such graphs. Besides real-world-like networks, the program can generate random graphs from other well-known graph ensembles, such as the soft configuration model, random geometric graphs on a circle, or Erdős–Rényi random graphs. The simulations show a good match between the expected values of different network structural properties and the corresponding empirical values measured in generated graphs, confirming the accurate behavior of the program. Program summaryProgram title: Hyperbolic graph generatorCatalogue identifier: AEXC_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEXC_v1_0.htmlProgram obtainable from: CPC Program Library, Queen’s University, Belfast, N. IrelandLicensing provisions: GNU General Public License, version 3No. of lines in distributed program, including test data, etc.: 101190No. of bytes in distributed program, including test data, etc.: 771660Distribution format: tar.gzProgramming language: C++.Computer: Any.Operating system: Any.Classification: 6.3, 4.13, 23.Nature of problem: Generation of graphs in hyperbolic spaces.Solution method: Implementation based on analytical equations.Additional comments: Can be used as a command-line tool or installed as a library to support more complex software.Running time: Depends on the number of nodes. A few seconds for the graph in the example provided.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call