Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Saturday 14 March

Combinatorics

On the Seidel energy of uniform hypergraphs due to hyperedge and vertex deletion

Let $\mathcal{S}(\mathcal{H})$ be the Seidel matrix of a hypergraph $\mathcal{H}$, and the Seidel energy is denoted by the sum of the absolute eigenvalues of $\mathcal{S}(\mathcal{H})$. In [G.~X.~Tian, Y.~Li and S.~Y.~Cui, The change of Seidel energy of tripartite Turán graph due to edge deletion, Linear Multilinear Algebra, 19 (2022), 4597-4614] and [Y.~Liu, X.~Chen, The change of Seidel energy of 5-partite Turán graph due to edge deletion, Discrete Applied Mathematics, 2024, 342, 104-123], the authors studied the change of Seidel energy of the Turán graph due to edge deletion. In this article, we analyze the Seidel spectrum of the complete $3$-uniform bipartite hypergraph $\mathcal{C}^3_{m,n}$ and show that it has exactly one negative Seidel eigenvalue even after a single hyperedge deletion. Finally, we prove that the Seidel energy of the complete $3$-uniform bipartite hypergraph $\mathcal{C}^3_{m,n}$ decreases after single hyperedge and vertex deletion for all $m,n \ge 3$.
Read the full abstract

Optimization and Control

Distributional Uncertainty and Adaptive Decision-Making in System Co-design

Complex engineered systems require coordinated design choices across heterogeneous components under conflicting objectives and uncertain specifications. Monotone co-design provides a compositional framework for such problems. Performance of each subsystem is modeled with a design problem: a relation specifying what resources suffice to provide each functionality. Existing uncertain co-design models rely on interval bounds, which support worst-case reasoning but cannot represent probabilistic risk or multi-stage adaptive decisions. We develop a distributional extension of co-design that models uncertain design outcomes as distributions over design problems and supports adaptive decision processes through Markov-kernel re-parameterizations. Using quasi-measurable and quasi-universal spaces, we show that the standard co-design compositions remain compositional under this richer uncertainty, and introduce queries and observations extracting probabilistic trade-offs, including feasibility probabilities, confidence bounds, and distributions of minimal required resources. A task-driven unmanned aerial vehicle case study shows how the framework captures risk-sensitive and information-dependent design choices that interval models cannot express.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Further Results on Null and Force-free Electromagnetic Fields

The theory of Force-Free Electrodynamics (FFE) provides a robust framework for modeling the magnetospheres of compact objects, where the electromagnetic field's energy density dominates the surrounding plasma. Central to this theory is the existence of two-dimensional integral submanifolds, or field sheets, which foliate the spacetime. While it is established that every null force-free field possesses an associated 2-D null geodesic foliation, the converse, identifying which null geodesic congruences can support a force-free solution, remains a non-trivial computational challenge. In this paper, we extend the foliation-based approach to null FFE by addressing two primary obstacles to the existence of a solution: the equipartition of null mean curvature and the involutivity of the field sheet distribution. We prove a general existence theorem demonstrating that for any given null geodesic congruence, there always exists a local rotation of a 2-D basis transverse to the geodesic congruence that satisfies the equipartition condition. Furthermore, we establish that a shear-free null geodesic congruence is sufficient to guaranty the existence of an arbitrary function of three variables such that any choice of such a function will generate a null field sheet foliation. Additionally, each unique foliation will be associated with a null force-free field that further contains an arbitrary function of two variables. These results are formally linked to the vanishing of the shear tensor, providing a coordinate-independent geometric criterion for the existence of null FFE solutions. We illustrate these theorems with explicit examples in Schwarzschild and Kerr geometries and present new, non-trivial exact null solutions in flat spacetime and for the C-metric.
Read the full abstract

Commutative Algebra

On licci squarefree monomial ideals

We study the licci property for several classes of squarefree monomial ideals arising from graphs and related combinatorial structures. We characterize licci bi-Cohen-Macaulay squarefree monomial ideals, complementary edge ideals, $t$-path ideals of cycles, and $(t-1)$-suspensions of graphs. Consequently, the full list of licci path ideals of trees is obtained. This work extends the known classification of licci edge ideals to a broader family of path ideals.
Read the full abstract

