Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 2 April
Let $S = (S(n))$ be a simple random walk on $\mathbb{Z}^{d}$ started at the origin. We study a loop-erasing procedure of $S[0,n]$ that differs from Lawler's chronological loop-erasure. Specifically, we remove loops from $S[0,n]$ in decreasing order of their lengths. The resulting random simple path is called the largest-loop-first (LLF) LERW. For $d=4$, we prove that the expected length of LLF LERW is of the order $n (\log n)^{-1/2 + o(1)}$. In particular, this suggests that chronological LERW and LLF LERW belong to different universality classes. Furthermore, we also prove the convergence of LLF LERW to Brownian motion in four dimensions.
Mathematical Physics
Functional relations in renormalization group methods for a class of ordinary differential equations
We develop a renormalization group (RG)-based perturbation scheme for a class of ordinary differential equations, including first-order systems with semisimple or nilpotent linear parts, as well as scalar higher-order equations. The key observation is that the secular coefficients arising in naive perturbation theory satisfy an exact functional relation. This yields, in a unified manner, several fundamental features of the RG method: the renormalized amplitudes satisfy a closed functional relation with a group-like structure, the RG equation governing their slow dynamics is obtained directly, the absence of secular terms is ensured to all orders, and the relation between bare and renormalized amplitudes admits an explicit inversion. The results extend earlier ones for second-order scalar equations.
Read the full abstract
Representation Theory
Godement-Jacquet gamma factors of distinguished representations of $\mathrm{GL}_n(\mathbb{F}_q)$
Let $k$ be a finite field of characteristic $p$. In the 1960s, Kondo attached non-abelian Gauss sums to irreducible $\mathbb{C}$-representations of $\mathrm{GL}_n(k)$, and computed them in terms of Green parameters. On the other hand, the Godement-Jacquet functional equation in which they occur was established by Macdonald in the 1980s. We first revisit Macdonald's and Kondo's results with a different perspective, in the process of generalizing their constructions to representations with coefficients in $\mathbb{Z}[\sqrt{p}^{-1},\mu_p]$-algebras. Then, when $p$ is odd and $R$ is an algebraically closed field of characteristic different to $p$, our main result shows that the Godement-Jacquet gamma factor of a cuspidal irreducible $R$-representation, which is distinguished with respect to the subgroup fixed by a Galois or an inner involution, coincides with the sign of the associated period under the normalizer of this subgroup. Finally, we compute the gamma factors of these distinguished representations in terms of Green's and James' parametrizations of irreducible cuspidal $R$-representations.
Read the full abstract
Numerical Analysis
Mixed Consistent PINNs for Elliptic Obstacle Problems with Stability Analysis
We propose a consistent physics-informed neural networks (CPINNs) framework for elliptic obstacle problems formulated as variational inequalities. The method is based on a mixed loss functional that is rigorously aligned with the stability structure of the underlying problem and incorporates obstacle constraints through a consistent treatment of the associated Lagrange multiplier. Relying on optimal recovery theory under Besov regularity assumptions, we establish near-optimal convergence rates for the simultaneous reconstruction of the solution and the multiplier from pointwise interior and boundary data. To enable practical implementation, we construct discrete counterparts of the continuous stability norms and duality pairings, leading to fully computable and theoretically justified training losses. Numerical experiments on benchmark obstacle problems demonstrate the accuracy, stability, and robustness of the proposed approach, and highlight its clear advantages over standard PINNs.
Read the full abstract
Combinatorics
On the Variance Fraction of the Hard-Core Model on Graphs with Bounded Maximum Degree
The hard-core model can be used to understand the number of independent sets in graphs in extremal graph theory. The occupancy fraction, defined by Davies et al. in 2017 as the logarithmic derivative of the independence polynomial of a graph, is a key quantity in the hard-core model. The variance fraction, introduced by Davies et al. in 2025, is defined as the derivative of the occupancy fraction with respect to the logarithm of the fugacity. Since the occupancy fraction can be obtained by integrating the variance fraction with respect to the logarithm of the fugacity, bounding the variance fraction yields the corresponding bounds on the occupancy fraction. Moreover, the occupancy fraction correlates, in quantity, to the independence polynomial. In this note we provide two lower bounds on the variance fraction, proving the conjecture by Davies et al. in 2025, for graphs with bounded maximum degree and for graphs with $n$ vertices, respectively. We also derive lower bounds for other graph classes, including graphs with a given edge chromatic number, $d$-regular graphs, and triangle-free graphs with bounded maximum degree.
Read the full abstract
Analysis of PDEs
Scale-critical curve diffusion flows
We introduce and study a one-parameter family of curve diffusion flows with a scale-critical cubic curvature term for closed immersed planar curves. We first classify all closed stationary solutions, showing that they are precisely circles or a unique family of “super-lemniscates”. We then analyse the dynamical stability of homothetic circles. Under a sharp spectral condition, we establish, by purely variational methods, that any small perturbation of an $\omega$-fold circle monotonically approaches the unit $\omega$-circle after rescaling, translation, and reparametrisation. As a corollary, we determine the sharp ranges of the parameter for the stability of an embedded circle, and of all $\omega$-circles. We also uncover a striking arithmetic structure in the stability landscape, where the stability of $\omega$-circles depends non-monotonically on $\omega$.
Read the full abstract
Group Theory
Semiring identities in the semigroup $B_2$
The 5-element Brandt semigroup $B_2$ admits the structure of a naturally semilattice-ordered inverse semigroup, thus becoming an additively idempotent semiring with the operation of taking greatest lower bounds as the semiring addition. For this semiring we present a finite basis of identities and thus, by the previous results, complete the solution of Finite Basis Problem for combinatorial naturally semilattice-ordered inverse semigroups.
Read the full abstract
Probability
Chung-type laws of the iterated logarithm for $m$-fold weighted integrated fractional processes
Let $\{B_H(t);t\ge 0\}$ be a fractional Brownian motion of order $H\in (0,1)$, and $J_{m,\alpha}(B_H)$ be the $m$-fold weighted integrals of $B_H$ defined as $$ J_{m,\bm\alpha}(B_H)(t) =\int_0^ts_m^{-\alpha_m}\int_0^{s_m}\cdots s_2^{-\alpha_2}\int_0^{s_2}s_1^{-\alpha_1}B_H(s_1)d s_1\; ds_2\cdots d s_m, $$ where $\alpha_1+\cdots+\alpha_i<H+i$, $i=1,\ldots,m$, $\bm\alpha=\bm\alpha_m=(\alpha_1,\ldots,\alpha_m)$. We show that \begin{align*} \liminf_{T\to \infty} \frac{(\log\log T)^{H+m}}{T^{H+m-\alpha}}\sup_{0\le t\le T}\left|\frac{ J_{m,\bm\alpha}(B_H)(t)}{t^{\alpha-\alpha_1-\cdots-\alpha_m}}\right| = a_H\left( \frac{\kappa_{H+m}}{1-\alpha/(H+m)}\right)^{H+m}\;\; a.s. \end{align*} for all $\alpha<H+m$, and \begin{align*} \liminf_{T\to \infty} & \sqrt{\frac{\log\log\log T}{\log T}} \sup_{1\le t\le T}\left|\int_1^t \frac{J_{m-1, \bm\alpha_{m-1}}(B_H)(s)}{s^{H+m-\alpha_1-\cdots-\alpha_{m-1}}}ds\right| &= \frac{\pi}{2}\frac{\sqrt{\beta(2H,1-H)}}{\prod_{i=1}^{m-1}\big(H+i-\alpha_1-\cdots-\alpha_i\big)}\;\; a.s., \end{align*} where $a_H$ is an explicit constant with $a_{\frac{1}{2}}=1$, $\kappa_{\lambda}$ is a constant which depends only on $\lambda$, and $\beta(a,b)$ is the beta function.In particular, the exact value of a Chung-type law of the iterated logarithm established by Duker, Li and Linde (2000) is found, and as an application, the Chung-type law of the iterated logarithm for the randomized play-the-winner rule is established. The small ball probabilities of \(J_{m, \bm\alpha}(B_H)\) are established to show the liminf behaviors. Similar Chung-type laws of the iterated logarithm and small ball probabilities for a Riemann-Liouville fractional process are also established.
Read the full abstract
Geometric Topology
Dehn filling and the knot group II: Ubiquity of persistent elements
Let $K$ be a nontrivial knot in $S^3$. We say that an element of the knot group $G(K)$ is persistent if it remains nontrivial under all nontrivial Dehn fillings. Such elements exist for every nontrivial knot. Indeed, Property P is equivalent to the statement that the meridian of $K$ is a persistent element, and this represents the first instance of such elements. Building on the solution to the Property P conjecture due to Kronheimer and Mrowka, we show that every nontrivial knot group admits infinitely many persistent elements with pairwise disjoint automorphic orbits, none of which contains a power of the meridian. We then develop this further to show that for a broad class of hyperbolic knots - namely those admitting no surgery whose resulting manifold has torsion in its fundamental group - persistent elements are not rare curiosities, but rather structurally pervasive in $G(K)$. This is reflected in the following two properties: (i) Every subgroup of $G(K)$ that is not contained in the normal closure of a peripheral element contains persistent elements. (ii) Persistent elements exist outside every proper subgroup of $G(K)$.
Read the full abstract
Probability
Lecture notes: Probability with Measure
Lecture notes as per the title. In the first part, the concepts of a measurable space, measurable maps between measurable spaces and that of a measure on a measurable space are introduced, after which the fundamentals of the theory of Lebesgue integration are developed: convergence theorems, product spaces and Tonelli-Fubini, indefinite integration and absolute continuity, L-spaces and integral inequalities. Everything is set up so that in the second part the fundamental concepts of probability (such as those of random elements and their laws, independence, conditioning) can be cast swiftly in the measure-theoretic setting. Some emphasis is placed on monotone class and Dynkin's lemma type arguments. Products of arbitrary families of probabilities and Kolmogorov's extension theorem are treated.
Read the full abstract
Algebraic Geometry
The Integral Chow Ring of Smooth Non-strict Toric Stacks
We extend the Stanley-Reisner ring to the non-strict stacky fans introduced by Geraschenko and Satriano. We then prove that this ring is isomorphic to the integral Chow ring of the smooth non-strict toric stack defined by the given non-strict stacky fan. This generalizes known results for the integral Chow rings of less general toric stacks.
Read the full abstract
Number Theory
Overconstrained character sums over finite abelian groups and decompositions of generalized bent, plateaued and landscape functions
Generalized bent (gbent) functions from an $n$-variable Boolean space to $\mathbb{Z}_{2^k}$ are central in cryptography and sequence design. Instead of the usual binary decomposition, we introduce a $2^\ell$-adic representation, for $k=\ell r$, writing such functions as linear combinations of $r$ component functions valued in $\mathbb{Z}_{2^\ell}$. We prove a general result on overconstrained character sums over finite abelian groups: under a common-argument hypothesis, sequences with two-level Fourier magnitude spectra must be extremely sparse, with a conditional extension to multi-level spectra. As an application, we derive consequences for generalized plateaued functions under suitable assumptions. We then show that if $f:\mathbb{F}_2^n\to\mathbb{Z}_{2^k}$ is landscape, then under the $2^\ell$-adic decomposition every function in a certain affine space over $\mathbb{Z}_{2^\ell}$ is again landscape with the same Walsh magnitudes. This gives an unconditional necessity result, with no structural assumptions on $f$, together with a complete characterization using only a small subset of these maps. For generalized bent and generalized plateaued functions, sufficiency is also obtained from linear combinations of lower components under natural assumptions; a counterexample shows these assumptions are essential. Our method reduces verification for landscape functions from $2^{2^{k-1}}$ checks to fewer than $2^{k-\ell+1}+1$ conditions; for gbent functions this drops to a single basis function under the common-argument hypothesis, and for generalized plateaued functions, under additional assumptions, to $2^{k-\ell}$ checks. The $2^\ell$-adic framework also preserves key properties, including duality and differential uniformity.
Read the full abstract
Numerical Analysis
The Landau–Lifshitz–Bloch equation with spin diffusion: Global strong solution and finite element approximation
The spin-diffusion Landau–Lifshitz–Bloch (SDLLB) system is a nonlinearly coupled system of quasilinear vector-valued PDEs which models the interaction between spin-polarised currents and magnetisation at high temperatures. The aim of this paper is twofold. Firstly, assuming the initial data is sufficiently small, we show the existence of a unique global strong solution to the SDLLB equation in a bounded domain $\Omega\subset \mathbb{R}^d$, where $d\leq 3$, thus ensuring well-posedness of the model. Secondly, we propose a decoupled linearised fully-discrete finite element scheme to solve the problem. Despite the strong nonlinearity of the system, the proposed scheme only requires the solution of two completely decoupled linear systems per time-step. Assuming adequate regularity of the exact solution and a certain time-step constraint, we rigorously show that the numerical scheme converges at an optimal rate. Several numerical experiments corroborate our theoretical results.
Read the full abstract
Analysis of PDEs
Analyticity up to the boundary for the divergence equation
We address analytic regularity for the divergence equation $\text{div}\, u = f$ in $\Omega$, with $u=0$ on $\partial\Omega$, where $\Omega$ is an arbitrary bounded analytic domain and $\int_{\Omega} f\,dx=0$. If $f$ is analytic on the closure of $\Omega$, then we prove that there exists a solution that is analytic on the closure of $\Omega$.
Read the full abstract
Mathematical Physics · Cross-listed from nlin.PS
One-Parameter Family of Elliptic Sine-Gordon Equations
We introduce a continuous one-parameter family of elliptic sine-Gordon equations (SGE) characterized by the modulus $0 \le m \le 1$ of Jacobi elliptic functions and analyze some of its properties and obtain its kink solution for various values of modulus $m$. These elliptic SGE have the novel property that while in the limit $m = 0$ they go over to the integrable sine-Gordon equation, in the $m = 1$ limit they go over to the integrable sine hyperbolic-Gordon equations (SHGE).
Read the full abstract
Functional Analysis
Mountain-Pass Solutions for Second-Order Ergodic Mean-Field Game Systems
We study the existence of mountain-pass solutions to a potential-free mean-field game system in the whole space $\mathbb R^n$ under the mass-supercritical regime, assuming an aggregating local coupling and a $C^2$ Hamiltonian that is $\gamma$-homogeneous with $\gamma > 1$. Due to the lack of smoothness of the underlying variational structure, the standard deformation lemma and the classical mountain-pass theorem are not directly applicable. To overcome this difficulty, we constrain the nonlinear term and employ a two-stage linearization argument to establish the existence of least-energy solutions to an auxiliary mean-field game problem with general coercive potentials. In the vanishing coercive potential limit, we recover compactness by using maximal regularity for Hamilton-Jacobi equations together with Pohozaev-type identities, and show that the potential-free mean-field game system admits a classical solution, which is also an optimizer of a Gagliardo-Nirenberg type inequality. Finally, we analyze the mountain-pass geometry of the variational structure, which yields that the solution obtained above corresponds to a mountain-pass type solution of the original mean-field game system. These results provide an affirmative answer to the longstanding problem concerning the existence of mountain-pass solutions for mean-field game systems. Furthermore, as a byproduct, we relax the admissible set and provide a unified framework for establishing the optimal Gagliardo-Nirenberg inequality below the Sobolev critical exponent.
Read the full abstract
Optimization and Control
Strong Convergence of FISTA for Affinely Constrained Convex Quadratic Minimization
In October 2025, research by Boţ, Fadili, and Nguyen, and by Jang and Ryu, led to the seminal result that Beck and Teboulle's FISTA converges weakly to a minimizer of the sum of two convex functions resolving a long-standing open problem. The first strong convergence result was obtained in November 2025 by Moursi, Naguib, Pavlovic, and Vavasis for affinely constrained convex minimization provided certain closedness conditions hold. In this paper, we prove strong convergence in the affine-quadratic case without any closedness assumption. Specializing this to the unconstrained case, we obtain the strong convergence of Nesterov's accelerated gradient method when applied to a convex quadratic objective function.
Read the full abstract
Group Theory
Universal virtual braid groups
We introduce the universal virtual braid group $UV_n(c)$, which provides a unified algebraic framework for virtual braid–type structures with $c$ types of crossings and admits natural quotient maps onto the standard families in the literature. We prove that $UV_n(c)$ contains a right-angled Artin subgroup of finite index, yielding strong structural consequences: residual finiteness, linearity, solvability of the word and conjugacy problems, and the Tits alternative. For $n\ge 5$, the commutator subgroup $UV_n(c)'$ is perfect, and every non-abelian finite image contains a subgroup isomorphic to the symmetric group $S_n$; in particular, $S_n$ is the smallest non-abelian finite quotient. These rigidity phenomena persist under a broad class of natural quotients, including virtual braid, virtual singular braid, virtual twin and multi-virtual braid groups. We further obtain a complete classification of subgroup separability (LERF) and the Howson property for $UV_n(c)$ and its pure subgroup $PUV_n(c)$, showing that both properties hold precisely for $n\le 3$. We also compute the virtual cohomological dimension, determine the center, prove that the finite-index RAAG subgroup is characteristic, and construct explicit finite quotients of $UV_n(c)$ whose order is strictly larger than $n!$.
Read the full abstract
Probability
Hierarchical symmetry selects log-Poisson cascades: classification, uniqueness, and stability
Within i.i.d. multiplicative cascades, a single axiom – the hierarchical symmetry, a linear contraction on incremental scaling exponents – is shown to be necessary and sufficient for the cascade multiplier to be log-Poisson. We prove: (1) a characterization theorem determining the log-Poisson law with explicit parameters, within the class of all multipliers with finite lattice moments; (2) a classification theorem locating the log-Poisson class inside the log-infinitely-divisible family and identifying the mechanism by which every rival sub-family fails the symmetry; (3) a stability theorem with sharp constants – $(1+\beta)^{1/2}$ when the limiting increment is known, $\sqrt{2}$ when it is fitted – and (4) an unconditional propagation theorem transferring the bound to the multiplier distribution at the sharp rate $\Theta(\sqrt{\varepsilon})$, with a matching lower bound. Beyond independence, the classification extends exactly at the level of asymptotic statistics (limiting cumulant generating function, large deviations, multifractal spectrum) and provably not at the level of laws: an explicit stationary ergodic Markov multiplier satisfies the symmetry exactly with a non-log-Poisson marginal, while exchangeable multipliers collapse to the i.i.d. log-Poisson cascade and finite-state Markov multipliers cannot satisfy the symmetry at all. In the continuous category of exactly scale-invariant log-infinitely-divisible multifractal random measures, no finite moment window of structure-function exponents identifies the cascade class, whereas at the level of the scale-invariance generator the symmetry selects exactly the Barral-Mandelbrot compound Poisson cascade, with scale-ratio-free stability constants. The proofs reduce to second-moment identities on [0,1] via the change of variables $u = e^{kx}$, boundedness of the multiplier, and multiplicative couplings.
Read the full abstract
Algebraic Geometry
On relative Ulrich bundles and generalized Clifford algebras
We give a Clifford-theoretic description of relatively Ulrich bundles on smooth families of hypersurfaces. A split projection centre produces an explicit monic Clifford algebra whose locally free representations are exactly the relatively Ulrich bundles. For quadric fibrations, the description is intrinsic and requires no projection centre; the even Clifford algebra gives exact formulas for the minimal relative Ulrich rank in terms of Brauer classes and monodromy. We also obtain applications to stability, moduli, and relative wildness.
Read the full abstract
Optimization and Control · Cross-listed from stat.ML
Random Coordinate Descent on the Wasserstein Space of Probability Measures
Optimization over the space of probability measures endowed with the Wasserstein-2 geometry is central to modern machine learning and mean-field modeling. However, traditional methods relying on full Wasserstein gradients often suffer from high computational overhead in high-dimensional or ill-conditioned settings. We propose a randomized coordinate descent framework specifically designed for the Wasserstein manifold, introducing both Random Wasserstein Coordinate Descent (RWCD) and Random Wasserstein Coordinate Proximal{-Gradient} (RWCP) for composite objectives. By exploiting coordinate-wise structures, our methods adapt to anisotropic objective landscapes where full-gradient approaches typically struggle. We provide a rigorous convergence analysis across various landscape geometries, establishing guarantees under non-convex, Polyak-Łojasiewicz, and geodesically convex conditions. Our theoretical results mirror the classic convergence properties found in Euclidean space, revealing a compelling symmetry between coordinate descent on vectors and on probability measures. The developed techniques are inherently adaptive to the Wasserstein geometry and offer a robust analytical template that can be extended to other optimization solvers within the space of measures. Numerical experiments on ill-conditioned energies demonstrate that our framework offers significant speedups over conventional full-gradient methods.
Read the full abstract
Representation Theory
Wavefront sets for genuine representations of $\rm GL$-covers of Kazhdan–Patterson or Savin types
First, we consider general Brylinski–Deligne covers of the $p$-adic general linear groups, and discuss the theory of Bernstein–Zelevinsky derivatives. We also recall the Zelevinsky-type classification of the irreducible genuine spectrum for the Kazhdan–Patterson and Savin covers. Following this, for these two special families of covers, we determine the wavefront sets of their irreducible genuine representations, expressed in terms of the iterated degrees of the highest Bernstein–Zelevinsky derivatives. Finally, for Kazhdan–Patterson covers, we reinterpret this result on the wavefront set using a version of the local Langlands correspondence and the covering Barbasch–Vogan duality.
Read the full abstract
Mathematical Physics
Edge localization and Lifshitz tails for graphs with Ahlfors regular volume growth
In this work, we study the Anderson model on graphs with Ahlfors $\alpha$-regular volume growth. We show that, under mild regularity assumptions of the random distribution, Lifshitz-tail type estimates near the bottom of the spectrum lead to exponential decay of fractional moments of the Green's function and thus spectral and dynamical localization at low energies. This generalizes the result of [4] from the lattice $\mathbb{Z}^d$ to Ahlfors $\alpha$-regular graphs. In addition, we establish Lifshitz tail estimates for the integrated density of states, with the Lifshitz exponent determined by the ratio of the volume growth rate and the random walk dimension of the underlying graphs, under certain assumptions on low lying eigenvalues of the Dirichlet and Neumann Laplacian on the graph. As an application, we verify all conditions on the Sierpinski gasket graph and obtain that, under mild regularity assumptions of the random distribution, for any fixed disorder, the Anderson model on the Sierpinski gasket graph has pure point spectrum and exhibits strong dynamical localization near the bottom of the spectrum.
Read the full abstract
Probability · Cross-listed from stat.CO
Simulation and Analysis of Multifractional Stochastic Processes with R Package Rmfrac
Brownian motion and fractional Brownian motion have been widely applied in statistical modeling in finance, telecommunication, network traffic, neuroscience, physics, and other fields. More realistic models for real time series data, such as multifractional processes, generalize these classical models by allowing their regularity to vary over time. A new class of Gaussian Haar-based multifractional processes, which utilizes the Haar wavelet series representation, was recently introduced. It significantly extends the range of available models by incorporating more general classes of Hurst functions. The Rmfrac package was developed to simulate multifractional time series. The package also comprises several functions for the analysis and visualization of time series. It includes the estimation of the Hurst function and local fractal dimension, clustering realizations and computing various geometric statistics of these time series. The package also offers a Shiny application to visualize simulation and estimation results. The article presents an overview of the Rmfrac package and exemplifies its main functionalities.
Read the full abstract
Number Theory
On finite analogues of Dobiński's formula and of Euler's constant via Gregory polynomials
We study a finite analogue of Dobiński's formula, which is related to the Napier constant $e$, and its Bessel-type generalizations. Furthermore, using Gregory polynomials, we extend the results of Kaneko–Matsusaka–Seki on finite analogues of Euler's constant, and compare them with the Wilson-type analogue $\gamma_\mathcal{A}^\mathrm{W}$.
Read the full abstract
Algebraic Geometry
Tropical covers, tropical abelian varieties and Prym varieties
We define and investigate the tropical Prym varieties associated to unramified Galois cyclic covers of tropical curves (or equivalently metric graphs) $\tilde{\Gamma}\to \Gamma$. Our approach here is to study the tropical Prym varieties using group actions on tropical abelian varieties induced by the cyclic Galois group of the cover of tropical curves. We also define and conider the Abel-Prym map for tropical cyclic covers extending that for double covers. As a special case we consider free $\Z_3$-covers of tropical curves and their associated tropical Prym variety and compute its volume generalizing the case of double covers.
Read the full abstract
Dynamical Systems
When is cumulative dose response monotonic? Analysis of incoherent feedforward motifs
We study the monotonicity of the cumulative dose response (cDR) for a class of incoherent feedforward motifs (IFFM) systems with linear intermediate dynamics and nonlinear output dynamics. While the instantaneous dose response (DR) may be nonmonotone with respect to the input, the cDR can still be monotone. To analyze this phenomenon, we derive an integral representation of the sensitivity of cDR with respect to the input and establish general sufficient conditions for both monotonicity and nonmonotonicity. These results reduce the problem to verifying qualitative sign properties along system trajectories. The structural conditions identify eight canonical IFFM models, four of which are analyzed in detail within the proposed framework. In particular, IFFM1 and IFFM3 exhibit monotone cDR despite potentially nonmonotone DR, while IFFM2 is monotone already at the level of DR, which implies monotonicity of cDR. In contrast, IFFM4 exhibits nonmonotone cDR. Numerical simulations indicate that these properties persist beyond the structured initial conditions used in the analysis. Overall, our results provide a unified framework for understanding how system structure shapes monotonicity in cumulative input–output responses.
Read the full abstract
Statistics Theory
Asymptotic theory and first-order bias of the Wallace–Freeman estimator
The Wallace–Freeman estimator is a classical minimum message length estimator whose relationship with likelihood-based asymptotic theory has not been fully developed. We show that, in regular parametric models, the Wallace–Freeman criterion is equivalent, up to constants, to a penalised likelihood criterion with penalty weight \(n^{-1}\). This representation places the estimator within the standard theory of penalised M-estimation and yields existence, consistency, an asymptotic linear expansion, and asymptotic normality under regularity conditions. We further derive the first-order difference between the Wallace–Freeman estimator and the maximum likelihood estimator, showing that it is an explicit \(O(n^{-1})\) shift determined by the gradient of the Wallace–Freeman penalty. Combining this expansion with the Cox–Snell formula gives a first-order bias expansion for the Wallace–Freeman estimator. The result clarifies its relationship with maximum likelihood, Jeffreys-prior penalisation, and Firth-type bias reduction. We illustrate the theory for the Weibull model, where the penalty modifies the leading bias of the maximum likelihood estimator of the shape parameter.
Read the full abstract
Complex Variables
Energy estimates for level sets of holomorphic functions and universal counterexamples to Calderón-Zygmund theory
We demonstrate that the failure of $L^1$ regularity in Calderón-Zygmund theory is a universal phenomenon: every non-constant holomorphic function in $\C^n$ generates a counterexample to the Poisson equation. In order to achieve this goal, we shall establish sharp level-set estimates that link harmonic analysis to the geometry of complex structure through Hironaka's resolution of singularities and the Łojasiewicz gradient inequality.
Read the full abstract
Optimization and Control · Cross-listed from quant-ph
Scalable Ground-State Certification of Quantum Spin Systems via Structured Noncommutative Polynomial Optimization
A fundamental challenge in quantum physics is determining the ground-state properties of many-body systems. Whereas standard variational approaches posit a wave-function ansatz and minimize over the possible states expressible by that ansatz, the problem can alternatively be formulated as a noncommutative polynomial optimization problem and treated through a hierarchy of semidefinite programming relaxations. In contrast to variational calculations, these relaxations provide lower bounds on ground-state energies and both lower and upper bounds on observable expectation values. However, this approach typically suffers from severe scalability issues, limiting its applicability to small-to-medium-scale systems. In this article, we demonstrate that systematically leveraging the inherent structures of the system can substantially mitigate these scalability challenges and thus permits computing meaningful bounds for quantum spin systems on square lattices of size up to $16\times16$.