Peer Revenue Publish or profit

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Saturday 28 March

Probability

Viral Quasispecies Evolution as a Branching Random Walk on the Hypercube

We study a continuous-time nearest-neighbor branching random walk on the $d$-dimensional $b$-ary hypercube $\{0,1,\dots,b-1\}^d$ as a model for viral quasispecies evolution under mutation and replication. Motivated by mutagenic antiviral treatments and evolutionary-safety questions, we analyze the first passage time to a fixed target genotype at Hamming distance $m$, corresponding to the first appearance of a prescribed collection of mutations. We derive sharp asymptotics for these first passage times, uniformly for $m\le d/L$ as $d\to\infty$ (where $L>0$ is a large constant), and identify a phase transition in first-passage scaling at $\rho=e$, where $\rho$ denotes the effective growth parameter. In the slow-branching regime $\rho\in(1,e)$ relevant to mutagenic treatment scenarios, the first passage time is asymptotically affine in the genome length $d$ and the target distance $m$. In particular, when replication is fixed and mutation exceeds branching, increasing the mutation rate can delay the first appearance of a prescribed genotype by order $d$, providing a quantitative perspective on evolutionary safety.
Read the full abstract

Numerical Analysis

A Mean Field Games Perspective on Evolutionary Clustering

We propose a control-theoretic framework for evolutionary clustering based on quasi-stationary Mean Field Games. Each cluster is represented by a probability density whose evolution is governed by a Fokker–Planck equation, while the associated velocity field is determined through a stationary Hamilton–Jacobi equation. The general formulation does not prescribe a finite-dimensional statistical shape for the component densities, although the number of components is fixed. In the Gaussian specialization, we show that suitable affine dynamics reproduce the mean and covariance trajectories generated by the classical Expectation–Maximization procedure. To improve temporal coherence in the presence of noise and temporary cluster overlaps, we introduce causal and non-causal time-averaged log-likelihood objectives. We also develop a fully density-based numerical implementation for non-Gaussian components. The proposed formulations are assessed on synthetic and real time-dependent datasets and compared with independent snapshot Expectation–Maximization and with the same method applied to temporally smoothed observations. In the two-dimensional benchmark, an established evolutionary \(k\)-means method is also included as an external dynamic-clustering baseline.
Read the full abstract

Combinatorics

The Tutte symmetric matrix of a graph

We provide a matrix-based formula for the Tutte symmetric function of a graph. In particular, for any graph $G$ with a designated head and tail vertex, we describe an infinite matrix $M_G$ from which the Tutte symmetric function can be easily recovered. We prove gluing graphs together corresponds to matrix multiplication, gluing the head and tail of a single graph corresponds to taking the trace, and reversing a graph corresponds to the transpose (up to a change of basis).
Read the full abstract

Probability · Cross-listed from cs.CC

Random tensor isomorphism under orthogonal and unitary actions

We study the problem of testing whether two tensors in $\mathbb{R}^\ell\otimes \mathbb{R}^m\otimes \mathbb{R}^n$ are isomorphic under the natural action of orthogonal groups $\textbf{O}(\ell, \mathbb{R})\times\textbf{O}(m, \mathbb{R})\times\textbf{O}(n, \mathbb{R})$, as well as the corresponding question over $\mathbb{C}$ and unitary groups. These problems naturally arise in several areas, including graph and tensor isomorphism (Grochow–Qiao, SIAM J. Comp. '21), scaling algorithms for orbit closure intersections (Allen-Zhu–Garg–Li–Oliveira–Wigderson, STOC '18), and quantum information (Liu–Li–Li–Qiao, Phys. Rev. Lett. '12). We study average-case algorithms for orthogonal and unitary tensor isomorphism, with one random tensor where each entry is sampled uniformly independently from a sub-Gaussian distribution, and the other arbitrary. For the algorithm design, we develop algorithmic ideas from the higher-order singular value approach into polynomial-time exact (algebraic) and approximate (numerical) algorithms with rigorous average-case analyses. Following (Allen-Zhu–Garg–Li–Oliveira–Wigderson, STOC '18), we present an algorithm for a gapped version of the orbit distance approximation problem. For the average-case analysis, we work from recent progress in random matrix theory on eigenvalue repulsion of sub-Gaussian Wishart matrices (Christoffersen–Luh–O'Rourke–Shearer and Han, arXiv '25) by extending their results from side lengths of Wishart matrices linearly related to polynomially related.
Read the full abstract