Numerical Analysis · Cross-listed from cs.MS

Pyroclast: A Modular High-Performance Python Solver for Geodynamics

This monograph presents the design, implementation, and evaluation of Pyroclast, a modular high-performance Python framework for large-scale geodynamic simulations. Pyroclast addresses limitations of legacy geodynamics solvers, often implemented in monolithic Fortran, C++, or C codebases with limited GPU support and extensibility, by combining modern numerical methods, hardware-accelerated execution, and a flexible object-oriented architecture. Designed for distributed and GPU-accelerated environments, Pyroclast provides an accessible and efficient platform for simulating mantle convection and lithospheric deformation using the marker-in-cell method and a matrix-free finite difference discretization. The work focuses on a scalable two-dimensional viscous mechanical solver that forms the computational core for future visco-elasto-plastic models. The solver includes a stress-conservative staggered grid discretization of the incompressible Stokes equations, a matrix-free geometric multigrid solver, Krylov and quasi-Newton methods, and MPI-based domain decomposition for distributed execution. Benchmarks evaluate performance and scalability. Shared-memory tests show strong scaling of the Stokes solver and demonstrate a 5-10x speedup on NVIDIA A100 GPUs compared to a multi-core CPU baseline. Distributed advection benchmarks show near-ideal weak scaling up to 896 CPU cores across seven compute nodes. These results demonstrate that Pyroclast achieves high performance while remaining accessible through a high-level Python interface. The framework also provides a blueprint for modernizing legacy geodynamics codes. Its modular architecture and Python-native implementation lower the barrier to entry while enabling interoperability with modern machine learning libraries, enabling hybrid physics-based and data-driven workflows.
Read the full abstract

Statistics Theory

On a Universal Strictly Decreasing Nonparametric Estimator Applied to the Drift Function of a Recurrent Diffusion Process Estimation

This paper deals with a copies-based continuously differentiable and strictly decreasing estimator of the drift function for stochastic differential equations defining recurrent diffusion processes. The first part of our paper deals with non-asymptotic $\mathbb L^1$-risk bounds and a bandwidths selection procedure for a universal monotone estimator. These results are tailor-made to our framework, and then applied to the estimation of the drift function of recurrent diffusion processes in the second part of the paper.
Read the full abstract

Numerical Analysis

Energy Dissipation Preserving Feature-based DNN Galerkin Methods for Gradient Flows

In recent years, deep learning methods, exemplified by Physics-Informed Neural Networks (PINNs), have been widely applied to the numerical solution of differential equations. However, these methods may suffer from limited accuracy, high training costs, and lack of robustness, particularly their inability to preserve the intrinsic physical structures of continuous PDE models, such as the energy dissipation property in gradient flow systems. To address these challenges, we propose a feature-based Deep Neural Network Galerkin (DNN-G) framework designed for structure-preserving simulations of gradient flows. Instead of treating neural networks merely as optimization-driven solvers, we employ them as adaptive feature generators that define nonlinear trial spaces within a Galerkin projection formulation.This formulation guarantees semi-discrete energy dissipation and can be naturally combined with energy stable time integration schemes. Several strategies for constructing neural basis functions are investigated, including random features, structured initialization, and problem-informed pre-training. Numerical experiments demonstrate that the proposed method preserves robust energy stability in high-dimensional settings and accurately captures complex topological transitions. With equivalent degrees of freedom, the DNN-G framework achieves higher accuracy than classical spectral methods, highlighting the effectiveness of neural feature representations for the numerical solution of partial differential equations.
Read the full abstract

All authors Tao Tang, Jiang Yang, Yuxiang Zhao, Quanhui Zhu

Numerical Analysis

A Mixed Finite Element Method for the Dirichlet Vector Laplacian in Three Dimensions

