Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 15 May

Probability

Mean-field derivation of a two-dimensional signal-dependent parabolic-elliptic Keller-Segel system in algebraic scaling

This paper continues our survey about the mean-field derivation of the two-dimensional signal-dependent Keller-Segel system studied in [1]. Therefore, we consider the same system of moderately interacting particles as before. The difference lies in the scaling. Since logarithmic scaling was treated in [1], we now consider algebraic scaling to obtain propagation of chaos in the weak sense. We prove convergence in probability for the particle trajectories. Moreover, for short times and regularity assumptions on the initial data we show the convergence of the densities in the L1 norm. The novelty of this paper is the treatment of a particle model (with algebraic scaling) where the moderate interaction completely takes place in the diffusive term. This structure with algebraic scaling makes tremendous difference from the propagation of chaos discussion when the interaction appears in the drift terms with singular kernel in [8]. The argument for convergence in probability proceeds by defining a stopping time based on a power mean of the sample paths. Furthermore, we prove that the convergence in probability with this power-mean is equivalent to the convergence with maximum norm on trajectories.
Read the full abstract

Mathematical Physics · Cross-listed from physics.optics

Nonlocal Optical Response and Surface Susceptibilities: A Systematic Derivation via Spatial Moment Expansion

We present a systematic theory connecting the nonlocal response kernel of a homogeneous medium to its effective surface susceptibilities for an arbitrary curved interface. Starting from the most general tensorial nonlocal constitutive relation and combining a spatial moment expansion with a distributional thin-layer limit, we show that the full complexity of the interfacial response condenses, at leading order, into a single scalar: the surface susceptibility $\chi^s$, equal for the tangential and normal components of the electric field. These quantities provide a constructive generalization of the Feibelman $d$-parameters to interfaces of arbitrary curvature, and the curvature corrections, proportional to the geometric invariants $H$ (mean curvature) and $K$ (Gaussian curvature), are derived explicitly. The formalism is illustrated on a comprehensive set of analytically tractable cases (planar, spherical, cylindrical, and ellipsoidal interfaces) for several kernel choices (Gaussian, Yukawa, tensorial Lorentz). Generalized Maxwell boundary conditions are established and compared with the classical Fresnel results.
Read the full abstract

Information Theory

Optimum Peer-Turbo: A Scalable and Efficient Solution for P2P Broadcasting

Blockchain systems such as Solana or Monad employ tree- or star-shaped broadcast topologies in which a single source node disseminates message shards to a set of target peers within a strictly bounded time window. In these architectures, shard propagation must complete before the next consensus step, making timely delivery to a large fraction of the validator set essential. A fundamental limitation of such designs is that the outbound bandwidth of the source node constitutes the primary system bottleneck. In this paper, we introduce peer Turbo, a technique that allows target nodes to exchange shards using Random Linear Network Coding (RLNC), thereby assisting each other in completing decoding without requiring explicit shard state coordination. We use a tractable fluid approximation of the degree of freedom distribution of peer-Turbo-enabled systems show that this approach reduces source bandwidth required for a set service quality by up to one order of magnitude, or equivalently reduces propagation latency by one order of magnitude under fixed bandwidth constraints.
Read the full abstract

All authors Muriel Médard, Kishori Konwar, Moritz Grundei, Vipindev Adat Vasudevan

Probability · Cross-listed from stat.ML

$\alpha$-TCAV: A Unified Framework for Testing with Concept Activation Vectors

Concept Activation Vectors (CAV) and the Testing with CAVs (TCAV) method are fundamental tools for concept-based explainability in deep learning, yet their practical utility is limited by the variability across different samples of concept and non-concept examples. We analyze this stochastic nature of CAVs, and identify a fundamental flaw in the standard TCAV score, its instability by using a discontinuous indicator function. To address this, we introduce $\alpha$-TCAV, a parameterized unified framework that replaces the discontinuous indicator with a smooth function, which recovers TCAV as a limiting case. Under realistic assumptions, we characterize the score distributions and derive principled parameter choices: one matches the mean of its averaged counterpart, Multi-TCAV, with no larger variance using a single CAV; the other provides a calibrated probability that the concept positively influences the model output. Our analysis and experiments provide practical guidance and challenge the established practice of splitting the sampling budget across multiple CAVs.
Read the full abstract