All authors Jeremy Chizewer, Samuel Everett, Deven Mithal, Youming Qiao

Algebraic Geometry

k-Wahl chains and cyclic quotient singularities

We study two-dimensional cyclic quotient singularities defined by $k$-Wahl chains, a class of Hirzebruch–Jung continued fractions obtained inductively starting from $[k+2]$. This class includes the classical Wahl singularities in the case $k=2$ and also contains cyclic quotient singularities arising from $k$-generalized Markov triples. For singularities defined by $k$-Wahl chains, we prove that the combinatorics of the continued fraction is encoded in the special representations of the associated cyclic group. We also study zero continued fractions on the dual side and obtain consequences for the deformation theory of these singularities, including the existence of extremal P-resolutions in the case of $1$-Wahl chains.
Read the full abstract

Analysis of PDEs

$L^p$-estimates for the wave equation with partial inverse-square potentials

This paper investigates $L^p$-estimates for solutions to the wave equation perturbed by a scaling-critical partial inverse-square potential. We study a model in which the singularity of the potential appears only in a subset of the variables, corresponding to the Schrödinger operator $\mathcal{H}_a = -\Delta_x - \Delta_y + a/|x|^2$ on $\mathbb{R}^{2+n}$. Using spectral analysis, we establish the $L^p$-boundedness of the wave propagator $(1+\sqrt{\mathcal{H}_a})^{-\gamma} e^{it\sqrt{\mathcal{H}_a}}$ for a range of exponents $\gamma$ and $p$ satisfying $|1/p -1/2| < \gamma/(n+1)$. The key ingredients are the spectral measure kernel of the partial inverse-square operator $\mathcal{H}_a$ and the complex interpolation argument.
Read the full abstract

All authors Jialu Wang, Chengbin Xu, Fang Zhang, Junyong Zhang

Combinatorics

On the Ramsey numbers of fans and stars

Let $F_n$ be the graph on $2n+1$ vertices consisting of $n$ triangles meeting at a single vertex. After a number of improvements over the years, it is currently known that the Ramsey number of $F_n$ is between $4.5n-5$ (Chen, Yu, Zhao) and $(5+\frac{1}{6})n+O(1)$ (Dvořák and Metrebian). We improve both of these bounds as follows $$4.732n\approx (3+\sqrt{3})n-8< R(F_n)\leq (5+o(1))n.$$ Additionally, as it relates to the lower bound on $R(F_n)$ (and for which nothing was known when $n< m< n(n-1)$), we determine the Ramsey numbers of stars vs.~fans, within a constant, as follows $$R(K_{1,m}, F_{n})= \begin{cases} m+2n-\frac{1+(-1)^{m}}{2}, & m\leq n \frac{3m+\sqrt{m^2+8n^2}}{2}+\Theta(1), & m>n \end{cases}. $$ In particular, we have $R(K_{1,2n}, F_n)=(3+\sqrt{3})n+\Theta(1)$.
Read the full abstract

Optimization and Control

Meta-Contrastive Learning for Vision-Language Models via Task-Adaptive CLIP Training

We propose Domain-Conditioned Meta-Contrastive Learning, a framework for improving the cross-domain generalization of vision-language models. While contrastive models such as CLIP achieve strong performance through large-scale training, they rely on a global objective that does not explicitly account for domain shift. To address this limitation, we formulate multimodal learning as a bilevel meta-learning problem over domain-conditioned tasks. Specifically, we introduce domain embeddings that modulate image and text representations, and optimize the model for rapid adaptation to domain-specific distributions via gradient-based inner-loop updates. In addition, we incorporate a cross-domain alignment regularization to encourage domain-invariant representations. Our approach is compatible with standard contrastive training pipelines and can be applied to heterogeneous datasets spanning natural and medical domains. We expect improved robustness under domain shift and enhanced few-shot adaptation performance, highlighting a promising direction for scalable multimodal learning.
Read the full abstract

Numerical Analysis

Weak convergence order of stochastic theta method for SDEs driven by time-changed Lévy noise

