{"id":"c4f40d85-f9b4-4943-8ca5-fd5bf35d9732","arxiv_id":"2501.13044","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A p-percolated uniform temporal tree on an n-ary tree has size converging to an exponential law, height asymptotic to e times np, and typical depth asymptotic to np.","lead":"This paper introduces a random tree model for temporal networks and proves its size, height, and vertex depths follow simple limit laws. It is worth reading because the model connects temporal network phenomena to random recursive tree theory and branching random walks.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 4.3's coupling is not well-defined: the appendix builds Tnew from actual subtrees Tn(v_{r(v)+i}) yet asserts the law of T_{n,ℓ^-_v(ϵ)}; without a corrected construction, Theorem 2.1's two-sided comparison lacks a key independence/distribution step.","rationale":"The paper's overall strategy is sound: the spacings coupling gives a clean representation, the second-moment bound is plausible, and the height proof follows a standard Biggins-type argument. The reader's weakest assumption correctly identified Lemma 4.2/4.3 as the fragile structural step. I agree, but I locate the problem more specifically: the reader emphasized the unquantified high-probability event E, which is actually harmless for a distributional limit because L is fixed before n→∞ and the error is o(1). The more serious issue is the proof of Lemma 4.3, where the construction of Tnew is not fully specified and the asserted distributional identity appears to conflict with attaching actual subtrees from the original tree. Since every two-sided bound on |T_{n,p}| in Lemma 4.2 passes through Lemma 4.3, this is the most load-bearing gap. My recommendation is CONDITIONAL rather than REJECT because the gap may be a fixable typo: if the intended construction uses fresh independent copies with the correct root labels, the argument may go through. A precise rewrite plus the first-moment check I propose would settle the matter.","tokens_in":20486,"tokens_out":44274,"duration_ms":447992,"concrete_test":"Rewrite the construction of Tnew in Lemma 4.3 with explicit indices, replacing 'attach Tn(v_{r(v)+i})' by one of two precise objects: (a) independent fresh copies T_{n,\\ell^*_{u_i}} generated from new spacings, or (b) the actual higher-rank sibling subtrees. Then verify the distributional claim. A concrete analytic check: compute the conditional first moment E[|Tnew| | ℓ^-_v(ϵ)] from the spacings representation. For (a) it must equal (1+o(1)) e^{nℓ^-_v(ϵ)} and be conditionally independent of Tn(v); for (b) it will instead be driven by the actual sibling labels ℓ_{v_{r(v)+i}}, and one must prove the stochastic bounds in Lemma 4.3 despite the law not being T_{n,ℓ^-_v(ϵ)}. If neither case yields the claimed identity, the proof of Theorem 2.1 is incomplete.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central limit law for |T_{n,p}| rests on Lemma 4.2, whose upper and lower bounds replace F(v) — the side mass above a fixed-index vertex v — by a tree with law |T_{n,ℓ^-_v(ϵ)}| via Lemma 4.3. In the proof of Lemma 4.3 (Appendix), after defining root labels ℓ^*_{u_i}, the text says 'we attach Tn(v_{r(v)+i}) to the vertices u_i' and then concludes 'Tnew is distributed like T_{n,ℓ^-_v(ϵ)}'. Under the paper's notation, T_n(v) is the actual subtree of the original tree rooted at v, so Tnew is built from the same random variables that determine F(v). To have the claimed distribution, the subtree below a child with label ℓ^* would need to be an independent copy of T_{n,\\ell^*}, drawn from fresh spacings; the actual sibling subtrees have root labels ℓ_{v_{r(v)+i}}, not ℓ^*_{u_i}. The construction also refers to vertices u_i with n < i ≤ n+r(v) although only u_1,...,u_n are defined, indicating a mis-specification. Thus Lemma 4.3's asserted independence and exact law are not established, and the two-sided comparison in Lemma 4.2 — and hence Theorem 2.1 — inherits this gap.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper defines uniform temporal trees T_{n,p} by assigning independent uniform labels to the edges of an infinite rooted n-ary tree and retaining vertices for which labels along the root-to-vertex path are decreasing and below p. It proves four main results: E|T_{n,p}|=e^{np} and the distributional limit |T_{n,p}|/e^{np}→Exponential(1); a joint limit for the masses of the largest root subtrees; the height law H_{n,p}/(np)→e in probability; the typical depth law D_{n,p}/(np)→1 in probability; and an asymptotic expected degree distribution with weights 2^{-(k+1)}. The proofs use a uniform-spacings coupling, a branching-random-walk decomposition, concentration bounds, and Cramér large deviations. The results are plausible and well motivated, but the proof of Theorem 2.1 depends on a coupling lemma whose current construction is not valid. The paper is a candidate for acceptance after a substantive revision of that proof.","tokens_in":256,"tokens_out":9842,"duration_ms":108620,"significance":"If the proofs are repaired, the paper gives a clean set of first-order asymptotics for a natural random-tree model and demonstrates an interesting contrast: the total number of vertices is random on the exponential scale, while the height is deterministic at scale np. The branching-random-walk method and the uniform-spacings coupling are well suited to the problem, and the paper states explicit, falsifiable limits with no fitted parameters. The height, depth, and degree results are likely correct and potentially useful for the analysis of random temporal graphs. However, the size theorem, which is one of the paper's central claims, is currently not rigorously established because its key approximation lemma is flawed.","major_comments":[{"comment":"The construction of Tnew is not well-defined and does not have the claimed law. The text first assigns labels ℓ*_{u_i} to n new vertices u_i attached to a root and then says: 'we attach Tn(v_{r(v)+i}) to the vertices u_i ... for 1 ≤ i ≤ n − r(v)'. Under the paper's notation, Tn(v_{r(v)+i}) is the actual subtree of the original complete tree rooted at the sibling v_{r(v)+i}; these are exactly the subtrees that determine F(v). A tree with the law T_{n,ℓ^-_v(ϵ)} would require, below a child with label ℓ*_{u_i}, an independent copy of T_{n,ℓ*_{u_i}} generated from fresh spacings, not the original subtree whose root label is ℓ_{v_{r(v)+i}}. Consequently, Tnew is not distributed as claimed and is not conditionally independent of Tn(v). Since Lemma 4.2 uses Lemma 4.3 for both directions of the two-sided comparison, Theorem 2.1 is not established by the present proof.","section":"Section 8, proof of Lemma 4.3"},{"comment":"The sentence 'For the vertices ui with n < i≤ n + r(v) we make ui the root of independently sampled trees distributed like Tn' refers to vertices u_i that have not been defined: only u_1,...,u_n were introduced. The construction must specify which of the n attachment vertices receive independent copies and which receive the original subtrees; the current indexing makes the definition of Tnew ambiguous. This is not merely a typographical issue, as the proof later compares |Tnew(u_i)| for i=1,...,k and needs a precise prescription of those subtrees.","section":"Section 8, proof of Lemma 4.3"}],"minor_comments":[{"comment":"The sentence 'D is smaller than the sum of 2KM random variables distributed as S*_K' is incorrect as written. There are K^M vertices at depth M, each with M increments, so the sum should involve K^M M random variables, or a fixed constant depending on K and M. Since K and M are fixed and E[S*_K]=O(1/n), the asserted o_n(1) conclusion remains valid, so this appears to be a harmless typo.","section":"Section 5, proof of Theorem 2.2"},{"comment":"In the displayed inequality after defining I(x), the supremum is written as sup_{λ>0}(λx+log(−λ)); since log(−λ) is undefined for λ>0, this should read sup_{λ<0}(...) or, after the substitution μ=−λ, sup_{μ>0}(−μx+log μ).","section":"Section 5, proof of Lemma 5.1"},{"comment":"The displayed ratio f(k+1)/f(k) contains a redundant factor (ℓ−k+m)!/(ℓ−k+m)! in the numerator and denominator; the intended simplification to (ℓ−k+m)/(ℓ−k+2m) is correct, but the formula as printed is confusing.","section":"Section 8, proof of Lemma 4.1"}],"recommendation":"major_revision","confidential_remarks":"The central size theorem is likely correct, but the current proof of Lemma 4.3 has a real gap that cannot be fixed by minor editing alone. I would invite a revision with a corrected coupling; if the authors provide a valid proof of Lemma 4.3, the paper would be suitable for publication in a probability journal."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Read this. The model — independent uniform labels on an infinite n-ary tree, keep decreasing paths — is actually new, and the four limit statements are the right first questions. The exponential limit for the size is a surprise, and the comparison with random recursive trees is accurate rather than a sales pitch. What is good: the second moment bound is clean; the branching random walk decomposition is a natural and mostly convincing way to get the exponential law; the height proof uses a standard Biggins/Cramér argument; and the expected degree distribution falls out neatly. I found no issue with the math in Sections 4–7 apart from the one below; citations to the temporal graph literature are appropriate.\n\nThe soft spot is Lemma 4.3. In the appendix, the construction of Tnew does not have the law the lemma claims. You start with the actual sibling subtrees Tn(v_{r(v)+i}) and attach them to new roots u_i whose labels are defined using fresh renormalized spacings, then assert Tnew is distributed like T_{n,ℓ^-_v(ϵ)}. But under the paper's own notation, the distribution of a subtree depends on the label of its root, and the actual sibling roots have labels ℓ_{v_{r(v)+i}}, not the ℓ^*_{u_i}. The text also refers to u_i for i > n that were never defined. So the independence/exact-law step is not established. Since Lemma 4.2 and Theorem 2.1 lean directly on this lemma, the main size law currently rests on an unsupported comparison. The pieces for a repair are probably all there — a careful two-sided coupling with fresh spacings should work — but as submitted, this is a genuine gap, not a typo. The '2KM random variables' bound in the height proof is also loose (the count should be M K^M or similar), but that is minor because K and M are fixed and the term is o(1).\n\nFor whom: probabilists interested in random trees or temporal network models. It deserves a serious referee; I would send it out, but I would not accept it until Lemma 4.3 is rewritten with a well-defined coupling and a proof of the claimed distribution.","headline":"A nicely motivated new tree model with an appealing exponential size law, but the proof of the central comparison lemma has a real gap that needs a rewrite.","tokens_in":21288,"tokens_out":6090,"would_cite":false,"duration_ms":64794,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60C05","60J80","60F05","05C80"],"pacs":[],"model":"deepseek-v4-flash","headline":"A new class of random temporal trees has a size that fluctuates on the exponential scale and a height that settles at e times np.","keywords":["uniform temporal tree","random temporal networks","branching random walk","exponential limit law","tree height","random recursive tree","uniform spacings coupling","degree distribution"],"falsifier":"Simulate $T_{n,p}$ for fixed $p$ (for example $p=1/2$) and increasing $n$, and compare the empirical survival function of $|T_{n,p}|/e^{np}$ with $e^{-x}$. If the proportion of runs with normalized size above 1 does not tend to $e^{-1} \\approx 0.368$, the exponential limit law of Theorem 2.1 is false. A complementary check is to compute the second-moment ratio $E|T_{n,p}|^2/(E|T_{n,p}|)^2$ directly for finite $n$ and see whether it remains bounded by 5 as required by Lemma 4.1.","tokens_in":20313,"feed_emoji":"🌲","tokens_out":8739,"duration_ms":82795,"temperature":0.7,"pith_summary":"This paper introduces a random object it calls a uniform temporal tree: take the rooted infinite complete n-ary tree, give every edge an independent uniform [0,1] label, and keep only the vertices whose root-to-vertex labels are decreasing; the p-percolated version additionally requires every label on the path to stay below p. The paper's central question is how large such a tree is and how deep it grows. It establishes that the number of surviving vertices is exponentially large but not concentrated: normalized by its mean $e^{np}$, the size converges in distribution to an Exponential(1) random variable. The height is a different story: $H_{n,p}/(np)$ converges in probability to $e$, so the deepest paths are about $e$ times as long as a typical vertex's depth. These laws put uniform temporal trees in the same asymptotic family as uniform random recursive trees and give a tree-level model for random temporal networks.","feed_headline":"Random temporal tree: size fluctuates, height hits e·np","feed_subtitle":"Surviving vertices follow an exponential law while deepest paths scale with e, matching random recursive trees.","key_machinery":"The argument is carried by two linked devices. First, the uniform spacings coupling replaces the independent edge labels with spacings: a vertex with label $\\ell$ has children whose labels are $\\ell$ minus cumulative sums of independent uniform spacings, which are distributed as exponential variables divided by their total sum. This makes the label of a vertex equal to $p$ minus a sum of spacing terms indexed by the vertex's rank among its siblings. Second, the paper maps the vertices of small index in $T_{n,p}$ into an infinite complete binary branching random walk whose edge steps are independent exponential random variables divided by $n$, using the event that fixed-index vertices have enough children to support the injection. The size of $T_{n,p}$ is then bounded above and below by sums of independent copies of smaller temporal trees with modified thresholds $p_i$, controlled by a second-moment inequality and by distributional properties of the branching random walk. The height proof instead trims the tree to its $K$ largest-label children and uses large-deviation estimates for gamma sums to show that a supercritical Galton-Watson process survives, forcing vertices at depth roughly $\\gamma n$ for every $\\gamma < e$.","core_discovery":"The paper's central claim is that $|T_{n,p}|$, the number of vertices in the $p$-percolated uniform temporal tree, has expectation $e^{np}$ and satisfies $|T_{n,p}|/e^{np}$ converging in distribution to an Exponential(1) random variable. It also proves a joint version of this limit for the subtrees attached to the root's highest-label children: after division by $e^{np}$, their sizes converge to $(E_1 U_1, E_2 U_1 U_2, \\ldots, E_m U_1 \\cdots U_m)$ with independent exponentials $E_i$ and independent uniform random variables $U_i$. The height $H_{n,p}$ satisfies $H_{n,p}/(np) \\to e$ and $H_{n,p}/\\log|T_{n,p}| \\to e$ in probability, and a uniformly chosen vertex has depth $D_{n,p}$ with $D_{n,p}/(np) \\to 1$ and $D_{n,p}/\\log|T_{n,p}| \\to 1$. Finally, the expected number of vertices with outdegree $k$ satisfies $E L_{n,k}/e^{np} \\to 2^{-(k+1)}$. Read together, the tree has random volume on the exponential scale but a deterministic shape profile.","pith_inferences":["If uniform temporal trees are the local tree limit of sparse random simple temporal graphs, the height law would imply that temporal paths in such networks reach depth about $e \\log$ of the local tree size; this is an inference beyond the paper, which only proposes the tree as a motivated model.","The same spacings-coupling machinery should extend to labels with other continuous distributions; the constant $e$ in the height law would likely change to a functional of the label distribution, giving a testable family of temporal tree models.","The joint limit for root-subtree masses suggests a recursive stick-breaking representation of the exponential limit; one could test whether conditioning $T_{n,p}$ on its total size produces a mass-splitting structure close to that of uniform random recursive trees despite the different root-degree behaviour."],"forward_implications":["The size of a uniform temporal tree does not concentrate: even at large $n$, the total number of surviving vertices fluctuates by a factor comparable to its mean, with an exponential limiting distribution.","The height is deterministic at scale $np$: with high probability the deepest vertex sits at depth about $e \\cdot np$, so the tree is roughly $e$ times as deep as a typical vertex's depth.","Because $H/\\log|T|$ tends to $e$, the height is about $e$ times the natural logarithm of the number of vertices, the same logarithmic relation seen in uniform random recursive trees.","A uniformly random vertex lies near depth $np$, so almost all of the tree's mass sits in a band around $np$ whose width is small relative to $n$.","The expected degree distribution stabilizes in a geometric form: about half of all vertices are leaves, one quarter have exactly one child, and so on."],"supporting_citations":[{"why":"Supplies the temporal-network motivation that drives the tree model.","marker":"Holme and Saramäki (2012)"},{"why":"Provides the random simple temporal graph setting that the tree model is designed to mirror.","marker":"Angel et al. (2020)"},{"why":"Gives the uniform-spacings representation as ratios of exponentials used throughout the coupling.","marker":"Devroye (1986)"},{"why":"Supplies the recursive-tree height analysis and the log-size height relation that Theorem 2.2 extends.","marker":"Devroye (1987)"},{"why":"Contributes the first/last-birth branching process method used to prove existence of deep vertices.","marker":"Biggins (1976)"},{"why":"Is the reference for branching random walk definitions and basic theory on which the comparison rests.","marker":"Shi (2015)"},{"why":"Provides the Biggins-Hammersley-Kingman theorem used to control extrema of the branching random walk in Lemma 4.4.","marker":"Addario-Berry and Reed (2009)"},{"why":"Is the source of Cramér's large-deviations theorem used in the height lower bound.","marker":"Klenke (2008)"}],"fun_headline_variants":["Uniform temporal trees: size -> exponential, height -> e·np","Temporal tree size: exponential law; height: e times np","Uniform temporal trees: exponential size law, height e·np","Random temporal tree: size exponential, height e·np"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing step is the assumption that every vertex among the first few index levels of the temporal tree has enough surviving children to be matched injectively into the binary branching-random-walk tree; the paper proves this event has probability tending to one but does not quantify how fast, and the two-sided bounds on the total size inherit that unquantified high-probability event.","fun_headline_variants_meta":{"raw":{"variants":["Uniform temporal trees: size -> exponential, height -> e·np","Temporal tree size: exponential law; height: e times np","Uniform temporal trees: exponential size law, height e·np","Random temporal tree: size exponential, height e·np"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000993,"raw_usage":{"total_tokens":4251,"prompt_tokens":1035,"completion_tokens":3216,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":651,"completion_tokens_details":{"reasoning_tokens":3144}},"tokens_in":651,"tokens_out":3216,"duration_ms":26687,"temperature":1.0,"reasoning_tokens":3144,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T16:30:06.866611+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Simulate $T_{n,p}$ for fixed $p$ (for example $p=1/2$) and increasing $n$, and compare the empirical survival function of $|T_{n,p}|/e^{np}$ with $e^{-x}$. If the proportion of runs with normalized size above 1 does not tend to $e^{-1} \\approx 0.368$, the exponential limit law of Theorem 2.1 is false. A complementary check is to compute the second-moment ratio $E|T_{n,p}|^2/(E|T_{n,p}|)^2$ directly for finite $n$ and see whether it remains bounded by 5 as required by Lemma 4.1.","supporting_citations":[{"cited_title":"and Saramäki, J","cited_arxiv_id":null,"evidence_quote":"Supplies the temporal-network motivation that drives the tree model."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the random simple temporal graph setting that the tree model is designed to mirror."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the uniform-spacings representation as ratios of exponentials used throughout the coupling."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the recursive-tree height analysis and the log-size height relation that Theorem 2.2 extends."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Contributes the first/last-birth branching process method used to prove existence of deep vertices."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Is the reference for branching random walk definitions and basic theory on which the comparison rests."},{"cited_title":"and Reed, B","cited_arxiv_id":null,"evidence_quote":"Provides the Biggins-Hammersley-Kingman theorem used to control extrema of the branching random walk in Lemma 4.4."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Is the source of Cramér's large-deviations theorem used in the height lower bound."}],"review_version":1}