{"id":"928085aa-50e6-42a7-8275-44f307d8d50c","arxiv_id":"1908.04155","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A transfer theorem: for kernels U+f with f excessive, the a.s. limsup of an α-permanental sequence equals the a.s. limsup of the Gaussian sequence with covariance U, with the same normalization φ.","lead":"This paper proves that, for a large class of permanental random sequences, the largest values follow the same law of the iterated logarithm as an associated Gaussian sequence. It gives sharp almost-sure growth rates for permanental sequences built from Markov chains such as birth-death and autoregressive models.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1.2's proof uses Lemma 6.5's lim hypothesis where (1.8) gives only limsup, making (6.44) and the proof of (1.10) unsupported.","rationale":"I read the paper's central claim as the transfer principle in Theorem 1.2. The reader's formal weakest_assumption is the uniform o_l(1) estimate (1.7); that is indeed necessary for the comparison (6.35) to be sharp. But the proof has an additional, more direct gap: the step leading to (6.44) invokes Lemma 6.5 under a limsup hypothesis. The counterexample shows that the implication is invalid. Since the conclusion (1.10) for all α≥1/2 is derived from (6.44), this is load-bearing. The reader's rationale does mention a 'lim/limsup mismatch in Lemma 6.5', so my concern is partially overlapping; however, their stated weakest assumption is (1.7), not this mismatch. I therefore mark agreement as partial. The paper's examples may still be correct because they use Koval's theorem to get a true limit for the Gaussian normalizer, so a conditional verdict remains appropriate rather than rejection. The fix is local: either upgrade (1.8) to lim, or rework the lower-bound half of the proof along a subsequence.","tokens_in":58788,"tokens_out":9956,"duration_ms":95157,"concrete_test":"Test the inference used at (6.44) by taking η_j iid N(0,1) and φ_j = log j. Then (1.8) holds with limsup 1, yet the normalized squared sequence has liminf 0, so (6.44) cannot follow from (1.8) via Lemma 6.5. This settles that the proof of Theorem 1.2 contains a gap; a repair would need either a strengthened hypothesis (true in the paper's applications) or a new subsequence argument.","verdict_should_be":"UNCHANGED","load_bearing_attack":"At the core of the proof of Theorem 1.2, after establishing (6.38), the authors write that 'It follows from (1.8) and Lemma 6.5 below that lim_{j→∞} ∑_{i=1}^k η_{i,j}^2/(2φ_j)=1 a.s.' (Eq. 6.44). However, Lemma 6.5's hypothesis is lim_{j→∞} |η_j|/(2φ_j)^{1/2}=1 (Eq. 6.47), while Theorem 1.2 assumes only limsup in (1.8). The implication from this limsup to the stated limit of normalized squares is false: for iid N(0,1) with φ_j = log j, limsup |η_j|/(2 log j)^{1/2}=1 a.s. but liminf η_j^2/(2 log j)=0, so (6.44) fails. The proof of (6.45) and hence the derivation of (1.10) for α=k/2 is therefore unjustified. This is an internal inconsistency in the argument, not merely a too-weak hypothesis: the theorem statement may still be true, and the gap is repairable by strengthening (1.8) to a true limit (which the applications obtain from Koval's theorem) or by a subsequence argument for the lower bound. But as written, the proof of the central transfer principle does not go through.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies alpha-permanental sequences whose kernels are obtained by adding a finite excessive function f to the symmetric potential U of a transient symmetric Borel right process. The main result, Theorem 1.2, gives conditions under which a Gaussian law of the iterated logarithm for the sequence with covariance U, limsup_j eta_j/(2 phi_j)^{1/2}=1, transfers to a sharp limsup for the permanental sequence, limsup_j tilde X_{alpha,j}/phi_j=1. The proof is based on a comparison with a symmetrized inverse-M-matrix kernel, developed in Section 6, and is then applied to birth-and-death processes with and without emigration, first- and higher-order Gaussian autoregressive sequences, and Levy processes on Z.","tokens_in":59098,"tokens_out":12357,"duration_ms":139325,"significance":"If the proof is made fully rigorous, the paper gives a substantial and useful transfer principle: sharp asymptotic behavior of nonsymmetric permanental sequences is derived from the classical Gaussian LIL, with explicit verification for several families of Markov chains. The applications are non-trivial and the verification of the inverse-matrix hypotheses (1.6)-(1.7) in Sections 2-5 is detailed. The paper is also honest in separating the general theorem from the application-specific lower bounds for all alpha>0. The main proof, however, contains a mismatch between the limsup hypothesis of Theorem 1.2 and the limit hypothesis used in Lemma 6.5, which currently leaves the central transfer argument incomplete.","major_comments":[{"comment":"The proof of Theorem 1.2 asserts that 'It follows from (1.8) and Lemma 6.5 below that lim_{j to infinity} sum_{i=1}^k eta_{i,j}^2/(2 phi_j) = 1 a.s.' This implication is not justified. Lemma 6.5 has the hypothesis lim_{j to infinity} |eta_j|/(2 phi_j)^{1/2} = 1 (Eq. (6.47)), while Theorem 1.2 assumes only the limsup condition (1.8). The stronger hypothesis is essential for the lemma as stated: for iid N(0,1) variables and phi_j = log j, (1.8) holds but eta_j^2/(2 log j) has liminf 0 and limsup 1, so it does not converge; hence Lemma 6.5 cannot be invoked, and the limit asserted in (6.44) is not established. Since (6.44) is the bridge between the probability comparison (6.38) and the claimed permanental limit in (6.45)-(6.46), the proof of (1.10) for alpha = k/2 is incomplete as written. The applications likely satisfy the stronger limit through Koval-type theorems, e.g., (2.52), (3.28), and (5.85), so the gap may be repairable by strengthening the hypothesis of Theorem 1.2 or by a subsequence argument for the lower bound, but the general theorem as stated is not proved.","section":"Section 6, Eq. (6.44) and Lemma 6.5"},{"comment":"The hypothesis in Theorem 6.1 that rho_{l,n} <= delta_l with delta_l = o(l) is insufficient for its use in the proof of Theorem 1.2: the error term 2 alpha delta_l must tend to zero as l tends to infinity in the inequalities (6.35) and subsequently in (6.42)-(6.43). The proof of Theorem 1.2 actually requires delta_l = o_l(1), which does follow from (1.7). The statement of Theorem 6.1 should therefore be corrected to delta_l = o_l(1), or delta_l -> 0, to match the argument that follows.","section":"Section 6, Theorem 6.1, Eq. (6.34)"}],"minor_comments":[{"comment":"The abstract states the transfer for all alpha > 0, but Theorem 1.2 proves the lower bound only for alpha >= 1/2, with additional arguments needed for all alpha > 0 in the applications. This discrepancy should be clarified in the statement of the abstract or the theorem.","section":"Abstract and Theorem 1.2"},{"comment":"The notation Q(s) = 2 Q(s) is confusing because the same symbol is used for the rescaled generator; a different symbol, such as Q'(s) or a sentence explaining the rescaling, would make the argument easier to follow.","section":"Section 2, around Eq. (2.15)"},{"comment":"The displayed formula in (1.55) appears to have a missing fraction: the denominator should be (sum_{l=1}^k l p_l)^2, as used later in the proof.","section":"Theorem 1.9, Eq. (1.55)"}],"recommendation":"major_revision","confidential_remarks":"The paper contains a genuine and interesting transfer principle, and the applications are substantial. The main concern is the limsup/limit mismatch in Eq. (6.44); I would not reject on this basis, because the applications appear to have the stronger limit from Koval-type theorems. The editorial decision should ensure that the revised version either strengthens the hypothesis of Theorem 1.2 or supplies a subsequence argument that works with only the limsup assumption."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things to know. First, this is a serious paper with a genuinely new transfer principle: a Gaussian LIL for a sequence with covariance U is transferred to a permanental LIL for the nonsymmetric kernel U + f, where U is a symmetric transient Markov potential and f is excessive. That is a real organizer for the class of non-Gaussian infinitely divisible sequences the authors have been developing, and the applications — birth-death processes with and without emigration, first- and higher-order AR covariances, Lévy potentials — are actually worked, not just asserted. The example-specific verification of the inverse-matrix estimates (Lemmas 2.6, 3.3, 5.14) is the real work and it holds up on my read.\n\nSecond, the proof of the main theorem has a genuine lim/limsup mismatch at its load-bearing joint. Equation (6.44) is justified by Lemma 6.5, but Lemma 6.5 requires a full limit in (6.47) while Theorem 1.2 only assumes limsup in (1.8). The step is false as written: for iid N(0,1) with φ_j = log j the limsup of the normalized absolute value is 1 a.s., but the squares have liminf 0, so the stated limit of the average squares fails. The stress-test note is right that this is an internal gap, not a too-weak hypothesis in an isolated lemma.\n\nThat said, the gap is repairable. A limsup version of Lemma 6.5 is true with the same proof: the upper bound comes from the finite net, the lower bound from projecting onto any fixed unit vector. Then (6.44) becomes a limsup statement, which is all the surrounding argument needs to get (1.10). My assessment is that Theorem 1.2 is true as stated and the applications are not in danger; the written proof just doesn't yet establish what it claims.\n\nMinor issues: the abstract advertises (0.2) for all α > 0, while Theorem 1.2 states α ≥ 1/2 and recovers all α through extra work in each example; that should be aligned. There is a small typo in Theorem 6.1 (δ_l = o(l)). The citation profile leans hard on the authors' own [9] and [10], but those are used as black-box lemmas, the normalizer φ is fixed by U and Koval's Gaussian LIL rather than fitted, and I see no circularity.\n\nWho it's for: people working on permanental processes, Markov-chain potentials, or Gaussian LIL transfer; the isymi comparison technique is worth studying on its own. I'd send it to a serious referee, with the instruction to require a corrected Lemma 6.5 or an explicit subsequence argument before passing the proof of Theorem 1.2.","headline":"A real transfer principle with a load-bearing lim/limsup gap in the proof; repairable, and worth sending to a referee.","tokens_in":59613,"tokens_out":5579,"would_cite":true,"duration_ms":53839,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60J27","60F20","60G17"],"pacs":[],"model":"deepseek-v4-flash","headline":"Adding an excessive function to a Markov potential transfers the Gaussian law of the iterated logarithm to permanental sequences.","keywords":["permanental sequences","alpha-permanental processes","law of the iterated logarithm","Gaussian sequences","Markov chain potentials","excessive functions","inverse M-matrices","birth and death processes"],"falsifier":"For the birth-death potential $V_{j,k}=s_j\\wedge s_k$, take $f_j=\\delta s_j$, which is excessive but not a potential; the explicit inverse in Lemma 2.6 gives $\\rho_{l,n}=\\delta$, independent of $l$, so hypothesis (1.7) fails. If simulation of the permanental sequence with kernel $V_{j,k}+\\delta s_k$ shows that $\\limsup \\widetilde X_{\\alpha,j}/(s_j K_s(j))$ is not $1$, this confirms that the uniformity estimate is doing the load-bearing work.","tokens_in":58576,"feed_emoji":"📈","tokens_out":9264,"duration_ms":84756,"temperature":0.7,"pith_summary":"This paper establishes a general transfer principle for permanental sequences, the nonnegative stochastic processes whose Laplace transform is $\\det(I+KS)^{-\\alpha}$. If the kernel is written as $\\widetilde U = U + f$, where $U$ is the symmetric potential of a transient symmetric Markov process (in the Borel right-process sense) and $f$ is an excessive function, then under three explicit conditions the almost-sure limsup of $\\widetilde X_{\\alpha,j}/\\phi_j$ equals the limsup of the Gaussian sequence with covariance $U$, namely $\\limsup \\eta_j/(2\\phi_j)^{1/2}=1$. The conditions are that the augmented matrix is an inverse M-matrix, that the inverse-potential row sums applied to $f$ vanish uniformly as the window moves to infinity, and that $f_j=o(\\phi_j)$. The payoff is a collection of sharp, explicit log-log and log asymptotics for permanental sequences based on birth-death processes, birth-death processes with emigration, first- and higher-order Gaussian autoregressions, and L\\'evy processes on the integers.","feed_headline":"Gaussian LIL transfers to permanental sequences","feed_subtitle":"Sharp almost-sure limits for birth-death and autoregressive permanental processes follow from one transfer theorem.","key_machinery":"The load-bearing object is the symmetrize-then-invert operation: for an inverse M-matrix $K$ (a positive kernel whose inverse has non-positive off-diagonal entries), set $A=K^{-1}$, form $A^{\\mathrm{sym}}$ by keeping the diagonal and replacing off-diagonal entries by $-(A_{i,j}A_{j,i})^{1/2}$, and define $K^{\\mathrm{isymi}}=(A^{\\mathrm{sym}})^{-1}$. For the extended kernels $K(l,n+1)$ built from $\\widetilde U$, the paper proves $1\\le \\nu_{l,n}=|A(l,n+1)^{\\mathrm{sym}}|/|A(l,n+1)|\\le 1+\\rho_{l,n}$, where $\\rho_{l,n}=\\sum_{j,k}(U(l,n))^{-1}_{j,k}f_{k+l}$. Condition (1.7) makes $\\rho_{l,n}=o_l(1)$, so the symmetrized permanental sequence is close in probability to the original one; its Gaussian representation then transfers the Gaussian law of the iterated logarithm. For the concrete examples, Koval's Gaussian LIL supplies the correct denominator $\\phi_j$, and inverses of the triangular potentials $s_j\\wedge s_k$ are computed explicitly.","core_discovery":"On its own terms, the paper's central claim is Theorem 1.2: let $X$ be a transient symmetric Borel right process with potential $U$, let $f$ be a finite excessive function, and form $\\widetilde U_{j,k}=U_{j,k}+f_k$. Then $\\widetilde U$ is the kernel of an $\\alpha$-permanental sequence $\\widetilde X_\\alpha$ for every $\\alpha>0$. If the nonnegativity condition (1.6) holds, if the quantitative estimate $\\sum_{j,k=1}^n (U(l,n))^{-1}_{j,k} f_{k+l}=o_l(1)$ holds uniformly in $n$, and if the Gaussian sequence $\\eta$ with covariance $U$ satisfies $\\limsup_{j\\to\\infty}\\eta_j/(2\\phi_j)^{1/2}=1$ a.s. with $f_j=o(\\phi_j)$, then $\\limsup_{j\\to\\infty}\\widetilde X_{\\alpha,j}/\\phi_j=1$ a.s. for every $\\alpha\\ge 1/2$. The upper bound is noted to hold for all $\\alpha>0$, and in the applications the lower bound is extended to all $\\alpha>0$ using earlier permanental-process technology. The proof compares the target permanental sequence with a symmetrized permanental sequence whose Gaussian representation is explicit, and controls the error by the ratio of the inverse M-matrix and its symmetrization.","pith_inferences":["The same transfer should work for other symmetric Markov-chain potentials whose finite-block inverses are explicit enough to verify (1.7), for instance potentials of random walks on trees or on finitely generated groups.","The ratio $\\nu_{l,n}$ can be read as a quantitative measure of how non-symmetric the kernel is: keeping it close to $1$ is what makes the permanental sequence mimic its Gaussian counterpart, so it could serve as a diagnostic for Gaussian-like extremes in other permanental processes.","The paper itself notes that the restriction $f_j=o(j^{1/2})$ in Theorem 1.10 is probably unnecessary; a natural next step is to replace it by $f_j=o(j)$ and check whether the all-$\\alpha>0$ lower bound persists.","Because the upper bound is trivial for all $\\alpha>0$ by infinite divisibility, the delicate point is the lower bound; the Gaussian decomposition in (6.39) suggests a route toward proving the lower bound for all $\\alpha>0$ under (1.7) alone, without the additional hypotheses used in the examples."],"forward_implications":["For every symmetric transient Borel right process satisfying (1.6)-(1.9), the Gaussian LIL transfers to the permanental sequence with kernel $U+f$: the upper bound holds for all $\\alpha>0$ and the lower bound for $\\alpha\\ge 1/2$, with the lower bound extended to all $\\alpha>0$ in the paper's applications.","For birth-death chains without emigration, $\\limsup_{j\\to\\infty}\\widetilde Y_{\\alpha,j}/(s_j K_s(j))=1$ for every $\\alpha>0$, and this simplifies to $s_j\\log\\log s_j$ or $s_j\\log j$ according to the growth rate of $s_j$.","For birth-death chains with emigration and for first-order Gaussian autoregressive potentials, the same principle gives $\\limsup \\widetilde Z_{\\alpha,j}/(W_{j,j}K_s(j))=1$ and the explicit $U_{j,j}\\log\\log$ or $U_{j,j}\\log j$ corollaries, including the constant $1-\\beta$ when $U_{j,j}$ is regularly varying with index $0<\\beta<1$.","For higher-order autoregressive potentials, if $\\sum_l p_l=1$ then $\\limsup \\widetilde Y_{\\alpha,j}/(j\\log\\log j)=1/(\\sum_l l p_l)^2$; if $\\sum_l p_l<1$ then $\\limsup \\widetilde Y_{\\alpha,j}/\\log j=c^*$, where $c^*$ is expressed through the roots of $P(x)=1-\\sum_l p_l x^l$.","For L\\'evy processes on $\\mathbb Z$ killed at an independent exponential time, even without symmetry of the kernel, $\\limsup \\widetilde X_{\\alpha,n}/\\log n=U_{0,0}$ a.s. whenever the added excessive function vanishes at infinity."],"supporting_citations":[{"why":"Supplies the permanental-kernel theorem that $\\widetilde U=U+f$ is the kernel of an $\\alpha$-permanental sequence, together with Lemma 7.1 for lower bounds and Lemma 7.3 for converging kernels.","marker":"[10]"},{"why":"Supplies Lemma 6.2's probability comparison and the fact that symmetrizing the inverse of an M-matrix gives another M-matrix.","marker":"[9]"},{"why":"Supplies Lemma A.1, showing finite blocks of a potential are inverse M-matrices; this is used throughout for $U(l,n)$ and for the diagonal bounds.","marker":"[8]"},{"why":"Supplies the characterization of inverse M-matrices as kernels of permanental variables and the lemma used to show the extended kernel $K(l,n+1)$ defines a permanental process.","marker":"[3]"},{"why":"Supplies Koval's law of the iterated logarithm for Gaussian sequences, which fixes the normalizing sequence $\\phi_j$ in all the concrete examples.","marker":"[5]"},{"why":"Supplies the standard bound $U_{j,k}\\le U_{j,j}\\wedge U_{k,k}$ and the invertibility facts for the finite blocks $U(l,n)$.","marker":"[6]"}],"fun_headline_variants":["Gaussian LIL extends to permanental sequences","Permanental sequences inherit Gaussian LIL","LIL transfer: Gaussian to permanental","Permanental LIL from Gaussian comparison","Gaussian LIL implies permanental LIL"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The transfer rests on the quantitative estimate (1.7): the row sums of the inverse of every finite block of the potential, applied to the excessive function $f$, must tend to zero uniformly as the block is pushed out to infinity; if that estimate fails, the probability comparison in (6.35) has an uncontrollable error and the limsup transfer does not follow.","fun_headline_variants_meta":{"raw":{"variants":["Gaussian LIL extends to permanental sequences","Permanental sequences inherit Gaussian LIL","LIL transfer: Gaussian to permanental","Permanental LIL from Gaussian comparison","Gaussian LIL implies permanental LIL"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000699,"raw_usage":{"total_tokens":3283,"prompt_tokens":1199,"completion_tokens":2084,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":815,"completion_tokens_details":{"reasoning_tokens":2016}},"tokens_in":815,"tokens_out":2084,"duration_ms":17501,"temperature":1.0,"reasoning_tokens":2016,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:51:06.172414+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For the birth-death potential $V_{j,k}=s_j\\wedge s_k$, take $f_j=\\delta s_j$, which is excessive but not a potential; the explicit inverse in Lemma 2.6 gives $\\rho_{l,n}=\\delta$, independent of $l$, so hypothesis (1.7) fails. If simulation of the permanental sequence with kernel $V_{j,k}+\\delta s_k$ shows that $\\limsup \\widetilde X_{\\alpha,j}/(s_j K_s(j))$ is not $1$, this confirms that the uniformity estimate is doing the load-bearing work.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the permanental-kernel theorem that $\\widetilde U=U+f$ is the kernel of an $\\alpha$-permanental sequence, together with Lemma 7.1 for lower bounds and Lemma 7.3 for converging kernels."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies Lemma 6.2's probability comparison and the fact that symmetrizing the inverse of an M-matrix gives another M-matrix."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies Lemma A.1, showing finite blocks of a potential are inverse M-matrices; this is used throughout for $U(l,n)$ and for the diagonal bounds."},{"cited_title":"Eisenbaum and H","cited_arxiv_id":null,"evidence_quote":"Supplies the characterization of inverse M-matrices as kernels of permanental variables and the lemma used to show the extended kernel $K(l,n+1)$ defines a permanental process."},{"cited_title":"Koval, The law of the iterated logarithm for Gaussia n sequences and its applications, Theor","cited_arxiv_id":null,"evidence_quote":"Supplies Koval's law of the iterated logarithm for Gaussian sequences, which fixes the normalizing sequence $\\phi_j$ in all the concrete examples."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the standard bound $U_{j,k}\\le U_{j,j}\\wedge U_{k,k}$ and the invertibility facts for the finite blocks $U(l,n)$."}],"review_version":1}