Skip to contents

Refines one Louvain local-move partition using Leiden's constrained singleton-merge rule. Graph edges are streamed in bounded blocks and labels and refinement state are memory-mapped. This is one stage; use massive_leiden() for the multilevel fit. Mapped pages can contribute to process RSS.

Usage

massive_leiden_refine_level(
  graph,
  parent,
  output,
  resolution = 1,
  seed = 1L,
  chunk_rows = 8192L,
  memory_limit = "1GB",
  backend = "cpu"
)

Arguments

graph

A result of massive_umap_fuzzy_graph().

parent

A first-level massive_louvain_level() result for graph.

output

New path for one-based uint32 refined labels.

resolution

Positive modularity resolution.

seed

Nonnegative refinement seed.

chunk_rows

Maximum consecutive CSR rows per scan block.

memory_limit

RAM budget for graph scan buffers.

backend

Only "cpu" is implemented; no fallback is used.

Value

A file-backed refinement and refined-to-parent label map.