# Computing the Gromov hyperbolicity constant of a discrete metric space

- Handle URI:
- http://hdl.handle.net/10754/244575
- Title:
- Computing the Gromov hyperbolicity constant of a discrete metric space
- Authors:
- Abstract:
- Although it was invented by Mikhail Gromov, in 1987, to describe some family of groups[1], the notion of Gromov hyperbolicity has many applications and interpretations in different fields. It has applications in Biology, Networking, Graph Theory, and many other areas of research. The Gromov hyperbolicity constant of several families of graphs and geometric spaces has been determined. However, so far, the only known algorithm for calculating the Gromov hyperbolicity constant of a discrete metric space is the brute force algorithm with running time O (n4) using the four- point condition. In this thesis, we first introduce an approximation algorithm which calculates a O (log n)-approximation of the hyperbolicity constant , based on a layering approach, in time O (n2), where n is the number of points in the metric space. We also calculate the fixed base point hyperbolicity constant r for a fixed point r using a (max; min)matrix multiplication algorithm by Duan in time O (n2:688) [2]. We use this result to present a 2-approximation algorithm for calculating the hyperbolicity constant in time O (n2:688). We also provide an exact algorithm to compute the hyperbolicity constant in time O (n3:688) for a discrete metric space. We then present some partial results we obtained for designing some approximation algorithms to compute the hyperbolicity constant.
- Advisors:
- Committee Member:
- KAUST Department:
- Program:
- Issue Date:
- Jul-2012
- Type:
- Thesis

- Appears in Collections:
- Theses; Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

# Full metadata record

DC Field | Value | Language |
---|---|---|

dc.contributor.advisor | Vigneron, Antoine E. | en |

dc.contributor.author | Ismail, Anas | en |

dc.date.accessioned | 2012-09-18T09:12:12Z | - |

dc.date.available | 2012-09-18T09:12:12Z | - |

dc.date.issued | 2012-07 | en |

dc.identifier.uri | http://hdl.handle.net/10754/244575 | en |

dc.description.abstract | Although it was invented by Mikhail Gromov, in 1987, to describe some family of groups[1], the notion of Gromov hyperbolicity has many applications and interpretations in different fields. It has applications in Biology, Networking, Graph Theory, and many other areas of research. The Gromov hyperbolicity constant of several families of graphs and geometric spaces has been determined. However, so far, the only known algorithm for calculating the Gromov hyperbolicity constant of a discrete metric space is the brute force algorithm with running time O (n4) using the four- point condition. In this thesis, we first introduce an approximation algorithm which calculates a O (log n)-approximation of the hyperbolicity constant , based on a layering approach, in time O (n2), where n is the number of points in the metric space. We also calculate the fixed base point hyperbolicity constant r for a fixed point r using a (max; min)matrix multiplication algorithm by Duan in time O (n2:688) [2]. We use this result to present a 2-approximation algorithm for calculating the hyperbolicity constant in time O (n2:688). We also provide an exact algorithm to compute the hyperbolicity constant in time O (n3:688) for a discrete metric space. We then present some partial results we obtained for designing some approximation algorithms to compute the hyperbolicity constant. | en |

dc.language.iso | en | en |

dc.subject | Gromov | en |

dc.subject | Hyperbolic groups | en |

dc.subject | Discrete metric | en |

dc.title | Computing the Gromov hyperbolicity constant of a discrete metric space | en |

dc.type | Thesis | en |

dc.contributor.department | Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division | en |

thesis.degree.grantor | King Abdullah University of Science and Technology | en_GB |

dc.contributor.committeemember | Chikalov, Igor | en |

dc.contributor.committeemember | Gao, Xin | en |

thesis.degree.discipline | Computer Science | en |

thesis.degree.name | Master of Science | en |

dc.person.id | 113029 | en |

All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.