- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes a multifractal step-graphon model that represents multiscale network-generation rules through a recursive Kronecker structure, together with a Multi-Wavelet Neural Operator Transformer (MWNOT) that amortizes recovery of base parameters from an observed adjacency matrix. It provides an identifiability proposition under specific non-degeneracy conditions, with recovery defined up to community-label permutation. It also evaluates parameter recovery at unseen network sizes, zero-shot generation on real networks, reconstruction from a single observed network, and an application to multi-subject EEG state analysis. The main assessment questions concern the scope of the assumptions and the extent to which population-level identifiability translates into stable recovery from finite, noisy network observations
Critical strengths
(1) An interpretable generative model paired with amortized inference. The multifractal step graphon represents multiscale connection rules through a recursive Kronecker structure, while the neural inverse operator estimates base parameters, giving the paper a coherent generation-to-inversion pipeline. (2) Complementary theoretical and empirical evaluations. The paper provides a conditional identifiability result and studies parameter recovery at unseen network sizes, zero-shot generation across empirical network domains, single-network reconstruction, and an EEG state-analysis applicatio
Critical weaknesses
(1) The identifiability result should not be conflated with finite-sample recovery guarantees. The proposition establishes identifiability of base parameters, up to community-label permutation, under specific positivity and non-degeneracy conditions. It does not automatically guarantee stable parameter estimation from a single finite and noisy graph. The gap between population-level identifiability and practical amortized recovery deserves clearer discussion. (2) The recursive cross-scale assumption limits the range of networks to which the model naturally applies. The paper evaluates transfer to unseen network sizes and zero-shot generation on empirical networks, but it also relies on a repeated connection rule across scales and deterministic degree-order normalization. Reported weaknesses on some domains and spectral metrics suggest that applicability to networks departing from the assumed multifractal structure should be delineated more clearly.
Questions for authors
(1) Proposition 1 establishes identifiability up to community-label permutation under specific non-degeneracy conditions. How does this population-level result relate to parameter recovery from a finite, single observed network? Which sources of error or violations of assumptions are most likely to make practical recovery unstable? (2) The paper evaluates unseen network sizes from N=128 to N=8192 and zero-shot generation across empirical network domains. Given the assumption that the same connection rule repeats across scales, how should applicability be characterized for networks that do not follow this recursive structure? Which network characteristics are most associated with the remaining spectral-metric errors?
4 comments
Q1
Q1a. "How does this population-level result relate to parameter recovery from a finite, single observed network?"
Here we measured the gap from theory to practice that the reviewer pointed out. We fixed 20 rules, drew 50 graphs from each at three sizes (K = 4), and split the error of the estimate into two parts. Bias is the distance between the average estimate and the truth. Spread is the standard deviation of the estimate from graph to graph.
| N | Bias, p | Spread, p | Bias, l | Spread, l |
|---|---|---|---|---|
| 512 | 0.080 | 0.025 | 0.068 | 0.030 |
| 2048 | 0.096 | 0.010 | 0.085 | 0.014 |
| 8192 | 0.103 | 0.004 | 0.088 | 0.006 |
The spread shrinks as the graph grows: at N = 8192, two graphs from the same rule give almost the same estimate. The bias stays, and it makes up more than 90% of the squared error at every size. So the model's error is consistent, not random. Proposition 1 guarantees that an exact inverse exists. The limitation is therefore in the trained network, not in the formulation. This suggests that future studies improving the training and architecture of the network can further mitigate this.
Q1b. "Which sources of error or violations of assumptions are most likely to make practical recovery unstable?"
In short: too few nodes per block. A depth-K graphon has 2^K blocks, so what matters is the combination of N and K, that is N / 2^K. We reran the Figure 4 protocol and kept the error of every graph (4,000 graphs, N = 128 to 8192). Mean absolute error:
| Nodes per block, N / 2^K | 2-4 | 4-16 | 16-64 | 64-256 | 256-1024 | 1024-4096 |
|---|---|---|---|---|---|---|
| Error on p | 0.147 | 0.106 | 0.089 | 0.085 | 0.080 | 0.078 |
| Error on l | 0.130 | 0.097 | 0.077 | 0.069 | 0.055 | 0.046 |
Below about 16 nodes per block the error rises. Above that, recovery is stable: the error on p stays between 0.085 and 0.089 from N = 256 to N = 8192, eight times the largest training size.
We note that this is a property of any block model. Block parameters cannot be estimated from a handful of nodes. Appendix A (lines 762-768) already stated this constraint. These results help us quantify it. In addition, every graph with N ≥ 1024 meets it at any depth the method selects (K ≤ 6).
Q2
Q2a. "Given the assumption that the same connection rule repeats across scales, how should applicability be characterized for networks that do not follow this recursive structure?"
Applicability can be assessed with a fit check on each network. The paper states this assumption as a limitation (lines 477-479) and gives a check for it in the EEG case study (Appendix K of the submitted version, lines 1447-1463; Appendix L of the revised version). We infer the rule, generate networks from it, and compare the reconstruction error with its range on synthetic networks for which the model is true. A network passes if its error is below the 95th percentile of that range. Of the 80 EEG networks, 76 pass.
We also quantified what happens when the assumption fails. The main takeaway is that the method tolerates mild departures from it. For the table below, we generated graphs in which each of the K = 4 levels uses its own perturbed copy of the base rule, with independent noise of size eps, and compared the recovered rule with the base rule (N = 1024, 1,000 graphs per eps, mean ± standard deviation over 10 seeds).
| eps | Change of the rule per level, p / l | Mean absolute error, p | Mean absolute error, l |
|---|---|---|---|
| 0 | 0 / 0 | 0.080 ± 0.004 | 0.068 ± 0.008 |
| 0.05 | 0.025 / 0.018 | 0.081 ± 0.004 | 0.066 ± 0.007 |
| 0.1 | 0.049 / 0.037 | 0.084 ± 0.004 | 0.068 ± 0.008 |
| 0.2 | 0.095 / 0.074 | 0.103 ± 0.005 | 0.084 ± 0.009 |
| 0.4 | 0.177 / 0.146 | 0.153 ± 0.007 | 0.124 ± 0.014 |
At eps = 0.05, where the levels differ by about 0.025 on average, recovery is as accurate as with exact repetition. At eps = 0.1, where they differ by about 0.05, the error on p is 6% higher and the error on l is unchanged. Beyond that the error grows gradually and roughly doubles at eps = 0.4.
Q2b. "Which network characteristics are most associated with the remaining spectral-metric errors?"
The analysis below shows that sparsity is most associated with the remaining spectral-metric errors. For the 548 unique reference graphs of the 12 domains, we correlated the spectral error (Table 1, test graph as input) with properties of each reference graph and with the selected depth, all fixed before the analysis. Spearman correlations with 95% bootstrap intervals. We show the main rows here; the full list of ten properties is in Table S9 (Appendix N.4, p. 34):
| Property | Across domains (n = 12) | Within domains (n = 548) |
|---|---|---|
| Mean degree | -0.91 [-1.00, -0.57] | -0.49 [-0.70, -0.22] |
| Average clustering | -0.40 [-0.89, 0.35] | -0.40 [-0.63, -0.14] |
| Fraction of nodes cropped | -0.13 [-0.68, 0.63] | 0.07 [-0.25, 0.38] |
| Selected depth K* | -0.10 [-0.83, 0.61] | -0.18 [-0.42, 0.04] |
The error is higher for sparser networks, and we detect no association with cropping or with the selected depth. The remaining spectral error is therefore concentrated in sparse networks, and it is not tied to cropping or to depth selection. We note that this is a known limit of graphon models, which describe dense graphs best. This provides an interesting way to extend the model prior for future studies.
Final Comment
We sincerely thank the reviewer again for their questions and insights. We also apologize for the additional comment, and we hope the reviewer can understand that we write it out of our commitment to this work.
We highlight two of the new results that address the reviewer's concerns. The details are in our response above.
- The method holds beyond exact recursion (Q2a). When the rule differs across scales, recovery is as accurate as with exact repetition at eps = 0.05. At eps = 0.1, the error on p is only 6% higher and the error on l is unchanged.
- The design choices are supported (Q1b, Q2b). The remaining error is not tied to cropping or to depth selection.
We would be very grateful if the reviewer could consider these results in the final assessment.
Summary of the Response
Thank you for the careful review, and for the two questions that pushed us to test the method harder. We ran four new experiments with the frozen model of the paper (no retraining) to answer with numbers.
For the reviewer's convenience, we restate our work: our framework bridges the interpretability of mechanistic graph models with amortized inference of deep generative models. Two properties make it readily applicable for scientific applications. First, one model transfers to empirical networks across many domains and returns the rule in a single forward pass after pre-training only on synthetic graphs generated by our multifractal step graphon. Second, the model and the inference are formulated in function space, allowing generalization to unseen network sizes. Critically, this practicality does not come at the cost of accuracy, as our model's performance is comparable to a per-network optimization method within the same model class.
The implication is that a practitioner needs only one model to extract the mechanistic generative rule of empirical networks of various domains and sizes. Each rule can then be used for downstream applications, such as hypothesis testing and controlled perturbations in forward simulations, network control, and settings where only a single network is observed. As such, we believe that our method has the potential to greatly enhance our understanding of complex networks.
We summarise our response here, with details for each below. We hope that the discussion here clarifies the reviewer's concerns. If so, we respectfully ask the reviewer to consider this in the final assessment.
(Q1a) Identifiability and finite recovery. We split the recovery error into bias and graph-to-graph spread. The spread vanishes as the graph grows (0.025 at N = 512 to 0.004 at N = 8192 on p), so two graphs from the same rule give almost the same estimate. More than 90% of the squared error may be a consistent bias of the trained network. Since Proposition 1 guarantees that an exact inverse exists, the limitation is in the trained network and not in the formulation. We note that the main contribution of our paper is the overall formulation of the generative prior and inference in function space, with MWNOT serving as one instance of the architecture. The remaining bias is therefore something that better training and architectures can reduce, without any change to the formulation.
(Q1b) Sources of instability. This is a great question. We ran experiments to seek the answer. The results indicate that the main source is too few nodes per block. We note that this is a property of any block model, since block parameters cannot be estimated from a handful of nodes. Training on larger graphs would allow greater depths while keeping enough nodes per block. This serves as an interesting direction to explore for scaling up our method.
(Q2a) Applicability beyond the recursive assumption. We also found this question interesting, as we acknowledged in the discussion that this is an assumption of our model. To test this, we ran a new experiment in which the rule differs across scales. The results show that Recovery is as accurate as with exact repetition at eps = 0.05, where each level differs from the base rule by about 0.025. At eps = 0.1, where the levels differ by about 0.05, the error on p is 6% higher and the error on l is unchanged, and it degrades gradually beyond that. The method is therefore not strictly constrained to networks that follow the assumption exactly. However, this assumption is also something we are working on loosening more in the future. Therefore, the reviewer raises an important point.
(Q2b) Remaining spectral error. Our new experiments indicate that the error is concentrated in sparse networks, with a correlation with mean degree of -0.91 across domains and -0.49 within domains. This draws a measurable boundary for the applicability of the method. The error is not tied to cropping or to depth selection, which supports these design choices. It also points to a concrete extension, such as a generative prior that can better infer the rule from sparse networks.