Statistics Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 4 March
Skewed distributions are fundamental in modelling asymmetric data on the d-dimensional torus. In this context, asymmetry is introduced through the sine-skewing mechanism, which is the only skewing mechanism that has been proposed on the hyper-torus in the literature. Some sine-skewed models are known to suffer from a singular Fisher information matrix in the vicinity of symmetry, which poses a significant issue for inferential purposes. It is an open question to determine for which sine-skewed models Fisher information singularity occurs. In this paper, a general characterization of the class of models that exhibit this singularity is given in the general d-dimensional setting.
Probability
Comparison theorems for the extreme eigenvalues of a random symmetric matrix
This paper establishes a comparison theorem for the maximum eigenvalue of a sum of independent random symmetric matrices. The theorem states that the maximum eigenvalue of the matrix sum is dominated by the maximum eigenvalue of a Gaussian random matrix whose statistics match the sum, and it strengthens previous results of this type. Corollaries address the minimum eigenvalue and the spectral norm; the proof strategy also extends to matrix martingale sequences. The comparison methodology is powerful because of the vast arsenal of tools for treating Gaussian random matrices. As applications, the paper improves on existing eigenvalue bounds for random matrices arising in spectral graph theory, quantum information theory, high-dimensional statistics, and numerical linear algebra. In particular, these techniques deliver the first complete proof that a sparse random dimension reduction map has the injectivity properties conjectured by Nelson & Nguyen in 2013.
Read the full abstract
Information Theory · Cross-listed from quant-ph
On Error Thresholds for Pauli Channels: Some answers with many more questions
This paper focuses on error thresholds for Pauli channels. We numerically compute lower bounds for the thresholds using the analytic framework of coset weight enumerators pioneered by DiVincenzo, Shor and Smolin in 1998. In particular, we study potential non-additivity of a variety of small stabilizer codes and their concatenations, and report several new concatenated stabilizer codes of small length that show significant non-additivity. We also give a closed form expression of coset weight enumerators of concatenated phase and bit flip repetition codes. Using insights from this formalism, we estimate the threshold for concatenated repetition codes of large lengths. Finally, for several concatenations of small stabilizer codes we optimize for channels which lead to maximal non-additivity at the hashing point of the corresponding channel. We supplement these results with a discussion on the performance of various stabilizer codes from the perspective of the non-additivity and threshold problem. We report both positive and negative results, and highlight some counterintuitive observations, to support subsequent work on lower bounds for error thresholds.
Read the full abstract
Numerical Analysis
Exp-ParaDiag: Time-Parallel Exponential Integrators for Parabolic PDEs
This paper introduces Exp-ParaDiag, a novel time-parallel method that combines the strength of exponential integrators into the ParaDiag framework. We develop and analyze Exp-ParaDiag based on first and second order accurate exponential integrators. We establish the convergence of the proposed methods both as preconditioned fixed-point iterations and as precon- ditioners within the GMRES framework. Furthermore, we extend the Exp-ParaDiag formulation to achieve sixth-order temporal accuracy using exponential integrators. The proposed approach is also generalized to nonlinear problems, for which convergence is rigorously demonstrated. A series of numerical experiments is presented to validate the theoretical results and to illustrate the robustness and efficiency of the developed methods.
Read the full abstract
Statistics Theory
Extreme Geometric Quantiles Under Minimal Assumptions, with a Connection to Tukey Depth
Geometric (also known as spatial) quantiles, introduced by Chaudhury and representing one of the three principal approaches to defining multivariate quantiles, have been well studied in the literature. In this work, we focus on the extremal behaviour of these quantiles. We establish new extremal properties, namely general lower and upper bounds for the norm of extreme geometric quantiles, free of any moment conditions. We discuss the impact of such results on the characterization of distribution behaviour. Importantly, the lower bound can be directly linked to univariate quantiles and to halfspace (Tukey) depth central regions, highlighting a novel connection between these two fundamental notions of multivariate quantiles.
Read the full abstract
Combinatorics
All-to-all Routing on Kautz Graphs: Regular Routing Beats Shortest Paths
We study packet routing in the Kautz digraph K(d,D), where every ordered pair of distinct vertices is connected by a unique shortest directed path. The regular routing introduced in earlier work schedules all ordered pairs in tau(d,D) = (D-1)d^(D-2) + D d^(D-1) steps. We show that, for every fixed outdegree d at least 2 and all sufficiently large diameters D, no shortest-path routing scheme can match this makespan. More precisely, we prove that K(d,D) contains an edge whose shortest-path congestion strictly exceeds tau(d,D) when D is sufficiently large. Our construction uses edge-words drawn from a subset of ternary unbordered square-free words, together with a trimming inequality that propagates large congestion at distance D down to shorter distances. Computations for d=2 and small D show that for all D at least 4 there is an edge in K(2,D) with congestion greater than tau(2,D).
Read the full abstract
Analysis of PDEs
Incompressible limit for an age-structured tumor model
In this paper, we consider an age-structured mechanical model for tumor growth. This model takes into account the life-cycle of tumor cells by including an age variable. The underlying process for tumor growth is the same as classical tumor models, where growth is driven by pressure-limited cell proliferation, and cell movement away from regions of high pressure. The main contribution of this paper is establishing the convergence of solutions of the age-structured model to a limit satisfying a Hele-Shaw free boundary problem. This limiting problem describes the geometric motion of the tumor as it grows according to a nonlinear Darcy's law.
Read the full abstract
Analysis of PDEs
A Hydrodynamics Formulation for a Nonlinear Dirac Equation
We derive a hydrodynamics formulation for a modified Dirac equation with a nonlinear mass term that preserves the homogeneity of the original Dirac equation. The nonlinear Dirac equation admits a symmetric split into the left and right-handed spinor components. It is formulated using Clifford algebra tools. We prove global existence for a regularized equation.
Read the full abstract
Algebraic Topology · Cross-listed from cs.LG
PTOPOFL: Topology-Guided Personalised Federated Learning with Persistent-Homology Client Descriptors
Clustered and personalised federated learning (FL) needs a signal telling the server which clients should share a model. Most methods derive it from losses or model updates that must be recomputed during training. We study pTopoFL, which derives it once, before training, from a compact persistent-homology (PH) descriptor of each client's feature distribution: the server clusters clients on these descriptors, weights them within clusters, and runs blended clustered local gradient descent, returning one personalised model per cluster. For strongly convex, smooth losses we analyse the complete procedure: for any partition, one round is a contraction with factor (1-eta*mu)^tau; the fixed point is characterised by a local-step drift bound, an exact formula for the effective strength of blending (which yields a calibration rule) and a stochastic floor exposing a bias-variance trade-off of clustering; and personalisation lowers the heterogeneity floor in proportion to a measurable share of the dispersion of client optima. Experiments on synthetic federations, a label-skew benchmark and a real four-hospital dataset confirm the theory and delimit the method. When feature geometry and decision rules co-vary, the PH partition recovers the latent client groups, including differences a linear-subspace descriptor misses, and pTopoFL is competitive with the strongest clustered baselines; on the real federation it lowers the test log-loss of FedAvg from 0.463 to 0.438, on par with the best personalised methods. When heterogeneity is invisible in feature geometry, it offers no advantage over FedAvg. pTopoFL transmits model parameters and is no more private than FedAvg; we give a record-level differential-privacy accounting and show that privatising the descriptor destroys the partition. Code reproduces every number.
Read the full abstract
Numerical Analysis
Asymptotic Spectral Insights Behind Fast Direct Solvers for High-Frequency Electromagnetic Integral Equations on Non-Canonical Geometries
Integral-equation-based fast direct solvers for electromagnetic scattering can substantially reduce computational costs, especially in the presence of multiple excitations. We recently proposed a new high-frequency fast direct solver strategy that combines preconditioning techniques with acceleration algorithms. However, the validity of this approach applied to non-canonical geometries requires further justification. In this contribution, we collect relevant semiclassical microlocal results and use them to assess the legitimacy and effectiveness of the proposed fast direct solver in the high-frequency regime.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
A spectral inference method for determining the number of communities in networks
To characterize the community structure in network data, researchers have developed various block-type models, including the stochastic block model, the degree-corrected stochastic block model, the mixed membership block model, the degree-corrected mixed membership block model, and others. A critical step in applying these models effectively is determining the number of communities in the network. However, to the best of our knowledge, existing methods for estimating the number of network communities either rely on explicit model fitting or fail to simultaneously accommodate network sparsity and a diverging number of communities. In this paper, we propose a model-free spectral inference method based on eigengap ratios that addresses these challenges. The inference procedure is straightforward to compute, requires no parameter tuning, and can be applied to a wide range of block models without the need to estimate network distribution parameters. Furthermore, it is effective for both dense and sparse networks with a divergent number of communities. Technically, we show that the proposed spectral test statistic converges to a {function of the type-I Tracy-Widom distribution via the Airy kernel} under the null hypothesis, and that the test is asymptotically powerful under weak alternatives. Simulation studies on both dense and sparse networks demonstrate the efficacy of the proposed method. Three real-world examples are presented to illustrate the usefulness of the proposed test.
Read the full abstract
Dynamical Systems
A Symmetry-Based Classification of Synchrony in Tree Networks
Coupled cell systems model interacting dynamical units and provide a natural framework for studying synchrony phenomena arising from collective behavior. Graph symmetries often induce such patterns, but certain networks exhibit additional synchronies not associated with automorphisms, commonly referred to as exotic synchronies. In undirected asymmetric graphs, any synchrony, if present, must be non-symmetry-induced, and determining when such exotic patterns occur remains a challenging structural problem. In this work, we address this question for networks whose underlying coupling graph is a tree, a class of graphs that naturally models hierarchical interactions among elements. We prove that exotic synchronizations do not arise in tree-type networks, showing that every balanced coloring is a fixed-point coloration determined by graph automorphisms. Furthermore, we identify the importance of the role played by the leaves of a graph in this context. Beyond existence results, we investigate the dynamical consequences of these structures by analyzing the linear stability of equilibria and the Lyapunov stability of synchrony subspaces for admissible vector fields defined on tree networks. Particular attention is devoted to cherry- type configurations, where local symmetries generated by leaves attached to a common vertex influence the stability properties of the associated synchronous states, thereby clarifying how the combinatorial architecture of trees constrains both the emergence and the stability of synchrony.
Read the full abstract
Representation Theory
Simple $\mathfrak{sl}_2$-modules that are torsion free $U(\mathfrak{h})$-modules of rank $1$
We provide an explicit classification of all simple $\mathfrak{sl}_2$-modules that are torsion free of rank $1$ over the Cartan subalgebra. We also establish a similar result for the first Weyl algebra and for the Lie superalgebra $\mathfrak{osp}(1|2)$.
Algebraic Geometry · Cross-listed from econ.TH
Index and Robustness of Mixed Equilibria: An Algebraic Approach
We present two results regarding the relation of the index of equilibria and the index of fixed points, and the index of equilibria and payoff-robustness: any integer can be the index of an isolated completely mixed equilibrium of a finite game. In a particular class of isolated completely mixed equilibria, called monogenic, the index can be 0, +1 or -1 only. In this class non-zero index is equivalent to payoff-robustness. We also discuss extensions of the method of computation to extensive-form games, and cases where the equilibria might be located on the boundary of the strategy set. These results follow from a new method of computing indices of equilibria, which we also develop in this paper, that is based on algebraic properties of the system of polynomials describing completely mixed equilibria.
Read the full abstract
Quantum Algebra
Plane geometry of $q$-rationals and Springborn Operations
We study the geometry of $q$-rational numbers, introduced by Morier-Genoud and Ovsienko, for positive real $q$. In particular, we construct and analyse the deformed Farey triangulation and the deformed modular surface. We interpret every $q$-rational geometrically as a circle, similar to the famous Ford circles. Further, we define and study new operations on $q$-rationals, the Springborn operations, which can be seen as a quadratic version of the Farey addition. Geometrically, the Springborn operations correspond to taking the homothety centers of a pair of two circles. As an application, we derive a formula for the $q$-deformed midpoint of two Farey neighbors and we consider a new $q$-deformation of Markov numbers.
Read the full abstract
Number Theory
The Geometric Unitary Kudla Conjecture
We prove that, over an arbitrary CM field, every symmetric formal Fourier-Jacobi series converges and equals the Fourier-Jacobi expansion of a genuine Hermitian Hilbert modular form. As an application, we show that the Chow-valued Kudla generating series of special cycles on unitary Shimura varieties for Hermitian lattices over CM fields of signature $(p,1)$ at one infinite place and $(p+1,0)$ at all others is modular of weight $p+1$ for a Weil representation, establishing the geometric unitary Kudla Conjecture in arbitrary codimension. This removes the modularity hypothesis from the arithmetic inner product formula by Li-Liu.
Read the full abstract
Optimization and Control
Maintenance optimization of a two-component system with mixed observability
This paper studies maintenance optimization for a two-component system under mixed observability. Component~$U_1$ is fully monitored, whereas component~$U_2$ is only partially observable due to sensing limitations. The system exhibits unidirectional positive degradation dependence, in which the health state of component~$U_1$ influences the degradation process of component~$U_2$, but not vice versa. We propose a novel framework for modeling and optimizing maintenance decisions for such systems using a partially observable Markov decision process (POMDP). Under mild conditions, we analytically establish structural properties of the optimal maintenance policy. Baum-Welch algorithm with multiple sample paths is developed to estimate the unknown system parameters in the context of a covariate-dependent Hidden Markov Model. %from observational data with multiple trajectories. Numerical experiments demonstrate the effectiveness of the proposed parameter estimation and the maintenance policy. Across 64 instances, we show that it consistently outperforms classical threshold-based policies. Specifically, when the degradation of component $U_1$ is faster, it achieves maximal cost reductions of up to approximately $6\%$
Read the full abstract
Number Theory
Sums of four generalized polygonal numbers of almost prime length
In this paper, we consider sums of four generalized polygonal numbers whose parameters are restricted to integers with a bounded number of prime divisors. With some restriction on m modulo 30, we show that for n sufficiently large, it can be represented as such a sum, where the parameters are restricted to have at most 988 prime factors.
Read the full abstract
Metric Geometry
Continuity of Magnitude at Skew Finite Subsets of $\ell_1^N$
Magnitude is an isometric invariant of metric spaces introduced by Leinster. Although magnitude is nowhere continuous on the Gromov-Hausdorff space of finite metric spaces, continuity results are possible if we restrict the ambient space. In this paper, we focus on $\ell_1^N$ and prove that magnitude is continuous at every skew finite subset of $\ell_1^N$, that is, at every finite set whose coordinate projections are injective. For such sets, we analyze cubical thickenings and derive an explicit formula for their weight measures. This yields a formula for the magnitude of these thickenings, which we use to prove that their magnitude converges to that of the underlying finite set. Since skew finite subsets of $\ell_1^N$ form an open and dense subset of the space of all finite subsets, magnitude is continuous on an open dense subset of the space of finite subsets of $\ell_1^N$.
Read the full abstract
Mathematical Physics · Cross-listed from physics.flu-dyn
Grid-agnostic volume of fluid approach with interface sharpening and surface tension for compressible multiphase flows
The interfacial diffusion associated with finite volume method (FVM) discretizations of multiphase flows creates the need for an interface sharpening mechanism. Such solutions for structured quadrilateral grids are well documented, but various engineering applications require mesh designs specific to the irregular geometry of the physical system it is modeling. Therefore this study casts interface sharpening as an ant-idiffusive volumetric body force whose calculation procedure is generalizable to an arbitrarily constructed grid. The force magnitude is derived at cell centers as a function of the local compressible flow characteristics and the geometry of the cell neighborhood. The flow model uses an AUSM+up based method for flux evaluation and imposes a stiffened equation of state onto each of the fluids in order to close the linear system and extract auxiliary variables. Validation tests show good agreement with the Young-Laplace condition whereby the interface converges to the analytical solution corresponding to a balance between a pressure jump and interfacial forces. Further results show the recovery of a circle starting from a shape with highly variational curvature through the combined effects of surface tension and interface sharpening. Lastly shear-driven droplet pinchoff results show good agreement with droplet shapes provided by the surrounding literature at various Weber-Ohnesorge number combinations.
Read the full abstract
Functional Analysis
Extreme and exposed points of shift-invariant spaces generated by Gaussian kernel and hyperbolic secant
We characterize the extreme and exposed points of the unit ball (with respect to the $L^1$-norm) in the shift-invariant space generated by the Gaussian function, as well as in the quasi shift-invariant space generated by the hyperbolic secant.
Read the full abstract
Differential Geometry
Extrinsic bi-Conformal Heat Flow and its smoothness
In this paper we introduce conformal heat flow of (extrinsic) biharmonic maps on $4$-manifold, simply called bi-conformal heat flow (bi-CHF), and study its properties. Similar to other CHF of harmonic maps and regularized $n$-harmonic maps, (CHF and regularized $n$-CHF respectively), we obtain global smoothness and no finite time singularity.
Read the full abstract
Commutative Algebra · Cross-listed from cs.CC
Learning Read-Once Determinants and the Principal Minor Assignment Problem
A symbolic determinant under rank-one restriction computes a polynomial of the form $\det(A_0+A_1y_1+\ldots+A_ny_n)$, where $A_0,A_1,\ldots,A_n$ are square matrices over a field $\mathbb{F}$ and $rank(A_i)=1$ for each $i\in[n]$. This class of polynomials has been studied extensively, since the work of Edmonds (1967), in the context of linear matroids, matching, matrix completion and polynomial identity testing. We study the following learning problem for this class: Given black-box access to an $n$-variate polynomial $f=\det(A_0+A_1y_1+ \ldots+A_ny_n)$, where $A_0,A_1,\ldots,A_n$ are unknown square matrices over $\mathbb{F}$ and rank$(A_i)=1$ for each $i\in[n]$, find a square matrix $B_0$ and rank-one square matrices $B_1,\ldots,B_n$ over $\mathbb{F}$ such that $f=\det(B_0+B_1y_1+\ldots+B_ny_n)$. In this work, we give a randomized poly(n) time algorithm to solve this problem. As the above-mentioned class is known to be equivalent to the class of read-once determinants (RODs), we will refer to the problem as learning RODs. The algorithm for learning RODs is obtained by connecting with a well-known open problem in linear algebra, namely the Principal Minor Assignment Problem (PMAP), which asks to find (if possible) a matrix having prescribed principal minors. PMAP has also been studied in machine learning to learn the kernel matrix of a determinantal point process. Here, we study a natural black-box version of PMAP: Given black-box access to an $n$-variate polynomial $f = \det(A + Y)$, where $A \in \mathbb{F}^{n \times n}$ is unknown and $Y = diag(y_1,\ldots,y_n)$, find a $B\in\mathbb{F}^{n\times n}$ such that $f=det(B+Y)$. We show that black-box PMAP can be solved in randomized poly(n) time, and further, it is randomized polynomial-time equivalent to learning RODs. We resolve black-box PMAP by investigating a property of dense matrices that we call the rank-one extension property.
Read the full abstract
Spectral Theory
On the isoperimetric inequality for the first positive Neumann eigenvalue on the sphere
We prove that geodesic disks are the unique maximizers of the first positive Neumann eigenvalue among all simply connected domains in $\mathbb S^2$ with prescribed area. We then show that geodesic disks are no longer maximisers for the class of spherical annuli.
Numerical Analysis
A Multi-Fidelity Parametric Framework for Reduced-Order Modeling using Optimal Transport-based Interpolation: Applications to Diffused-Interface Two-Phase Flows
This work introduces a data-driven, non-intrusive reduced-order modeling (ROM) framework that leverages Optimal Transport (OT) for multi-fidelity and parametric problems in two-phase flows modelling. Building upon the success of displacement interpolation for data augmentation in handling nonlinear dynamics, we extend its application to more complex and practical scenarios. The framework is designed to correct a computationally inexpensive low-fidelity (LF) model to match an accurate high-fidelity (HF) one by capturing its temporal evolution via displacement interpolation while preserving the problem's physical consistency. The framework is further extended to address systems dependent on a physical parameter, for which we construct a surrogate model using a hierarchical, two-level interpolation strategy. First, it creates synthetic HF checkpoints via displacement interpolation in the parameter space. Second, the residual between these synthetic HF checkpoints and a true LF solution is interpolated in the time domain using the multi-fidelity OT-based methodology. This strategy provides a robust and efficient way to explore the parameter space and to obtain a refined description of the dynamical system. The potential of the method is discussed in the context of complex and computationally expensive diffuse-interface methods for two-phase flow simulations, which are characterized by moving interfaces and nonlinear evolution, and challenging to be dealt with traditional ROM techniques.
Read the full abstract
Numerical Analysis
A comparative numerical study of graph-based splitting algorithms for linear subspaces
In this note, we test the performance of six algorithms from the family of graph-based splitting methods [SIAM J. Optim., 34 (2024), pp. 1569-1594] specialized to normal cones of linear subspaces. To do this, we first implement some numerical experiments to determine the best relaxation parameter for each algorithm. Then, we compare the number of iterations each algorithm requires to reach a given stopping criterion, using the previously identified best relaxation parameter. The numerical results allow us to identify some relevant patterns and provide numerical evidence that may guide further theoretical analysis.
Read the full abstract
Combinatorics
p^(k)-Fibonacci Numbers of the p-Bratteli Diagram for Every Odd Prime p and Integer k>=0
We study paths in the p-Bratteli diagram associated with hook partitions, where p is an odd prime. By comparing blocks along a path, we define inversions and descents. We prove that the sign balance derived from inversions vanishes at every vertex of the diagram. Using descents, we introduce the p^(k)-Fibonacci numbers and derive recurrence relations for them. For k=0, we recover the OEIS sequence A391520, while for k>=1 we obtain new families of Fibonacci-type sequences.
Read the full abstract
Optimization and Control
Optimal strategies in Markov decision processes with finitely additive evaluations
We study infinite-horizon Markov decision processes (MDPs) where the decision maker evaluates each of her strategies by aggregating the infinite stream of expected stage-rewards. The crucial feature of our approach is that the aggregation is performed by means of a given diffuse charge (a diffuse finitely additive probability measure) on the set of stages. The results of Neyman [2023] imply that in this setting, in every MDP with finite state and action spaces, the decision maker has a pure optimal strategy as long as the diffuse charge satisfies the time value of money principle. His result raises the question of existence of an optimal strategy without additional assumptions on the aggregation charge. We answer this question in the negative with a counterexample. With a delicately constructed aggregation charge, the MDP has no optimal strategy at all, neither pure nor randomized.
Read the full abstract
Combinatorics
Arrow pattern avoidance in permutations: structure and enumeration
Arrow patterns were introduced by Berman and Tenner as a generalization of vincular patterns. They observed that arrow patterns have the potential to bridge the divide between a permutation's cycle notation and its one-line notation; in support of this, they used arrow avoidance to enumerate shallow and cyclic shallow permutations. More recently, $321$-avoiding cyclic permutations were recharacterized entirely in terms of arrow avoidance. Motivated by these results, we initiate a systematic study of arrow avoidance. In this paper, we prove structural results about arrow patterns, including defining arrow-Wilf equivalence, and enumerate several arrow avoidance classes. Finally, we consider the avoidance of pairs of arrow patterns, focusing on cases that prohibit fixed points in the underlying permutation.
Read the full abstract
Numerical Analysis
Statistical Topological Gradient and Shape Optimization for Robust Metal–Semiconductor Contact Reconstruction
We develop a statistically robust framework for reconstructing metal–semiconductor contact regions using topological gradients. The inverse problem is formulated as the identification of an unknown contact region from boundary measurements governed by an elliptic model with piecewise coefficients. Deterministic stability of the topological gradient with respect to measurement noise is established, and the analysis is extended to a statistical setting with multiple independent observations. A central limit theorem in a separable Hilbert space is proved for the empirical topological gradient, yielding optimal $n^{-1/2}$ convergence and enabling the construction of confidence intervals and hypothesis tests for contact detection. To further refine the reconstruction, a shape optimization procedure is employed, where the free parameter $\beta$ in the CCBM formulation plays a crucial role in controlling interface sensitivity. While $\beta$ affects both topological and shape reconstructions, its influence is particularly pronounced in the shape optimization stage, allowing more accurate estimation of the size and geometry of the contact subregion. The proposed approach provides a rigorous criterion for distinguishing true structural features from noise-induced artifacts, and numerical experiments demonstrate the robustness, precision, and enhanced performance of the combined statistical, topological, and $\beta$-informed shape-based reconstruction.