A Latent Parameter Node-Centric Model for Spatial Networks

Abstract

Spatial networks, in which nodes and edges are embedded in space, play a vital role in the study of complex systems. For example, many social networks attach geo-location information to each user, allowing the study of not only topological interactions between users, but spatial interactions as well. The defining property of spatial networks is that edge distances are associated with a cost, which may subtly influence the topology of the network. However, the cost function over distance is rarely known, thus developing a model of connections in spatial networks is a difficult task. In this paper, we introduce a novel model for capturing the interaction between spatial effects and network structure. Our approach represents a unique combination of ideas from latent variable statistical models and spatial network modeling. In contrast to previous work, we view the ability to form long/short-distance connections to be dependent on the individual nodes involved. For example, a node's specific surroundings (e.g. network structure and node density) may make it more likely to form a long distance link than other nodes with the same degree. To capture this information, we attach a latent variable to each node which represents a node's spatial reach. These variables are inferred from the network structure using a Markov Chain Monte Carlo algorithm. We experimentally evaluate our proposed model on 4 different types of real-world spatial networks (e.g. transportation, biological, infrastructure, and social). We apply our model to the task of link prediction and achieve up to a 35% improvement over previous approaches in terms of the area under the ROC curve. Additionally, we show that our model is particularly helpful for predicting links between nodes with low degrees. In these cases, we see much larger improvements over previous models.

References in corpus (18)

• Modularity and community structure in networks
• Spatial Networks
• Stochastic blockmodels and community structure in networks
• Popularity versus Similarity in Growing Networks
• Navigability of Complex Networks
• Sustaining the Internet with Hyperbolic Mapping
• Uncovering space-independent communities in spatial networks
• Self-similarity of complex networks and hidden metric spaces
• Modeling homophily and stochastic equivalence in symmetric relational data
• Spatial Growth of Real-world Networks
• Optimal design of spatial distribution networks
• Clustering Stability: An Overview
• The effects of spatial constraints on the evolution of weighted complex networks
• Curvature and temperature of complex networks
• Structural properties of spatially embedded networks
• Preferential attachment in growing spatial networks
• Spatial correlations in attribute communities
• Assortative Mixing in Close-Packed Spatial Networks

Cited by in corpus (1)

• Mining for Spatially-Near Communities in Geo-Located Social Networks