This work establishes the well-posedness and a priori error analysis for the mixed FEEC-type finite element approximation of the three-dimensional vector Laplace boundary value problem subject to the Dirichlet boundary condition. The Dirichlet condition disrupts the structure of the standard de Rham complex, requiring the vorticity to be sought in a non-standard function space to achieve well-posedness. We derive error estimates that confirm the numerically observed suboptimal convergence rates. In particular, by developing a discrete Caccioppoli-type inequality for discrete curl-harmonic functions, we prove $(k-1/2)$-th order convergence in the energy norm on general domains and $k$-th order convergence in $L^2$ on convex domains, where $k \ge 1$ denotes polynomial degree of the finite element spaces. These results extend the previous two-dimensional analysis developed in [Arnold, D.N., Falk, R.S. and Gopalakrishnan, J., 2012. Mixed finite element approximation of the vector Laplacian with Dirichlet boundary conditions. Mathematical Models and Methods in Applied Sciences, 22(9), p.1250024.]~to three-dimensional domains with general topology. As a direct application, a discretization of the Stokes problem in vorticity-velocity-pressure form is studied.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Quantum Dynamical Entropy and Dissipative Information Flows

The Alicki-Lindblad-Fannes dynamical (ALF) entropy measures the rate at which new information is gathered about a quantum system by inspecting its long-time evolution. We propose an extension of the ALF entropy to open quantum dynamics as a measure of back-flow of information from the environment. Such a proposal is stronger than the existing ones based only on the open system reduced dynamics. In the case of a qubit collisionally coupled to a classical spin chain, we obtain an exact expression for the $\textit{open-system ALF entropy}$ explicitly depending on the environment correlations. An extreme case shows how the information flow from environment to system corresponds to vanishing entropy production as for reversible finite quantum systems.
Read the full abstract

Mathematical Physics

Entropy Maximization and Weak Gibbsianity of Quasi-Free Fermionic States

In their 1972 study of approach to equilibrium, Lanford and Robinson showed that gauge-invariant quasi-free states of lattice fermions maximize entropy among all translation-invariant states with a fixed two-point function, and suggested that the maximizer is unique. In subsequent work on this topic, the uniqueness question re-emerged, together with the problem of whether such quasi-free states are weak Gibbs states. We provide a positive answer to both questions within a class of states whose momentum-space two-point function $\widehat C$ satisfies $0<\widehat C(k)<1$ and belongs to the Wiener algebra of the Brillouin zone. The proof reveals that both the entropy maximization principle and weak Gibbsianity follow directly from the thermodynamic formalism for lattice fermions.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Quantum Dynamical Entropy and non-Markovianity: a collisional model perspective

Accessing the physical mechanisms behind non-Markovian phenomena in open quantum dynamics requires the study of the statistical properties of the joint system-environment dynamics. This is impossible at the level of the reduced dynamics of the open system alone as the latter is obtained by suitably eliminating the environment. The task is instead made possible by considering multi-time correlation functions involving observables of the open system, only: the open system-environment interactions turn them into global ones thus building up correlations between the two systems. Multi-time correlations form the basis of both the theory of quantum stochastic processes and of the Alicki-Lindblad-Fannes dynamical entropy (ALF entropy for short). This latter quantity provides for quantum systems a measure of the dynamical entropy production as the Kolmogorov-Sinai entropy does for classical systems. In the case of a collisional model whereby the dissipative dynamics of a finite-level system is obtained by its coupling to an infinite classical spin chain, the ALF entropy can be explicitly computed. It turns out to depend on the parameters characterizing the statistical properties of the environment and can be related to the activation and super-activation of memory effects in the open quantum system.
Read the full abstract

Dynamical Systems · Cross-listed from physics.flu-dyn

Dynamical compartments in stirred tank reactors and Markov state modeling for mixing quantification: a transfer operator approach

Identifying coherent flow structures in chemical reactors is crucial for understanding the mixing dynamics, which is essential for optimizing reactor performance. We demonstrate the use of a transfer operator method to find coherent flow structures such as almost-invariant sets and coherent sets, which are characterized by minimal mixing with the surrounding fluid, in a lab-scaled stirred tank reactor using both simulated and experimental Lagrangian trajectory data. The proposed method further enables a detailed analysis of the mixing behavior by computing expected residence times and mixing times. Additionally, a Markov-state-model describes the macroscopic transport dynamics between compartments in the reactor.
Read the full abstract

