Flexible model of network embedding
arXiv:1803.10572
Abstract
There has lately been increased interest in describing complex systems not merely as single networks but rather as collections of networks that are coupled to one another. We introduce an analytically tractable model that enables one to connect two layers in a multilayer network by controlling the locality of coupling. In particular we introduce a tractable model for embedding one network (A) into another (B), focusing on the case where network A has many more nodes than network B. In our model, nodes in network A are assigned, or embedded, to the nodes in network B using an assignment rule where the extent of node localization is controlled by a single parameter. We start by mapping an unassigned `source' node in network A to a randomly chosen `target' node in network B. We then assign the neighbors of the source node to the neighborhood of the target node using a random walk starting at the target node and with a per-step stopping probability . By varying the parameter , we are able to produce a range of embeddings from local () to global (). The simplicity of the model allows us to calculate key quantities, making it a useful starting point for more realistic models.
References in corpus (13)
- Emergence of scaling in random networks
- Catastrophic cascade of failures in interdependent networks
- Hyperbolic Geometry of Complex Networks
- Dynamical interplay between awareness and epidemic spreading in multiplex networks
- Geographical dispersal of mobile communication networks
- Geographic constraints on social network groups
- Self-similarity of complex networks and hidden metric spaces
- Network robustness of multiplex networks with interlayer degree correlations
- Uncovering collective listening habits and music genres in bipartite networks
- Entangling mobility and interactions in social media
- Geographies of an online social network
- Spatially distributed social complex networks
- The small-world effect is a modern phenomenon