All authors Ekkehard Schnoor, Jawher Said, Malik Tiomoko, Wojciech Samek, Alexander Jung

Differential Geometry

Forman–Ricci Curvature on Contact-Sequence Temporal Networks via Spatiotemporal Prism Complexes

Temporal networks – sequences of time-stamped contacts among nodes – constitute the finest-grained representation of dynamic interaction data; however, geometric and topological analyses of such networks have remained largely confined to time-aggregated or snapshot-based approximations. Such reductions destroy the temporal ordering and interevent statistics essential for understanding spreading dynamics, synchronization, and information flow. This study proposes a geometric framework that lifts a contact-sequence temporal network into a genuine simplicial complex through a prism construction adapted from algebraic topology. On this spatiotemporal prism complex, we develop the Forman–Ricci curvature in its original CW-complex form and contrast it with an augmented variant widely used in network science. We prove that the two variants coincide under uniform weights, derive a closed-form expression for their pointwise discrepancy in the general case, and identify the precise conditions under which they diverge – conditions generically satisfied in temporal networks because temporal edges carry interval-dependent weights. Numerical experiments on three synthetic contact-network models (Erd\H os–Rényi, activity-driven, and bursty) and on the SocioPatterns Hypertext 2009 face-to-face contact dataset quantitatively confirm the theoretical predictions: the two Forman variants disagree on $56$–$67\%$ of the $1$-simplices – predominantly the temporal and diagonal simplices – while remaining strongly correlated according to the Pearson coefficient. The proposed framework provides a principled, parameter-free method for assigning discrete Ricci curvature to each contact event, thereby opening a new geometric avenue for temporal data analysis.
Read the full abstract

Combinatorics

A new construction of permutation polynomials over $\mathbb{F}_{q^3}$

We determine all permutation polynomials among several families of polynomials over $\mathbb{F}_{q^3}$ for arbitrary prime powers $q$. We obtain some new families of permutation polynomials over $\mathbb{F}_{q^3}$ with simple coefficients for infinitely many characteristics. As a specific consequence, our results resolve the generalization of conjectures of Zhang, Zheng, Wang, Peng, and Li in the even characteristic. Our proofs are conceptually short and involve no complicated computations, in contrast to the proofs of results on permutation polynomials which were published previously. Moreover, we develop a totally new systematic method in this paper for the study of permutation polynomials.
Read the full abstract

Mathematical Physics

Spectral separation of variables from equivalent Lagrangian systems

We investigate the dynamical equivalence of quadratic Lagrangians and its relation to separation of variables. We show that requiring two quadratic Lagrangians to generate the same Euler–Lagrange equations imposes a compatibility condition between the kinetic matrices and the potential. For constant symmetric kinetic matrices, this condition reduces to a commutation relation with the Hessian of the potential, yielding an orthogonal spectral decomposition of the configuration space. The equations of motion then decouple into independent subsystems: generically in block-separated form, and completely when the spectrum is simple. Applications include the Sawada–Kotera system and an $n$-dimensional extension of the Hénon–Heiles model, where the classical integrable parameter regimes are recovered.
Read the full abstract

Representation Theory

Local newforms for generic representations of $p$-adic ${\rm SO}_{2n+1}$: Reduction

We prove that if the space of newforms is non-zero for every irreducible generic supercuspidal representation of ${\rm SO}_{2n+1}$ then it is also non-zero for all irreducible generic representations of ${\rm SO}_{2n+1}$.

Commutative Algebra

Rota Baxter Operators on Truncated Polynomial Algebras

Let K be a field of characteristic zero, and let m=(x_1,...,x_n)) be a maximal ideal of the polynomial ring K[x_1,...,x_n]. We classify all Rota–Baxter operators of weights zero and one on the truncated polynomial algebra R=K[x_1,\dots,x_n]/m^2. For weight zero, we prove that the Rota–Baxter operators are precisely the linear maps P satisfying P^2=0 and Image(P) \subset m/m^2. For nonzero weight, a standard rescaling reduces the classification to weight one. In this case, the operators split into two disjoint families according to the value of P(1)\in{0,-1}. On the maximal ideal m/m^2, such operators induce an endomorphism L satisfying L^2 + L = 0), equivalently, -L is idempotent. We further show that each family is isomorphic to the variety of idempotent matrices.
Read the full abstract

