Table of Contents
Fetching ...

Geometry and Geography of Complex Networks

Louis Boucherie

TL;DR

This work investigates the intersection of network structure, geometry, and geography. It introduces the Adaptive Cut to perform multilevel dendrogram cuts via MCMC with simulated annealing and the Balanceness score to assess dendrogram balance, improving partition density and modularity across many networks. The second part leverages network embeddings, including hyperbolic representations and Poincaré maps, to reveal that geography can redefine administrative boundaries and to analyze mobility through a geography-aware pair distribution framework, uncovering a universal five-order-of-magnitude power law that bridges distance-based and opportunity-driven mobility models. Overall, the thesis demonstrates that incorporating geometry and geography into network analysis yields more faithful representations of social-spatial dynamics and scalable, interpretable models for large-scale mobility data.

Abstract

Complex systems are made up of many interacting components. Network science provides the tools to analyze and understand these interactions. Community detection is a key technique in network science for uncovering the structures that shape the behavior of these networks. This thesis introduces the Adaptive Cut, a novel method that improves clustering methods by employing multi-level cuts in hierarchical dendrograms. Overcoming the limitations of traditional single-level cuts-especially in unbalanced dendrograms-the Adaptive Cut provides a multi-level cut by optimizing a Markov chain Monte Carlo with simulated annealing. In addition, we propose the Balanceness score, an information-theoretic metric that quantifies dendrogram balance and predicts the benefits of multilevel cuts. Evaluations on over 200 real and synthetic networks show significant improvements in partition density and modularity. In the second part, our analysis shows that incorporating network geometry allows redefining administrative boundaries into non-contiguous regions that better reflect social and spatial dynamics. We also discuss the representation of hierarchical data in hyperbolic space through Poincare maps, which can represent tree-like structures in low dimension. In addition, we examine how geography constrains human mobility, an aspect often overlooked in scale-free characterizations of mobility. By incorporating geography via the pair distribution function from condensed matter physics, we separate geographic constraints from mobility choices. Analyzing datasets containing millions of individual movements, we identify a universal power law that spans five orders of magnitude, thereby bridging the divide between distance-based and opportunity-driven models of human mobility.

Geometry and Geography of Complex Networks

TL;DR

This work investigates the intersection of network structure, geometry, and geography. It introduces the Adaptive Cut to perform multilevel dendrogram cuts via MCMC with simulated annealing and the Balanceness score to assess dendrogram balance, improving partition density and modularity across many networks. The second part leverages network embeddings, including hyperbolic representations and Poincaré maps, to reveal that geography can redefine administrative boundaries and to analyze mobility through a geography-aware pair distribution framework, uncovering a universal five-order-of-magnitude power law that bridges distance-based and opportunity-driven mobility models. Overall, the thesis demonstrates that incorporating geometry and geography into network analysis yields more faithful representations of social-spatial dynamics and scalable, interpretable models for large-scale mobility data.

Abstract

Complex systems are made up of many interacting components. Network science provides the tools to analyze and understand these interactions. Community detection is a key technique in network science for uncovering the structures that shape the behavior of these networks. This thesis introduces the Adaptive Cut, a novel method that improves clustering methods by employing multi-level cuts in hierarchical dendrograms. Overcoming the limitations of traditional single-level cuts-especially in unbalanced dendrograms-the Adaptive Cut provides a multi-level cut by optimizing a Markov chain Monte Carlo with simulated annealing. In addition, we propose the Balanceness score, an information-theoretic metric that quantifies dendrogram balance and predicts the benefits of multilevel cuts. Evaluations on over 200 real and synthetic networks show significant improvements in partition density and modularity. In the second part, our analysis shows that incorporating network geometry allows redefining administrative boundaries into non-contiguous regions that better reflect social and spatial dynamics. We also discuss the representation of hierarchical data in hyperbolic space through Poincare maps, which can represent tree-like structures in low dimension. In addition, we examine how geography constrains human mobility, an aspect often overlooked in scale-free characterizations of mobility. By incorporating geography via the pair distribution function from condensed matter physics, we separate geographic constraints from mobility choices. Analyzing datasets containing millions of individual movements, we identify a universal power law that spans five orders of magnitude, thereby bridging the divide between distance-based and opportunity-driven models of human mobility.

Paper Structure

This paper contains 41 sections, 77 equations, 38 figures, 2 tables.

Figures (38)

  • Figure 1: Network visualizations of four different systems. (A) Social network: representing multiplex social relationships among individuals at a research department at Aarhus University. Magnani2013. (B) Informational network: A network of common adjective and noun adjacencies from the novel David Copperfield by Charles Dickens, showing linguistic connections between words Newman2006. (C) Technological network: The reduced Central Chilean power grid, illustrating the infrastructure and connections within the electrical system Kim2018. (D) Biological network: Vazquez & Simberloff's plant-pollinator web, representing interactions between plant species and their pollinators, demonstrating ecological relationships Vazquez2003.
  • Figure 2: A visualization of an Erdős-Rényi random graph with 20 nodes and a connection probability of 0.3. The spring layout algorithm positions the nodes to reflect the network's structure.
  • Figure 3: Adjacency matrix of the generated network. Each cell indicates the presence (white) or absence (black) of an edge between pairs of nodes.
  • Figure 4: Adjacency matrix of a weighted network, the size of the cell is proportional to the weight of the edges
  • Figure 5: Adjacency matrix of a weighted and directed network, the adjacency matrix is not symmetric anymore
  • ...and 33 more figures