All authors Anna Klünker, Thanh Tung Thai, Eike Steuwe, Christian Weiland, Yvonne Schade, Alexandra von Kameke, Kathrin Padberg-Gehle

Mathematical Physics · Cross-listed from quant-ph

Dynamical Simulations of Schrödinger's Equation via Rank-Adaptive Tensor Decompositions

We study low-rank tensor methods for the numerical solution of Schrödinger's equation with time-independent and explicitly time-dependent Hamiltonians, motivated by large-scale simulations of many-body quantum systems and quantum computing devices subject to time-dependent control pulses. We outline the recent application of the "basis update and Galerkin" (BUG) method for tensor trains, and describe the established TDVP and TDVP-2 algorithms based on the time-dependent variational principle. For comparison, we also consider the BUG method in the Tucker format. All these approaches enable memory efficient representations of partially entangled quantum states and thereby mitigate the exponential cost of conventional state-vector formulations. The rank-adaptivity relies on the truncated singular value decomposition, in which the rank of a matrix is reduced by setting its smallest singular values to zero, based on a threshold parameter that controls the truncation error. Numerical experiments on representative time-independent and time-dependent Hamiltonian models quantify the tradeoff between accuracy and compression across methods, with particular attention to the interplay between the time-step and the truncation threshold, and how the computational effort scales with the number of sub-systems in the quantum system.
Read the full abstract

Number Theory

Euler Characteristics of a Family of Congruence Subgroups of $GL_m(\Z)$

The congruence subgroups $\Gamma_1(m,p)$ that we consider here are subgroups of $GL_m(\Z)$ that fix the vector $(0,\dots,0,1) \mod p$, where $p\geq 5$ is a prime. We present a method and many computations of homological Euler characteristics of $GL_m(\Z)$ and $\Gamma_1(m,p)$ with coefficients in any highest weight representation $V$. By homological Euler characteristics we mean the alternating dimensions of cohomology of the group with coefficient in $V$. We compute the homological Euler characteristics for $\Gamma_1(2,p)$, and $\Gamma_1(3,p)$ with coefficients in any finite dimensional highest weight representation. Also we compute the homological Euler characteristics for of $\Gamma_1(4,p)$ and $\Gamma_1(5,p)$ with coefficients in the trivial and the determinant representations. We give application to cohomology of $\Gamma_1(3,p)$ with trivial and with determinant representation. We also give an alternative method for computing the cohomology of $GL_4(\Z)$ compared to \cite{GL4}. The methods in this paper are a continuation of result from \cite{Thesis, EulerChar}.
Read the full abstract

Functional Analysis

Banach Hardy-Sobolev Spaces on the Upper Half-plane and Operator Theory

We study Hardy–Sobolev spaces H_n^p(C^+) on the upper half-plane for 1<=p<=infty and n is a nonnegative integer, from both function-theoretic and operator-theoretic viewpoints. We establish an isometric boundary characterization of H_n^p(C^+) via nontangential limits, together with a Sobolev-type embedding theorem, a Cauchy integral representation, a direct-sum decomposition of W_n^p(R) for 1<p<infty, and a generalized Banach algebra structure under pointwise multiplication. We also obtain a finer Fourier-analytic description in the Hilbert case p=2 by proving a Paley–Wiener theorem and deriving the reproducing kernel of H_n^2(C^+).On the operator-theoretic side, we prove the spectral formula for multiplication operators and establish two verifiable sufficient conditions for the boundedness of weighted composition operators. These results provide a systematic theory of Hardy–Sobolev spaces on the upper half-plane beyond the Hilbert setting.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Quantification of the Resource Theory of Imaginarity Revisited

