Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 1 March

Optimization and Control

An Abstract Stochastic Haugazeau Method for Best Approximation

The Haugazeau method was originally designed to compute the best approximation from an intersection of closed convex sets in Hilbert spaces using the projection operators onto the individual sets iteratively. We propose an abstract stochastic version of it to compute the best approximation from a closed convex set by successive projections onto randomly generated stochastic outer approximations of that set. Strong convergence in the mean square and the almost sure modes is derived under general hypotheses on the outer approximations. The results are applied to the development of stochastic algorithms to construct the best approximation from an arbitrary intersection of fixed point sets by random activation of blocks of operators. A numerical application to the computation of Chebyshev centers is provided.
Read the full abstract

Algebraic Geometry

Explicit deformation of a spider algebra to a curvilinear scheme via Möbius generators

We construct an explicit flat one-parameter family of 22-dimensional Artinian $k$-algebras whose special fibre is the spider algebra $k[x,y,z]/(x^8, y^8, z^8, xy, xz, yz)$ and whose generic fibre is the curvilinear algebra $k[t]/(t^{22})$. The construction uses Möbius generators $u_a = t/(1-at)$ inside the curvilinear ring together with a divided-difference change of coordinates, and produces the family via a weighted Rees degeneration with integer coefficients. This gives an explicit one-parameter family witnessing, for this spider ideal, the general phenomenon proved by Bérczi-Svendsen that every monomial subscheme of $\mathbb{C}^d$ lies in the curvilinear component of the Hilbert scheme of points.
Read the full abstract

Numerical Analysis · Cross-listed from cs.MS

A natural language framework for non-conforming hybrid polytopal methods in Gridap.jl

Hybrid finite element methods such as hybridizable discontinuous Galerkin, hybrid high-order and weak Galerkin have emerged as powerful techniques for solving partial differential equations on general polytopal meshes. Despite their diverse mathematical origins, these methods share a common computational structure involving hybrid discrete spaces, local projection operators and static condensation. This work presents a comprehensive framework for implementing such methods within the Gridap finite element library. We introduce new abstractions for polytopal mesh representation using graph-based structures, broken polynomial spaces on arbitrary mesh entities, patch-based local assembly for cell-wise linear systems, high-level local operator construction and automated static condensation. These abstractions enable concise implementations of hybrid methods while maintaining computational efficiency through Julia's just-in-time compilation and Gridap's lazy evaluation strategies. We demonstrate the framework through implementations of several non-conforming polytopal methods for the Poisson problem, linear elasticity, incompressible Stokes flow and optimal control on polytopal meshes.
Read the full abstract

Dynamical Systems

Fractional Sobolev Spaces and Variational Problems with Variable-Order Operators on Time Scales

We construct fractional Sobolev spaces on arbitrary time scales, both in one dimension and on product time scales. In 1D, we define $W^{\alpha(\cdot),p}_{\mathrm{rd}}(\mathcal I)$ through a variable-order Gagliardo-type seminorm and prove completeness and compact embedding properties under standard boundedness assumptions on the order. We then extend the framework to rectangles $\mathcal R=\mathcal I_1\times \mathcal I_2\subset\mathbb T_1\times\mathbb T_2$, introducing the product spaces $W^{(\alpha,\beta),p}_{\mathrm{rd}}(\mathcal R)$ and establishing completeness, reflexivity, separability, and compact embeddings. To support boundary-value problems, we propose a boundary decomposition of $\partial\mathcal R$ into four sides and a corresponding trace framework (first on $C_{\mathrm{rd}}(\mathcal R)$ and then by density). We also define variable-order Riemann–Liouville and Caputo fractional operators on time scales and derive an Euler–Lagrange equation for variational functionals depending on these operators. The resulting toolkit provides a functional-analytic basis for fractional dynamic equations on mixed time scales and for anisotropic nonlocal models on product time scales.
Read the full abstract