This paper studies the weak convergence order of the stochastic theta method for stochastic differential equations (SDEs) driven by time-changed Lévy noise under global Lipschitz and linear growth conditions. In contrast to classical Lévy-driven SDEs, the presence of a random time change makes the weak error analysis involve both the discretization error of the underlying equation and the approximation error of the random clock. Moreover, compared with explicit Euler–Maruyama method, the implicit drift correction in the stochastic theta method makes the associated weak error analysis substantially more delicate. To address these difficulties, we first establish a global weak convergence estimate of order one for the stochastic theta method applied to the corresponding non-time-changed Lévy SDEs on the infinite time interval by means of the Kolmogorov backward partial integro differential equations. Incorporating the approximation of the inverse subordinator together with the duality principle, we derive the weak convergence order of the stochastic theta method with $\theta \in [0,1]$ in the time-changed Lévy setting. The result advances the currently available weak convergence analysis beyond the Euler–Maruyama method to the more general class of stochastic theta method, and establishes a workable route from the weak analysis of the underlying non-time-changed Lévy equation to the corresponding time-changed problem. Finally, numerical experiments are presented to further support the theoretical findings.
Read the full abstract

Logic

Gradualist descriptionalist set theory

We introduce a formal language GDST (gradualist descriptionalist set theory) with a family of interpretations indexed by ordinals, as well as a sublanguage NMID (the language of not necessarily monotonic inductive definitions), and show that the assertion that all propositions in NMID have well-defined truth values is equivalent to the existence for each $k \in \mathbb N$ of a sequence of ordinals $\eta_0 < . . . < \eta_k$ such that for each $i < k$, $\eta_i$ is $\eta_{i+1}$-reflecting, a notion we introduce which implies being $\Pi_n$-reflecting for all $n \in \mathbb N$ (and in particular being admissible and recursively Mahlo).
Read the full abstract

Information Theory · Cross-listed from stat.AP

Forecastability as an Information-Theoretic Limit on Prediction

Forecasting is usually framed as a problem of model choice. This paper starts earlier, asking how much predictive information is available at each horizon. Under logarithmic loss, the answer is exact: the mutual information between the future observation and the declared information set equals the maximum achievable reduction in expected loss. This paper develops the consequences of that identity. Forecastability, defined as this mutual information evaluated across horizons, forms a profile whose shape reflects the dependence structure of the process and need not be monotone. Three structural properties are derived: compression of the information set can only reduce forecastability; the gap between the profile under a finite lag window and the full history gives an exact truncation error budget; and for processes with periodic dependence, the profile inherits the periodicity. Predictive loss decomposes into an irreducible component fixed by the information structure and an approximation component attributable to the method; their ratio defines the exploitation ratio, a normalised diagnostic for method adequacy. The exact equality is specific to log loss, but when forecastability is near zero, classical inequalities imply that no method under any loss can materially improve on the unconditional baseline. The framework provides a theoretical foundation for assessing, prior to any modelling, whether the declared information set contains sufficient predictive information at the horizon of interest.
Read the full abstract

Numerical Analysis

Structural Inconsistency and Stability Classification of Multi-symplectic Diamond Schemes

Multi-symplectic diamond schemes proposed by McLachlan and Wilkins (2015) provide a framework for the numerical integration of Hamiltonian partial differential equations, combining local implicitness with high-order accuracy and discrete multi-symplectic conservation laws. Despite these advantages, their behavior beyond a limited class of model equations remains poorly understood, and numerical difficulties may arise depending on the underlying multi-symplectic formulation. In this paper, we present a systematic stability analysis framework for diamond schemes applied to general multi-symplectic PDEs. The approach consists of three stages. First, we identify structural inconsistency of the local diamond update using Dulmage–Mendelsohn decomposition, revealing cases in which the scheme is intrinsically unsolvable. Second, we introduce a graph-based error-propagation analysis that yields a necessary stability condition by detecting negative cycles in a weighted directed graph. Third, for equations that pass the preliminary tests, we derive eigenvalue-based timestep restrictions providing sufficient conditions for stability. The analysis leads to a comprehensive classification of multi-symplectic PDEs according to whether diamond schemes are structurally inconsistent, unconditionally unstable, or conditionally stable. In particular, we show that benchmark equations such as the Korteweg–de Vries equation are intrinsically incompatible with the diamond update, while systems including the nonlinear Dirac and “good” Boussinesq equations admit stability regimes under mild timestep scaling. Extensive numerical experiments confirm the theoretical predictions and demonstrate the practical implications of the proposed framework. Our results clarify fundamental limitations of diamond schemes and provide practical guidelines for their reliable application to new PDE models.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Dynamic resource matching in manufacturing using deep reinforcement learning

