{"id":"e2503cca-e8d9-4e80-bebe-5c8b3569a36c","arxiv_id":"2501.17042","paper_version":4,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"Networks grown by local rules develop detectable community structure above a finite size threshold, while random rewiring of the same degree sequences does not, formalized as the Ramsey community number.","lead":"This paper defines a 'Ramsey community number' that measures how large a growing network must become before community structure is almost guaranteed, and uses simulations to show that networks grown by local rules cross this threshold while their degree-preserving random rewritings do not. It supports the idea that communities can emerge from the wiring process alone, without pre-assigned node types.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The local-vs-randomized dichotomy may rest on community-detection algorithms whose implicit null is the configuration model; a local-correlation-preserving null is needed to show the detected blocks are true communities rather than generic local structure.","rationale":"The reader's weakest assumption, that the community detection methods may mislabel the synthetic networks, is indeed the most load-bearing premise. Without a reliable f_kappa, the Ramsey community numbers and the local/non-local dichotomy lose their meaning. I agree with the reader and sharpen the concern: the degree-preserving configuration-model null is insufficient because it removes all correlations rather than isolating community structure from other local features such as clustering, 4-cycles, and degree correlations. A local-preserving null is a concrete, decisive test that would indicate whether SBM-DC and Infomap are detecting genuine community structure or merely any deviation from a configuration model. This concern does not invalidate the paper's positive evidence, which includes two independent detection methods, multiple generative models, and visual inspections of small instances, so the appropriate verdict remains CONDITIONAL pending this additional validation. The paper also has minor data-reporting issues, such as the repeated value in Sec. VII.A, but those do not affect the central argument.","tokens_in":11460,"tokens_out":7194,"duration_ms":79356,"concrete_test":"Build local-preserving null networks from each LS(n,d), DS(n,q), and WS(n,K,p) instance by performing double-edge swaps that preserve the degree sequence and the number of triangles (for DS, preserve the number of 4-cycles or the joint degree-degree distribution), thereby randomizing the placement of local correlations while keeping their density. Estimate P_kappa(n) for these nulls with both SBM-DC and regularized Infomap for n up to about 10^4. If P_kappa stays near 0 for the nulls while the original models reach P_kappa=1, the detected communities are not a trivial consequence of clustering or degree correlations; if P_kappa rises with n, the algorithms are mistaking local correlations for community structure, which would undercut the central claim.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim, that networks grown by local rules have finite Ramsey community numbers while their degree-preserving randomizations do not, is established entirely through two community-counting algorithms: degree-corrected stochastic block modeling (SBM-DC) and regularized Infomap with regularization_strength=1.0. No ground-truth communities are planted in the synthetic networks, and the paper itself states in Sec. IV.B that 'there is no gold standard.' The degree-preserving rewiring null removes all correlations, but it is not the right null to isolate 'community' from other local correlations: LS and WS produce many triangles, and DS produces duplication-induced 4-cycles and degree-degree correlations. SBM-DC and Infomap are compression/MDL methods and can legitimately partition any network whose local correlations deviate from the configuration model, labeling those deviations as separate blocks. The choice regularization_strength=1.0 is justified by the fact that it makes random networks appear community-free, which introduces a risk of circularity. Unless the null preserves local correlations or the result is shown robust across a range of detection settings, the finite r_kappa values and the local/non-local dichotomy could be artifacts of the detection methods' implicit null model rather than evidence about node heterogeneity.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a Ramsey-theoretic criterion for the emergence of network communities: the Ramsey community number r_kappa is the smallest graph size n at which a generative model produces graphs with two or more detected communities with probability at least 1-epsilon, and a model has the emergent communities property if r_kappa exists for all epsilon. Using numerical simulations of four generative model families (local search, duplication-split, Watts-Strogatz, and Barabasi-Albert, plus variants), the author reports that the three models with explicit local rules have finite r_kappa, while their degree-preserving randomized versions do not, and that the canonical BA model does not have the emergent communities property. The paper concludes by conjecturing that network communities are an emergent property of networks evolving with local rules, and that node heterogeneity is not a necessary condition.","tokens_in":11668,"tokens_out":4652,"duration_ms":46063,"significance":"The paper introduces a crisp, potentially reusable definition (the Ramsey community number) and supports it with a reproducible computational pipeline (code at github.com/av2atgh/ramsey netcom) and substantial simulations: 1000 instances per condition, two independent community detection methods (degree-corrected SBM and regularized Infomap), and degree-preserving randomization controls. The randomized baselines are a genuine strength and correctly show that simple degree heterogeneity is not the explanation. If the central conjecture survives the robustness checks below, the paper would make a useful conceptual contribution to the community-detection literature by shifting attention from node attributes to network-growth dynamics. However, the paper is fully simulation-based, contains no proofs, and its central dichotomy is method-dependent; those limitations currently prevent the strong necessary-condition claim in Sec. VIII from being established.","major_comments":[{"comment":"The emergent communities property is defined relative to a community-count function f_kappa, and all conclusions depend on the two chosen algorithms. The paper acknowledges in Sec. IV.B that 'there is no gold standard,' yet the Infomap regularization strength is fixed at 1.0 precisely because it makes random networks appear community-free. This risks circularity: the detection method is tuned to reproduce the desired local-vs-randomized dichotomy. I request a robustness analysis across a range of regularization_strength values, and ideally a third detection method whose null model preserves local correlations (for example, triangle-preserving or 2K-preserving rewiring) to show that the finite r_kappa values are not artifacts of the configuration-model null implicit in SBM-DC and Infomap.","section":"Sec. IV.B and Definition 2"},{"comment":"The Ramsey community numbers in Table I are reported as point estimates without confidence intervals or error bars. The text says 'variations in the last digit due to the stochastic nature' but does not quantify this, and the binary-search procedure does not state how many instances are generated at each candidate n (Sec. II specifies 1000 for the P_kappa curves, but the search points are not documented). Since the paper draws quantitative comparisons across models and parameters (for example, LS d=1 vs d=2, DS q=0.3 vs q=0.5, and WS p=0.1 vs p=0.2), the reader cannot assess whether the reported differences are statistically meaningful.","section":"Sec. V and Table I"},{"comment":"The finite r_kappa values for BA(n,m,a) with a<m complicate the abstract's claim that local rules are necessary. The paper's response is to reinterpret locality as 'implicit formation of local structures' through clustering, but this shifts the operative concept from local rules to local structure. The necessary-condition statement in Sec. VIII should be formulated and tested in terms of local structure (for example, finite clustering or the presence of short cycles) rather than inherited from the local-rule models; otherwise the claim is not supported by the BA(n,m,a) results.","section":"Sec. VI and Table I"},{"comment":"The evidence that BA(n,m=2) lacks the emergent communities property rests on a non-monotonic P_kappa curve that peaks at about 0.5 near n ~ 1000 and then declines with increasing n, a behavior the paper states it cannot explain. Because the nonexistence of r_kappa is inferred from this decline, the authors should either provide a mechanistic explanation for the non-monotonicity or demonstrate that the decline is not a community-detection artifact, for example by showing that the detected communities near the peak are stable under algorithmic variations and that the decline persists under alternative detection settings.","section":"Sec. III.D and Fig. 5"}],"minor_comments":[{"comment":"The word 'warranties' in 'the minimum graph size that warranties the emergence' should be 'warrants'; the same typo appears in Sec. I.","section":"Abstract"},{"comment":"The abbreviation 'SMB' should be 'SBM' (stochastic block model); the same typo appears in Sec. V.","section":"Table I caption"},{"comment":"The sentence 'there is no gold standard, we cannot tell which methods is right' has a subject-verb agreement error and should be rephrased, e.g., 'we cannot tell which method is right.'","section":"Sec. IV.B"},{"comment":"The sentence 'I obtain the Ramsey community numbers r_kappa(L=1,W=1)=108 and r_kappa(L=1,W=1)=1090' reports the same condition twice; the second value is presumably for W=2 and should be corrected.","section":"Sec. VII.A"},{"comment":"The notation 'fG(n) :→ SG' is malformed; it should define fG as a map from a size parameter to the set of graphs, and the signature of P_kappa (a function on graphs, but written 'P_kappa(fG)') should be clarified.","section":"Sec. V, Definition 1"},{"comment":"The Greek word for community is rendered as garbled text ('kappaoinu ´o t eta'); it should be 'koinotita' or the proper Greek 'κοινότητα'.","section":"Sec. II"}],"recommendation":"major_revision","confidential_remarks":"The paper is within the scope of physics.soc-ph and reports an intriguing conjecture, but the strength of the claims currently exceeds the evidence: the central dichotomy is method-dependent, the r_kappa values lack uncertainty quantification, and the necessary-condition statement is weakened by the BA(n,m,a) results. I encourage the editor to request the robustness analyses outlined in the major comments before considering acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The genuinely new piece is the Ramsey community number and the emergent-communities property. That gives a formal, if simulation-based, threshold for when a growing graph is almost certain to be detected as having two or more communities. The paper also broadens the local-rules evidence base beyond JGN/triadic closure: LS, DS, WS, and the bubble model all show the pattern, while BA and the degree-randomized versions do not. The DS model is a good choice because it is triangle-free, so the claim is not just about triangles.\n\nWhat the paper does well: the experiments are simple and reproducible in spirit, the randomized degree-preserving baseline is the right first control, and the author is honest about the absence of a gold standard and about unexplained features (the BA hump, the WS large-p behavior). The explicit statement that r_kappa depends on the detection method is a useful caveat rather than a defect.\n\nSoft spots, in descending order. First, the sentence in Section V claiming the dichotomy indicates locality is 'a necessary condition' goes beyond the evidence. It is a finite-model observation, not a proof. Second, the stress-test concern about the null is real: degree-preserving rewiring removes all local correlations, so the detectors might be labeling triangles or 4-cycles as communities. The paper would be stronger with a null that preserves local correlations (for instance, randomizing while holding triangle counts or cycle counts fixed) or at least with a discussion of why that null is not the right one. Third, choosing the Infomap regularization strength because it makes random graphs community-free is mildly circular; it is a legitimate tuning choice but should be justified independently. Fourth, the table of r_kappa values has no error bars; the author notes last-digit variation, but for a quantity defined by a threshold, a confidence interval would be more informative. Fifth, Section VII.A has a typo: both reported r_kappa values are attributed to W=1.\n\nNone of these are fatal. The central observation—that local growth rules produce networks that standard community-detection methods see as community-structured, while degree-preserving random rewirings do not—holds up under two independent detection methods. The paper is for network scientists working on generative models and community detection. I would take it to reading group and I'd cite the r_kappa definition in future work. It deserves serious peer review; with a softened necessity claim and a modest amount of extra robustness analysis it could be a solid contribution.","headline":"A useful formal threshold for when local growth rules yield detectable communities, backed by honest simulation evidence, but the necessity claim and the choice of null both need more care.","tokens_in":12211,"tokens_out":3324,"would_cite":true,"duration_ms":33781,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C80","05D10","91D30"],"pacs":["89.75.Fb","89.75.Hc"],"model":"deepseek-v4-flash","headline":"The paper argues that local network-growth rules alone can force communities to appear, without any node heterogeneity, once networks are large enough.","keywords":["network communities","emergent properties","local rules","Ramsey community number","stochastic block model","Infomap","degree-preserving rewiring","generative network models"],"falsifier":"Generate LS($n$, $d=1$), DS($n$, $q=0.5$), and WS($n$, $K=\\{1,2\\}$, $p=0.1$) networks at large $n$ (say 100,000 nodes) and apply a community detector calibrated to report no communities on configuration-model random graphs; if that detector still reports two or more communities on almost every locally grown instance, the emergent-communities claim survives, while if it reports none, the reported dichotomy is a method artifact. In the other direction, running the degree-corrected stochastic block model on BA($n$, $m=2$) networks up to $n=10^6$ and finding $P_\\kappa$ rising back to 1 would falsify the claim that the Barabasi-Albert model lacks the emergent communities property.","tokens_in":11202,"feed_emoji":"🕸️","tokens_out":6742,"duration_ms":55849,"temperature":0.7,"pith_summary":"The paper sets out to show that network communities can appear without any pre-existing node types or node heterogeneity: purely local rules of network growth are enough. To make this precise it defines the Ramsey community number, the smallest network size at which a given generative model yields at least two detected communities with probability at least $1-\\epsilon$, and the emergent communities property for models where that number exists for every $\\epsilon$. Using the degree-corrected stochastic block model and regularized Infomap, the paper reports finite Ramsey numbers for the local search, duplication-split, and Watts-Strogatz models, while degree-preserving randomized versions of these networks show no emergent communities. It conjectures that network communities are an emergent property of networks evolving with local rules, which would mean observed segregation in real networks could reflect how links form rather than hidden node attributes.","feed_headline":"Local growth rules alone can create network communities","feed_subtitle":"Ramsey community numbers show communities appear in locally grown networks but vanish under degree-preserving rewiring.","key_machinery":"The central object is the Ramsey community number $r_\\kappa(f_G, f_\\kappa, \\epsilon)$: the minimum $n$ such that a graph generative model $f_G$ on $n$ vertices has probability at least $1-\\epsilon$ of being assigned two or more communities by a community count function $f_\\kappa$. A model has the emergent communities property when $r_\\kappa$ exists for all $0<\\epsilon<1$. This number carries the argument by converting a qualitative intuition about emergence into a measurable threshold, and the key comparison is between a model and its degree-preserving randomized version: the local-rule models cross the threshold at finite size, while the randomized versions never do. Tunable model families (Watts-Strogatz rewiring, Barabasi-Albert attractiveness, and the bubble model's cycle length and attachment distance) are then used to show that the finite threshold tracks the degree of locality, not degree heterogeneity.","core_discovery":"The core claim is the conjecture that network communities are an emergent property of networks evolving with local rules, stated against the null picture that communities require node heterogeneity. The paper gives the conjecture an operational form: for the local search, duplication-split, and Watts-Strogatz (with at least two neighbor sets) models, the Ramsey community number is finite, whereas for their degree-preserving randomized versions it does not exist within the tested sizes, and the canonical Barabasi-Albert model lacks the emergent communities property. The evidence also shows that implicit locality suffices: Barabasi-Albert models with baseline attractiveness and degree exponent $\\gamma<3$ do have finite Ramsey numbers, with $r_\\kappa$ falling as the clustering coefficient rises, and the bubble model's Ramsey number grows as the added cycles lengthen and disappears when attachments can reach more than two steps away. Communities, on this picture, are a large-size consequence of local connection rules rather than a trace of node types.","pith_inferences":["The Ramsey community number could double as a benchmark for community detection methods: a method that assigns communities to degree-preserving random graphs at finite size is unlikely to be a reliable probe of emergence.","A testable extension would classify real networks by whether their communities persist under degree-preserving rewiring; networks whose communities persist would be candidates for growth driven by global rather than local link selection.","The apparent divergence of $r_\\kappa$ as the clustering coefficient approaches zero suggests a possible phase transition in community emergence; scanning the Barabasi-Albert attractiveness parameter near the boundary could locate a critical clustering value.","Because the numerical values of $r_\\kappa$ depend on the detection method, a natural strengthening would define the Ramsey number against a consensus of several regularized methods or against planted ground truth, making the threshold less method-dependent."],"forward_implications":["If the conjecture is right, community structure in a single static network cannot be taken as evidence of hidden node types; the network's growth history alone could have produced it.","Degree-preserving rewiring becomes a standard control: a generative model whose communities survive rewiring, or whose randomized version also shows communities, is not demonstrating emergent community structure.","Scale-free networks generated by preferential attachment with baseline attractiveness and degree exponent below 3 are predicted to show communities at finite size, while the canonical Barabasi-Albert model should not.","The absence of the property for the one-neighbor Watts-Strogatz ring and its presence for the two-neighbor ring delimits what 'local' must mean: enough local connections beyond immediate neighbors are required.","For real networks, the framework suggests that observed communities may be explained by local dynamics, making node attributes a possible consequence of community membership rather than its cause."],"supporting_citations":[{"why":"Introduces the triadic-closure social model that first demonstrated communities arising from a local rule; the motivating precedent for this paper.","marker":"[9]"},{"why":"Provides the stochastic block model implementation used to infer community counts.","marker":"[15]"},{"why":"Provides the Infomap method used as the second community detector.","marker":"[19]"},{"why":"Supplies the configuration-model rewiring algorithm used to create degree-preserving randomized baselines.","marker":"[20]"},{"why":"Introduces the Watts-Strogatz model whose rewiring parameter tunes locality.","marker":"[27]"},{"why":"Introduces the Barabasi-Albert preferential attachment model used as the non-local negative example.","marker":"[28]"},{"why":"Defines the preferential attachment model with baseline attractiveness used to test implicit locality.","marker":"[31]"},{"why":"Gives the decay of clustering in Barabasi-Albert networks used to explain the absence of emergent communities.","marker":"[32]"}],"fun_headline_variants":["Local rules alone spark network communities","No node types needed for community emergence","Community formation driven by local rules, not identity","Why local growth rules lead to community structure","Local rules suffice: network communities emerge naturally"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the two community-detection methods used here, the degree-corrected stochastic block model and regularized Infomap, reveal the true presence or absence of communities; the paper itself notes that there is no gold standard for community detection, so a method artifact could in principle manufacture the local-versus-nonlocal split.","fun_headline_variants_meta":{"raw":{"variants":["Local rules alone spark network communities","No node types needed for community emergence","Community formation driven by local rules, not identity","Why local growth rules lead to community structure","Local rules suffice: network communities emerge naturally"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000249,"raw_usage":{"total_tokens":1505,"prompt_tokens":857,"completion_tokens":648,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":473,"completion_tokens_details":{"reasoning_tokens":584}},"tokens_in":473,"tokens_out":648,"duration_ms":6723,"temperature":1.0,"reasoning_tokens":584,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T05:01:19.670045+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Generate LS($n$, $d=1$), DS($n$, $q=0.5$), and WS($n$, $K=\\{1,2\\}$, $p=0.1$) networks at large $n$ (say 100,000 nodes) and apply a community detector calibrated to report no communities on configuration-model random graphs; if that detector still reports two or more communities on almost every locally grown instance, the emergent-communities claim survives, while if it reports none, the reported dichotomy is a method artifact. In the other direction, running the degree-corrected stochastic block model on BA($n$, $m=2$) networks up to $n=10^6$ and finding $P_\\kappa$ rising back to 1 would falsify the claim that the Barabasi-Albert model lacks the emergent communities property.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces the triadic-closure social model that first demonstrated communities arising from a local rule; the motivating precedent for this paper."},{"cited_title":"The MapE- quation software package,","cited_arxiv_id":null,"evidence_quote":"Provides the Infomap method used as the second community detector."},{"cited_title":"Park and M","cited_arxiv_id":null,"evidence_quote":"Supplies the configuration-model rewiring algorithm used to create degree-preserving randomized baselines."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the preferential attachment model with baseline attractiveness used to test implicit locality."},{"cited_title":"Klemm and V","cited_arxiv_id":null,"evidence_quote":"Gives the decay of clustering in Barabasi-Albert networks used to explain the absence of emergent communities."}],"review_version":1}