-
Notifications
You must be signed in to change notification settings - Fork 4
Infomap (INP by Rosvall and Bergstrom)
Sergiu Tripon edited this page Jul 27, 2016
·
6 revisions
Home ▸ Algorithms ▸ Infomap (INP by Rosvall and Bergstrom)
The community structure is represented through a two-level nomenclature based on Huffman coding:
- one to distinguish communities in the network;
- the other to distinguish nodes in a community;
The problem of finding the best partition is expressed as minimizing the quantity of information needed to represent some random walk in the network using this nomenclature. With a partition containing few inter community links, the walker will probably stay longer inside communities, therefore only the second level will be needed to describe its path, leading to a compact representation.
The authors optimize their criterion using simulated annealing.
Home |
Scope |
Research |
Value |
Background
Literature Survey | Data | Algorithms | Plan | Meetings Journal
Literature Survey | Data | Algorithms | Plan | Meetings Journal
© Copyright 2016 Sergiu Tripon. All Rights Reserved.