Statistics Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 6 April
We study bootstrap inference for the $k$th largest coordinate of a normalized sum of independent high-dimensional random vectors. Existing second-order theory for maxima does not directly extend to order statistics, because the event $\{T_{n,[k]}\le t\}$ is not a rectangle and its local structure is governed by exceedance counts rather than by a single boundary. We develop an approach based on factorial moments and weighted inclusion–exclusion that reduces the problem to a collection of rare-orthant probabilities and allows high-dimensional Edgeworth and Cornish–Fisher expansions to be transferred to the order-statistic setting. Under moment, variance, and weak-dependence conditions, we derive a second-order coverage expansion for wild-bootstrap critical values of the $k$th order statistic. In particular, a third-moment matching wild bootstrap achieves coverage error of order $n^{-1}$ up to logarithmic factors, and the same second-order accuracy is obtained for a prepivoted double wild bootstrap. We also show that the maximal-correlation condition can be replaced by a stationary Gaussian exponential-mixing assumption at the price of an explicit dependence remainder $r_d$, and this remainder can itself be of order $n^{-1}$ when the dimension is sufficiently large relative to the sample size. These results extend recent second-order Gaussian and bootstrap approximation theory from maxima to the $k$th order statistic in high dimension.
Mathematical Physics · Cross-listed from gr-qc
Canonical Uncertainty Relations for Madelung Variables in Curved Spacetime: Relating Dark Matter Cores and Unruh Radiation
We establish fundamental uncertainty relations for the hydrodynamic variables arising from the Madelung representation of quantum fields in curved spacetime. Through canonical quantization of the density \(n\) and phase \(\theta\) variables and their conjugate momenta, we derive exact uncertainty principles that depend on spacetime geometry through the lapse function \(N\) and spatial metric \(\gamma_{ij}\). These relations reveal how gravitational fields modulate quantum fluctuations and provide first-principles constraints for Scalar Field Dark Matter (SFDM) models and stochastic quantum gravity. We present two groundbreaking applications. First, By coupling the density-velocity uncertainty to the Newtonian condition of hydrostatic equilibrium, we derive the exact scaling law for the minimum core radius of a self-gravitating scalar field halo. We naturally find the scale \(r_c \propto m^{-1/2}\) which is a testable prediction. Second, by evaluating the phase–momentum commutator in Rindler coordinates and relating the canonical momentum \(\Pi_\theta\) to the energy density via the Hamiltonian, we obtain the acceleration scale \(k_B T = C\hbar a/c\). The proportionality constant \(C=1/(2\pi)\) is fixed by the topological quantization of the Madelung phase circulation around the Euclidean horizon. This dual achievement demonstrates that quantum uncertainty on curved backgrounds is the unifying principle behind both galactic structure and black hole thermodynamics.
Read the full abstract
Combinatorics
Problems and results on intersections of product sets and sumsets in semigroups
For every subset $A$ of a semigroup $S$, let $A^h$ be the set of all products of $h$ elements of $S$. If $(A)_{q\in Q}$ is a family of subsets of $S$, then $A = \bigcap_{q \in Q} A_q$ satisfies $A^h \subseteq \bigcap_{q \in Q} A_q^h$. The product intersection set $H(A_q) = \left\{h \in \mathbf{N}: A^h = \bigcap_{q \in Q} A_q^h \right\}$ is investigated.
Read the full abstract
Analysis of PDEs
Optimal $C^{1,\alpha}$ regularity up to the boundary for fully nonlinear elliptic equations with double phase degeneracy
In this paper we establish optimal $C^{1,\alpha}$ regularity up to the boundary for viscosity solutions of fully nonlinear elliptic equations with double phase degeneracy law and oblique boundary conditions. The approach developed here relies on first deriving uniform boundary Hölder estimates for perturbed models with oblique boundary data in “almost $C^{1}$-flat” domains. Building upon these estimates, the desired regularity is obtained through a compactness and stability framework for viscosity solutions. As a byproduct of our analysis, we determine the optimal Hölder exponent for solutions when the governing operator is quasiconvex or quasiconcave. In addition, we establish an improved regularity result along vanishing points of the source term.
Read the full abstract
Optimization and Control
Collaborative Altruistic Safety in Coupled Multi-Agent Systems
This paper presents a novel framework for ensuring safety in dynamically coupled multi-agent systems through collaborative control. Drawing inspiration from ecological models of altruism, we develop collaborative control barrier functions that allow agents to cooperatively enforce individual safety constraints under coupling dynamics. We introduce an altruistic safety condition based on the so-called Hamilton's rule, enabling agents to trade off their own safety to support higher-priority neighbors. By incorporating these conditions into a distributed optimization framework, we demonstrate increased feasibility and robustness in maintaining system-wide safety. The effectiveness of the proposed approach is illustrated through simulation in a simplified formation control scenario.
Read the full abstract
Group Theory
The Lyapin's notebook: a collection of unsolved problems in Semigroup Theory
This collection presents a selected set of unsolved problems in semigroup theory, a fundamental branch of modern algebra. The publication is dedicated to the 110th anniversary of the birth of E. S. Lyapin, one of the founders of the field and the author of the world's first monograph on semigroups. The collection covers several major directions of contemporary research: potential properties and embeddability of semigroups; structural problems and finiteness conditions in varieties; endomorphisms; solvable and unsolvable classes of finite semigroups and groups; power semigroups; inclusive varieties; and the theory of partial groupoids. It serves both as a tribute to Lyapin's memory and as a roadmap for current and future research in algebraic systems.
Read the full abstract
Algebraic Geometry
Isotropy subgroups of homogeneous locally nilpotent derivations
We say that a locally nilpotent derivations $\delta$ is maximal if there are no inequivalent locally nilpotent derivations that commute with $\delta$. The paper gives a description of isotropy groups of maximal homogeneous locally nilpotent derivations on affine toric varieties and on certain trinomial hypersurfaces. Moreover, the criteria for homogeneous locally nilpotent derivations to be maximal were obtained for these classes of varieties.
Read the full abstract
Optimization and Control
Extremum Seeking of Static Maps in the Presence of Unknown Large Time-Varying Delays
In this paper, we present the discrete-time unbiased extremum seeking (ES) algorithm for n-dimensional (nD) static quadratic maps in the presence of unknown time-varying measurement delays bounded by known constants which can be large. The existing ES results in the presence of large delays are usually confined to known constant or slowly-varying delays, which is restrictive. We provide the first ES algorithm, which is robust with respect to unknown large time-varying delays. Moreover, we achieve the unbiased exponential convergence. We manage with such delays by choosing dithers with frequencies of the order of \sqrt{\epsilon}, where the small parameter {\epsilon} > 0 appears in the dynamics of the real-time estimator. As expected, larger delays lead to a slower convergence. We provide qualitative and quantitative results based on the averaging analysis via delay-free transformation. For the quantitative bounds on the controller parameters that ensure the exponential unbiased convergence of the ES system, we assume that the Hessian of the map is uncertain and lies within a known range. Differently from its continuous-time counterpart, the small parameter in the discrete-time case defines the decay rate of the estimation error system, making a quantitative bound on this parameter particularly important. We present also constructive conditions for the practical stability of the classical ES system. Our results are semi-global for globally quadratic maps, while for locally quadratic static maps, we provide a bound on the region of convergence. Our analysis shows that appropriate ES parameters can be found for any large unknown time-varying bounded delay. A numerical example highlights the efficiency of the method.
Read the full abstract
Probability
Scaling limit and density conjecture for activated random walk on the complete graph
We study driven-dissipative activated random walk with sleep probability $p$ on an $n$-vertex complete graph with a sink that traps jumping particles with probability $q_n$. We show that the number of sleeping particles $S_n$ left by the stationary distribution has a Gumbel scaling limit for $\exp(-n^{1/3}) \ll q_n \ll n^{-1/2}$. The particular scaling implies that $S_n$ is hyperuniform and thus the stationary configuration law has negative correlations and is not a product measure. We also prove that $S_n/n$ converges to $p$ if and only if $q_n = e^{-o(n)}$, and that, when $q_n=0$, the number of jumps to stabilization undergoes a phase transition at density $p$.
Read the full abstract
Optimization and Control
Exact and Matheuristic Methods for the Generalized Multiple Strip Packing Problem
We study the Generalized Multiple Strip Packing Problem (GMSPP), in which rectangular items are packed without overlap into open-ended strips of different widths and an item's dimensions may depend on the strip it is assigned to—a recently introduced model bridging cutting and packing and scheduling on heterogeneous platforms. While the single-strip problem possesses a mature exact toolbox, the GMSPP has so far been approached only heuristically. We close this gap with the first exact framework for the problem, covering the total-area and makespan objectives at once, and an extensive comparative study of exact and matheuristic methods. The framework comprises a combinatorial Benders decomposition whose variable-height master requires new $H_i$-aware conditional cuts, which we prove valid; a packing-aware LP dual bound proven to dominate the two previously available LP relaxations, and empirically stronger than the scheduling relaxation of Vasilyev et al. by up to $58\%$ on tall-item families; and a certified matheuristic coupling adaptive large neighborhood search with exact components, so that every run returns a machine-independent optimality certificate. The Benders decomposition proves the first optima reported for the GMSPP and remains the strongest method up to $n=800$; beyond that frontier the matheuristic delivers proven optima at $n=2532$ and $m=8$. All instances and code are released.
Read the full abstract
Dynamical Systems
Global Linearization of Parameterized Nonlinear Systems with Stable Equilibrium Point Using the Koopman Operator
The Koopman operator framework enables global analysis of nonlinear systems through its inherent linearity. This study aims to clarify spectral properties of the Koopman operators for nonlinear systems with control inputs. To this end, we treat the inputs as parameters throughout this paper. We then introduce the Koopman operator for a parameterized dynamical system with a globally exponentially stable equilibrium point and analyze how eigenfunctions of the operator depend on the parameter. As a main result, we obtain a global linearization, which enables one to transform the nonlinear system into a finite-dimensional linear system, and we show that it depends continuously on the parameter. Subsequently, for a control-affine system, we investigate a condition under which the transformation providing a global bilinearization does not depend on the parameter. This provides the condition under which the global bilinearization for the control-affine system is independent of the parameter.
Read the full abstract
Differential Geometry
Gromov-Hausdorff limits of the Chern-Ricci flow on smooth Hermitian minimal models of general type
We establish uniform diameter estimates and volume non-collapsing estimates for the Chern-Ricci flow on smooth Hermitian minimal models of general type, assuming the initial metric is Kähler in a neighborhood of the null locus of the canonical bundle. This yields subsequential Gromov-Hausdorff convergence, partially resolving a conjecture of Tosatti and Weinkove. When the underlying manifold is Kähler, we further prove the uniqueness of the limit space. Analytically, we overcome the difficulties posed by non-Kähler torsion in the Green's formula by exploiting our local Kähler assumption, successfully adapting recent estimates of Kähler Green's function to the Hermitian setting. To prove the uniqueness of the limit, we introduce Perelman's reduced length to the Chern-Ricci flow. By establishing a uniform Chern scalar curvature bound and an almost monotonicity formula for the reduced volume, we deduce an almost-avoidance principle for the singular set, allowing us to effectively compare the flow distance with the canonical limit distance.
Read the full abstract
Algebraic Geometry
Tschirnhausen bundles of sextic covers of $\mathbb{P}^1$
A degree $d$ genus $g$ cover of the complex projective line by a smooth irreducible curve $C$ yields a vector bundle on the projective line by pushforward of the structure sheaf. We classify the bundles that arise this way when $d = 6$. Interestingly, our methods show that all constraints on the pushforward are “explained” by multiplication in an algebra. Finally, we show that all possible pushforwards are realized by covers with a nontrivial proper subcover.
Read the full abstract
Operator Algebras
Gauge-invariant ideal structure of C*-algebras associated with proper product systems over $\mathbb{Z}_+^d$
We show that the gauge-invariant ideal parametrisation results of the author and Kakariadis are in agreement with those of Bilich in the case of a proper product system over $\mathbb{Z}_+^d$. This is accomplished in two ways: first via the use of Nica-covariant representations and Gauge-Invariant Uniqueness Theorems (the indirect route), and second via the definitions of the parametrising objects alone (the direct route). We then apply our findings to simplify the main parametrisation result of the author and Kakariadis in the proper case, thereby fully describing the gauge-invariant ideal structure of each equivariant quotient of the Toeplitz-Nica-Pimsner algebra. We close by providing applications in the contexts of C*-dynamical systems and row-finite higher-rank graphs.
Read the full abstract
Algebraic Topology
Cyclic Symmetries of Chord Diagrams
We give a direct proof that the proalgebraic graded Grothendieck-Teichmüller group $\mathsf{GRT}_{\mathbb{K}}$ is isomorphic to the group of automorphisms of the prounipotent cyclic operad of parenthesized ribbon chord diagrams based on Furusho's $5$-cycle reformulation of the pentagon equation. As an application, we describe a $\mathsf{GRT}_{\mathbb{K}}$-action on the category of framed chord diagrams with self-dual objects, which is closely related to the target category of the Kontsevich integral for framed tangles.
Read the full abstract
Algebraic Geometry
Gap theorems and achirality for automorphisms of K3 surfaces and Enriques surfaces
We prove gap theorems for entropy norms on automorphism groups of K3 surfaces, Enriques surfaces, and irreducible holomorphic symplectic manifolds. We also study the achirality of automorphisms of K3 surfaces and Enriques surfaces in terms of genus-one fibrations.
Information Theory
LRC codes over characteristic $2$
In this work the construction of LRC codes given in [6] is completed, in the case of even characteristic. A general construction is presented, that enables us to obtain linear LRC codes of large length $n \approx q^4$, dimension and distance of order $q^4$, and locality $r =q-1$. In addition, the cases $q = 4$ and $q=8$ are studied.
Read the full abstract
Analysis of PDEs
A Trudinger-Moser inequality under a refined constraint in fractional dimensions and extremal functions
We establish a Trudinger-Moser type inequality with a Tintarev-type constraint in fractional-dimensional spaces and prove the existence of maximizers in the critical regime. Our results provide a refinement of those in (Calc. Var. 52 (2015), 125-163) in the setting of fractional-dimensional spaces, as well as of those in (Ann. Global Anal. Geom. 54 (2018), 237-256) for classical Sobolev spaces.
Read the full abstract
Number Theory
On special values of Koshliakov zeta functions
In this paper, we study the Koshliakov zeta function $\eta_p(s)$, whose theory appears to be more involved than that of its counterpart $\zeta_p(s)$, owing to the fact that its defining series is not of Dirichlet type. We derive formulas for $\eta_p(s)$ at both even and odd values of $s$. In the limiting case $p\to\infty$, our results yield the celebrated formulas of Euler and Ramanujan for the Riemann zeta function. Moreover, our results lead to several consequences concerning closed-form expressions for Lambert series and their arithmetic properties, recovering results due to Berndt, Cauchy, Ramanujan, and others. We also propose $p$-analogues of the transformation formula for the classical Eisenstein series. Moreover, we introduce two families of $p$-analogues of Ramanujan polynomials and establish functional equations satisfied by them.
Read the full abstract
Information Theory
Identification for Colored Gaussian Channels
We study the identification capacity of discrete-time Gaussian channels impaired by correlated noise and inter-symbol interference (ISI). Our analysis is formulated for deterministic encoding functions subject to a peak power constraint and colored noise whose covariance matrix features a polynomially bounded singular value spectrum, i.e., $\sim [n^{-\mu} , n^{\mu/2}]$ where $n$ is the codeword length and $\mu \in [0,1/2)$ is the spectrum rate. A central result establishes that, even when the ISI memory length grows sub-linearly with $n,$ i.e., $\sim n^{\kappa}$ where $\kappa \in [0,1/2)$ and $\kappa + \mu \in [0,1/2),$ the codebook size continues to exhibit super-exponential growth in $n$, i.e., $\sim 2^{(n \log n)R},$ with $R$ representing the associated coding rate. Moreover, by employing the well-known Mahalanobis-distance decoder induced by colored Gaussian noise statistics, we characterize bounds on the identification capacity, with the resulting bounds parameterized by $\kappa$ and $\mu.$
Read the full abstract
Statistics Theory
Minimaxity and Admissibility of Bayesian Neural Networks
Bayesian neural networks (BNNs) offer a natural probabilistic formulation for inference in deep learning models. Despite their popularity, their optimality has received limited attention through the lens of statistical decision theory. In this paper, we study decision rules induced by deep, fully connected feedforward ReLU BNNs in the normal location model under quadratic loss. We show that, for fixed prior scales, the induced Bayes decision rule is not minimax. We then propose a hyperprior on the effective output variance of the BNN prior that yields a superharmonic square-root marginal density, establishing that the resulting decision rule is simultaneously admissible and minimax. We further extend these results from the quadratic loss setting to the predictive density estimation problem with Kullback–Leibler loss. Finally, we validate our theoretical findings numerically through simulation.
Read the full abstract
Probability
Connected components and topological ends of stationary planar forests
We study the topological structure of random geometric forests $G$ in the Euclidean plane under mild assumptions: non-crossing edges, stationarity, and finite edge intensity. The framework covers a broad range of constructions, including models based on stationary point processes as well as lattices, and encompasses many already well-studied examples among drainage networks, geodesic forests arising from first- and last-passage percolation, and minimal or uniform spanning trees. First, denoting by $N_k$ the number of $k$-ended connected components in $G$ for each $k\geq0$, we show that almost surely, all trees of $G$ have at most two topological ends, $N_0\in\{0,\infty\}$, $N_1\leq2$, and $N_1=2\implies N_2<\infty$. We then construct explicit examples realizing all possibilities compatible with these constraints, yielding a complete classification of the admissible topological structures for $G$. As a second result, we prove that under the additional assumptions that $G$ is non-empty, oriented, out-degree one, with all its directed paths going to infinity along a fixed deterministic direction, the situation reduces to a dichotomy: $G$ consists almost surely of either a unique one-ended tree, or infinitely many two-ended trees. The latter extends a theorem of Chaika and Krishnan (2019), who considered a lattice setting. Our proofs combine classical Burton-Keane type arguments with substantial new conceptual ideas using planar topology, resulting in a robust, unified approach.
Read the full abstract
Metric Geometry
Exact colinearity of centroids of iterated midpoint hexagons
We study the iteration that replaces a planar hexagon by the hexagon formed by joining the midpoints of consecutive edges. While this iteration quickly drives any polygon toward a point and their shapes asymptotically regularize, we show a stronger and unexpected rigidity holds for hexagons: from the second iterate onward, the centroids of the filled hexagons all lie exactly on a fixed line. This exact colinearity reflects a special algebraic feature of the hexagonal case and does not hold generally for any other polygons.
Read the full abstract
Quantum Algebra
Quantum affine vertex algebra at root of unity
Let $\mathfrak g$ be a finite simple Lie algebra, and let $r$ denote the ratio of the square length of long roots to that of short roots. Let $\wp>2r$ be an integer and $\zeta$ a primitive $\wp$-th root of unity. Denote by $\mathcal U_\zeta(\widehat{\mathfrak g})$ the Lusztig big quantum affine algebra at root of unity defined by divided powers. In this paper, we establish a current algebra presentation of $\mathcal U_\zeta(\widehat{\mathfrak g})$. Based on this presentation, we construct a $\mathbb Z_\wp$-module quantum vertex algebras $V_{\wp,\tau}^\ell(\mathfrak g)$ for each integer $\ell$. Moreover, we establish a fully faithful functor from the category of smooth weighted $\mathcal U_\zeta(\widehat{\mathfrak g})$-modules of level $\ell$ to the category of $(\mathbb Z_\wp,\chi_\phi)$-equivariant $\phi$-coordinated quasi-modules of $V_{\wp,\tau}^\ell(\mathfrak g)$, where $\chi_\phi:\mathbb Z_\wp\to\mathbb C^\times$ is the group homomorphism defined by $s\mapsto \zeta^s$. We also determine the image of this functor. The structure $V_{\wp,\tau}^\ell(\mathfrak g)$ is substantially different from that of affine vertex algebras. We realize $V_{\wp,\tau}^\ell(\mathfrak g)$ as a deformation of a simpler quantum vertex algebra $V_{\wp,\varepsilon}^\ell(\mathfrak g)$ by using vertex bialgebras, and decompose $V_{\wp,\varepsilon}^\ell(\mathfrak g)$ into a Heisenberg vertex algebra and a more interesting quantum vertex algebra determined by a quiver.
Read the full abstract
Dynamical Systems
Sharp regularity of a weighted Sobolev space over $ \mathbb{T}^n $ and its relation to finitely differentiable KAM theory
In this paper, we investigate the sharp regularity properties of a special weighted Sobolev space defined on the $ n $-dimensional torus, which is of independent interest. As a key application, we show that for almost all $ n $-dimensional vector fields, the Kolmogorov-Arnold-Moser (KAM) theory holds via this regularity, and in this case, the perturbation must have classical derivatives up to order $ \left[ {n/2} \right] $, yet it can admit unbounded weak derivatives from order $ \left[ {n/2} \right]+1 $ to $ n$. This result may appear surprising within the classical framework of KAM theory. We also provide further discussion of historical KAM theorems and relevant counterexamples. These findings constitute a new step in the long-standing KAM regularity conjecture.
Read the full abstract
Operator Algebras
On the Haagerup property for partial crossed products
Let $(A,G,\alpha)$ be a partial dynamical system and let $A\rtimes_{\alpha,r} G$ denote the associated reduced partial crossed product. In this article, we introduce the Haagerup property for partial actions of discrete groups on $C^*$-algebras. We prove that the partial crossed product $A\rtimes_{\alpha,r} G$ has the Haagerup property if and only if both $A$ and the partial action $\alpha$ have the Haagerup property. As a consequence, we obtain an equivalence between the Haagerup property of the partial crossed product and that of the underlying $C^*$-algebra and the acting group. We also show that the Haagerup property is preserved under inductive limits and apply this result to study the Haagerup property of inductive limits of partial crossed products.
Read the full abstract
Probability
A pluricomplex error-function kernel at the edge of polynomial Bergman kernels
We consider polynomial Bergman kernels with respect to exponentially varying weights $e^{-n \mathscr Q(z)}$ depending on a potential $\mathscr Q:\mathbb C^d\to\mathbb R$. We use these kernels to construct determinantal point processes on $\mathbb C^d$. Under mild conditions on the potential, the points are known to accumulate on a compact set $S_{\mathscr Q}$ called the droplet. We show that the local behavior of the kernel in the vicinity of the edge $\partial S_{\mathscr Q}$ is described in two different ways by universal limiting kernels. One of these limiting kernels is the error-function kernel, which is ubiquitous in random matrix theory, while the other limiting kernel is a new universal object: a multivariate version of the error-function kernel. We prove the universality in two qualitatively different settings: (i) the tensorized case where $\mathscr Q$ decomposes as a sum of planar potentials, and (ii) the case where $\mathscr Q$ is rotational symmetric. We also explicitly identify the subspace of the Bargmann-Fock space where the multivariate error-function kernel is reproducing. To treat regular edge points that exhibit a certain type of bulk degeneracy, we also find the behavior of the planar kernel with number of terms of order $o(n)$ instead of $n$. Lastly, we prove an edge scaling limit for counting statistics.
Read the full abstract
Geometric Topology
Amicable Knots on Minimal Genus Seifert Surfaces
For a knot $K\subset S^3$, let $S(K)$ denote the set of non-trivial knot types represented by simple closed curves on a minimal genus Seifert surface of $K$. We study the relation $J\in S(K)$ and its symmetric part, which leads to the notion of amicable knots: knots $K$ and $J$ are called amicable if each is represented by a simple closed curve on a minimal genus Seifert surface of the other. A classical result of Lyon implies that the family of torus knots is universal for this realization problem: for every non-trivial knot type $J$, there exists a torus knot $T$ such that $J\in S(T)$. In contrast, one of the main results of this paper is that no single knot is universal: for every knot $K$, there exists a knot $J$ such that $J\notin S(K)$. We also study explicit examples, keeping track of chirality throughout. Writing $3_1^+=T(2,3)$ and $8_{19}^+=T(3,4)$ for the right-handed positive torus knots, we show that $3_1^+$ and $8_{19}^+$ are amicable, whereas $3_1^+$ and the figure-eight knot $4_1$ are not. We also describe the hosting sets of both chiralities of the trefoil in terms of primitive slope classes on their once-punctured torus fibers.
Read the full abstract
Combinatorics
Non-existence probabilities and lower tails in the critical regime via Belief Propagation
We compute the logarithmic asymptotics of the non-existence probability (and more generally the lower-tail probability) for a wide variety of combinatorial problems for a range of parameters in the `critical regime' between the regime amenable to hypergraph container methods and that amenable to Janson's inequality. Examples include lower tails and non-existence probabilities for subgraphs of random graphs and for $k$-term arithmetic progressions in random sets of integers. Our methods apply in the general framework of estimating the probability that a $p$-random subset of vertices in a $k$-uniform hypergraph induces significantly fewer hyperedges than expected. We show that under some simple structural conditions on the hypergraph and an upper bound on $p$ determined by a phase transition in the hard-core model on the infinite $k$-uniform, $\Delta$-regular, linear hypertree, this probability can be accurately approximated by the Bethe free energy evaluated at the unique fixed point of a Belief Propagation operator on the hypergraph.
Read the full abstract
Optimization and Control
Determinant Dynamics under Low-Rank Perturbations: A Unified Framework for Singular Systems
This paper develops a unified analytical framework for determinant identities under finite-rank perturbations of square matrices that remains valid without invertibility assumptions. In contrast to classical inverse-based formulations, the approach is based on an adjugate-driven additive representation, which extends naturally to singular matrices and yields explicit, non-asymptotic formulas. Building on this representation, we derive recursive and multiplicative expressions describing the evolution of determinant and log-determinant quantities under successive rank-one updates. These results reveal a structural interpretation in which determinant-based quantities evolve as cumulative measures of independent directions, providing a precise decomposition of incremental contributions. To address the singular case, we develop a systematic extension based on the Drazin inverse and the pseudodeterminant, leading to closed-form identities that isolate the contribution of the nonzero spectrum. In particular, we obtain a generalized determinant formula that can be viewed as a singular counterpart of the matrix determinant lemma. The spectral impact of low-rank perturbations is analyzed, yielding explicit conditions governing eigenvalue shifts and stability preservation. The proposed framework establishes a direct analytical link between matrix perturbation theory and system-theoretic concepts. In particular, we show that the pseudodeterminant of controllability Gramians admits a multiplicative decomposition that explicitly quantifies the incremental expansion of the reachable subspace under successive inputs. This leads to a unified interpretation of information accumulation, uncertainty reduction, and reachability in both full-rank and rank-deficient linear systems.