Optimization and Control

Viscosity-Informed Generative Actor-Critic for High-Dimensional Stochastic Optimal Control

We introduce a method for approximating viscosity solutions of stationary degenerate elliptic Hamilton–Jacobi–Bellman equations on bounded domains arising in stochastic exit-time control. Viscosity enforcement is formulated as a min–max problem over an envelope-generated test family parameterized by symmetric positive definite matrices. Under structural and asymptotic assumptions, any uniform limit point of the value function approximations satisfies the viscosity inequalities on the sampled test family. Numerical experiments show that the proposed method reduces empirical viscosity violations and improves robustness under perturbed dynamics.
Read the full abstract

All authors Alen E. Golpashin, Gokul Puthumanaillam, Melkior Ornik, Bruce A. Conway

Information Theory · Cross-listed from cond-mat.stat-mech

A Finite-State Gibbs Construction from a Recognition Cost

On a finite outcome space, the canonical Gibbs distribution is usually obtained by maximizing Shannon entropy at fixed mean of an externally supplied energy functional. This paper studies the finite-state consequences of a ratio-cost construction instead: after adopting the normalized d'Alembert degree-two closure called the Recognition Composition Law (RCL), with unit log-curvature calibration at the reference ratio, the continuous nontrivial positive branch is $J(x)=\tfrac12(x+x^{-1})-1=\cosh(\log x)-1$. Given the induced cost vector $X_\omega=J(r_\omega)$, multinomial counting and convex duality recover the finite-state Gibbs weights and the identity $F_{\mathrm{R}}(q)-F_{\mathrm{R}}(p)=T_{\mathrm{R}}\,D_{\mathrm{KL}}(q\Vert p)$; the entropy-maximization steps are classical once the cost is fixed. New technical content includes a non-asymptotic Stirling bound and soft-shell constrained-type theorems for real-valued costs. A three-state example compares the Gibbs law to squared-log, affinity-as-energy, and Tsallis alternatives at the same cost vector and mean-cost constraint, with sample-size power calculations at fixed RCL ground truth. The framework is conditional on axioms (A1)–(A3) and restricted to finite outcome spaces with strictly positive weights; it does not derive the composition law from a more primitive principle.
Read the full abstract

Analysis of PDEs

Global dynamics of a supercritical wave equation in a large data regime

We prove the existence of global solutions to the nonlinear wave equation in $\mathbb{R}^{1+3}$ $$\Phi_{tt} - \Delta \Phi \pm \Phi|\Phi|^{p-1} = 0$$ in the energy-supercritical regime $p>5$, for a class of large initial data. Our initial data can be decomposed into two pieces, one which is dispersed in the sense of having large $L^2$ norm, while the other piece takes a localised short-pulse form. Consequently, we can obtain global existence for a class of initial data which is large in every homogeneous Sobolev norm $\dot{H}^s_x$ with $s \geq 0$.
Read the full abstract

Number Theory

On the Face Map of the Admissible Set With Parahoric Level

To each face $\mathcal{F}$ of the coweight polytope $\mathcal{P}_{\mu}$, we associate a subset $\text{Adm}(\mu)_{\mathcal{F}}$ of the $\mu$-admissible set $\text{Adm}(\mu)$, which we refer to as a face of $\text{Adm}(\mu)$. This gives rise to a face decomposition of $\text{Adm}(\mu)$. As an application, we give a complete description of the fibers of the face map $|\Delta|^f$ defined by Pappas-Rapoport and prove that the face map is surjective.
Read the full abstract

Mathematical Physics

Thermodynamic Invariants of Coupled Channels: A Many-Channel Tolman-Ehrenfest Effect

When multiple thermodynamic channels are coupled, single-channel equilibrium conditions fail. Extending the Tolman–Ehrenfest effect to the entropy manifold, we derive the unique $n$-channel invariant $\zeta_i T_i = C$, where $\zeta_i$ is the holonomy of the Ruppeiner connection. For the granular volume–stress ensemble, Rowe's dilatancy ratio and energy restriction emerge as geometric consequences of the off-diagonal curvature $g_{V\sigma}$, and the 60-year puzzle of state-dependent $K_\mu$ is resolved: the correction $\zeta_V$ reaches $O(1)$ near jamming. The prediction $\zeta_V\chi=\mathrm{const}$ across a shear band is experimentally testable.
Read the full abstract

Differential Geometry

A vector field induced de Rham-Hodge theory on manifolds

We introduce a de Rham-Hodge framework induced by a vector field on a compact, oriented smooth manifold. Using a vector field induced bundle isomorphism on differential forms, we define a vector field induced Hodge $L^2$-inner product, codifferential, and Hodge Laplacian. Unlike classical deformations, such as the drifting and Witten-type Hodge Laplacians, the induced Laplacian modifies the principal symbol and gives rise to an anisotropic Laplace-Beltrami type operator on functions. We establish the resulting de Rham-Hodge theory for closed manifolds, including the ellipticity of the induced Hodge Laplacian and the corresponding Hodge decomposition and isomorphism results. We further extend the framework to manifolds with boundary by imposing certain vector field induced boundary conditions, which are necessary to restore the adjointness between the differential and induced codifferential, and to obtain a well-posed boundary value problem. Under these boundary conditions, we establish analogues of the Hodge-Morrey and Friedrichs decompositions. We also discuss several structural properties of the framework, including its relation to anisotropic Laplace-Beltrami operators, its spectral behavior in several explicit examples, and its invariance under isometries.
Read the full abstract

Numerical Analysis

A Tearing and Interconnecting Formulation for Magneto-Quasi-Statics

This note deals with a tearing and interconnecting (special non-overlapping domain decomposition) formulation for magneto-quasi-statics (also known as the eddy current model). Only two subdomains are considered, one conducting and one insulating. Using a straightforward tree-cotree splitting, one can get rid of some kernel components in the non-conducting region, but due to the coupling across the interface, a lot of kernel functions remain that are associated with the interface. The formulation presented here overcomes this problem by using a space splitting into gradient fields and a complementary space. Under a mild condition on that splitting, it is shown that (i) one does not need any gradient part in the non-conducting domain, and therefore no coupling of any gradient components between the two subdomains, (ii) both subdomain operators are invertible, and (iii) although the magnetic vector potential is discontinuous across the subdomain interface, the corresponding magnetic field is globally in H(div).
Read the full abstract

Analysis of PDEs

Sharp threshold for a one-dimensional thin film equation in the supercritical case

We study a one-dimensional thin film equation combining competitive effects of aggregation and repulsion, where repulsion is modeled by fourth-order diffusion and aggregation by backward second-order degenerate diffusion with exponent $m>0$. Under natural regularity constraints, we prove that for every $m>0$, there exists a unique (up to the mass-critical case $m=3$) nonnegative, radially decreasing steady state $U_*$ which coincides with the extremal function of the sharp Sz.-Nagy inequality and is simultaneously the global minimizer of the free energy. Using this variational characterization in the supercritical regime $3<m<\infty$, we show that finite-time blow-up occurs for all initial data whose initial free energy lies below the positive threshold $F(U_*)$, provided the $L^{m+1}$-norm of the initial datum exceeds that of $U_*$. Conversely, if the $L^{m+1}$-norm is below that of $U_*$, the solution exists globally and its second moment diverges as $t\to\infty$. This sharp criterion significantly extends the previously known blow-up condition requiring negative free energy to a much wider class of initial data (see \cite{BP00}). Our results identify the steady state $U_*$ as the critical pivot linking variational structure to dynamical behavior, and provide a constructive method to determine blow-up versus global existence via an explicit $L^{m+1}$-norm comparison.
Read the full abstract

Dynamical Systems

Rigorous Construction of Stop-and-Go Waves in the Optimal Velocity Model via a Difference-Differential Equation

Nonlinear wave phenomena such as stop-and-go traffic patterns are widely observed in vehicular flow but remain challenging to describe within a rigorous mathematical framework. Motivated by this, we investigate nonlinear wave structures in the optimal velocity (OV) model, which is a fundamental microscopic traffic flow model describing the car-following dynamics on a circuit. Using a traveling-wave formulation for vehicle headways, we reduce the original ordinary differential system to a difference-differential equation. We focus on steep OV functions approaching a step function, which generate sharp transition layers in the headway profile. In the singular limit, we explicitly construct heteroclinic transition layer solutions connecting two uniform traffic states. Motivated by related solvable queueing models in the literature, we rigorously prove the existence of heteroclinic traveling waves for sufficiently steep OV functions. We further establish the existence of homoclinic solutions arising from the interaction of increasing and decreasing transition layers, and derive a necessary condition for the amplitude parameter for their existence. To construct periodic stop-and-go waves on a circuit, we impose a global constraint reflecting the conservation of the total road length. Within this constrained framework, we prove the existence of large-period periodic solutions comprising alternating transition layers and quasi-uniform states. Beyond local bifurcation analysis, these results establish a rigorous foundation for nonlinear congestion waves. Furthermore, they contribute to the validation of car-following models and the design of control strategies to mitigate congestion.
Read the full abstract

Optimization and Control

Optimal Harvesting of a Stochastic Logistic Model Driven by One-Sided Tempered Stable Process

This paper investigates a class of stochastic Logistic harvesting models driven by tempered stable processes, with a one-sided power-law Lévy measure. We establish threshold conditions for population extinction and persistence, prove the distributional stability of the model, and derive explicit solutions for the optimal harvesting effort and the maximum sustainable yield. We systematically analyze the effects of white noise intensity and Lévy jump intensity on the optimal harvesting strategy. In particular, by focusing on the intrinsic structural parameters of the Lévy measure, namely the stability index and the tempering parameter, we elucidate their roles in shaping the optimal strategy and propose four targeted intervention strategies. Numerical simulations are presented to validate the theoretical findings.
Read the full abstract

Numerical Analysis

Entropy stable finite difference schemes for One-Fluid Two-Temperature Euler Non-equilibrium Hydrodynamics

One-Fluid Two-Temperature Euler (OFTT-Euler) equations are used for modeling non-equilibrium hydrodynamics and form a system of nonlinear hyperbolic partial differential equations with non-conservative products. The model decomposed the total pressure into two scalar components: one for electrons and one for ions. In this work, we design entropy-stable finite difference numerical schemes for the model. This is achieved by introducing a novel reformulation of the equations, ensuring that the new non-conservative terms do not contribute to the entropy evolution. For this novel reformulation of the equations, we design higher-order entropy-conservative numerical schemes by using Tadmor's relation for the conservative part and higher-order central differences for the non-conservative parts. Finally, we design the entropy-dissipation terms using the entropy-scaled right eigenvectors of the conservative part, thereby ensuring entropy stability for the entire system at the semi-discrete level. We present several test cases in one and two dimensions to demonstrate the accuracy and entropy stability of the proposed schemes.
Read the full abstract

Information Theory

Statistical two-round search for one excellent element

We formulate and study a statistical version of Katona's two-round search problem of finding at least one excellent element in a set. A population of $n$ elements is considered, where each element is independently excellent with probability $\lambda/n$, $\lambda > 0$. A subset test is noiseless: it returns positive exactly when the queried subset contains at least one excellent element. The goal is to minimize the expected number of tests subject to finding one excellent element with probability at least $1-\alpha$, where $0<\alpha<1$, under the restriction that testing is performed in two rounds. Unlike classical group testing, the objective is not to recover the full set of excellent elements, but only to identify one of them. We first show that success is fundamentally limited by the possibility that no excellent element exists. In the sparse Poisson regime, this imposes the necessary feasibility condition $\alpha\ge e^{-\lambda}$. When the target success probability is feasible, we prove that the optimal expected number of tests grows logarithmically with the population size. The upper bound is obtained by combining an initial existence test with a second-round separating design; the lower bound follows from an information-counting argument. Numerical illustrations show the feasibility boundary and the resulting logarithmic scaling.
Read the full abstract

Quantum Algebra

Representability of the automorphism group of finitely generated vertex algebras

We study the automorphism groups attached to a free algebra with multiple, possibly infinitely many, composition laws. As an application, we prove that the automorphism group of finitely generated vertex algebras over noetherian rings are affine group schemes.

Optimization and Control

Travel-time tomography from mean field game dynamics

Travel-time tomography seeks to recover a hidden environment from external measurements generated by propagation through an anomalous region. Standard formulations treat propagation as passive, so the environment influences observations mainly by bending paths or changing travel times. Many collective systems do not operate in that regime: observed arrivals are shaped by strategic motion, congestion, and environmental costs. We formulate this active setting through mean field games, in which the unknown environment enters the running cost through a spatial cost field and observations are read from the resulting population dynamics. This yields three contributions. First, it places propagation, observation generation, and inversion within one PDE-constrained model. Second, it clarifies why the inverse problem differs structurally from passive tomography: kinetic, congestion, and environmental effects are coupled endogenously and appear through space- and time-dependent local weights rather than externally chosen global coefficients. Third, it introduces a two-stage inversion pipeline that combines diffusion-based initialization with full mean field game refinement, and numerical experiments show stable recovery under noise and across multichannel scene families. Taken together, these ingredients establish a foundational framework for a class of inverse problems in which data are generated by optimizing and interacting populations rather than by passive signals. The framework identifies the forward MFG model, admissible observation channels, structural mechanisms, and computational recovery route needed to study active tomography under collective dynamics. Such problems arise, among other settings, in biological transport, vascular flow, and subsurface groundwater dynamics.
Read the full abstract

Optimization and Control

Decomposition and Successive Decomposition Methods and Algorithms for Nonconvex Optimization

Existing results on decomposition methods and algorithms for nonconvex problems are minimal. Parallel decomposition algorithms do not exist for nonconvex problems with coupling nonlinear equality constraints. Besides, decomposition structures (i.e., coupling variables and constraints) are not fully exploited in designing decomposition methods and algorithms. In this paper, we consider nonconvex problems with decomposition structures that are more general than those handled in the existing literature. We propose primal and dual decomposition and successive primal and successive dual decomposition methods and algorithms for these nonconvex problems, which exploit decomposition structures, allow for parallel and distributed implementations, produce the original nonconvex problems' stationary points, and offer good opportunities to achieve superior tradeoff between convergence performance and computation time. Finally, we compare the proposed methods and algorithms, extend them to indirect and two-level decomposition methods and algorithms, and provide examples and numerical results to demonstrate their respective values. Notably, the proposed decomposition and successive decomposition methods and algorithms generalize the basic ones for convex problems, and the proposed successive decomposition methods and algorithms extend the existing ones for nonconvex problems, together enriching the decomposition theory.
Read the full abstract

Classical Analysis and ODEs

Generalized Error Bounds in the Recovery of Solitary Wave Profiles

We investigate the robustness of Constantin's explicit reconstruction formula for two-dimensional irrotational solitary water waves. This formula recovers the free-surface profile from the dynamic pressure trace at the bed and depends on both the wave speed and the undisturbed depth. We consider simultaneous perturbations in these three quantities and derive an $L^2$ error estimate for the reconstructed profile. The proof uses the hodograph transform, holomorphic extension arguments, and Paley–Wiener Fourier-decay estimates, yielding stability estimates with sublinear dependence on the perturbation size. We include numerical computations to illustrate the effects of specifically designed perturbations.
Read the full abstract

Dynamical Systems

A Weyl-type theorem for Diophantine approximations driven by LCA groups and applications

We investigate actions of locally compact Abelian (LCA) groups on the torus $\mathbb{T}^n$, motivated by their close connection with Diophantine approximation. While Kronecker's theorem yields a classical density result, we prove a stronger equidistribution theorem of Weyl type: every such action admits a decomposition into uniquely ergodic subsystems. The proof of this result is based on a characterization of unique ergodicity for actions of amenable groups on compact metric spaces. As consequences, we establish several foundational results for LCA groups, including the Bohr orthogonality of characters along arbitrary Folner sequences, a Bohr mean formula for almost periodic functions, and a Wiener-type theorem on LCA groups characterizing the discrete part of a Borel probability measure through its Fourier transform. An application to numerical analysis is also discussed.
Read the full abstract

Differential Geometry

\lambda-biharmonic Riemannian submersions from manifolds with constant sectional curvature

In this paper, we study \lambda-biharmonic Riemannian submersions, which generalize biharmonic Riemannian submersions. We prove nonexistence results for \lambda-biharmonic Riemannian submersions from (n + 1)-dimensional Riemannian manifolds with constant sectional curvature c to n-dimensional Riemannian manifolds. Our results show that the critical value \lambda = 2(n - 1)c plays a decisive role. We prove that if c \ge 0, or if c < 0 and \lambda \ne 2(n - 1)c, then any \lambda-biharmonic Riemannian submersion must be harmonic. On the other hand, when \lambda = 2(n - 1)c with c < 0, we construct explicit examples of \lambda-biharmonic Riemannian submersions.
Read the full abstract

Optimization and Control

Spectral conjugate gradient projection methods for large-scale monotone equations without Lipschitz continuity

We introduce two derivative-free projection methods for large-scale systems of nonlinear monotone equations subject to convex constraints. Both methods incorporate an adaptive spectral parameter into established conjugate gradient frameworks: the first generalizes the modified optimal Perry method via an eigenvalue-optimized scaling matrix, and the second generalizes the Hager–Zhang-type conjugate gradient projection method via a spectral Dai–Liao parameter. The resulting search directions satisfy a sufficient descent condition independent of the line search. For the first method, we establish global convergence under monotonicity alone, without requiring Lipschitz continuity of the mapping. For the second, global convergence holds under the standard monotonicity and Lipschitz continuity assumptions. Numerical experiments on 18 test problems across dimensions up to 120{,}000, together with applications to $\ell_1$-regularized signal recovery and regularized logistic regression, confirm the practical effectiveness of the proposed approach.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Direct Data-Driven Linear Quadratic Tracking via Policy Optimization

Direct data-driven optimal control provides an elegant end-to-end paradigm, yet its real-time applicability is often hindered by the growing dimensionality of online decision variables. Recent breakthroughs, notably Data-EnablEd Policy Optimization (DeePO), overcome this bottleneck for the Linear Quadratic Regulator (LQR) through sample-covariance parameterization; however, extending this paradigm to Linear Quadratic Tracking (LQT) poses a fundamental challenge. The core difficulty stems from the intricate coupling between time-varying references and the feedback-feedforward policy structure, which prevents a direct application of constant-dimension parameterization. We first introduce a reference-decoupled reformulation of LQT that naturally accommodates the covariance parameterization, guaranteeing a fixed dimension of decision variables independent of data horizon. This formulation is proven to be exactly equivalent to the indirect certainty-equivalence LQT solution. Leveraging this characterization, we develop offline and online DeePO algorithms. Theoretically, we prove global linear convergence for the offline algorithm using local gradient dominance and smoothness, and show that in the online setting the optimality gap decays linearly up to a bias term that scales inversely with the signal-to-noise ratio (SNR). Numerical simulations varify the theoretical results and illustrate the superior tracking performance of the proposed method.
Read the full abstract

Probability

Crossover from subcritical to critical decay: random walk, self-avoiding walk, percolation

The study of the Ornstein–Zernike decay of subcritical two-point functions in equilibrium statistical mechanics has a history going back over a century. Despite this, the crossover from Ornstein–Zernike decay to critical power-law decay has received scant attention in the literature. We prove a general theorem which, under appropriate hypotheses, identifies the asymptotic behaviour of the solution to an Ornstein–Zernike equation on $\mathbb{Z}^d$ as that of the Green function for Brownian motion with drift, multiplied by an anisotropic exponentially decaying factor. The theorem applies to a wide class of random walks, to nearest-neighbour self-avoiding walk in dimensions $d \ge 5$, and to nearest-neighbour percolation in dimensions $d \ge 15$. Wide-ranging consequences follow, including details of the crossover from Ornstein–Zernike to critical decay on the scale of the correlation length, and the fact that all finite-order correlation lengths are equivalent up to universal constants. The proof is based on a variational characterisation of the direction-dependent rate of exponential decay and a major extension of Hara's 2008 Gaussian Lemma to noncentred kernels.
Read the full abstract