Block-weighted random graphs: planar and beyond
Pith reviewed 2026-05-15 18:55 UTC · model grok-4.3
The pith
Block weighting on block-stable graphs induces a phase transition that governs the sizes of the largest 2-connected components.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Block weighting applied to block-stable classes produces a phase transition in the singular behavior of the generating function; the decorated block tree then yields three regimes in which the largest blocks obey different scaling laws, together with precise enumeration formulas when the class admits sufficiently regular generating functions.
What carries the argument
The decorated block tree, a rooted tree whose nodes carry weighted blocks and whose edges record the tree-like attachments between blocks.
If this is right
- Precise asymptotic formulas become available for the number of connected graphs in each regime.
- The largest block is of smaller order than the whole graph in the subcritical regime and reaches linear size in the supercritical regime.
- The same transition applies to any block-stable class whose generating function satisfies the required analytic conditions.
- Results for uniform planar graphs are recovered as the special case of unit block weight.
Where Pith is reading between the lines
- The decorated-block-tree approach may extend to classes with higher-order connectivity constraints or to maps on surfaces.
- Sampling algorithms that enforce a target block-size distribution could be built directly from the regime-specific generating functions.
- The phase-transition threshold itself supplies a tunable parameter for controlling global connectivity in random-graph models.
Load-bearing premise
The ordinary generating functions of the underlying block-stable classes admit singular expansions whose form permits a clean change of dominant singularity under block weighting.
What would settle it
Direct enumeration or Monte-Carlo sampling of block-weighted planar graphs that produces largest-block sizes inconsistent with the three predicted regimes.
read the original abstract
We investigate random connected graphs from a block-stable class whose distribution is weighted based on the number of $2$-connected components, or blocks. This includes the class of planar graphs. For this, we develop a notion of a decorated block tree. Following similar ideas to Fleurat and the second author on block-weighted planar maps, we find a phase transition in the singular behaviour of the appropriate generating function and in the typical structure of the block tree. Moreover, for certain block-stable classes (including planar graphs), we obtain precise enumeration results and determine also the typical sizes of the largest blocks in subcritical, critical, and supercritical regimes. It strengthens previously known results on block sizes in uniform random planar graphs.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript investigates random connected graphs from block-stable classes, weighted according to the number of blocks (2-connected components). This includes the class of planar graphs. The authors introduce the concept of a decorated block tree and identify a phase transition in the singular behavior of the associated generating functions, which affects the structure of the block tree. For certain classes such as planar graphs, they derive precise enumeration results and determine the typical sizes of the largest blocks in the subcritical, critical, and supercritical regimes, thereby strengthening prior results on block sizes in uniform random planar graphs.
Significance. If the derivations hold, this work offers a valuable extension of analytic combinatorics techniques to block-weighted random graphs. The determination of regime-specific block sizes for planar graphs and similar classes provides new structural insights that build upon existing literature. The decorated block tree appears to be a useful innovation for analyzing these weighted structures.
major comments (1)
- [Abstract] The central result depends on the generating functions of block-stable classes exhibiting a clean phase transition in their singular expansions under block weighting. However, the abstract does not include explicit singular expansions or a verification that the transition is free from interfering singularities, which is necessary to confirm the extraction of precise asymptotics for the largest block sizes.
Simulated Author's Rebuttal
We thank the referee for their careful reading and positive assessment of the manuscript's contributions. We address the major comment below.
read point-by-point responses
-
Referee: [Abstract] The central result depends on the generating functions of block-stable classes exhibiting a clean phase transition in their singular expansions under block weighting. However, the abstract does not include explicit singular expansions or a verification that the transition is free from interfering singularities, which is necessary to confirm the extraction of precise asymptotics for the largest block sizes.
Authors: The abstract is intentionally concise to summarize the main results and their implications. The explicit singular expansions of the block-weighted generating functions, the identification of the phase transition, and the verification that it occurs without interfering singularities (via analytic continuation and singularity analysis) are derived in full detail in Sections 3 and 4 of the manuscript, including the relevant theorems on the decorated block tree and the asymptotic extractions for block sizes. These steps directly support the precise asymptotics in the subcritical, critical, and supercritical regimes. We maintain that technical expansions belong in the body rather than the abstract, but we can add a brief clause to the abstract mentioning the clean phase transition if the referee prefers. revision: partial
Circularity Check
No circularity: abstract presents independent analytic extension
full rationale
Only the abstract is available and contains no equations or explicit derivations. The text states that a decorated block tree is developed and a phase transition is found in the singular behaviour of the generating function, following similar ideas from prior work. No self-definitional step, fitted parameter renamed as prediction, or load-bearing self-citation that reduces the central claims to inputs by construction is present. The enumeration results and block-size asymptotics are described as obtained results rather than tautological restatements, leaving the derivation chain self-contained against external singular-analysis techniques.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption The graph class is block-stable
invented entities (1)
-
decorated block tree
no independent evidence
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.