Mathematical Physics · Cross-listed from cs.DM

Unbounded length minimal synchronizing words for quantum channels over qutrits

Grudka, Karczewski, Kurzynski, Stempin, Wójcik and Wojcik (2025) constructed quantum channels with synchronizing words of length 3 for qutrits. We extend their result to arbitrarily long minimal synchronizing words, providing a contrast to Černý's conjecture for finite automata.
Read the full abstract

Numerical Analysis

Geometric Multigrid solvers for Hybrid High-Order methods on polytopal meshes

We propose the first optimal geometric multigrid solver for hybrid high-order discretisations that can handle arbitrary polytopal agglomeration hierarchies in both two and three dimensions. The key ingredient is the use of modified skeleton spaces, which naturally accommodate non-planar interfaces arising during coarsening while reducing the number of degrees of freedom. We prove robust convergence with respect to the mesh size and the number of levels, and we validate our results numerically on a range of agglomeration-based mesh hierarchies. The approach extends naturally to other hybrid discretisations such as hybridizable discontinuous Galerkin and Weak Galerkin methods.
Read the full abstract

Information Theory · Cross-listed from econ.TH

Artificial Superintelligence May be Useless: Equilibria in the Economy of Multiple AI Agents

With recent development of artificial intelligence, it is more common to adopt AI agents in economic activities. This paper explores the economic actions of agents, including human agents and AI agents, in an economic game of trading products/services, and the equilibria in this economy involving multiple agents. We derive a range of equilibrium results and their corresponding conditions using a Markov chain stationary distribution based model. One distinct feature of our model is that we consider the long-term utility generated by economic activities instead of their short-term benefits. For the model consisting of two agents, we fully characterize all the possible economic equilibria and conditions. Interestingly, we show that unless each agent can at least double (not merely increase) its marginal utility by purchasing the other agent's products/services, purchasing the other agent's products/services will not happen in any economic equilibrium. We further extend our results to three and more agents, where we characterize more economic equilibria. We find that in some equilibria, the “more powerful” AI agents contribute zero utility to “less capable” agents.
Read the full abstract

All authors Huan Cai, Ziqing Lu, Catherine Xu, Weiyu Xu, Jie Zheng

Optimization and Control

Robust Optimal Portfolio in a Mixture Setting with Partial Ambiguity

Managing insurance and financial risk when data is limited is a key task in the insurance industry. In this paper, we focus on cases where the risk distribution is modeled as a mixture with some components estimable to high precision or known, and others, along with their weights, are not. Our paper addresses two robust portfolio optimization problems with partial ambiguity, where the loss function involves either variance or conditional value-at-risk (CVaR). We use a projected subgradient descent algorithm to solve the optimization problems. The problem reduces to a convex-nonconcave minimax problem. We show that, while the general problem converges at an $O(1/\sqrt{k})$ rate, where $k$ denotes the number of iterations, exponential convergence is possible in some cases. Lastly, we provide numerical examples to show the effectiveness of our approach and the attainment of a geometric convergence rate. This work aims to provide more effective solutions for actuarial decision-making under model uncertainty.
Read the full abstract

Statistics Theory

A new kernel-based approach for the global sensitivity analysis of models with correlated inputs

We present an HSIC-based approach for global sensitivity analysis of broad classes of models with correlated and possibly function-valued inputs and outputs. To this end, we define the first-order and total HSIC sensitivity indices, which are bounded, interpretable, and moment-independent analogues to the first-order and total-effect Sobol' indices, respectively. These desirable qualities hinge upon the key property of monotonicity under marginalization for the HSIC. We rigorously establish this monotonicity property by using a suitable class of augmented kernels. Furthermore, we provide an efficient algorithm for computing an empirical estimator of the HSIC that significantly reduces computational complexity and storage requirements. The effectiveness and interpretability of the first-order and total HSIC sensitivity indices are demonstrated through computational experiments on models that feature nonlinear relationships, correlated inputs, and functional outputs.
Read the full abstract

