Skip to main content

Part of the book series: Methodos Series ((METH,volume 11))

Abstract

Studying geographical networks is made difficult by their size and complexity. Graph theory and its developments in sociology provide formal tools to simplify a graph by identifying cohesive subgroups inside the graph. This set of tools is based on clustering criteria, which use the extent of ties within subgroups, the node reachability, the node degree, the balance between inter- and intra-group ties and the subgroup connectivity. Graph theory also provides extensions that help to model the edge directions and the edge values and then take attributes specific to the geographical context into account. Finally, this set of methods provides a formal framework to simplify a network based on relevant topological criteria and develop new clustering rules for geographical networks in view of the context of the study.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The contrast between cohesive and adhesive structures appears in the etymology of these words. On the one hand, the words cohesion, colleague, and companion refer to notions of equality or numerous connections; on the other hand, the words adhesion, adversary, and administrator refer to notions of centrality or reference Moody & White (2003).

  2. 2.

    As defined, a n-clique may have a diameter greater than n because the shortest paths between its nodes may pass through the outer edges of the n-clique. Nevertheless, there are variants of this clustering method that control the subgroup diameter. Subgroups extracted by such methods are called “n-clans” and “n-clubs” (for further information, see Moody & White, 2003; Wasserman & Faust 1994).

  3. 3.

    Subgroups with a similar criterion can also be built by considering the minimum number of adjacencies (rather than the maximum number of “non-adjacencies”), which we define as the k-core. A k-core is then a maximal subgroup of n nodes where each node is adjacent to at least k other nodes (Moody & White, 2003; Wasserman & Faust, 1994).

References

  • Amiel, M., Mélançon, G., & Rozenblat, C. (2005). Réseaux multi-niveaux: l’exemple des échanges aériens mondiaux. Mappemonde, 79(3). Retrieved July 21, 2009, from http://mappemonde.mgm.fr/num7/index.html

  • Berge, C. (1973). Graphes (3rd ed., 1983, 400 p.). Paris, France: Gauthier-Villars.

    Google Scholar 

  • Bollobás, B. (1998). Modern graph theory (394 p.). New York: Springer.

    Google Scholar 

  • Gleyze, J.-F. (2005). La vulnérabilité structurelle des réseaux de transport (848 p.). Unpublished doctoral dissertation, Université Paris VII, Paris, France.

    Google Scholar 

  • Gleyze, J.-F. (2009, September 4–8). Friendship and neighbourhood in the eurovision song contest. In Proceedings of ecqtg09, 17th European Colloquium on theoretical and quantitative geography. Maynooth, Ireland.

    Google Scholar 

  • Levine, J. (2009). Large networks (13 p.). Unpublished draft, Hanover, NH: Dartmouth University. Retrieved July 21, 2009, from http://www.dartmouth.edu/~jlevine/NSF%20%205.pdf

  • Mackechnie, G., & Mackaness, W. A. (1999). Detection and simplification of road junctions in automated map generalization. GeoInformatica,3, 185–200.

    Google Scholar 

  • Moody, J., & White, D. (2003). Social cohesion and embeddedness: A hierarchical conception of social groups. American Sociological Review,68(1), 103–127.

    Google Scholar 

  • Wasserman, S., & Faust, K. (1994). Social network analysis – Methods and applications (857 p.). Cambridge: Cambridge University Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jean-François Gleyze .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Gleyze, JF. (2013). Topological Clustering for Geographical Networks. In: Rozenblat, C., Melançon, G. (eds) Methods for Multilevel Analysis and Visualisation of Geographical Networks. Methodos Series, vol 11. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6677-8_3

Download citation

Publish with us

Policies and ethics