This work studies the decay of three imaginarity measures, namely the $l_1$-norm-based imaginarity, the robustness of imaginarity, and the relative-entropy-based imaginarity, under typical noise channels. For arbitrary single-qubit pure states subject to real quantum channels, we prove an exact attenuation theorem: the $l_1$-norm-based imaginarity and the robustness exhibit identical attenuation governed by a common channel-dependent factor, whereas the relative-entropy-based imaginarity additionally depends on the input-state orientation relative to the reference basis. We extend the investigation to two-qubit entangled and dual-rail states, establishing a quantitative link between photon-loss probability and residual imaginarity for photonic dual-rail encodings. For separable two-qubit states, we define a real-operation resource preorder and show that $\Omega_{++}=|+\rangle\langle+|\otimes|+\rangle\langle+|$ is operationally maximal. We further distinguish operational de-imaginary power from reference-state imaginarity loss. For several real two-qubit channels we derive exact operational de-imaginary powers, while for other channels we provide analytic reference-state losses serving as benchmarks and rigorous lower bounds.
Read the full abstract

Numerical Analysis

Regge metrics with enhanced trace

We introduce variants of Regge finite element metrics with enhanced properties of the trace. In particular the trace operator is surjective to a finite element space of continuous functions. Multiplying these scalar functions by the identity tensor brings one back to the finite element space of metrics. The metrics can be based on high order polynomials and be constructed on refinements, such as the Clough-Tocher or Worsey-Farin splits. Potential applications to general relativity, incompressible elasticity and conformal geometry are sketched.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Discrete-time linear quadratic stochastic control with equality-constrained inputs: Application to energy demand response

We investigate the discrete-time stochastic linear quadratic control problem for a population of cooperative agents under the hard equality constraint on total control inputs, motivated by demand response in renewable energy systems. We establish the optimal solution that respects hard equality constraints for systems with additive noise in the dynamics. The optimal control law is derived using dynamic programming and Karush-Kuhn-Tucker (KKT) conditions, and the resulting control solution depends on a discrete-time Riccati-like recursive equation. Application examples of coordinating the charging of a network of residential batteries to absorb excess solar power generation are demonstrated, and the proposed control is shown to achieve exact power tracking while considering individual State-of-Charge (SoC) objectives
Read the full abstract

Analysis of PDEs

Dimension reduction of fractional Sobolev seminorms on thin domains

We study the asymptotic behaviour of Gagliardo seminorms in $H^s$ defined on thin films $\Omega_\e=\omega\times(0,\e)$. The first relevant order is $\e^{1-2s}$, at which the corresponding limit captures the vertical fractional oscillations through one-dimensional sections. The second relevant order produces dimension-reduction regimes that undergo a qualitative transition at the critical exponent $s=\tfrac12$. For $s<\tfrac12$, the dominant contribution is driven by interactions at finite planar distance, and the dimension-reduction scale is $\e^2$. In this regime, the limit is a lower-dimensional fractional energy with an effective gain of $\tfrac12$ in the differentiability index. At the critical exponent $s=1/2$, the dimension-reduction scale is $\e^{2}|\log\e|$, and the limit is local, with dominant interactions at scales between $\e$ and $1$, producing a Dirichlet-type limit on $\omega$. For $s>\tfrac12$, the dominant contribution is instead driven by interactions at distances of order $\varepsilon$, the dimension-reduction scale is $\e^{3-2s}$, and the second-order $\Gamma$-limit is still local. We also study the case $s=s_\e\to 1^-$, showing a Bourgain–Brezis–Mironescu-type result.
Read the full abstract

Combinatorics

An improvement bound on a problem of Picasarri-Arrieta and Rambaud

Let $k$ and $\ell$ be positive integers. A cycle with two blocks $C(k,\ell)$ is a digraph consisting of two internally vertex disjoint directed paths of lengths $k$ and $\ell$ with the same initial vertex and terminal vertex. Picasarri-Arrieta and Rambaud (European J. Combin., 2024) proved that for any $k\geq 2$, every digraph of minimum out-degree at least two and girth at least $8k-6$ contains a subdivision of $C(k,k)$. They also construct a family of digraphs showing that the girth cannot be reduced to $k-1$, and posed the problem of determining the minimum girth such that every digraph of minimum out-degree at least two contains a subdivision of $C(k,k)$. In this paper, we improve the lower bound on the girth from $8k-6$ to $4k+2$, and construct a family of digraphs in which every member has minimum out-degree two and girth $k$ but contains no subdivision of $C(k,k)$. Thus our results show that the girth in question lies between $k+1$ and $4k+2$.
Read the full abstract