Matching plays an important role in the logical allocation of resources across a wide range of industries. The benefits of matching have been increasingly recognized in manufacturing industries. In particular, capacity sharing has received much attention recently. In this paper, we consider the problem of dynamically matching demand-capacity types of manufacturing resources. We formulate the multi-period, many-to-many manufacturing resource-matching problem as a sequential decision process. The formulated manufacturing resource-matching problem involves large state and action spaces, and it is not practical to accurately model the joint distribution of various types of demands. To address the curse of dimensionality and the difficulty of explicitly modeling the transition dynamics, we use a model-free deep reinforcement learning approach to find optimal matching policies. Moreover, to tackle the issue of infeasible actions and slow convergence due to initial biased estimates caused by the maximum operator in Q-learning, we introduce two penalties to the traditional Q-learning algorithm: a domain knowledge-based penalty based on a prior policy and an infeasibility penalty that conforms to the demand-supply constraints. We establish theoretical results on the convergence of our domain knowledge-informed Q-learning providing performance guarantee for small-size problems. For large-size problems, we further inject our modified approach into the deep deterministic policy gradient (DDPG) algorithm, which we refer to as domain knowledge-informed DDPG (DKDDPG). In our computational study, including small- and large-scale experiments, DKDDPG consistently outperformed traditional DDPG and other RL algorithms, yielding higher rewards and demonstrating greater efficiency in time and episodes.
Read the full abstract

Differential Geometry

Geometric Properties and Spectral Estimates on Warped Products

We establish an integral inequality for the Ricci curvature of a certain class of warped products $M\times_fN$, where the equality holds if and only if it is simply a Riemannian product. We also give a sufficient condition for the intersection of a warped product $M=\mathbb{R}\times_fP$ with a totally geodesic hypersurface $N$ in an arbitrary Riemannian space to be a totally geodesic slice of $M$. In addition, we establish some spectral estimates for the Laplacian of a submanifold $N$ that intersects a warped product in the same ambient manifold.
Read the full abstract

General Topology

Atoms of Compacta on Closed Surfaces

For any compact set $K$ lying on a closed surface $\mathcal{S}$ we introduce a closed equivalence relation $\sim$, called the Schönflies equivalence on $K$. We show that every class $[x]_\sim$ of $\sim$ is a continuum and that the resulting quotient space $K\!/\!\sim$ is a Peano compactum. By definition, all components of a Peano compactum are locally connected and for any $\varepsilon>0$ only finitely many of them have diameter greater than $\varepsilon$. The decomposition $\mathcal{D}_K=\{[x]_\sim: x\in K\}$ refines every other upper semicontinuous decomposition of $K$ into subcontinua that has a Peano compactum as its quotient space. In other words, $\mathcal{D}_K$ is the {\em core decomposition of $K$} with Peano quotient. The elements of $\mathcal{D}_K$ are called atoms of $K$. We also show that for any branched covering $f: \mathcal{S}^*\rightarrow \mathcal{S}$ from a closed surface $\mathcal{S}^*$ to $\mathcal{S}$, every atom of $f^{-1}(K)$ is sent into an atom of $K$. If $f$ is even a covering, it sends every atom of $f^{-1}(K)$ onto an atom of $K$. We illustrate our theory with examples and show that it cannot be generalized to $n$-manifolds with $n\ge 3$ by providing a detailed counterexample in~$\mathbb{R}^3$.
Read the full abstract

All authors Jun Luo, Joerg Thuswaldner, Xiao-Ting Yao, Shuqin Zhang

Friday 27 March

Probability · Cross-listed from cs.GT

Approximation Properties of Evolutionary Dynamics in Continuous-Time Finite State Space Games

