PAPER / ARXIV:2609.07896

Modularity in planted partition model

M. Koshelev

RESUMO

We obtain tight bounds on the modularity of PPM graphs in the case of equally sized parts. Moreover, we provide a general method that can help in obtaining bounds for various other models.

NO MESMO MAPA

Papers relacionados

cs.DS18 de set. de 2026

Spectral Gap of Down-Up Walks via Trickle-Down: A Simplified and Sharpened Analysis

Xiaoyu Chen , Kuikui Liu

Modularity in planted partition model

Papers relacionados

Spectral Gap of Down-Up Walks via Trickle-Down: A Simplified and Sharpened Analysis

Improved Algorithms for Beck--Fiala with Bounded Sets

A Reachable-State Operator Formulation of Deferred Acceptance: Progress Invariants and Structural Diagnostics

Roman Domination on Circular-Convex, Triad-Convex Bipartite Graphs and $P_4$-Tidy Graphs

Condorcet-type properties of the linear ordering problem with ties

Norm-One Torus Decompositions and Decoding of Gashkov-Sidel'nikov Codes