All authors Bin Chen, Xinmin Hou, Yue Ma, Zhi Yin, Xinyu Zhou

Optimization and Control

The Effective Lasserre's Perturbative Positivstellensatz

We study sum-of-squares (SOS) certificates for nonnegative polynomials $p$ on $\mathbb{R}^d$ and their implications for polynomial optimization over unbounded domains. Building on Lasserre's perturbation approach, we consider SOS representations of $p$ augmented by weighted polynomial tails of the form $\sum_{n=0}^N (x\cdot x)^n/(n!)^t$ for $0 < t < 1$. Our main result provides an explicit quantitative bound on the truncation order $N$ required to achieve an $\varepsilon$-accurate certificate. Using positivity properties of the Mehler kernel and techniques inspired by polynomial kernel methods, we show that $N$ grows polynomially in $1/\varepsilon$, with rate $N = O((\|p\|/\varepsilon)^{1/(1-t)})$.
Read the full abstract

Statistics Theory

Random discrete copulas

We introduce the notion of a bivariate random discrete copula on an equidistant mesh and explore its stochastic properties. A random discrete copula is a discrete random field, hence, its value at a given point on the mesh is a random variable. We determine the distribution of this random variable and calculate its expected value and variance. We also consider bilinear extension of a random discrete copula to a random field over the whole unit square.
Read the full abstract

Category Theory · Cross-listed from quant-ph

Generalized Inverses of Quantum Channels: a categorical perspective

A quantum channel is defined as being completely positive (CP) and trace preserving (TP). While not every quantum channel is invertible or reversible, every quantum channel admits various kinds of generalized inverses such as the Moore-Penrose inverse and the Drazin inverse. A generalized inverse of a quantum channel may not itself be a quantum channel: it often fails to be CP. However, generalized inverses still play an important role in quantum error mitigation. Here, because it is often desirable for the generalized inverse of a quantum channel to be at least TP, the Drazin inverse, which is TP, is favoured over the Moore-Penrose inverse, which is not in general TP. In this paper, we take a categorical perspective on generalized inverses of quantum channels. This allows us to give a simple proof of the fact that the Drazin inverse of a quantum channel is always TP. It also allows us to show that for unital quantum channels, the Drazin inverse is also unital. We then generalize this result to dagger Drazin inverses, which allows us to show that for unital quantum channels, the Moore-Penrose inverse is both TP and unital as well. This opens the door to new applications of both the Drazin inverse and Moore-Penrose inverse in quantum information theory and, in particular, in quantum error mitigation.
Read the full abstract

Number Theory

A Totient Function Associated with Variants of Groups

Motivated by an application of semigroup variants to the discrete log problem in groups and related cryptographic applications, we introduce a new kind of totient function, related to both Euler's function and a generalisation of Euler's function introduced in 1869 by Schemmel. We focus on the problem of how to evaluate this function, and the number theory involved, while non-trivial and at times slightly technical, is reasonably accessible to a wide audience. It should also become clear that there are obvious generalisations of his new function that the interested reader might like to pursue.
Read the full abstract

Number Theory

The multi-height distribution implies the Batyrev-Manin principle

We explain how to deduce from the multi-height analysis of rational points on a toric stack (respectively on a toric variety) the asymptotic study of the number of rational points of bounded orbifold anticanonical height (respectively bounded anticanonical height), using a general version of the hyperbola method developed by Marta Pieropan and Damaris Schindler.
Read the full abstract

Operator Algebras

Metric dimension and product entropy of group $C^{\ast}$-algebras

We consider reduced group $C^{\ast}$-algebras of finitely generated discrete groups metrized by seminorms obtained from word length functions. We study the metric dimensions of such $C^{\ast}$-algebras as defined by David Kerr. We also study the product entropy of the automorphisms of group $C^{\ast}$-algebras induced by the automorphisms of the underlying groups. We get a lower bound and an upper bound of the product entropy of an automorphism in terms of the classical group theoretic algebraic and geometric entropy of the automorphisms, provided the group has polynomial growth property. For groups with exponential growth, we show that the metric dimension of the group $C^{\ast}$-algebras is generically $+\infty$.
Read the full abstract

