Algorithmadvanced
Infomap
Also called map equation.
Finds communities that minimise the description length of random-walk trajectories.
Finds communities that minimise the description length of random-walk trajectories.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag R7CYRH Edit this page History Report an error