Statistics Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Saturday 28 March
The aim of this article is to determine a new six-parameter Beta Weibull distribution and its various associated functions, namely the cumulative distribution, survival, probability density and hazard functions. Next, we determine the sub-distributions of the new distribution and show that the latter generalizes those of the literature. Finally, numerical simulations were performed and show that the shapes of the density function of the new distribution cover all those in the literature, and the shapes of hazard functions (constant, increasing, decreasing, $\bigcup$-shaped and $\bigcap$-shaped) are represented in the new distribution and encompass all existing distributions.
Mathematical Physics
Quantum Hall States response to toroidal geometry deformation
In this paper, we apply techniques of geometric quantization to study the response of the integer and fractional quantum Hall effects to toroidal geometry deformation. The main method is that of using complex time Hamiltonian evolution to induce the geometry change and then the associated generalized coherent state transforms (gCST) to find the evolution of the Laughlin states. We consider two kinds of deformations. The first are flat toroidal deformations. Although Laughlin states for all flat toroidal geometries have been thoroughly studied before, we believe that our approach via the gCST is novel. It also serves as a testing ground to study the non-flat Kähler deformations. The Hamiltonians used in the flat deformations are quadratic in the generators of translations and therefore non periodic. The second kind of deformations involve nonflat Kähler toroidal deformations, generated by global, thus bi-periodic, Hamiltonians on the torus. The corresponding imaginary time flows are (elliptic curve modulus) $\tau$-preserving Mabuchi geodesics in the space of Kähler metrics on the torus, hitting a curvature singularity in finite imaginary time. By restricting to $S^1$-invariant deformations we find explicit analytic expressions for the evolution of the toroidal geometry and of the Laughlin states all the way to the singularity.
Read the full abstract
Rings and Algebras
Explicit constructions of anti-automorphisms of cyclic and generalized cyclic algebras
We present norm criteria for the existence of anti-automorphisms, as well as explicit constructions of anti-automorphisms, both on cyclic and generalized cyclic algebras. Our approach describes anti-automorphisms as polynomial maps and unifies existing approaches. It recovers classical criteria for the existence of involutions as special cases. We obtain norm conditions for the existence of anti-automorphisms of the second kind on the ring of twisted Laurent series $K((t;\sigma))$ over a field $K$ and the ring of twisted Laurent series $D((t;\sigma))$ over a division algebra $D$ that is finite-dimensional over its center. Our constructions rely on the isomorphisms between an algebra and its opposite algebra. Along the way, we hence describe monomial isomorphisms between cyclic or generalized cyclic algebras, which ties in with studying the isomorphism problem for central simple algebras. Proper nonassociative cyclic and generalized cyclic algebras, which are canonical generalizations of associative cyclic and generalized cyclic central simple algebras, are included here.
Read the full abstract
Algebraic Geometry
Multiplicity of codimension 1 fibers in Lagrangian fibrations
Let $\pi : X \to B$ be a Lagrangian fibration of a compact hyper-Kähler manifold. We prove that every codimension $1$ fiber of $\pi$ has multiplicity $1$.
Optimization and Control · Cross-listed from cs.CE
Budgeted Robust Intervention Design for Financial Networks with Common Asset Exposures
In the context of containment of default contagion in financial networks, we here study a regulator that allocates pre-shock capital or liquidity buffers across banks connected by interbank liabilities and common external asset exposures. The regulator chooses a nonnegative buffer vector under a linear budget before asset-price shocks realize. Shocks are modeled as belonging to either an $\ell_{\infty}$ or an $\ell_{1}$ uncertainty set, and the design objective is either to enlarge the certified no-default/no-insolvency region or to minimize worst-case clearing losses at a prescribed stress radius. Four exact synthesis results are derived. The buffer that maximizes the default resilience margin is obtained from a linear program and admits a closed-form minimal-budget certificate for any target margin. The buffer that maximizes the insolvency resilience margin is computed by a single linear program. At a fixed radius, minimizing the worst-case systemic loss is again a linear program under $\ell_{\infty}$ uncertainty and a linear program with one scenario block per asset under $\ell_{1}$ uncertainty. Crucially, under $\ell_{1}$ uncertainty, exact robustness adds only one LP block per asset, ensuring that the computational complexity grows linearly with the number of assets. A corollary identifies the exact budget at which the optimized worst-case loss becomes zero. Numerical experiments on the 8-bank benchmark of \cite{Calafiore2025}, on a synthetic core-periphery network, and on a data-backed 107-bank calibration built from the 2025 EBA transparency exercise show large gains over uniform and exposure-proportional allocations. The empirical results also indicate that resilience-maximizing and loss-minimizing interventions nearly coincide under diffuse $\ell_\infty$ shocks, but diverge under concentrated $\ell_1$ shocks.
Read the full abstract
Information Theory
Algorithms of self-synchronizing single-deletion-correcting codes
This study explores the self-synchronization problem in DNA coding, specifically addressing single-deletion errors without using delimiters between codewords. We aim to identify the beginning of each codeword without using delimiters, enhancing the transmission efficiency. The motivation arises from the inefficiency of adding meaningless symbols as delimiters, decreasing the information rate. In addition, the historical context in biology, specifically Francis Crick's proposal of “codes without commas” for DNA sequences, inspires this investigation. We introduce a novel approach for correcting single-deletion errors in continuous transmissions without delimiters, distinguishing the beginning and end of each codeword. This approach is based on the properties of complementary information set codes, which is used to present an algorithm for single-deletion correcting codes with self-synchronizing capability. Accordingly, we present encoding and decoding algorithms for self-synchronizing single-deletion correcting DNA codes with concrete examples.
Read the full abstract
Number Theory
A note on the multiple zeta functions and their variants at identical arguments
In this article, we study the multiple zeta functions (MZF) and some of its variants at identical arguments. Using the harmonic product, these functions can be expressed as polynomials in the Riemann zeta function. Firstly, we note that an explicit description of the coefficients of these polynomials can be given in terms of the values of the complete Bell polynomials. This for instance, easily leads to the complete description of the singularities of these functions. But more importantly, this enables us to establish a functional relation between MZF, Multiple $t$-functions (M$t$F) and their star variants at identical arguments.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Robust Estimation in Step-Stress Experiments under Weibull Lifetime Distributions
Many modern products are highly reliable, often exhibiting long lifetimes. As a result, conducting experiments under normal operating conditions can be prohibitively time-consuming to collect sufficient failure data for robust statistical inference. Accelerated life tests (ALTs) offer a practical solution by inducing earlier failures, thereby reducing the required testing time. In step-stress experiments, a stress factor that accelerates product degradation is identified and systematically increased at predetermined time points, while remaining constant between intervals. Failure data collected under these elevated stress levels is analyzed, and the results are then extrapolated to normal operating conditions. Traditional estimation methods for such data, such as the maximum likelihood estimator (MLE), are highly efficient under ideal conditions but can be severely affected by outlying or contaminated observations. To address this, we propose the use of Minimum Density Power Divergence Estimators (MDPDEs) as a robust alternative, offering a balanced trade-off between efficiency and resistance to contamination. The MDPDE framework is extended to mixed distributions and its theoretical properties, including the asymptotic distribution of the model parameters, are derived assuming Weibull lifetimes. The effectiveness of the proposed approach is illustrated through extensive simulation studies, and its practical applicability is further demonstrated using real-world data.
Read the full abstract
Analysis of PDEs
Bayesian Formulation of Acousto-Electric Tomography and Quantified Uncertainty in Limited View
Acousto-electric tomography (AET) is a hybrid imaging modality that combines electrical impedance tomography with focused ultrasound perturbations to obtain interior power density measurements, which provide additional information that can enhance the stability of conductivity reconstruction. In this work, we study the AET inverse problem within a Bayesian framework and compare statistical reconstruction with analytical approaches. The unknown conductivity is modeled as a random field, and inference is based on the posterior distribution conditioned on the measurements. We consider likelihood constructions based on both L1- and L2-type data misfit norms and establish Bayesian well-posedness for both formulations within the framework of Stuart (2010). Numerical experiments investigate the performance of the Bayesian method from noisy power density measurements using the L1 and L2 likelihood functions and a smooth prior and a piecewise-constant prior for different limited view configurations, including severely limited boundary access. In particular, we demonstrate that small inclusions near the accessible boundary can be reconstructed from AET data corresponding to a single EIT measurement, and we quantify reconstruction uncertainty through posterior statistics.
Read the full abstract
Dynamical Systems
A short proof of Erdős's $B+C$ conjecture
We give a short proof of the fact that every set of natural numbers with positive upper Banach density contains the sum of two infinite sets. The approach simplifies earlier existing proofs.
Read the full abstract
Analysis of PDEs
Capillary John ellipsoid theorem with applications to capillary curvature problems
In this paper, we apply a capillary John ellipsoid theorem for capillary convex bodies in the Euclidean half-space $\overline{\mathbb{R}^{n+1}_{+}}$. This theorem yields a non-collapsing estimate for capillary hypersurfaces, which provides a new approach to obtaining $C^{0}$ estimates for solutions to some capillary curvature problems (including the capillary $L_{p}$ Christoffel-Minkowski problem and the capillary $L_{p}$ curvature problem), based on the corresponding gradient estimates. As an application, we study the capillary $L_{p}$ dual Minkowski problem. A gradient estimate, together with the non-collapsing estimate and a $C^2$ estimate, yields existence for every $1<p<q<\infty$ with positive smooth even data and an acute contact angle. The same estimates also yield the eigenvalue problem for $p=q>1$, with uniqueness up to dilation. We further obtain existence and uniqueness for $p>q$ without an upper restriction on $q$.
Read the full abstract
General Mathematics
Degree theory of the partition graph: exact maxima, profiles, and fibres
For the partition graph $G_n$, whose vertices are the partitions of $n$ and whose edges correspond to elementary unit transfers between parts, we develop a degree theory with three levels: exact value theory, exact profile theory, and fibre-level geometry. Writing $n=T_s+q$ with $T_s=s(s+1)/2$ and $0\le q\le s$, we prove that every degree-maximizing partition lies in the support-maximal stratum and obtain the exact formula \[ \Delta_n=s(s-1)+\lfloor\sqrt{4q+1}\rfloor-1 \] for the maximal degree in $G_n$. For a support-maximal partition $\lambda$, let $A(\lambda)$ and $B(\lambda)$ denote the numbers of active gap bonuses and multiplicity bonuses. We prove that the set of realized maximizing profiles is \[ \Pi_n=\{(a,b)\in\mathbb Z_{\ge0}^2:a+b=\rho(q),\ T_a+T_b\le q\}, \qquad \rho(q)=\lfloor\sqrt{4q+1}\rfloor-1. \] Thus the exact global theory stops at the profile level. For each realized profile we then study the corresponding fibre of maximizers: we prove nonemptiness, construct canonical representatives, obtain lower bounds for mixed fibres, and show that conjugation induces a bijection between the fibres for $(a,b)$ and $(b,a)$. We also classify exactly the first near-triangular fibre windows and formulate localization and stability questions for the remaining fixed-$q$ regime.
Read the full abstract
Combinatorics
PHOEG: an online tool for discovery and education in extremal graph theory
Extremal Graph Theory heavily relies on exploring bounds and inequalities between graph invariants, a task complicated by the rapid combinatorial explosion of graphs. Various tools have been developed to assist researchers in navigating this complexity, yet they typically rely on heuristic, probabilistic, or non-exhaustive methods, trading exactness for scalability. PHOEG takes a different stance: rather than approximating, it commits to an exact approach. PHOEG is an interactive online tool (https://phoeg.umons.ac.be) designed to assist researchers and educators in graph theory. Building upon the exact geometrical approach of its predecessor, GraPHedron, PHOEG embeds graphs into a two-dimensional invariant space and computes their convex hull, where facets represent inequalities and vertices correspond to extremal graphs. PHOEG modernizes and expands this approach by offering a comprehensive web interface and API, backed by an extensive database of pairwise non-isomorphic graphs including all graphs up to order 10. Users can intuitively define invariant spaces by selecting a pair of invariants, apply constraints and colorations, visualize resulting convex polytopes, and seamlessly inspect the corresponding drawn graphs. In this paper, we detail the software architecture and new web-based features of PHOEG. Furthermore, we demonstrate its practical value in two primary contexts: in research, by illustrating its ability to quickly identify conjectures or counterexamples to conjectures, and in education, by detailing its integration into university-level coursework to foster student discovery of classical graph theory principles. Finally, this paper serves as a brief survey of the extremal results and conjectures established over the past two decades using this geometric approach.
Read the full abstract
Analysis of PDEs
Hölder regularity for the parabolic perturbed fractional 1-Laplace equations
This paper studies the regularity of weak solutions to a class of parabolic perturbed fractional $1$-Laplace equations. Our analysis combines finite difference quotients, energy estimates, and iterative arguments, with a key step being the decomposition of the nonlocal integral into local and nonlocal components to handle their contributions separately. We aim to show the local Hölder continuity of weak solutions within the parabolic domain. More precisely, the solutions are spatially $\alpha$-Hölder continuous with $0<\alpha<\min\left\lbrace1, \frac{s_p p}{p-1} \right\rbrace$ and $\gamma$-Hölder continuous in time, where the value of $\gamma$ is determined by the fractional differentiability indexes $s_1$, $s_p$ and the exponent $p$. For both the super-quadratic case ($p\ge 2$) and the sub-quadratic case ($1<p<2$), we establish the Sobolev regularity of solutions, which underpins the derivation of Hölder continuity. All estimates are quantitative and depend only on the structural parameters of the equation. To the best of our knowledge, this is the first attempt to develop a regularity theory for such nonlocal parabolic equations.
Read the full abstract
Metric Geometry
Local minimality of the truncated octahedron for the isoperimetric problem on parallelohedra
We investigate the isoperimetric problem for the Voronoi cells of three-dimensional lattices. Using Selling parameters, we derive an explicit closed formula for the scale-invariant isoperimetric quotient $F$ in terms of six non-negative variables. We then analyse the local behaviour of $F$ at the most relevant lattice configurations: we prove that the body-centered cubic lattice (BCC) is a strict local minimiser of $F$ at fixed volume, whereas the face-centered cubic lattice (FCC) and the simple cubic lattice (SC) are not local minimisers. Then, we consider a family of lattices which interpolates between BCC and FCC, showing that BCC is the global minimiser of $F$ restricted to this family.
Read the full abstract
Complex Variables
Arithmetic Uniformization of Rigid Elliptic Structures: From Rigid to Standard Vekua without the Beltrami Equation
For the rigid subclass of variable elliptic structures – characterized equivalently by the inviscid Burgers law $\lambda_x+\lambda\lambda_y=0$ or the self-dilatation $\mu_{\bar z}=\mu\mu_z$ – we show that the auxiliary Beltrami equation in the classical Vekua pipeline is unnecessary. The canonical coordinate $\xi=y-\lambda x$, computed by arithmetic from the spectral parameter $\lambda$, reduces every rigid variable-algebra Vekua equation to a standard Vekua equation in $\xi$ on any open set where the characteristic Jacobian $\Phi=\bar\xi_x+\lambda\bar\xi_y$ does not vanish, with global reduction on domains where $\xi$ is injective. No PDE is solved at any stage.
Read the full abstract
Optimization and Control
Linear-quadratic mixed Stackelberg-zero-sum game for mean-field regime switching system
Motivated by a green finance problem, a linear-quadratic Stackelberg differential game for a regime switching system involving one leader and two followers is studied. The two followers engage in a zero-sum differential game, and both the state system and the cost functional incorporate a conditional mean-field term. Applying continuation method and induction method, we first establish the existence and uniqueness of the conditional mean-field forward-backward stochastic differential equations with Markovian switching. Based on it, we prove the unique solvability of Hamiltonian systems associated with the two followers and the leader. Moreover, utilizing stochastic maximum principle, decoupling approach and optimal filtering technique, we obtain the optimal feedback strategies for the two followers and the leader. Employing the theoretical results, we solve the green finance problem with some numerical simulations.
Read the full abstract
Logic
The Cardinalities of Intervals of Equational Theories and Logics
We study the cardinality of classes of equational theories (varieties) and logics by applying descriptive set theory. We affirmatively solve open problems raised by Jackson and Lee [Trans. Am. Math. Soc. 370 (2018), pp. 4785-4812] regarding the cardinalities of subvariety lattices, and by Bezhanishvili et al. [J. Math. Log. (2025), in press] regarding the degrees of the finite model property (fmp). By coding equations and formulas by natural numbers, and theories and logics by real numbers, we examine their position in the Borel hierarchy. We prove that every interval of equational theories in a countable language corresponds to a $\boldsymbol{\Pi}^0_1$ set, and every fmp span of a normal modal logic to a $\boldsymbol{\Pi}^0_2$ set. It follows that they have cardinality either $\leq \aleph_0$ or $2^{\aleph_0}$, provably in ZFC. In the same manner, we observe that the set of pretabular extensions of a tense logic is a $\boldsymbol{\Pi}^0_2$ set, so its cardinality is either $\leq \aleph_0$ or $2^{\aleph_0}$. We also point out a negative solution to another open problem raised by Jackson and Lee, op. cit., regarding the existence of independent systems, which relies on Ježek et al. [Bull. Aust. Math. Soc. 42 (1990), pp. 57-70].
Read the full abstract
Analysis of PDEs
Constructive existence proofs and stability of stationary solutions to parabolic PDEs using Gegenbauer polynomials
In this paper, we present a computer-assisted framework for constructive proofs of existence for stationary solutions to one-dimensional parabolic PDEs and the rigorous determination of their linear stability. By expanding solutions in Gegenbauer polynomials, we first develop a general approach for boundary value problems (BVPs), corresponding to the stationary part of the PDE. This yields a computationally efficient sparse structure for both differential and multiplication operators. By deriving sharp, explicit and quantitative estimates for the inverse of differential operators, we implement a Newton-Kantorovich approach. Specifically, given a numerical approximation $\bar{u}$, we prove the existence of a true stationary solution $\tilde{u}$ within a small, rigorously quantified neighborhood of $\bar{u}$. A key advantage of this approach is that the sharp control over the defect $\tilde{u}-\bar{u}$, integrated with the spectral properties of the Gegenbauer basis, enables an accurate enclosure of the linearization's spectrum around $\tilde{u}$. This allows for a definitive conclusion regarding the (in)stability of the verified solution, which is the main contribution of the paper. We demonstrate the efficacy of this method through several applications, capturing both stable and unstable equilibrium states.
Read the full abstract
Mathematical Physics
Semiclassical shape resonances for magnetic Stark Hamiltonians
We study shape resonances of two-dimensional magnetic Stark Hamiltonians in the semiclassical limit. The magnetic field is assumed to be constant and the scalar potential is a perturbation of a linear potential. Under the assumption that the scalar potential has potential wells, the existence of a one-to-one correspondence between shape resonances of the Hamiltonian and discrete eigenvalues of a certain reference operator is proved. This implies the Weyl law for the number of resonances and the asymptotic behavior of the real parts of resonances near the bottom of a potential well. Resonances are studied as complex eigenvalues of complex distorted Hamiltonians, which is defined by the complex translation outside a compact set.
Read the full abstract
Optimization and Control
On the Convergence Rate of the One-Hop Transfer Algorithm
The transfer algorithm~\cite{jiang} solves the on-chain one-hop swap routing problem. In \cite{jiang}, the convergence is proved but the convergence rate is left open. We prove that the algorithm terminates in at most $\mathcal{O}(N\kappa\log\frac{1}{\varepsilon})$ rounds, where $N$ is the number of AMMs, $\kappa$ a liquidity heterogeneity parameter and $\varepsilon$ a tolerance parameter.
Read the full abstract
Statistics Theory
Estimation of Riemannian Quantities from Noisy Data via Density Derivatives
We study the recovery of geometric structure from data generated by convolving the uniform measure on a smooth compact submanifold $M\subset\mathbb{R}^D$ with ambient Gaussian noise. Our main result is that several fundamental Riemannian quantities of $M$, including tangent spaces, the intrinsic dimension, and the second fundamental form, are identifiable from derivatives of the noisy density. We first derive uniform small-noise expansions of the data density and its derivatives in a tubular neighborhood of $M$. These expansions show that, at the population level, tangent spaces can be recovered from the density Hessian with $O(\sigma^2)$ error, while the intrinsic dimension can be estimated consistently. We further construct estimators for the second fundamental form from density derivatives, obtaining $O(d(y,M)+\sigma)$ and $O(d(y,M)+\sigma^2)$ errors for hypersurfaces and submanifolds with arbitrary codimension. At the sample level, we estimate the density and its derivatives by kernel methods in the ambient space and plug them into the population constructions, yielding uniform nonparametric rates in the ambient dimension. Finally, we show that these density-based constructions admit a geometric interpretation through density-induced ambient metrics, linking the geometry of $M$ to ambient geodesic structure.
Read the full abstract
Differential Geometry
Minimal Surfaces with Stratified Branching Sets
Inspired by the Taubes-Wu construction of $\mathcal{C}^{1,\alpha}$ two-valued harmonic functions by the use of symmetry, we construct minimal surfaces with stratified branching sets as graphs of $\mathcal{C}^{1,\alpha}$ two-valued functions. We give three constructions. The first is perturbative and produces branched minimal submanifolds in arbitrary codimension as two-valued graphs over the $n$-ball or, slightly more generally, over the product of $B^n$ with a torus $\mathbb T^N$, parametrized by boundary data which is required to be small in a suitable norm. The second uses barrier methods together with a reflection argument to produce branched stable minimal hypersurfaces, again as two-valued graphs over the unit $n$-ball or $B^n \times \mathbb T^N$, parametrized by boundary data which now can be large. Finally, using bifurcation theory, we produce compact minimal submanifolds with similarly stratified branching sets in an ambient space $S^n \times \mathbb R$ with a suitable (analytic) warped product metric. These examples give minimal submanifolds with novel frequency values and whose branching sets have non-trivial deeper strata. While the main constructions are fairly elementary, they rely on the use of precisely tailored (and somewhat non-standard) function spaces, combined with a regularity theory which provides full asymptotic expansions around the branching sets.
Read the full abstract
History and Overview of Mathematics
How Disciplinary Norms Influence Mathematicians' Views of Programming in Undergraduate Mathematics
Programming is deeply embedded in contemporary mathematical practice, yet its epistemic status in university mathematics teaching remains contested. Little is known about how mathematicians themselves understand the legitimacy of programming in their professional work, and how these views shape their teaching. We address this gap through semi-structured interviews with 15 mathematicians at a Northern European university with over two decades of systematic integration of programming across STEM subjects. Drawing on Cultural-Historical Activity Theory and Communities of Practice, we examine how mathematicians articulate the role of programming across research and teaching. We identify four epistemic archetypes - classical pure, classical applied, computational applied, and computational pure - each expressing coherent norms governing legitimate use of programming. Across archetypes, light-touch programming (e.g., numerical exploration) was widely used in research but largely invisible in teaching, where legitimacy was tied to more "substantive" integration. We argue that this gap reflects epistemic continuity across practices combined with teaching's focus on established analytic outcomes, which reduces the epistemic visibility of computational work. Given how mathematicians articulate legitimate uses of programming, our findings suggest that integration is most widely accepted when substantive programming is taught in dedicated courses, while light epistemic use - such as numerical exploration - is used to support learning in traditional theoretical courses. More extensive computational work is generally viewed as fitting naturally within specialised numerical or computational mathematics courses.
Read the full abstract
Commutative Algebra
Supports of intersections of thick subcategories and proxy smallness
Let R be a commutative noetherian ring. Let D^b(R) be the bounded derived category of finitely generated R-modules. Let X and Y be thick subcategories of D^b(R). In this paper, we consider the question asking when the equality Supp(X\cap Y)=Supp X\cap Supp Y holds, and give several answers. As applications, we obtain a characterization of the proxy small subcategories, and classifications of certain thick subcategories.
Read the full abstract
Logic
Hindman and Owings-like theorems without the Axiom of Choice
We investigate Hindman- and Owings-type Ramsey-theoretic statements in Zermelo-Fraenkel set theory without the Axiom of Choice, with some occasional extra assumptions (such as the Axiom of Dependent Choice and/or the Axiom of Determinacy). We study several variations of Hindman's theorem on $\mathbb Q$-vector spaces; notably, we show that the uncountable analog of Hindman's theorem fails for the additive group of $\mathbb R$ (under ZF), and for $\mathbb Q$-vector spaces of uncountable dimension (under DC if such dimension is not well-orderable), among other results. In contrast, for Owings-type configurations, we obtain several positive results, especially when assuming AD. These results highlight the interaction between determinacy, algebraic structure, and dimension in the study of infinite Ramsey theory without the Axiom of Choice.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Time Window-Based Netload Range Cost Curves for Coordinated Transmission and Distribution Planning Under Uncertainty
Mechanisms to coordinate transmission and distribution planning should be regulatory compliant and keep the spheres of DSO and TSO decisions separate, without requiring disclosure of proprietary data or unrealistic computationally expensive T&D co-simulations. The concept of Netload Range Cost Curves (NRCC) has been recently proposed as simple non-invasive form of coordinating T&D investments under distribution netload uncertainty. This paper extends the NRCC concept to accommodate the temporal dimension of the T&D planning process. We propose to compute a hierarchy of certified temporal interface products that represent the different levels of flexibility that distribution networks can provide transmission grids with at the planning stage. The first product (P1) maps distribution investment into scenario-robust, per-window service envelopes within which any TSO service call (to modify load within specified bounds) is guaranteed distribution-network-feasible. The second product (P2) adds lexicographic rebound minimization, preserving P1-optimal service capacity while certifying post-service recovery under three governance variants with qualitatively distinct rebound-budget responses. In our numerical results, based on a real distribution feeder, we compare the performance of our proposed time-window-based flexibility products to an atemporal product (P0) that offers a static bound on the aggregate distribution grid netload across all time periods. Our results demonstrate the superiority of our proposed products in properly valuing the benefits of incremental investments in storage to allow for temporal flexibility.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Online Learning of Kalman Filtering: From Output to State Estimation
In this paper, we study the problem of learning Kalman filtering with unknown system model in partially observed linear dynamical systems. We propose a unified algorithmic framework based on online optimization that can be used to solve both the output estimation and state estimation scenarios. By exploring the properties of the estimation error cost functions, such as conditionally strong convexity, we show that our algorithm achieves a $\log T$-regret in the horizon length $T$ for the output estimation scenario. More importantly, we tackle the more challenging scenario of learning Kalman filtering for state estimation, which is an open problem in the literature. We first characterize a fundamental limitation of the problem, demonstrating the impossibility of any algorithm to achieve sublinear regret in $T$. By further introducing a random query scheme into our algorithm, we show that a $\sqrt{T}$-regret is achievable when rendering the algorithm limited query access to more informative measurements of the system state in practice. Our algorithm and regret readily capture the trade-off between the number of queries and the achieved regret, and shed light on online learning problems with limited observations. We validate the performance of our algorithms using numerical examples.
Read the full abstract
Commutative Algebra
Relative Gröbner bases of modules and applications in persistence theory
Finitely generated modules over the polynomial ring in $n$ indeterminates are isomorphic to quotients of finite rank free modules. We introduce a theory of relative Gröbner bases for those quotients of free modules and, equivalently, for pairs of submodules; we prove corresponding Buchberger- and Schreyer-type theorems. As applications of this theory, we consider three problems in persistence theory, which can be solved by relative Gröbner bases. First, we show that the relative Schreyer's theorem can be used to compute free presentations of complexes of finitely generated torsion-free modules. In contrast to previous approaches, this allows computation of free presentations for multicritical persistent homology directly at the chain module level without additional topological constructions. Second, any finitely generated Artinian module embeds in an Artinian injective hull, giving rise to a flat-injective presentation. We represent the embedding of the module in this injective hull by a quotient of a free module and apply the relative Schreyer's theorem to construct an algorithm for the computation of a free presentation from a flat-injective presentation. Third, we investigate how free presentations, and more generally free resolutions, obtained by the two preceding applications can be minimized by standard reduction techniques.
Read the full abstract
Probability
On the critical fugacity of the hard-core model on regular bipartite graphs
We establish long-range order for the hard-core model on a finite, regular bipartite graph above a threshold fugacity given in terms of expansion parameters of the graph. The result applies to the $d$-dimensional hypercube graph and, more generally, to $d$-dimensional discrete tori of fixed side length, proving long-range order at fugacities $\lambda\ge\Omega(\frac{\log d}{d})$. Furthermore, we use reflection positivity to transfer the result to the lattice $\mathbb{Z}^{d}$, verifying the long-standing belief that its critical fugacity is of the form $d^{-1+o(1)}$ as $d\to\infty$.