Statistics Theory

A two-sample test for symmetric positive definite matrix distributions using Wishart kernel density estimators

We develop a nonparametric two-sample test for distributions supported on the cone of symmetric positive definite matrices. The procedure relies on the Wishart kernel density estimator (KDE) introduced by Belzile et al. (2026), whose support-adaptive kernel alleviates boundary bias by remaining confined to the cone. Our test statistic is the rescaled integrated squared difference between two Wishart KDEs and can be expressed as a two-sample $V$-statistic via an explicit closed-form overlap of Wishart kernels, avoiding numerical integration. Under the null hypothesis of equal densities, we derive the asymptotic distribution in both the common shrinking-bandwidth and fixed-bandwidth regimes. The proposed method provides a kernel-based competitor to the empirical Laplace-transform two-sample test of Lukić (2024). Unlike the orthogonally invariant Hankel-transform test of Lukić and Milošević (2024), our statistic can detect alternatives that differ only through eigenvector structure, for instance, Wishart models with the same shape parameter and the same scale eigenvalues but different orientations. A comparative simulation study examines the empirical Type I error rates and power of the proposed and Laplace-transform tests.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Spatially Varying Coefficient Mallows Model Averaging

Model averaging, as an appealing ensemble technique, strategically integrates all valuable information from candidate models to construct fast and accurate prediction. Despite of having been widely practiced in many fields such as cross-sectional data, censored data and longitudinal data, its application to spatial data characterized by inherent spatial heterogeneity remains surprisingly limited. To mitigate risk of model misspecification and enhance the flexibility of prediction, we propose a combined estimator constructed by computing the weighted average of estimators derived from a set of spatially varying coefficient candidate models. Herein, the model weights are determined via a Mallows-type criterion, which dynamically calibrates the relative importance of individual candidate models in the ensemble. Theoretically, we establish desirable asymptotic properties under two practical scenarios. First, in the case where all candidate models are misspecified, the proposed model averaging estimator attains asymptotic optimality in the sense that it minimizes the squared error loss function asymptotically. Second, when the candidate model set encompasses at least one quasi-correct model, the weights assigned by the Mallows-type criterion asymptotically concentrate on the quasi-correct models, and the resulting model averaging estimator converges in probability to the true conditional mean. Both simulation studies and a real-world empirical example demonstrate that the proposed method generally outperforms alternative comparative approaches in terms of predictive accuracy and robustness.
Read the full abstract

Analysis of PDEs

Vorticity confinement for 2D incompressible flows in an infinite cylinder

We study the confinement of vorticity for two-dimensional incompressible flows in an infinite cylinder. For Navier-Stokes solutions with non-negative and compactly supported initial vorticity, we derive quantitative decay estimates showing that the vorticity mass outside regions whose distance from the initial support grows like $\sqrt{t\log^\alpha t}$ (with $\alpha>1$) or like $t^\beta$ (with $\beta>1/2$) becomes, respectively, super-polynomially or stretched-exponentially small. The analysis combines an iterative scheme with an antisymmetry property of the Biot-Savart kernel. In the Euler case, by coupling this approach with a first-moment estimate from [Commun. Math. Phys., 367, 1077-1093, 2019], we recover the confinement bound of [Commun. Math. Phys., 367, 1077-1093, 2019] and refine it slightly: the diameter of the vorticity support grows at most like $(t\log t)^{1/3}$, rather than $t^{1/3}\log^2 t$.
Read the full abstract

Analysis of PDEs · Cross-listed from cond-mat.stat-mech

Channel transport: gating, geometry, and heterogeneous diffusion

Channel-mediated transport is ubiquitous in biology. A series of works by different theoreticians have sought to determine how the diffusive flux through a channel depends on (a) stochastic gating, (b) channel geometry, and (c) heterogeneous diffusion. In this paper, we derive an explicit estimate for the diffusive flux through a channel that accounts for these three factors. We show that our estimate is exact in certain parameter regimes. We further use stochastic simulations to confirm that our estimate remains accurate across a very broad range of parameters. Our estimate differs from some results in the physics literature.
Read the full abstract