Numerical Analysis

Uncertainty quantification using importance-sampled quasi-Monte Carlo with dimension-independent convergence rates

Quasi-Monte Carlo (QMC) integration over unbounded domains $\mathbb{R}^s$ remains challenging due to the high dimensionality of sampling space and the boundary growth of the integrand. In applications such as uncertainty quantification (UQ), the dimension $s$ can reach hundreds or even thousands. To restore the efficiency of quadrature rules in high dimensions, constructive QMC methods like lattice rules have been successfully developed within the framework of weighted function spaces. In contrast to designing problem-specific quadrature points, this paper proposes transforming the underlying integrand to accommodate the off-the-shelf scrambled nets (a construction-free randomized QMC method) via the boundary-damping importance sampling (BDIS) proposed by Pan et al. (2025). We provide a rigorous analysis of the dimension-independent convergence rate of BDIS-based scrambled nets while covering a broader class of unbounded functions than that in Pan et al. (2025). By exploiting the dimension structure of the parametric input random field, the proposed $n$-point quadrature rule achieves a dimension-independent mean squared error rate of $O(n^{-1-\alpha^*+\varepsilon})$ on standard UQ problems in elliptic partial differential equations (PDEs), where $\varepsilon>0$ is arbitrarily small and $\alpha^*\in (0,1)$ reflects the regularity with respect to the parametric variables. Numerical experiments on elliptic PDEs with high-dimensional parameters further demonstrate the effectiveness of the method.
Read the full abstract

Saturday 28 February

Optimization and Control · Cross-listed from stat.ML

A Consistency-Centric Approach to Set-Based Optimization with Multiple Models of Unranked Fidelity

In complex real-world settings, optimization is challenged by the presence of diverse models of differing fidelity. In many optimization problems, a single model is treated as the most accurate representation of the underlying system, while other models are evaluated primarily by their agreement with this presumed most accurate model. Yet in real-world applications, model accuracy is rarely known a priori and assuming a single most accurate model can be misleading. This paper addresses this gap by proposing a flexible set-based optimization methodology called Set-Based Optimization with Multiple Models (S-BOMM) that works with multiple models without the assumption of a most accurate high-fidelity model. Unlike traditional optimization approaches that focus on finding an optimal solution according to the high-fidelity model, our methodology utilizes consistency between models to identify good solutions across multiple models. A probabilistic analysis of the consistency method is provided that bounds the likelihood of the methodology producing correct or incorrect results. Empirical results demonstrate the effectiveness of S-BOMM on test problems. By focusing on the consistency across models rather than relying on a single best solution, this set-based approach offers a practical alternative to optimization problems where multiple models must be considered without assuming a single most accurate high-fidelity model.
Read the full abstract

All authors Danielle F. Morey, Giulia Pedrielli, Cherry Y. Wakayama, Zelda B. Zabinsky

General Mathematics

Angles, orthogonality, and Pythagorean theorem in Banach spaces with two related applications

In the current work, we propose a generalization of angles and orthogonality from $L^2$ to generic Banach spaces, starting from a $L^p$ version of the Pythagorean theorem, $p\in [1,\infty)$. The starting point is conservation of energy measured in $L^1$ norm, as it occurs when considering the intrinsic mode functions decomposition in signal processing. This conservation of energy measure in $L^1$ norm is exactly the $L^1$ Pythagorean theorem. Besides the theoretical analysis, we apply the new notions in the context of preconditioning for structured large linear systems, by obtaining new classes of preconditioners. The present work contains numerical experiments and various remarks on the possible use of the given framework.
Read the full abstract

All authors Antonio Cicone, Stefano Serra-Capizzano, Giacomo Tento, Haomin Zhou

Dynamical Systems

A Stability Testing Algorithm for Incommensurate Fractional Differential Equation Systems

We consider the question of determining whether or not a given system of fractional-order differential equations is (asymptotically) stable. In particular, we admit systems where each constituent equation may have its own order, independent of the order of the other equations in the system, i.e. we discuss the so-called incommensurate case. Exploiting ideas based in numerical linear algebra, we present an algorithm that can be used to answer this question that is much simpler than known methods. We discuss in detail the case of linear problems where the ratios of orders are rational and indicate how known techniques can be used to apply our findings also to general nonlinear problems with arbitrary orders. A MATLAB implementation of the code is provided.
Read the full abstract

Dynamical Systems

Extended five-term nonlinear drag model for a wide range of cylinder wakes

The unsteady variations in the near wake of a moving cylinder induce lift and drag forces on it, which are customarily normalized and expressed in terms of nondimensional lift and drag coefficients. While there are already several wake oscillator models for either a fixed or moving cylinder, special attention was given to modeling the lift coefficient for the case of a fixed cylinder or the case of a cylinder with one-degree-of-freedom motion in the cross-stream direction. When the drag coefficient is molded for a fixed or two-degree-of-freedom moving cylinder, a two-to-one frequency relationship (or quadratic coupling) between the drag and lift coefficients was assumed in the literature. However, we report situations of the excited wake of a vibrating cylinder, where such a modeling assumption fails to reproduce the actual pattern of the drag coefficient. We excite the wake of the cylinder by vibrating it harmonically in straight lines, and we then investigate the effect of this mechanical harmonic excitation on the lift-drag coupling using three tools for nonlinear dynamics analysis, namely, (1) time domain, (2) projection of the limit cycle, and (3) power spectra. We perform this analysis under different motion cases with manifested lift-drag coupling types that call on an extended universal drag model that accommodates such cases. Based on this, we propose a new reduced-order drag model with both linear and quadratic coupling terms to the lift as well as a mean component (thus, the proposed model consists of five terms). We verified the accuracy of the proposed reduced-order drag model by testing its ability to reproduce the time-dependent drag coefficient signals at a low Reynolds number of 300.
Read the full abstract

Numerical Analysis

Randomized Tensor Krylov Subspace Methods via Sketched Einstein Product with Applications to Image and Video Restoration

We develop a randomized extension of tensor Krylov subspace methods based on the Einstein product for solving large-scale multilinear systems arising in image and video restoration. The classical tensor global GMRES method relies on Frobenius inner products and full tensor orthogonalization, which become computationally expensive for high-dimensional problems. We introduce a sketched Einstein inner product constructed via mode-wise random projections and develop a randomized tensor global Arnoldi process. The resulting Randomized Tensor Global GMRES (RTG-GMRES) method significantly reduces orthogonalization cost while preserving convergence properties under tensor subspace embedding assumptions. Residual bounds, perturbation analysis and projected Tikhonov regularization are derived. The proposed method provides an efficient framework for solving ill-posed multidimensional problems arising in color image and video restoration.
Read the full abstract

Number Theory

On a conjecture due to Kanade related to Nahm sums

Kanade explored the construction of modular companions to $q$-series identities, using the asymptotics of Nahm sums, and Mizuno [Ramanujan J. 66 (2025), Article 62, 31 pp.] recently obtained a generalization of Kanade's asymptotic formula for symmetrizable Nahm sums. A related conjecture from Kanade concerning the dilogarithm function and related to the work of Kurşungöz on Andrews–Gordon-type series [Ann. Comb. 23 (2019), 835–888] has remained open. In this paper, we prove Kanade's conjecture, through an application of dilogarithm identities due to Kirillov together with a dilogarithm ladder due to Loxton and Lewin. Inspired by Kanade's result, we extend this to prove two new related dilogarithm identities.
Read the full abstract

Analysis of PDEs

Recent Analytical and Computational Developments on the Advection-Diffusion-Reaction Wildfire Model

Wildfires represent a problem for ecosystems, human activities, and economies, driven by the climate crisis and land-use changes. Predicting wildfire propagation through mathematical modelling is essential for damage mitigation and risk assessment. This paper provides a comprehensive review of a physics-based Advection-Diffusion-Reaction (ADR) model, focusing on the balance between physical accuracy and computational efficiency. We analyze the ability of the ADR model to estimate fire front speed and behaviour and discuss its preliminary mathematical properties. Additionally, we discuss some modelling improvements which enhance the physical realism of the model. Furthermore, we address the challenge of reducing computational costs, emphasizing the need for inexpensive but precise numerical schemes. We report recent findings outlining open challenges in model discretization and technological solutions. All these developments highlight the potential of ADR models as powerful tools for efficient wildfire simulation and risk assessment.
Read the full abstract

All authors Luca Nieding, A.George Morgan, Adrian Navas, DonatoPera, Bruno Rubino, Federica Di Michele, Koondanibha Mitra, Qiyao Peng, Cordula Reisch

Statistics Theory

Minimax convergence rates of a binary plug-in type classification procedure for time-homogeneous SDE paths under low-noise conditions

The study of minimax convergence rates for classification procedures adapted to SDE paths is rarely addressed in the literature. Only one paper established optimal convergence rates for a binary classifier for SDE paths constructed from the white noise model. In this paper, we consider a more complex diffusion model with space-dependent drift and diffusion coefficients where the drift depends on the class and the diffusion coefficient is common to all classes. We establish, under the low-noise condition, a faster convergence rate over a Holder space. This result will require the establishment of an exponential inequality, which is essential to obtain the expected rate. We then study the lower bound on the excess risk of the empirical classifier.
Read the full abstract

Combinatorics

A Colorful Way to Park: An Introduction to Exact $k$-Typed Parking Functions

Parking functions are tuples that describe the parking of $M$ cars on a street with $M$ parking spots. In this paper, we define exact $k$-typed parking functions ($k$-TPFs) to be a variant of classical parking functions. We then establish that every exact $k$-TPF $\alpha$ of length $M$, corresponds to a unique parking configuration $C$. We observe that the collection of all exact $k$-TPFs which result in the same configuration form a disjoint subset of all exact $k$-TPFs. Lastly, we conclude by showing how parking permutations of an exact $k$-TPF can be related to other combinatorial objects.
Read the full abstract

Numerical Analysis

A short tour of operator learning theory: Convergence rates, statistical limits, and open questions

This paper surveys recent developments at the intersection of operator learning, statistical learning theory, and approximation theory. First, it reviews error bounds for empirical risk minimization with a focus on holomorphic operators and neural network approximations. Next, it illustrates fundamental performance limits in terms of sample size by adopting a minimax perspective and considering various notions of regularity beyond holomorphy. The paper ends with a discussion on the interplay between these two perspectives and related open questions.
Read the full abstract

Geometric Topology

Adjoint Reidemeister torsion of 3-manifolds with torus boundary for semisimple algebraic groups

Let $M$ be a compact oriented $3$-manifold with boundary consisting of tori, and let $G$ be a semisimple algebraic group. We define the adjoint torsion function on the moduli stack of $G$-local systems on $M$ satisfying a certain regularity condition, extending the construction by Porti for $G = \mathrm{SL}_2$. When $M$ is a cusped hyperbolic manifold, we prove that the local system associated with the image of the complete hyperbolic structure via a principal embedding $\mathrm{PGL}_2 \to G$ satisfies the regularity condition. Moreover, we provide a formula expressing its adjoint torsion as a product of $\mathrm{PGL}_2$-torsions associated with the simple $\mathrm{PGL}_2$-modules with multiplicity given by the exponents of the Lie algebra of $G$. We compute the adjoint $\mathrm{PGSp}_4$-torsions of the figure-eight knot complement for two boundary-unipotent local systems, one is arising from the complete hyperbolic structure via a principal embedding, and the other is defined over a number field of degree $6$ and not arising from any $\mathrm{PGL}_2$-local system via principal embeddings.
Read the full abstract

Analysis of PDEs

On Convolution in Variable Lebesgue Spaces and Applications to Fractional Navier_Stokes Equations

In this paper, we introduce a new class of convolution-type inequalities in variable exponent Lebesgue spaces and derive several related estimates, including the \(L^{r(\cdot)}\)–\(L^{p(\cdot)}\) smoothing estimate for the fractional heat kernel. We demonstrate the usefulness of these inequalities by establishing the local well-posedness results for mild solutions to the fractional Navier–Stokes equations, and we further extend these results to global-in-time well-posedness for sufficiently small initial data. Our analysis is carried out in a wide range of mixed-norm variable exponent Lebesgue spaces, including the fully variable setting $L^{p(\cdot)}_t L^{q(\cdot)}_x$, highlighting the robustness of the proposed framework under non-constant integrability. Moreover, the proposed framework is expected to serve as a key tool for similar applications in other related variable exponent function spaces.
Read the full abstract

Optimization and Control

On a Class of Optimal Reinsurance Problems

De Finetti's optimal reinsurance is a set of contracts, one for each risk in a portfolio, that caps the retained aggregate variance to a pre-specified level while minimizing total expected loss. The premiums are determined using the expected value principle, and the safety loading is allowed to vary with the risks. The original formulation assumed that the risks were independent and restricted contracts to quota shares on individual risks. A recent variation surprisingly yields a closed form for the contracts, while allowing dependence between risks and permitting the contracts to depend on all risks, without restricting their functional form. We extend this to the case of an arbitrary convex functional as the risk measure and use duality tools from convex analysis to show the equivalence between the constrained and the penalized versions of the underlying optimization problem. To explicitly solve the penalized version for the variance and the conditional value at risk (CVaR) as the risk measure, we resort to either variational analysis or a rudimentary approach. We show that a rudimentary approach can also address the choice of VaR, a non-convex functional, as the risk measure.
Read the full abstract

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

Simple models for mesoscopic systems: from slender structures to stochastic resetting

The objective of this thesis is to advance the understanding of complex physical phenomena through the lens of statistical physics. Specifically, it addresses two fundamental questions: What types of interactions can induce buckling of slender structures when their temperature is increased? And, how can we devise an optimal strategy for locating a hidden target? The thesis is divided into two distinct parts, both employing mesoscopic descriptions – neither fully microscopic nor fully macroscopic – to capture the essential interactions and behaviours that qualitatively govern the phenomena under investigation. In the first part, we examine the buckling behavior of low-dimensional materials under thermal load. To this end, we develop a comprehensive model that characterises the system using a minimal setup for mimicking: (i) elastic and electronic degrees of freedom, and (ii) coupling between the elastic and the electronic modes. In the second part, we investigate stochastic resetting processes as a means to formulate efficient search strategies. We explore various resetting mechanisms to understand how to optimise the search performance in real scenarios, where: (i) resetting involves a finite cost, and (ii) the target location is only partially known.
Read the full abstract

Probability

Condensation in stochastic lattice gases with size-dependent stationary weights

We consider stochastic lattice gases with stationary product weights and a polynomial perturbation vanishing with the system size that leads to condensation. If the density of particles exceeds a critical value the system phase separates into a bulk with homogeneous distribution of particles and a condensed phase. Depending on parameter values, the latter consists of a single macroscopic cluster or a diverging number of independent clusters on a smaller scale. We establish the condensation transition via the equivalence of ensembles and the main novelty is a derivation of the cluster size distribution using size-biased sampling, generalizing previous work on zero-range and inclusion processes. Simulations of zero-range processes illustrate our theoretical results on the condensate scale and size distribution.
Read the full abstract

All authors Joshua Blank, Paul Chleboun, Stefan Grosskinsky, Watthanan Jatuviriyapornchai

Analysis of PDEs

Decoupled energy estimates for tensorial non-linear wave equations and applications

We prove energy estimates for solutions to a tensorial system of coupled non-linear wave equations, in a way that is suitable to deal with the structure of the non-linearity that arises from the Einstein-Yang-Mills system in the Lorenz gauge as well as with other new different non-linearities. We establish suitable bounds on the $L^2$-norm of each component in a frame decomposition of the tensorial solutions, in way that does not involve all the other components of the tensor, which would allow us to decouple the higher order energy estimates for certain components from the other components. We achieve this partly by exploiting the tensorial structure of the coupled non-linear wave equations, where the background metric that is à priori unknown, is a perturbation of the Minkowski space-time in a certain fixed system of coordinates, and by exploiting the structure of the commutator term for the Lie derivatives of the solutions. These decoupled energy estimates for each component of the tensor in a frame, are new and motivated by a problem that we address in a subsequent paper to prove the exterior non-linear stability of the $(1+3)$-Minkowski space-time governed by a general class of perturbations, that includes the non-linearities that arise from the Einstein-Yang-Mills system in the Lorenz gauge as well as other new non-linearities, which have a different non-linear structure than the one treated by Lindblad-Rodnianski, for which their seminal $L^\infty$-estimate does not work to the best of our knowledge. The decoupled energy bounds on each component in a frame derived here allow us to replace the celebrated $L^\infty$-estimate of Lindblad-Rodnianski in a novel way that permits us to treat these new non-linear structures.
Read the full abstract

Metric Geometry

The Gromov-Hausdorff distance between $l^p$-products of metric spaces

This paper studies $l^p$-products of metric spaces and provides estimates for the Gromov-Hausdorff distances between them. The case of linear products is considered separately, and sufficient conditions for attainability of the estimates are given for it. Examples of calculating the Gromov-Hausdorff distance between flat tori are given. It is proved that for any metric space $X$ of density $d(X)$, the Gromov-Hausdorff distance between it and its $l^\infty$-product (in which the number of factors corresponds to $d(X)$) is equal to half its diameter.
Read the full abstract

Statistics Theory

A New Look at the Visual Performance of Nonparametric Hazard Rate Estimators

Nonparametric curve estimation by kernel methods has attracted widespread interest in theoretical and applied statistics. One area of conflict between theory and application relates to the evaluation of the performance of the estimators. Recently, Marron and Tsybakov (1995) proposed visual error criteria for addressing this issue of controversy in density estimation. Their core idea consists in using integrated alternatives to the Hausdorff distance for measuring the closeness of two sets based onthe Euclidean distance. In this paper, we transfer these ideas to hazard rate estimation from censored data. We are able to derive similar results that help to understand when the application of the new criteria will lead to answers that differ from those given by the conventional approaches.
Read the full abstract

2603.00794 · 28 Feb · 8 pages, no figures. Statistical Research Report, Department of Mathematics, University of Oslo, June 1997, but now arXiv'd March 2026. Has later appeared in "Data Highways and Information Flooding, a Challenge for Classification and Data Analysis", 1997, Springer Verlag

Number Theory

Equidistribution in shrinking sets for arithmetic spherical harmonics

We study a variant of the equidistribution of mass conjecture on the sphere posed by Böcherer, Sarnak, and Schulze-Pillot: quantum unique ergodicity in shrinking sets. Conditionally on the generalized Lindelöf hypothesis, we show that quantum unique ergodicity holds on every shrinking spherical cap whose radius is considerably larger than the Planck scale, and that it holds on almost every shrinking spherical cap whose radius is larger than the Planck scale. Additionally, conditionally on GLH, we provide explicit upper bounds for the $1$-Wasserstein distance and the spherical cap discrepancy between the involved measures.
Read the full abstract