This thesis studies the convergence of finite-population stochastic evolutionary dynamics to their deterministic mean-field limit in continuous-time finite state space games. We first develop refined ergodic theorems for Markov chains with a single positive-recurrent class, guaranteeing the existence of a unique invariant distribution and almost-sure convergence of time averages. Next, we prove that the mean-field model, described by a system of Lipschitz-continuous ordinary differential equations, admits a unique solution that depends continuously on its initial condition and that constitutes the almost-sure limit for the empirical distributions with fixed policy. Furthermore, we show that every Mixed Stationary Nash Equilibrium of the mean-field game is approximated by a Nash equilibrium of the corresponding $N$-player game within an error $\epsilon$ for sufficiently large $N$. We finally demonstrate, by Kurtz's theorem, that the empirical state-policy distribution converges in probability to the mean-field trajectory. Numerical simulations conducted in MATLAB confirm the theoretical $\mathcal{O}(N^{-1/2})$ convergence rate in both models across a range of population sizes.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Restless bandits with imperfect binary feedback: PCL-indexability analysis and computation

We study restless bandits with binary latent states and imperfect binary feedback, motivated by opportunistic spectrum access with sensing errors. For the associated belief-state model, we develop a partial conservation laws (PCL)-based analytical and computational framework for establishing indexability and evaluating the Whittle index, building on a verification theorem for real-state discounted restless bandits. The framework analyzes the stochastic dynamics via an associated deterministic skeleton, renewal decompositions, and combinatorics on words. It yields tractable expressions for discounted reward and resource metrics in several threshold regimes, enabling full verification of the PCL-indexability conditions there. For the remaining regime, where a complete analytic verification is not achieved in this paper, we derive efficient numerical schemes for computing the relevant marginal metrics and the marginal productivity (MP) index, which equals the Whittle index when those conditions hold. Extensive computational experiments provide strong evidence that these conditions also hold in that regime across broad parameter ranges and without the stringent parameter restrictions imposed in prior work. The experiments further show that theMP index policy typically outperforms standard benchmark policies, often by a substantial margin.
Read the full abstract

History and Overview of Mathematics

Helly's Theorem–A Very Early Introduction

We propose an interpretation of, and approach to, Helly's theorem that can be included quite early in the undergraduate curriculum. At the same time, the approach connects with contemporary models of data privacy and with sampling methods used in epidemiology. The presentation is intended to be accessible to teachers and their students.
Read the full abstract

Combinatorics

Graph Energies of Generalized and Shadow-Splitting Graphs

We extend the notions of the m-splitting graph Sm(G) and the m-shadow graph Dm(G) to introduce two new graph operations: the (p, q)-generalized splitting graph Sp,q(G) and the (c, k)-shadow-splitting graph Hc,k(G). We derive the adjacency energy of these constructions and as an application, identify several new infinite families of equienergetic and borderenergetic graphs.
Read the full abstract

Algebraic Geometry

Structure of the Components of the Fixed Locus of a Self-Map of the Berkovich Line

We describe the local and global structure of the fixed locus for the action of a rational function on the Berkovich projective line over a complete nontrivially-valued algebraically closed nonarchimedean field. This includes a bound for the number of connected components that is sharp when the residue characteristic is large or zero. The case of small nonzero residue characteristic will be treated in a subsequent article.
Read the full abstract

Algebraic Geometry

On the $\mathrm{PGL}_2$-equivariant intersection theory of $\mathrm{Gr}(2,4)$

We determine the $\mathrm{PGL}_2$-equivariant Chow ring of $\mathrm{Gr}(2,4)^s$, the $\mathrm{PGL}_2$-stable locus of $\mathrm{Gr}(2,4)$, over any algebraically closed based field of characteristic not equal to 2 or 3. In the process, we demonstrate that the quotient stack $[\mathrm{Gr}(2,4)^s/\mathrm{PGL}_2]$ can be presented as the quotient of an open subset of $\mathbb{P}^1$ by a suitably chosen $S_4\leq \mathrm{PGL}_2$. We also discuss some apparent difficulties with computing the full $\mathrm{PGL}_2$-equivariant Chow ring of $\mathrm{Gr}(2,4)$.
Read the full abstract

Number Theory

Improved Bounds for 3-Progressions

We prove that if $A\subset \{1,\dots,N\}$ has no nontrivial three-term arithmetic progressions, then $|A|\leq \exp(-c\log(N)^{1/6}\log\log(N)^{-1})N$ for some absolute constant $c>0$. To obtain this bound, we use an iterated variant of the sifting argument of Kelley and Meka, as well as an improved bootstrapping argument for Croot-Sisask almost-periodicity due to Bloom and Sisask.
Read the full abstract

Number Theory

Asymptotic Universal Koszulity in Galois Cohomology

