Information Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 24 February
Pinching antenna systems (PASS) have emerged as a promising architecture for high-frequency wireless communications. In this letter, we investigate user localization in PASS by jointly exploiting the received signal amplitude and phase information. A complex baseband signal model is formulated to capture free-space path loss, waveguide attenuation, and distance-dependent phase rotation between the user and each pinching antenna. Based on this model, we derive the Fisher information matrix and closed-form Cramer-Rao lower bound and position error bound. The derived analysis reveals that the phase-induced Fisher information decays with the fourth power of the user-antenna distance, whereas the amplitude-induced information decays with the sixth power, explaining the fundamental advantage of phase-aware localization in typical PASS deployments. A maximum likelihood estimator is then developed and implemented through a two-stage procedure combining coarse grid search and Levenberg-Marquardt refinement. Numerical results show that the proposed estimator achieves low positioning error and generally outperforms the considered benchmarks under different noise powers, numbers of pinching antennas, and user locations. In the considered scenario, the proposed method achieves sub-meter-level accuracy over the evaluated service area and yields substantially lower positioning error than the amplitude-only benchmark.
Analysis of PDEs
Global hypoellipticity for perturbations of complex vector fields on the torus
We apply Krönecker's approximation theorem to measure (in a topological sense) a set of constants which turn a vector field into a non-globally hypoelliptic operator. We present situations in which this set is a discrete enumerable (hence, meager) subset of the real line, and we also show that this set may be a dense $\mathcal{G}_\delta$ subset of the complex numbers (hence, nonmeager), which produces a contrast to a known result stating that this set has null Lebesgue measure.
Read the full abstract
Symplectic Geometry
Equivariant Floer cohomology for contactomorphisms of quotient spaces
This paper establishes the orderability of contact manifolds which are quotients of fillable contact manifolds under finite group actions compatible with the filling, the prototypical example being $\mathbb{R}P^{2n-1}$ as the quotient of $S^{2n-1}$. Our approach employs an equivariant formulation of the so-called contact Floer cohomology theory. This leads us to develop an analogue of Givental's nonlinear Maslov index using the $\mathbf{k}[[x]]$-module structure on an equivariant version of contact Floer cohomology. A key idea is that mapping cones of continuation maps detect crossings with the discriminant (recall that Givental's index is a continuous integer valued function on the complement of the discriminant). To properly handle the inherent non-canonicity in defining such mapping cones, we lift the structure of contact Floer cohomology to chain level by defining it as an $\infty$-functor on a suitable $\infty$-categorification of the Eliashberg-Polterovich orderability relation on the universal cover of the contactomorphism group.
Read the full abstract
Information Theory
TCDA: Robust 2D-DOA Estimation for Defective L-Shaped Arrays
While tensor-based methods excel at Direction-of-Arrival (DOA) estimation, their performance degrades severely with faulty or sparse arrays that violate the required manifold structure. To address this challenge, we propose Tensor Completion for Defective Arrays (TCDA), a robust algorithm that reformulates the physical imperfection problem as a data recovery task within a virtual tensor space. We present a detailed derivation for constructing an incomplete third-order Parallel Factor Analysis (PARAFAC) tensor from the faulty array signals via subarray partitioning, cross-correlation, and dimensional reshaping. Leveraging the tensor's inherent low-rank structure, an Alternating Least Squares (ALS)-based algorithm directly recovers the factor matrices embedding the DOA parameters from the incomplete observations. This approach provides a software-defined 'self-healing' capability, demonstrating exceptional robustness against random element failures without requiring additional processing steps for DOA estimation.
Read the full abstract
Optimization and Control
Complexity of Classical Acceleration for $\ell_1$-Regularized PageRank
We study the degree-weighted work required to compute $\ell_1$-regularized PageRank using the standard accelerated proximal-gradient method (FISTA). For non-accelerated methods (ISTA), the best known worst-case work is $\widetilde{O}((\alpha\rho)^{-1})$, where $\alpha$ is the teleportation parameter and $\rho$ is the $\ell_1$-regularization parameter. It is not known whether classical acceleration methods can improve $1/\alpha$ to $1/\sqrt{\alpha}$ while preserving the $1/\rho$ locality scaling, or whether they can be asymptotically worse. For FISTA, we show a negative result by constructing a family of instances for which standard FISTA is asymptotically worse than ISTA. On the positive side, we analyze FISTA on a slightly over-regularized objective and show that, under a confinement condition, all spurious activations remain inside a boundary set $\mathcal{B}$. This yields a bound consisting of an accelerated $(\rho\sqrt{\alpha})^{-1}\log(\alpha/\varepsilon)$ term plus a boundary overhead $\sqrt{vol(\mathcal{B})}/(\rho\alpha^{3/2})$. We also provide graph-structural sufficient conditions that imply such confinement.
Read the full abstract
Dynamical Systems
Invariance Principle and dynamics
This is a survey of some invariances that arise in dynamical systems theory in the presence of zero Lyapunov exponents.
Mathematical Physics · Cross-listed from hep-th
Geometric QCD II: The Confining Twistor String and Meson Spectrum
We present a local, asymptotically free solution of the planar Makeenko–Migdal loop equations in the continuum limit with full Lorentz invariance. The solution is constructed by quantizing internal Majorana fermions (referred to here as “elves”) on a rigid Hodge-dual minimal surface. These worldsheet degrees of freedom provide the algebraic mechanism required to satisfy the unintegrated vector loop equations, with the Pauli principle enforcing planar factorization. In the local limit, the theory reduces to a confining analytic twistor-string representation. By analyzing the monodromy structure of the complexified effective action, we show that the discrete mass spectrum is organized by topological data associated with twistor singularities. The simplest sector with one branch point yields parametric Regge trajectories expressed in terms of trigonometric functions. These trajectories are non-linear but approximately linear over a broad range and are in agreement with experimental data for light mesons. The asymptotic behavior of the trajectory $J = \alpha(M^2)$ and its subleading corrections arise from the interaction between the Liouville term and the twistor monodromy, without introducing additional assumptions about string excitations. In our solution, the QCD mass spectrum follows from a generalized eigenvalue problem in complexified phase space, effectively reducing the problem to classical geometry. Within this framework, the large-$N_c$ Master Field is realized as a classical trajectory in twistor space.
Read the full abstract
Mathematical Physics · Cross-listed from hep-ph
Scalar Lie point symmetries of the Standard Model with one or two real gauge singlets
We present a classification of all scalar Lie point symmetries of the Standard Model with one or two real gauge-singlet scalars (SM+S and SM+2S). By analyzing the associated field equations, we identify all realizable and inequivalent Lie point symmetry algebras of these models, distinguishing strict variational, variational (including divergence symmetries), and Euler–Lagrange cases. In addition, we devise efficient algorithms that, for any given numerical instance of the models, determine the Lie point symmetry algebra in each of the three categories by a parameter-based decision procedure using affine reparametrizations and simple parameter tests, thereby avoiding explicit symmetry analysis and the need to derive and solve the determining equations. Finally, we prove several relevant general results, including a characterization of the three disjoint types of Lie point symmetry generators – strict variational, divergence, and non-variational – for a broad class of Lagrangians with potentials, including the SM+S and SM+2S.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
Generating twisted Cherednik eigenfunctions
Hamiltonians ${\cal H}^{a}_k$ of new integrable systems associated with the integer rays $(1,a)$ (commutative subalgebras) of Ding-Iohara-Miki (DIM) algebra in the $N$-body representation are closely related to commuting twisted Cherednik Hamiltonians $\mathfrak{C}_i^{(a)}$, ${\cal H}^{a}_k = \sum_{i=1}^N (\mathfrak{C}_i^{(a)})^k$. Moreover, symmetric combinations of eigenfunctions in the twisted Cherednik system were recently shown to produce the DIM Hamiltonian eigenstates. We explicitly construct these twisted Cherednik eigenfunctions recurrently by action of some (creation and permutation) operations. It resembles of a far-going generalization of Kirillov-Noumi operators, but exact relation remains to be specified.
Read the full abstract
Analysis of PDEs
Low eigenvalues of the $p-$Laplacian in general open sets
We consider the minmax Ljusternik-Schnirelmann levels of the constrained $p-$Dirichlet integral, on a general open set of the Euclidean space. We show that, whenever one of these levels lies below the threshold given by the $L^p$ Poincaré constant “at infinity”, it actually defines an eigenvalue of the Dirichlet $p-$Laplacian. We also prove an exponential decay at infinity for the relevant eigenfunctions: this can be seen as a Šnol-Simon–type estimate for the nonlinear case. Finally, we exhibit some peculiar examples of unbounded open sets to which our main result applies.
Read the full abstract
Analysis of PDEs
Regularity of stable radial solutions to semilinear elliptic equations in MEMS problems
This paper investigates the regularity of stable radial solutions to semilinear elliptic equations arising in MEMS problems, modeled by the Dirichlet problem $-\Delta u=f(u)$ in the unit ball $B_1$, where the nonlinearity $f\in C^1([0,1))$ is nonnegative and satisfies $\int^1_0f(s)\,ds=+\infty$. We focus on the case where $f$ blows up as $u\to 1^{-}$. Micro-electro-mechanical systems (MEMS) are widely used devices in engineering and technology. Our main result establishes for dimensions $2\le n\le 6$, every stable radial solution is regular, meaning $\|u\|_{L^{\infty}(B_1)}<1$. This result gives a positive answer to an open problem posed by Bruera and Cabré concerning the regularity of stable solutions for singular nonlinearities without requiring a Crandall-Rabinowitz type condition, at least in the radial case.
Read the full abstract
Information Theory
Delay Alignment Modulation for Secure ISAC Systems
This paper introduces delay-alignment modulation (DAM) for secure integrated sensing and communication (ISAC). Due to the broadcast nature of multi-user downlinks, communications are vulnerable to eavesdropping. DAM applies controlled per-path symbol delays at the transmitter to coherently align the multipath components at the intended user, enhancing the received signal power, while simultaneously creating delay misalignment at the eavesdropper (Eve). To mitigate sensing degradation caused by multipath propagation, we propose a two-stage protocol that first estimates the angle and then the delay of the line-of-sight (LoS) path after suppressing multipath interference. We derive the secrecy spectral efficiency (SSE) and the Cramer-Rao (CRB) of the target delay. Finally, we develop a path-based zero-forcing (ZF) precoding framework and formulate a max-min SSE design under CRB and power constraints. Simulation results show DAM significantly outperforms the strongest-path (SP) benchmark in terms of SSE, while meeting sensing requirements, since intentional delay alignment at legitimate users degrades reception at Eve.
Read the full abstract
Number Theory
Potential Relation Between the Riemann Zeta Function and the Polynomial Function $F$ of the Generalized Erdős–Straus Conjecture, Subject to its Analytic Continuation
In this article, we explore a natural extension of the quadratic parametrization introduced in our previous work. By replacing the integer $n$ by $n^s$ ($ s\in\mathbb{R}, s>1$) and allowing the parameters to be real, we obtain for each $n\ge 1$ a decomposition $\frac{k}{n^s} = \frac{1}{x_s(n)}+\frac{1}{y_s(n)}+\frac{1}{z_s(n)}$ with $x_s(n), y_s(n), z_s(n) \in \mathbb{R}^*+$. Summing this equality over all integers brings forth the Riemann zeta function. Subject to an analytic continuation of the quantities $x_s(n), y_s(n), z_s(n)$ to complex values of $s$, one would obtain a new function \(G_k(s)\) satisfying $G_k(s)=k\,\zeta(s)$, thus establishing a deep connection between the structure of the conjecture and the zeros of $\zeta$.
Read the full abstract
Geometric Topology
Ribbon concordance and fibered predecessors, II: the general case
The first and third authors recently proved that for each knot $K\subset S^3$ there are only finitely many hyperbolic fibered knots which are ribbon concordant to $K$. In this paper, we remove the hyperbolic constraint, proving that every knot in $S^3$ has only finitely many fibered predecessors under ribbon concordance. The key new input is an inequality relating the knot Floer homology of a generalized satellite knot with that of its companion, proved via the immersed curves formulation of bordered Heegaard Floer homology, which should be of independent interest. Our work, together with results of Kojima–McShane, also leads to an explicit upper bound on the Gromov norm of the complement of any fibered predecessor of a knot $K \subset S^3$, in terms of the arc index and genus of $K$.
Read the full abstract
Mathematical Physics
Anomalous diffusion properties of stochastic transport by heavy-tailed jump processes
In this work, we investigate the large-scale transport properties of a passive scalar advected by a turbulent fluid, modelled as a superposition of divergence-free vector fields, each weighted by an independent symmetric $\alpha$-stable-like process. Motivated by recent works showing that complex small-scale spatial structures often lead to Brownian dispersion, we study if this principle persists when the driving noise exhibits heavy-tailed jump statistics. Our numerical results show a clear dichotomy linked with the tail behaviour of the noise. When considering standard $\alpha$-stable processes, very large jumps survive the interaction with the spatial complexity and yield anomalous, super-diffusive transport. In contrast, when the $\alpha$-stable noise is either truncated or exponentially tempered, suppressing extremely long jumps, the transport undergoes a transition to a classical diffusive regime.
Read the full abstract
Optimization and Control
Robustness certificates in data-driven non-convex optimization with additively-uncertain constraints
We consider decision-making problems that are formulated as non-convex optimization programs where uncertainty enters the constraints through an additive term, independent of the decision variables, and robustness is imposed using a finite data-set, according to the scenario robust optimization paradigm. By exploiting the structure of the constraints, we show that both a priori and a posteriori distribution-free probabilistic robustness certificates for a possibly sub-optimal solution to the resulting data-driven optimization problem can be obtained with minimal computational effort. Building on these results, we also discuss a one-shot and an incremental procedure to determine the size of the data-set so as to guarantee a user-chosen robustness level. Notably, both the a posteriori robustness assessment and incremental data-set sizing do not require to solve the non-convex scenario program. A comparative analysis performed on the unit commitment problem using real data reveals a limited increase in conservativeness with a significant computational saving with respect to the application of scenario theory results for general, non necessarily structured, non-convex problems.
Read the full abstract
Operator Algebras
Quantum deformations of the arc length metric
We investigate a q-deformation of the arc length metric on the unit circle. This q-deformation arises naturally from the Dirac operator by replacing the standard integers by their q-deformed analogues. Nonetheless, we show that the corresponding metric structure only makes sense at the level of quantum metric spaces as introduced by Marc Rieffel. This means that the quantum metric we obtain on the continuous functions on the circle does not arise from a classical metric on the circle. In the special case where q equals one we recover the usual arc length metric and we show that our family of quantum metric spaces depend continuously on the deformation parameter with respect to David Kerr's complete Gromov-Hausdorff distance.
Read the full abstract
Category Theory
A notion of semi-cubical tribe
The important notions our ideas revolve around are that of tribes, a class of categories aiming at modeling intensional type theory, and that of semi-cubical objects, for a category of cubes with symmetries and reversals. We introduce a general notion of $J$-tribes, tribes suitably enriched in presheaves over $J$, and $J$-frames in a tribe $\mathcal{T}$ as a category of $J$-shaped resolutions in $\mathcal{T}$, for a direct category $J$, and we construct the $J$-tribe of $J$-frames in $\mathcal{T}$. Similar notions of $R$-tribes and $R$-frames are introduced for $R$ a suitable generalized direct category, and corresponding properties are established thanks to a construction relating $R$ to a strictly direct category. In particular, our framework applies to semi-cubes, which is our main motivation, and yields an appropriate notion of a semi-cubical tribe.
Read the full abstract
Analysis of PDEs
On thermal transpiration and thermomolecular pressure difference
In this article, we demonstrate the phenomenon of thermal transpiration in a bounded convex domain. We employ the stationary Boltzmann equation with a cutoff potential. For boundary condition, we partition the boundary into diffuse reflection and incoming regions. We establish the existence of solution in a weighted $L^\infty$ space. Furthermore, we consider a convex domain with diffuse reflection boundary condition in the middle and incoming boundary condition at the two ends. We first consider Maxwellians with the same pressure but different temperatures at the two ends. We prove that the total flux $U(x)$ is directed toward the hot end. Furthermore, we derive an estimate for the total flux: \begin{align} U(x)\geq C\left(1-\frac{1}{\sqrt{T_2}}\right). \end{align} In addition, we show that when the pressures and temperatures on the two ends satisfy the relation \begin{align} \frac{P_1}{P_2}=\sqrt{\frac{T_1}{T_2}}, \end{align} the total flux of the solution is of order $\mathcal{O}(\frac{1}{\kappa})$. This result is consistent with Knudsen's finding of thermomolecular pressure difference in 1909.
Read the full abstract
Analysis of PDEs · Cross-listed from physics.flu-dyn
Pressure beneath a periodic travelling water-wave in constant-vorticity flow over a flat bed
We investigate within the framework of linear theory the behaviour of the total (hydrodynamic) pressure and of the dynamic pressure in a regular wave train which propagates at the surface of water with a flat bed in a flow with constant vorticity. We show that nonzero vorticity, the hallmark of a non-uniform underlying current, may strongly alter the behaviour with respect to the case of irrotational flows, for which the maximum and minimum of the dynamic pressure always occur at the wave crest and at the wave trough, respectively (the extrema of the dynamic pressure may occur along the flat bed or along the critical level, depending on the vorticity strength). While vorticity does not modify the increase of the hydrodynamic pressure with depth, it can significantly alter the location of the extrema of the hydrodynamic pressure at a fixed depth level.
Read the full abstract
Differential Geometry
Integral Inequalities and Rigidity for $V$-Static-Type Equations on Manifolds with Boundary
In this work, we study compact Riemannian manifolds with boundary satisfying V-static-type equations. By combining a generalized Reilly formula with Steklov-type boundary value problems, we derive integral inequalities for geometric quantities associated with the boundary. These inequalities lead to rigidity results, including characterizations of geodesic balls in space forms. In particular, our results offer new insights into several known rigidity theorems in the literature.
Read the full abstract
Differential Geometry
Capillary minimal slicing and scalar curvature rigidity
We develop minimal slicing via capillary hypersurfaces to understand scalar curvature metric on manifolds bounded below with boundary. In particular, in dimension $4$, we prove following comparison and rigidity statement: given a compact Riemannian $4$-manifold $(M^4,g)$ with a mean convex boundary whose boundary is diffeomorphic to boundary of a connected convex domain in $\mathbb R^4$, if the scalar curvature is non-negative and the scaled mean curvature comparison holds along the boundary, then $M$ is isometric to the Euclidean domain. Moreover, we prove a comparison and rigidity result of manifolds with Listing type scaling invariant scalar and mean curvature comparison : $R g \ge -12 g_{\mathbb{H}^{4}}$ and $\hat{H}^{2} g \ge \hat{H}_{0} g_{\mathbb{H}^{4}}$, where $\hat{H}$ is a shifted mean curvature depending on the scale of manifold. This proves the traced version of Gromov's conjecture on comparison and rigidity of hyperbolic convex domains
Read the full abstract
Number Theory
Elementary local representation densities at all primes via lifting recursions
Let $p$ be a prime and let $L$ be a quadratic $\mathbb{Z}_p$-lattice with quadratic form $Q$. For $t\neq 0$ the local representation density $\alpha_p(t;L)$ is the stable normalised growth of the congruence counts of solutions to $Q(v)\equiv t\pmod{p^m}$. We compute these counts and densities explicitly for the hyperbolic plane $H_0$ over $\mathbb{Z}p$, uniformly in $p$, and at $p=2$ for the basic dyadic blocks (rank-$1$ Type I blocks and the even binary planes $2^aH\varepsilon$), together with the anisotropic ternary lattice $L_3=\langle 2\rangle^{\oplus 3}$. At the dyadic prime the usual Jacobian/Hensel lifting mechanism breaks down in the bilinear-lattice convention $Q(v)=\langle v,v\rangle$. The main new input is an explicit half-lift involution for diagonal sums of squares, which yields a stable lifting recursion with factor $2^{d-1}$ under the primitivity hypothesis $4\nmid a$. As applications we obtain closed forms for the three-squares congruence counts (hence $\alpha_2(t;L_3)$) and a prime-uniform formula for the densities of the scaled hyperbolic planes $p^eH_0$ in the standard normalisation $q=\langle\cdot,\cdot\rangle/2$.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Detecting Where Effects Occur by Testing Hypotheses in Order
Experimental evaluations of public policies often randomize a new intervention within many sites or blocks. After an overall statistically significant result is reported, the natural question from a policy maker is: where did effects occur? Standard adjustments for multiple testing answer this question with little power because they ignore how the experiment is organized: blocks nest within cohorts, sites, and districts. We organize the hypotheses in the shape of a tree that follows this administrative structure and test them top-down, stopping at any branch where the null is not rejected. A stopping rule and valid tests at each node suffice for weak control of the family-wise error rate (FWER). Whether the unadjusted procedure also controls the FWER in the strong sense depends on an error load computable from design quantities before any data are tested; when the load exceeds one, an adaptive $\alpha$-schedule, which we prove controls the FWER on regular and irregular trees without pruning, restores control. [Correction, August 2026: an anonymous referee identified errors in the previous version. The error loads reported in the paper were computed incorrectly; corrected loads exceed 1 in all 25 block-randomized MDRC education trials at the planning effect size $d = 0.20$, so the adjustment the earlier version claimed unnecessary is in fact required. The theorem claiming FWER control under branch pruning and its switching corollary are false as stated and are withdrawn; an exact counterexample attains FWER 0.063 at $\alpha = 0.05$. The detection comparison with the Hommel procedure is under recomputation. A correction notice on page 1 details what changes and what stands; a fully corrected version is in preparation.]
Read the full abstract
Combinatorics
On linear lexicographic codes: Ninth column construction of the ternary Golay code
We characterize linear lexicographic $p$-ary codes. Using this characterization, when $p \ge 3$, we determine the dimensions of linear lexicographic codes obtained from several bases including the standard basis, except for those of certain minimum distances. In these excluded cases, we may obtain linear codes of higher dimensions; for instance, when $p = 3$ and $d = 6$, the ternary Golay code is obtained.
Read the full abstract
Number Theory
Toward the $p$-adic Hodge parameters in the potentially crystalline representations of $\mathrm{GL}_n$
Let $p$ be a prime number, $n\geq 2$, and let $L$ be a finite extension of $\mathbf{Q}_p$. Let $\rho_L$ be an $n$-dimensional non-critical generic potentially crystalline $p$-adic representation of the absolute Galois group of $L$ with regular Hodge–Tate weights. Building on Ding's results and strategy in the crystabelline case, and on the recent work of Breuil–Ding in the critical crystalline case, we construct an explicit locally analytic representation $\pi_{1}(\rho_L)$ and describe explicitly the Hodge-filtration data of $\rho_L$ that it determines. When $\rho_L$ arises from a patched $p$-adic automorphic representation, we show, under mild hypotheses, that $\pi_{1}(\rho_L)$ is a subrepresentation of the $\mathrm{GL}_n(L)$-representation globally associated with $\rho_L$ by using the framework of Bernstein eigenvarieties that were developed by Breuil-Ding.
Read the full abstract
Probability
Critical parameters of germ-monotone families of branching random walks
We introduce a broad class of families of branching random walks on a countable set $X$, which we refer to as germ-monotone branching random walks (GMBRWs). The processes in each family are parametrized by a positive parameter $\lambda>0$, which controls the overall reproductive speed, and they are monotonically increasing in $\lambda$ with respect to the germ order, a notion that extends classical stochastic domination. This framework encompasses a wide range of models, including classical continuous-time branching random walks, as well as discrete-time counterparts of certain non-Markovian processes such as ageing branching random walks. We define a general notion of critical parameter $\lambda(A)$ associated with each subset $A \subseteq X$, which serves as a threshold separating almost sure extinction in $A$ from positive probability of survival in $A$. This unifies and extends the classical global and local critical parameters $\lambda_w$ and $\lambda_s$, which can be recovered as special cases. We then investigate how modifications of the reproduction laws, either on a finite set or on a more general subset of $X$, affect these critical parameters. Our results extend earlier contributions in the literature.
Read the full abstract
Category Theory
On the Semi-Abelianness of Affine Group Schemes
We prove that the category of commutative Hopf algebras over a field $k$ is co-semi-abelian. Consequently, the category of affine group $k$-schemes is semi-abelian. We establish coregularity by identifying the orthogonal factorization system of surjections and faithfully flat injections, and we deduce coexactness from Takeuchi's correspondence between normal Hopf ideals and Hopf subalgebras of commutative Hopf $k$-algebras.
Read the full abstract
Functional Analysis
Oppenheim–Schur inequalities for causal products
We establish a class of Oppenheim–Schur-type inequalities for the convolutional Jury product of positive semidefinite matrices. These results extend to a causal convolutional setting the classical Schur and Oppenheim inequalities associated with the Hadamard product. Our approach highlights structural parallels between entrywise and convolution-based matrix operations, revealing how positivity constraints interact with causality. Building on this perspective, we introduce a broader family of causal matrix products and prove unified inequalities that simultaneously recover the classical Schur and Oppenheim bounds as well as their convolutional Jury counterparts. These results provide a common framework for understanding positivity-preserving matrix products and suggest further connections between classical matrix analysis and causal operator structures.
Read the full abstract
Statistics Theory
Adjacency Spectral Embeddings of Correlation Networks
In many applications, weighted networks are constructed based on time series data: each time series is associated to a vertex and edge weights are given by pairwise correlations. The result is a network whose edge dependency structure violates the assumptions of most common network models. Nonetheless, it is common to analyze these "correlation networks" using embedding methods derived from edge-independent network models, based on a belief that the edges are approximately independent. In this work, we put this modeling choice on firm theoretical ground. We show that when the time series are expressible in terms of a small number of Fourier basis elements (or in some other suitably-chosen basis), correlation networks correspond to latent space networks with dependent edge noise in which the vertex-level latent variables encode the basis coefficients. Further, we show that when time series are observed subject to noise, spectral embedding of the resulting noisy correlation network still recovers these true vertex-level latent representations under suitable assumptions. This characterization of embeddings as learning Fourier coefficients appears to be folklore in the signal processing community in the context of principal component analysis, but is, to the best of our knowledge, new to the statistical network analysis literature.