infomap

Generic Description

A flow-based community detection algorithm that groups nodes by how a random walk would remain trapped within them.

Simple example:

CALL nexyron.infomap()

Community detection procedures partition or group nodes by structural affinity. They are useful for segmentation, fraud-ring analysis, recommendation features, and exploratory graph profiling.

Consumer-Level Explanation

Use Infomap when the network is best understood as movement, traffic, communication, or flow rather than just density. Different community algorithms optimize different objectives and assumptions. Modularity methods, label propagation, block models, overlapping memberships, and partition-quality metrics should be chosen for the question, not swapped blindly.

Conceptual Explanation

Infomap asks a different question from modularity methods. Instead of “which partition is dense inside?”, it asks “which partition compresses the path of a walker moving through this graph?” That makes it powerful for transportation, messaging, clickstream, and communication networks where flow itself is the story.

How It Differs From Nearby Algorithms

Compared with Louvain or Leiden, Infomap is less about dense blocks and more about path compression. Compared with shortest-path routing algorithms, it is still a community detector, not a route solver. Compared with block models, it emphasizes movement patterns over generative block interaction.

When To Choose It

More Detailed Explanation

If your graph represents journeys or flows, modularity can miss what matters most. Infomap often surfaces communities that make much more intuitive sense to operators because they correspond to movement corridors rather than static dense islands.

Advanced Example

The advanced example keeps infomap in a named Cypher pipeline so the procedure output shape, downstream filters, and returned columns are visible to planner tooling.

CALL nexyron.infomap() YIELD node_id, community_id, map_equation
RETURN node_id, community_id, map_equation
LIMIT 10

Real Use Cases

Real Limitations And Tradeoffs