We introduce the notion of asymptotic universal Koszulity for graded-commutative algebras generated in degree~$1$, capturing the idea that an infinite-dimensional algebra can be approximated by a filtered system of finite-type universally Koszul quadratic subalgebras. We establish basic structural properties of this class, including stability under filtered colimits, direct products, and base change, as well as a local finite-type criterion expressed in terms of finite-dimensional subspaces of the degree-one component. In the context of Galois cohomology, we prove a colimit theorem for pro-$p$ groups under mild assumptions, showing that cohomology rings arise as filtered colimits of finite quotients. This yields a general criterion under which the cohomology algebra of a profinite group is asymptotically universally Koszul. We further analyze finitely generated quotients via a finite-type capture result, identifying their cohomology with canonical quadratic subalgebras of the ambient algebra. Finally, we formulate conditional local–global and patching principles that isolate the mechanisms by which asymptotic universal Koszulity may arise in arithmetic settings. These results provide a flexible structural framework linking homological algebra, quadratic algebras, and Galois cohomology, and suggest several directions for further investigation.
Read the full abstract

Group Theory

A set theoretic version of equations on groups

Let $G$ be a finite group. The aim of this paper is to study the number of solutions $S\subseteq G$ of the equation $\mho^{\{n\}}(S)=L$, where $L$ is a non-empty subset of $G$, $n$ is a positive integer and $\mho^{\{n\}}(S)=\{ s^n \ | \ s\in S\}$. Besides our findings obtained in this general frame, we also outline some results which hold for some particular cases such as: i) $L$ is a normal subset of $G$; ii) $G$ is abelian; iii) $G$ is an extraspecial $p$-group.
Read the full abstract

Information Theory

Fixed-wing UAV relay optimization for coverage hole recovery

Unmanned aerial vehicles (UAVs) fill coverage holes as wireless relays during emergency situations. Fixed-wing UAVs offer longer flight duration and larger coverage in such situations than rotary-wing counterparts. Maximizing the effectiveness of fixed-wing UAV relay systems requires careful tuning of system and flight parameters. This process is challenging because factors including flight trajectory, timeshare, and user scheduling are not easily optimized. In this paper, we propose an optimization for UAV-based wireless relaying networks based on a setup which is applicable to arbitrary spatial user positions. In the setup, a fixed-wing UAV flies over a circular trajectory and relays data from ground users in a coverage hole to a distant base station (BS). Our optimization iteratively maximizes the average achievable spectral efficiency (SE) for the UAV trajectory, user scheduling, and relay timeshare. The simulation results show that our optimization is effective for varying user distributions and that it performs especially well on distributions with a high standard deviation.
Read the full abstract

Mathematical Physics · Cross-listed from eess.SY

Data-driven discovery and control of multistable nonlinear systems and hysteresis via structured Neural ODEs

Many engineered physical processes exhibit nonlinear but asymptotically stable dynamics that converge to a finite set of equilibria determined by control inputs. Identifying such systems from data is challenging: stable dynamics provide limited excitation and model discovery is often non-unique. We propose a minimally structured Neural Ordinary Differential Equation (NODE) architecture that enforces trajectory stability and provides a tractable parameterization for multistable systems, by learning a vector field in the form $F(x,u) = f(x)\,(x - g(x,u))$, where $f(x) < 0$ elementwise ensures contraction and $g(x,u)$ determines the multi-attractor locations. Across several nonlinear benchmarks, the proposed structure is efficient on short time horizon training, captures multiple basins of attraction, and enables efficient gradient-based feedback control through the implicit equilibrium map $g$.
Read the full abstract

Probability · Cross-listed from stat.ML

Parameter Estimation in Stochastic Differential Equations via Wiener Chaos Expansion and Stochastic Gradient Descent

This study addresses the inverse problem of parameter estimation for Stochastic Differential Equations (SDEs) by minimizing a regularized discrepancy functional via Stochastic Gradient Descent (SGD). To achieve computational efficiency, we leverage the Wiener Chaos Expansion (WCE), a spectral decomposition technique that projects the stochastic solution onto an orthogonal basis of Hermite polynomials. This transformation effectively maps the stochastic dynamics into a hierarchical system of deterministic functions, termed the propagator. By reducing the stochastic inference task to a deterministic optimization problem, our framework circumvents the heavy computational burden and sampling requirements of traditional simulation-based methods like MCMC or MLE. The robustness and scalability of the proposed approach are demonstrated through numerical experiments on various non-linear SDEs, including models for individual biological growth. Results show that the WCE-SGD framework provides accurate parameter recovery even from discrete, noisy observations, offering a significant paradigm shift in the efficient modeling of complex stochastic systems.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Hyperbolic Cluster States for Fault-Tolerant Measurement-Based Quantum Computing

