Flexible model of network embedding

March 28, 2018 Β· Declared Dead Β· πŸ› Scientific Reports

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Juan FernΓ‘ndez-Gracia, Jukka-Pekka Onnela arXiv ID 1803.10572 Category physics.soc-ph Cross-listed cs.SI Citations 1 Venue Scientific Reports Last Checked 4 months ago
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 $q$. By varying the parameter $q$, we are able to produce a range of embeddings from local ($q = 1$) to global ($q \to 0$). The simplicity of the model allows us to calculate key quantities, making it a useful starting point for more realistic models.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted