Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 2 March

Probability

A moment-based approach to the injective norm of random tensors

In this paper, we present a technically simple method to establish upper bounds on the expected injective norm of real and complex random tensors. Our approach is somewhat analogous to the moment method in random matrix theory, and is based on a deterministic upper bound on the injective norm of a tensor which might be of independent interest. Compared to previous approaches to these problems (spin-glass methods, epsilon-net techniques, Sudakov-Fernique arguments, and PAC-Bayesian proofs), our method has the benefit of being nonasymptotic, relatively elementary, and applicable to non-Gaussian models. We illustrate our approach on various models of random tensors, recovering some previously known (and conjecturally tight) bounds with simpler arguments, and presenting new bounds, some of which are provably tight. From the perspective of statistical physics, our results yield rigorous estimates on the ground-state energy of real and complex, possibly non-Gaussian, spin glass models. From the perspective of quantum information, they establish bounds on the geometric entanglement of random bosonic states and of random states with bounded multipartite Schmidt rank, both in the thermodynamic limits as well as the regimes of large local dimensions.
Read the full abstract

Analysis of PDEs

Scattering problem for Zakharov-Kuznetsov equation in three space dimensions

This paper is a continuation of our previous study arXiv:2507.01288 on the scattering problem for the Zakharov-Kuznetsov equation (ZK). When the space dimension is three, we construct a global solution to (ZK) which scatters to a given free solution without smallness assumption on the asymptotic states.
Read the full abstract

Functional Analysis

Some properties of uaw-Dunford-Pettis operators

This paper introduces and investigates novel properties of uaw-Dunford-Pettis operators on Banach spaces, exploring their relationships with other classes of operators. We further define and characterize new property of Banach lattices. Also we introduce and study the weak* version of uaw-Dunford-Pettis operator, highlighting their relationships with other classes of operators.
Read the full abstract

Sunday 1 March

Optimization and Control

Risk-Averse Stochastic User Equilibrium on Uncertain Transportation Networks

Travel times in transportation networks are uncertain and exhibit right-skewed distributions with long tails under weather and incident disruptions. The current challenge is that expected cost traffic assignment underestimates rare but severe delays, while path-based logit stochastic user equilibrium (SUE) models assign positive flow to every prespecified route, and estimated scenario probabilities may be misspecified. This paper develops a risk- and ambiguity-aware truncated SUE framework integrating upper-tail risk, endogenous route activation, and distributional uncertainty. We use an origin-destination reservation generalized cost to endogenously exclude excessively costly routes from the active choice set. A mean-CVaR criterion balances average travel time and upper-tail delay. The framework produces two complementary models. Model A applies mean-CVaR to each route's random travel time. It produces route-specific tail-tilted scenario laws and a variational-inequality formulation. Model B applies mean-CVaR to the Beckmann congestion potential. It evaluates all routes under one common tail-tilted law and gives a convex program with a unique path flow solution. We establish common-tail conditions under which the two models agree on perceived and reservation costs, active routes, and equilibrium flows. We extend Model B with a 1-Wasserstein ambiguity set that selects an adverse law before CVaR re-weights its upper tail. Braess and Sioux Falls networks experiments confirm this agreement when a common severe-state block fills the CVaR tail. In the Braess network upgrade case, expectation-only evaluation rejects the reliability upgrade. Every tested case with a positive CVaR weight favors it. Jointly modeling route activation, tail risk, and law uncertainty can therefore alter equilibrium routing and infrastructure decisions.
Read the full abstract

Combinatorics

Hamiltonian Properties of 3-Connected Claw-Free Graphs and Line Graphs of 3-Hypergraphs

Motivated by Thomassen's well-known line graph conjecture, many researchers have explored sufficient conditions for claw-free graphs to be Hamiltonian or Hamilton-connected. In 1994, Ageev proved that every $2$-connected claw-free graph with domination number at most $2$ is Hamiltonian. In this paper, we extend this line of research to $3$-connected graphs by establishing the best possible upper bound on the domination number that guarantees Hamiltonicity. Specifically, we show that, except for some well-defined exceptional graphs, every $3$-connected claw-free graph $G$ with domination number at most $5$ is Hamiltonian. Furthermore, we prove that, apart from a few exceptional cases, every $3$-connected claw-free graph $G$ with domination number at most $4$ is Hamilton-connected, thereby generalizing earlier results of Zheng, Broersma, Wang and Zhang and Vrána, Zhan and Zhang. We further investigate the Hamiltonian properties of line graphs of $3$-hypergraphs, and prove that every 3-connected line graph of a 3-hypergraph with domination number at most $4$ is Hamiltonian.
Read the full abstract

Probability

Gibbs conditioning, atypical consensus and splitting Gibbs measures on random regular graphs

Given n independent Bernoulli(p) random variables X_i, i = 1, ..., n, representing the opinions of individuals connected by an underlying random k-regular graph G_n on {1, ..., n}, we show that when conditioned on an atypical empirical consensus, which is the normalized sum of X_i X_j over neighboring vertices i, j, the joint distribution of the random variables converges, as n goes to infinity, to an Ising measure on the infinite k-regular tree T^k with a specific external field that depends only on the bias parameter p, and a temperature that depends on both p and the atypical consensus value. In particular, we show that conditional on the empirical consensus being smaller (respy, larger) than typical, the limit is a translation-invariant splitting (TIS) antiferromagnetic (respy, ferromagnetic) Ising measure on T^k. Moreover, if the bias is zero, then there is a phase transition: when the consensus exceeds k/(k-1), the conditional limits could be either the plus or minus boundary condition Ising measures. Furthermore, when X_i, i = 1, ..., n, are i.i.d. on a finite space, we show that when conditioned on an atypical value of the scaled sum of h(X_i, X_j) over neighboring vertices i and j, for any symmetric edge potential h, the limiting joint distribution of {X_i} lies in the set of (possibly degenerate) TIS Gibbs measures on T^k. The proofs leverage a tractable form of the large deviation rate function for component empirical measures of random regular graphs with i.i.d. marks and Gibbs conditioning principles, and entail careful analyses of associated non-convex constrained optimization problems. As a by-product of our results, we also obtain an (asymptotic) analog of the maximum entropy principle for Gibbs measures on random regular graphs.
Read the full abstract

All authors I-Hsun Chen, Ivan Lee, Kavita Ramanan, Sarath Yasodharan

Combinatorics

Analysis of moments and cumulants in alternating sign matrices

In this work, we study the discrete observables $$E_k = \sum_{i,j=1}^n (i-j)^k A_{i,j}$$ associated with $n\times n$ alternating sign matrices $A = (A_{i,j})$. This work develops exact formulas for expectations using Bernoulli polynomials, exponential generating functions, expansions in $1/n$ linked to Riemann zeta functions, and cumulants up to fourth order via integrable kernel methods. All intermediate calculations, expansions, and pedagogical details are provided to illustrate the interplay between combinatorial sums, analytic expansions, and integrable structures in alternating sign matrices.
Read the full abstract

Geometric Topology

A Geometric Approach to the Links-Quivers Correspondence II: Rational Links

The Links-Quivers Correspondence predicts that the generating function for the symmetric (or antisymmetric) colored HOMFLY-PT polynomials for links can be put in a "quiver form," so that the generating function is expressed in terms of a quadratic form and two linear forms. This was originally proved for rational links by Stosic and Wedrich, but here we give a direct geometric description of the linear and quadratic forms in terms of the first and second configuration spaces of the 3-punctured plane.
Read the full abstract

Number Theory

Regulator Constants and Cohomology

We show how regulator constants of a finitely generated $\mathbb{Z}[G]$-module can be related to $G$-cohomology, where $G$ is a finite group. We then derive consequences of such relation for modules naturally arising in number theory, such as ring of integers and units of number fields, $K$-theory groups of ring of integers and Mordell-Weil groups of elliptic curves.
Read the full abstract

General Topology · Cross-listed from cs.LO

Constructive and Predicative Locale Theory in Univalent Foundations

We develop locale theory constructively and predicatively in univalent foundations (UF), with a particular focus on the theory of spectral and Stone locales. In the context of UF, predicativity refers specifically to the development of mathematics without the use of propositional resizing axioms. The traditional approach to the predicative development of point-free topology is to work with presentations of locales known as formal topologies. Here, we take a different approach: we work directly with frames, keeping careful track of the universes involved and adopting certain size assumptions to ensure that the theory is amenable to predicative development. Although it initially appears that many fundamental constructions of locale theory rely on impredicativity, we show that these can be circumvented under rather natural size assumptions. We first lay the groundwork for the predicative development of locale theory. We then orient our development towards a systematic investigation of the theory of spectral and Stone locales. We establish a categorical equivalence between large, locally small, and small-complete spectral locales and small distributive lattices. Moreover, we exhibit the category of Stone locales as a coreflective subcategory of spectral locales and spectral maps, using the construction known as the patch locale. Finally, we investigate the topology of algebraic DCPOs and Scott domains. We develop the Scott locale of a Scott domain, show that it forms a spectral locale, and then proceed to investigate its patch. Using this, we obtain a topological characterization of de Jong's notion of sharp element: we establish a correspondence between the sharp elements of a Scott domain and the points of the patch of its Scott locale. Our development is completely formalized and has been machine-checked using the Agda proof assistant.
Read the full abstract

Optimization and Control

GPU-friendly and Linearly Convergent First-order Methods for Certifying Optimal $k$-sparse GLMs

We investigate the problem of certifying optimality for sparse generalized linear models (GLMs), where sparsity is enforced through a cardinality constraint. While Branch-and-Bound (BnB) frameworks can certify optimality using perspective relaxations, existing methods for solving these relaxations are computationally intensive, limiting their scalability. To address this challenge, we reformulate the relaxations as composite optimization problems and develop a unified proximal framework that is both linearly convergent and computationally efficient. Under specific geometric regularity conditions, our analysis links primal quadratic growth to dual quadratic decay, yielding error bounds that make the Fenchel duality gap a sharp proxy for progress towards the solution set. This leads to a duality gap-based restart scheme that upgrades a broad class of sublinear proximal methods to provably linearly convergent methods, and applies beyond the sparse GLM setting. For the implicit perspective regularizer, we further derive specialized routines to evaluate the regularizer and its proximal operator exactly in log-linear time, avoiding costly generic conic solvers. The resulting iterations are dominated by matrix–vector multiplications, which enables GPU acceleration. Experiments on synthetic and real-world datasets show orders-of-magnitude faster dual-bound computations and substantially improved BnB scalability on large instances.
Read the full abstract

Geometric Topology

A Geometric Approach to the Links-Quivers Correspondence I: Rational Tangles

The Links-Quivers Correspondence predicts that all the symmetric (or antisymmetric) colored HOMFLY-PT polynomials of a link can be recovered from a finite amount of data (a quiver) associated to the link. We give a new geometric proof of the Links-Quivers Correspondence modified for rational tangles and explicitly describe the corresponding quivers in terms of winding numbers in the punctured plane and its second configuration space.
Read the full abstract

Optimization and Control · Cross-listed from q-fin.PM

Single-Asset Adaptive Leveraged Volatility Control

This paper introduces a methodology for constructing a market index composed of a liquid risky asset and a liquid risk-free asset that achieves a fixed target volatility. Existing volatility-targeting strategies typically scale portfolio exposure inversely with a variance forecast, but such open-loop approaches suffer from high turnover, leverage spikes, and sensitivity to estimation error – issues that limit practical adoption in index construction. We propose a proportional-control approach for setting the index weights that explicitly corrects tracking error through feedback. The method requires only a few interpretable parameters, making it transparent and practical for index construction. We demonstrate in simulation that this approach is more effective at consistently achieving the target volatility than the open-loop alternative.
Read the full abstract

All authors Nikhil Devanathan, Dylan Rueter, Stephen Boyd, Emmanuel Candès, Trevor Hastie, Mykel J. Kochenderfer, Arpit Apoorv, David Soronow, Igor Zamkovsky

Information Theory

Evaluation of iterated Ore polynomials and skew Reed-Muller codes

In this paper, we study two ways of evaluating iterated Ore polynomials. We provide many examples and compare these evaluations. We use the evaluation maps to construct Reed-Muller codes and compute explicitly some of the data that are associated to such codes.

History and Overview of Mathematics · Cross-listed from physics.hist-ph

Portrait of the mathematician as a young man: Revisiting Trinity's Tayler picture

A 17th-century oil painting by an unknown artist, once owned by the Tayler family and now in the collection of Trinity College, Cambridge, is currently identified as a portrait of a young Isaac Barrow. The sitter is shown pointing to a proposition in Barrow's 1655 edition of Euclid's Elements, but the portrait bears little resemblance to other depictions of Barrow. Moreover, Barrow is unlikely to have posed with that book, which appeared in print eight months after he had left England on a four-year tour of the Continent. Plausible alternatives are that the portrait is of Francis Willughby or Isaac Newton, both of whom resembled the man pictured and may be characterized as disciples of Barrow. If the Tayler were Newton's portrait, it could shed light on the patronage that allowed him to rise from undergraduate servant ("subsizar") to Lucasian Professor of Mathematics in only five and half years.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

Linearization Principle: The Geometric Origin of Nonlinear Fokker-Planck Equations

Anomalous diffusion and power-law distributions are observed in various complex systems. To provide a consistent dynamical foundation for these phenomena, we present a geometric derivation of the nonlinear Fokker-Planck equation by introducing the Linearization Principle directly at the dynamical stage. By identifying the generalized chemical potential as the natural dynamical ansatz, we construct a general thermodynamic framework where the drift term remains linear in the probability density, preserving the standard form of the Einstein relation. Within this framework, we show that the $q$-deformed geometry, corresponding to Tsallis statistics, exhibits a fundamental duality between the dynamic index $q$ and the thermodynamic index $2-q$: the stationary state is a $q$-Gaussian distribution that minimizes a free energy functional defined by a generalized entropy of index $2-q$. We prove the $H$-theorem for the derived equation and demonstrate its application to the harmonic oscillator and the free particle. This framework describes anomalous diffusion without relying on ad-hoc constraints or phenomenological nonlinear drift forces.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.quant-gas

Exact Density Profiles of 1D Quantum Fluids in the Thomas-Fermi Limit: Geometric Hierarchy to the Tonks-Girardeau Gas

We present a geometric framework for 1D quantum fluids across interaction regimes in the Thomas-Fermi limit. Based on the Linearization Principle via the $q$-logarithm, macroscopic density profiles form a discrete hierarchy: the ideal Bose gas ($q=1$), the mean-field Gross-Pitaevskii condensate ($q=-1$), and the strongly correlated Tonks-Girardeau gas ($q=-3$). We further derive a universal sound velocity scaling, $c \propto \rho^{(1-q)/4}$, valid in the interacting regimes ($q \le -1$). This establishes a non-perturbative link between static geometry and dynamical excitations in many-body systems.
Read the full abstract

Information Theory · Cross-listed from cs.DS

Achievability of Heterogeneous Hypergraph Recovery from its Graph Projection

We formulate and analyze a heterogeneous random hypergraph model, and we provide an achieveability result for recovery of hyperedges from the observed projected graph. We observe a projected graph which combines random hyperedges across all degrees, where a projected edge appears if and only if both vertices appear in at least one hyperedge. Our goal is to reconstruct the original set of hyperedges of degree $d_j$ for some $j$. Our achievability result is based on the idea of selecting maximal cliques of size $d_j$ in the projected graph, and we show that this algorithm succeeds under a natural condition on the densities. This achievability condition generalizes a known threshold for $d$-uniform hypergraphs with noiseless and noisy projections. We conjecture the threshold to be optimal for recovering hyperedges with the largest degree.
Read the full abstract

Representation Theory

KLR-Schur algebra of coherent sheaves on the projective line: Tilting and PBW bases

We begin the study of Khovanov-Lauda-Rouquier type algebras associated to moduli stacks of coherent sheaves on smooth projective curves. We consider the case of $\mathbb{P}^1$ and define, for any pair $(r,d)$ of a rank and a degree, the KLR and Schur algebras $A_{r,d}, \mathcal{R}_{r,d}$ as suitable convolution algebras in the Borel-Moore homology of an analog of the Steinberg stack built from the stacks $Coh_{r,d}(\mathbb{P}^1)$. We use the tilting equivalence and Bridgeland stability conditions to construct an interpolation between the KLR or Schur algebras of the categories of coherent sheaves on $\mathbb{P}^1$ and the KLR or Schur algebras of the categories of representations of the Kronecker quiver. We also introduce a stratification of the Steinberg stacks into cohomologically pure pieces and use this to construct a PBW basis of the corresponding algebra.
Read the full abstract

Algebraic Geometry

The global nilpotent cone for universal curves

We construct a conic Lagrangian in the cotangent bundle of the moduli stack of $G$-bundles over the universal curve, restricting to the global nilpotent cone for each curve. It gives rise to a singular support condition suitable for the Betti geometric Langlands correspondence for families of curves and the automorphic gluing functor studied in arXiv: 2105.12318. We also prove a family version of “local constancy of Hecke operators," generalizing our earlier result.
Read the full abstract

Combinatorics

On the most reliable graphs with fixed redundancy

The all-terminal reliability of a graph $G$ is the probability that $G$ remains connected when each edge fails independently with probability $p$. For fixed $n$ and $m$, the uniformly most reliable problem asks which graph with $n$ vertices and $m$ edges maximizes reliability for all $p \in [0,1]$. Although such graphs do not always exist, optimal graphs in the regime $p \to 0$ always do and are determined by the structure of their minimal cut sets. We establish a structural characterization of graphs that are most reliable near $p=0$. Our results partially resolve a conjecture of Bourel et al., showing that, under suitable conditions, regular graphs with maximal girth are optimal. Extending this analysis to graphs with fixed redundancy $r=m-(n-1)$ and sufficiently large $n$, we show that the most reliable graphs are obtained by subdividing the most reliable cubic graphs with $2(r-1)$ vertices. The general conjecture remains open. Unlike previous results, which resolved only small redundancy cases or very dense regimes, our approach yields a substantial extension of the known range. We determine the unique cubic candidates for uniformly most reliable graphs for all redundancy levels $m-n \le 19$, and prove the non-existence of uniformly most reliable graphs for several infinite families with fixed redundancy and asymptotically large $n$. These results significantly enlarge both the candidate class and the range of provable non-existence.
Read the full abstract

All authors Rotem Brand, Reuven Cohen, Simi Haber, Baruch Barzel

Algebraic Geometry

Modularity of special cycles on Shimura varieties: a survey

We survey recent results on a conjecture of Kudla regarding the modularity of generating series of special cycle classes in toroidal compactifications of orthogonal and unitary Shimura varieties. Along the way, we formulate several conjectures on related phenomena for special cycles in other types of Shimura varieties, as well as on more general quotients of period domains.
Read the full abstract

Probability

Exponential Localization of Spatial Random Permutations in One Dimension

We consider a class of random permutations of the interval $[-n,n]$, in which points are typically displaced a distance $O(W)$. We show the cycles are localized on the scale $W^3$, with an exponentially decaying tail bound. Analogous to eigenfunctions of one dimensional random band matrices, the cycles are conjectured to be localized to the scale $W^2.$
Read the full abstract

Combinatorics · Cross-listed from hep-th

Proofs of some conjectures of Okazaki and Smith on line defect half-indices of ${\rm SU}(N)$ Chern-Simons theories

Okazaki and Smith discovered many elegant formulas expressing some matrix integrals as some celebrated $q$-series such as the Rogers–Ramanujan functions or Jacobi theta functions. These integrals arise as Wilson line defect half-indices of 3d $\mathcal{N}=2$ supersymmetric ${\rm SU}(N)$ Chern-Simons theories. We evaluate them by carefully calculating the constant terms of some infinite products. Along the way we use some crucial facts about antisymmetric multivariate formal Laurent series. Consequently, we prove three general conjectures of Okazaki and Smith which provide explicit formulas for half indices of the ${\rm SU}(N)_{-N-k}$ ($k=0,1/2,1$) Chern-Simons theories. During the process, we extend these ${\rm SU}(N)$ formulas to include one additional parameter. Furthermore, we generalize the ${\rm SU}(N)_{-N-1/2}$ and ${\rm SU}(N)_{-N-1}$ conjectures by calculating the corresponding half-indices of Wilson lines of arbitrary charge. As a special instance of our generalizations, we also confirm the ${\rm SU}(3)_{-4}$ conjecture of Okazaki and Smith.
Read the full abstract

Numerical Analysis

Singular spaces for computing the structured distance to singularity

Finding the distance to singularity for a matrix is a ubiquitous problem in numerical linear algebra, and is elegantly solved by the Eckart-Young-Mirsky theorem. Its structured variant arises when one considers structured matrices and wants to preserve their structure. This problem is important for several matrix nearness problems that either entirely or partly reduce to a structured distance to singularity problem. In this work, we propose a new method for the structured distance to singularity problem based on singular spaces, that is, linear subspaces consisting of singular matrices. We study the properties of these spaces to guide the construction of the algorithm. In the Tikhonov regularized formulation, the method globally minimizes a certain objective function alternately in its arguments. We show that a restricted family of singular spaces suffices to attain the best possible improvement in a single iteration. In many of the numerical comparisons, the proposed method yields substantial reductions in running time when compared with existing methods, while the computed distances to singularity remain comparable. These gains allow larger problems to be solved within practical running times.
Read the full abstract

Information Theory

Communication-Efficient Quantum Federated Learning over Large-Scale Wireless Networks

Quantum federated learning (QFL) combines the robust data processing of quantum computing with the privacy-preserving features of federated learning (FL). However, in large-scale wireless networks, optimizing sum-rate is crucial for unlocking the true potential of QFL, facilitating effective model sharing and aggregation as devices compete for limited bandwidth amid dynamic channel conditions and fluctuating power resources. This paper studies a novel sum-rate maximization problem within a muti-channel QFL framework, specifically designed for non-orthogonal multiple access (NOMA)-based large-scale wireless networks. We develop a sum-rate maximization problem by jointly considering quantum device's channel selection and transmit power. Our formulated problem is a non-convex, mixed-integer nonlinear programming (MINLP) challenge that remains non-deterministic polynomial time (NP)-hard even with specified channel selection parameters. The complexity of the problem motivates us to create an effective iterative optimization approach that utilizes the sophisticated quantum approximate optimization algorithm (QAOA) to derive high-quality approximate solutions. Additionally, our study presents the first theoretical exploration of QFL convergence properties under full device participation, rigorously analyzing real-world scenarios with nonconvex loss functions, diverse data distributions, and the effects of quantum shot noise. Extensive simulation results indicate that our multi-channel NOMA-based QFL framework enhances model training and convergence behavior, surpassing conventional algorithms in terms of accuracy and loss. Moreover, our quantum-centric joint optimization approach achieves more than a 100% increase in sum-rate while ensuring rapid convergence, significantly outperforming the state-of-the-arts.
Read the full abstract

Algebraic Topology

Minimal Unital Cyclic $C_\infty$-Algebras and the Real and Rational Homotopy Type of Closed Manifolds

Using the notion of isotopy modulo $k$, for $k\in\mathbb N^+$, we introduce a stratification on the set of minimal $C_\infty$-algebra enhancements of a finite-dimensional graded commutative algebra $H^*$. We prove that two such enhancements are $C_\infty$-isotopic if and only if they are isotopic modulo $k$ for every $k\in\mathbb N^+$. We define obstruction sets governing the extension of an isotopy modulo $k$ to an isotopy modulo $(k+1)$ and establish their generalized additivity. We prove that if $M$ is a closed $(r-1)$-connected manifold of dimension $n\leq \ell(r-1)+2,\, r\geq2,\, \ell\geq 4$, then its real and rational homotopy types are determined by its cohomology algebra $H^*(M;\mathbb F)$ together with the isotopy class modulo $(\ell-2)$ of the corresponding minimal unital cyclic $C_\infty$-algebra enhancement, for $\mathbb F=\mathbb R$ and $\mathbb F=\mathbb Q$, respectively. Combining this obstruction theory with the Hodge homotopy method introduced in \cite{FKLS2021} and further developed in \cite{FiorenzaLe2025}, we give a new proof of a theorem of Crowley–Nordström \cite{CN}: if $M$ is a closed $(r-1)$-connected manifold of dimension $4r-1$ with $b_r(M)\leq3$, and there exists a class $\varphi\in H^{2r-1}(M;\mathbb R)$ such that multiplication by $\varphi$ induces an isomorphism $H^r(M;\mathbb R)\longrightarrow H^{3r-1}(M;\mathbb R),\,x\longmapsto\varphi\smile x$, then $M$ is intrinsically formal. Finally, we prove a borderline extension of a vanishing theorem of Fiorenza–Lê: if an $(r-1)$-connected Poincaré DGCA over $\mathbb Q$ of degree $n\leq5r-2$ admits a Hodge homotopy and satisfies $b^r\leq2$, then the operations of its transferred minimal unital cyclic $C_\infty$-algebra vanish in every arity $k\geq4$.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Multifold Confidence Intervals in Collaborative Mean Estimation (ColME) Using Sample Statistics

The rapid growth of digital devices and IoT has intensified the demand for collaborative learning. Since these devices generate sensitive and high-dimensional data, centralized transmission is often impractical, while local learning suffers from slow convergence. Collaborative approaches can alleviate these issues by allowing agents to use information from one another to improve estimation. Each agent faces a personalized learning problem, and collaboration is beneficial among agents whose data are generated from the same distributions. This paper studies the problem of personalized online mean estimation in heterogeneous environments, where each agent observes data from its own sigma-sub-Gaussian distribution. Collaborative algorithms enable agents to identify similarity classes in real time and exploit information from agents belonging to the the same class to improve convergence and accuracy. The work builds on existing approaches: the collaborative mean estimation (colME) and its graph-based extensions (C-colME and B-colME), which improve scalability and robustness. Since the variance estimation plays a crucial role in the above mentioned algorithms, a method for accurate, local and real-time estimation of variance is proposed. Estimation of sample kurtosis is also incorporated. We derive the CI estimators for the sample standard deviation and sample kurtosis. These results are combined with sample colME methods to design a unified procedure for constructing multifold CI based jointly on the sample mean, sample variance, and sample kurtosis. This framework enables colME in challenging scenarios, such as when classes share similar means but differ in variances, or when both means and variances are alike while the underlying distributions diverge in higher-order characteristics.
Read the full abstract

Optimization and Control

Non-Local Extremum Seeking Based on the Divergence Theorem

We propose a new design strategy for extremum seeking control for a multi-dimensional single-integrator system in the presence of local extrema. The proposed method employs suitably designed sinusoidal dither signals, which force the single-integrator to a spherical motion. Over time, this spherical motion gives approximate access to an integral of the objective function over a sphere. Using the divergence theorem, we identify the integral over the sphere as the gradient of an integral over the enclosed ball. This integral over the ball defines a locally averaged objective function. The proposed extremum seeking method drives the system state into the gradient direction of the averaged objective function. Such a local average of the objective function can eliminate undesired local extrema and is therefore beneficial for global optimization. Under the assumption that the averaged objective function has no undesired critical points, we prove practical asymptotic stability of the closed-loop system. Our theoretical analysis takes sufficiently small $L_\infty$-measurement errors of the objective function into account.
Read the full abstract

Numerical Analysis

Beyond singular value gaps in randomized subspace approximation

The success of randomized range finders (RRFs) is typically analyzed via the singular value gaps of a target matrix $A$. In this work, we show that the so-called Frobenius singular value ratio provides a sharper analysis of an RRF's subspace quality under Gaussian sketching. For any matrix $A$ and any integer $k\ge1$, we derive an exact formula for the cumulative distribution function of the largest principal angle between the $k$-dominant singular subspace of $A$ and the approximate RRF subspace, expressing it in terms of a hypergeometric function. We obtain definitive probabilistic guarantees for RRFs that are often stronger than those obtained previously.
Read the full abstract