Fault-tolerant measurement-based quantum computing (MBQC) provides a compelling framework for fault-tolerant quantum computation, in which quantum information is processed through single-qubit measurements on a three-dimensional entangled resource known as cluster state. To date, this resource has been predominantly studied on Euclidean lattices, most notably in the Raussendorf-Harrington-Goyal (RHG) construction, which underlies topological fault tolerance in MBQC. In this work, we introduce the hyperbolic cluster state, a generalization of the three-dimensional cluster state to negatively curved geometries, obtained via the foliation of periodic hyperbolic lattices. We present an explicit construction of hyperbolic cluster states and investigate their fault-tolerant properties under a realistic circuit-level depolarizing noise model. Using large-scale numerical simulations, we perform memory experiments to characterize their logical error rates and decoding performance. Our results demonstrate that hyperbolic cluster states exhibit a fault-tolerance threshold comparable to that of the Euclidean RHG cluster state, while simultaneously supporting a constant encoding rate in the thermodynamic limit. This represents a substantial improvement in qubit overhead relative to conventional cluster-state constructions. These findings establish hyperbolic geometry as a powerful and experimentally relevant resource for scalable, fault-tolerant MBQC and open new avenues for leveraging negative curvature in quantum information processing.
Read the full abstract

All authors Ahmed Adel Mahmoud, Gabrielle Tournaire, Sven Bachmann, Steven Rayan

Information Theory · Cross-listed from eess.SY

Beyond Freshness and Semantics: A Coupon-Collector Framework for Effective Status Updates

For status update systems operating over unreliable energy-constrained wireless channels, we address Weaver's long-standing Level-C question: do my packets actually improve the plant's behavior? Each fresh sample carries a stochastic expiration time – governed by the plant's instability dynamics – after which the information becomes useless for control. Casting the problem as a coupon-collector variant with expiring coupons, we (i) formulate a two-dimensional average-reward MDP, (ii) prove that the optimal schedule is doubly thresholded in the receiver's freshness timer and the sender's stored lifetime, (iii) derive a closed-form policy for deterministic lifetimes, and (iv) design a Structure-Aware Q-learning algorithm (SAQ) that learns the optimal policy without knowing the channel success probability or lifetime distribution. Simulations validate our theoretical predictions: SAQ matches optimal Value Iteration performance while converging significantly faster than baseline Q-learning, and expiration-aware scheduling achieves up to 50% higher reward than age-based baselines by adapting transmissions to state-dependent urgency – thereby delivering Level-C effectiveness under tight resource constraints.
Read the full abstract

All authors Youssef Ahmed, Arnob Ghosh, Chih-Chun Wang, Ness B. Shroff

Optimization and Control · Cross-listed from cs.MA

On the Reliability Limits of LLM-Based Multi-Agent Planning

LLM-based multi-agent planning delegates operational decisions to specialists that communicate through finite reports. In this research, we study its reliability limits when a coordinator can revisit source records before completing a resource-constrained plan. A useful report can support an immediate decision or direct later reading, so its value depends on how these stages communicate. We derive exact communication and access tradeoffs and prove that two report forms suffice for a broad class of allocation requirements, one favoring immediate resource identification and the other distinguishing absence from unnamed availability. For shared capacity, this reduction permits joint optimization of reporting roles and adaptive reads for a fixed number of source types with unequal workloads and reading costs. Identical specialists can optimally report different facts, and maximizing immediate completion can impose an unbounded recovery cost penalty even with full-record access. We also conduct numerical experiments to quantify the benefits of the proposed joint optimization and show how source access improves language-agent decisions that already use their reports optimally. In particular, an exhaustive evaluation of 207,632 report designs on small allocation instances recovers the predicted joint optima. Our analysis suggests that reliable agent communication should be evaluated by the complete decisions it supports and the cost of finishing its unresolved cases, instead of solely by report length, local prediction accuracy, or immediate task completion, as is often the case in current practice.
Read the full abstract