Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 15 May
We establish the joint $*$-convergence of a random circulant matrix and a specific deterministic diagonal matrix. We also show that the empirical spectral distributions of skew-circulant and left skew-circulant random matrices converge weakly a.s.~to complex Gaussian and symmetrized Rayleigh distributions, respectively. The $*$-convergence of symmetric Toeplitz and Hankel random matrices is well known. So is the weak convergence of their random spectrum. However, not much is known about the limits. We exploit the connections of circulant, reverse circulant, and left skew-circulants with the Hankel and Toeplitz matrices, to show the $*$-convergence of the random symmetric Toeplitz matrix to the sum of two non-commutative self-adjoint variables, each having a real Gaussian distribution. A similar result holds for the non-symmetric Toeplitz matrix, but the variables are not self-adjoint and have a complex Gaussian distribution. The random Hankel matrix is shown to converge in $*$-distribution to a sum of two self-adjoint variables, each of which has a symmetrized Rayleigh distribution. As a consequence of these results, we also obtain a different proof of the convergence of the empirical spectral distribution of symmetric Toeplitz and Hankel matrices, and a slightly different way of expressing the moments of the limit spectral distribution.
Dynamical Systems
A nonlinear version of the $\alpha$-Kakutani equidistribution problem
In this work, we extend results of Kakutani; Adler and Flatto; Smilansky; Pollicott and Sewell on the equidistribution of endpoints generated by interval-splitting procedures. We study a nonlinear version of the problem generated by a finite or countable family of $\mathcal{C}^{1+ \varepsilon}$ contractions and prove Lebesgue equidistribution under suitable nonlattice and thermodynamic regularity assumptions.
Read the full abstract
Combinatorics
Whitney's 2-isomorphism theorem for graphings
We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. For locally finite graphings, we define a weak isomorphism to be an edge-measure-preserving Borel bijection that preserves cycles and hyperfinite subgraphs, modulo null sets. Our rigidity theorem shows that every weak isomorphism of a weakly $3$-connected, infinitely-ended graphing is induced by an isomorphism of graphings. To our knowledge, this is the first general sufficient condition in measurable combinatorics for two given graphings to be isomorphic. We then prove a full measurable Whitney theorem, namely that every weak isomorphism between graphings is implemented by a finite composition of locally finite sequences of six measurable Whitney operations. The proofs combine measurable-combinatorial techniques, applications of spanning forests from percolation theory, and graph decomposition arguments. A central ingredient is the construction and analysis of infinitely-ended leafless subforests. With these tools we also show that, between weakly $2$-connected, infinitely-ended graphings, preservation of hyperfiniteness alone forces preservation of cycles, which is of independent interest. This work further develops the limit theory of matroids recently initiated by Lovász and provides its first application in finite graph theory. We show that Whitney's rigidity theorem is robust under sublinear errors for sequences of finite graphs with uniformly bounded degrees and suitable connectivity.
Read the full abstract
Information Theory
Covert Bayesian Quickest Change Detection
We investigate the problem of covert quickest change detection in a Bayesian and infinite-horizon setting. A legitimate entity seeks to detect a change in the state of a discrete memoryless channel as quickly as possible by actively probing it. Simultaneously, the entity must ensure its probing remains covert from an adversary monitoring the channel for active sensing. We introduce the expected covertness budget (ECB) as an analytically tractable covertness metric that bounds from above the relative entropy between the observation sequences induced by active and passive sensing. Under constraints on both the probability of false alarm (PFA) and the ECB, we establish a second-order asymptotic converse bound on the average detection delay as the PFA constraint approaches zero, for any positive ECB constraint, explicitly quantifying the maximum square-root-order covert sensing gain possible. Furthermore, we propose an achievability scheme utilizing a constant-sensing-probability Shiryaev-type policy and show that it matches the second-order asymptotic converse. We illustrate our result with a numerical example.
Read the full abstract
Functional Analysis
Block-equivalent finite Gabor frames
We study finite systems of vectors whose frame operator matrices are unitarily equivalent, via explicit and computationally efficient unitary transformations, to block-diagonal matrices. We call such systems block-equivalent. We show that a Gabor system $\mathcal{G}=\mathcal{G}(g,L\times K)\subset \mathbb C^N$ is block-equivalent when either the modulation set $L$ or the translation set $K$ is a subgroup of $\mathbb Z_N$. We also characterize situations in which the frame operator matrix becomes diagonal. Finally, we show that geometric conditions on subsets of $\mathbb Z_N$ force certain diagonals of the frame operator matrix of $\mathcal{G}$ to vanish, yielding additional sparsity and block structures.
Read the full abstract
Dynamical Systems
Evaluating the skill of a geometric early warning for tipping in a rapidly forced nonlinear system
The future behavioural fate of a forced nonlinear system can depend sensitively on the forcing profile as well as natural fluctuations within the system. This is especially the case for rate-induced tipping, where the forcing pushes the system to a basin boundary of a future behaviour and small changes in the forcing can lead to drastically different eventual behaviours. This sensitivity may be present only for a limited period of time, for example when the forcing is most rapidly changing. Moreover, critical slowing down based methods fail to be informative in such cases. We investigate a geometric early warning to evaluate when a system is in such a sensitive state. This involves computing the R-tipping indicator, namely the signed distance to an approximate R-tipping threshold. The latter is a dynamic state that embeds knowledge of the system and future behaviour of the forcing. We contrast this with early warnings of bifurcation-induced tipping, where tipping is associated with passing a threshold on slow variation of forcing. As an example, we consider methods of early prediction of the future state for a 3-box model of the Atlantic Meridional Overturning Circulation (AMOC) with specified rapid forcing. We show that the skill of the geometric early warning compares favourably with simple thresholds.
Read the full abstract
Information Theory · Cross-listed from cs.LG
Entropy Across the Bridge: Conditional-Marginal Discretization for Flow and Schrödinger Samplers
For a fixed flow-based generative model under a small inference budget, sample quality can depend strongly on where the sampler spends its few function evaluations. Flow matching and Schrödinger bridges define probability paths, yet their inference grids are usually heuristic or inherited from one-endpoint diffusion. We derive a conditional-marginal entropy-rate objective for bridge-aware discretization, separating endpoint-conditioned bridge geometry from marginal flow evolution, and use it to build a training-free entropic inference-time scheduler from first principles. For Gaussian Brownian bridges this rate is closed-form and U-shaped, motivating boundary-heavy nonuniform grids. On trained two-dimensional bridge/flow models, the estimated profile recovers the predicted shape and improves 10-step ODE-Heun MMD over linear by 18.1%, with a paired 22.7% SDE-Heun improvement in the same low-NFE sweep. On EDM/CIFAR-10, the entropic time-discretization gives the best tested five-step FID (186.3 \pm 4.0 versus 200.5 \pm 2.9 for linear and 238.0 \pm 5.3 for cosine). On AlphaFlow protein generation, entropic conditional-marginal (cond-marg) scheduling shows advantage in low-NFE regimes on both CAMEO22 and ATLAS benchmarks. These results support entropy-rate scheduling as a practical low-budget allocation signal for high-dimensional bridge and flow samplers.
Read the full abstract
Functional Analysis
Moment problems on compacts of characters of an unital commutative algebra
In this note we consider linear functionals on an unital commutative R-algebra. We give an integral representation of a nonnegative functional on an Archimedean cone where we do not assume that this cone is a semiring or a quadratic module. We also give a solution of the moment problem on a product of intervals and determine conditions for a functional to be a moment functional on a compact of characters.
Read the full abstract
Quantum Algebra
Non-combinatorial involutive braidings: the quantum algebra $\mathfrak{gl}_{k,m}$
We investigate involutive, non-combinatorial solutions of the braid equation, viewing them as special deformations of the permutation map. Utilizing these solutions, we identify the associated quantum algebra and introduce it as the $\mathfrak{gl}_{k,m}$ Yangian. This newly derived Yangian is distinct from the known Yangian of the general linear Lie superalgebra; crucially, as a Hopf algebra, it possesses the standard tensor product algebra structure. The underlying algebra $\mathfrak{gl}_{k,m}$ is also introduced as a novel structure and constitutes a subalgebra of the Yangian. We then construct specific highest-weight modules of $\mathfrak{gl}_{k,m}$ that simultaneously yield the eigenstates of spin-chain-like “Hamiltonians”, which are defined as the sum of the generators of the $A$-type braid group. Furthermore, we study the highest-weight representations and the corresponding combinatorial bases for $\mathfrak{gl}_{1,1}$, explicitly linking them to specific shapes of Young tableaux.
Read the full abstract
Information Theory · Cross-listed from cond-mat.mtrl-sci
Causation-guided mechanism identification and interpretable reduced-order modeling of damage-driving grain-boundary stress in creep
GB local stress is central to the initiation and evolution of long-term creep damage in polycrystalline superalloys. Owing to the high-dimensional nonlinear relationships between the GB stress response and multiple crystallographic, microstructural, and micromechanical characteristics, it remains challenging to identify the key characteristics governing GB stress and to elucidate their mechanisms of influence. Dislocation-climb-affected crystal-plasticity finite-element simulations of minimal grain clusters are combined with an integrated causation-guided machine-learning framework, in which mechanics-informed descriptors are analyzed by causation entropy (CE) to identify governing mechanisms and then distilled into a reduced-order regression form for interpretable prediction of GB normal stress. Unlike conventional black-box surrogate models, the proposed framework combines physically meaningful descriptors, CE-based mechanism identification, and an explicit compact regression form, enabling the dominant physical variables and their effects on GB normal stress to be directly interpreted. Among 18 physically motivated characteristics, the GB inclination angle, the slip transmission, the climb-related Schmid-type indicator, and the elastic-modulus mismatch are found to be dominant, revealing the coupled roles of interfacial geometry, crystallographic compatibility, creep stress relaxation, and micromechanical contrast. The identified characteristics hierarchy and functional representation remain effective under multiaxial loading and can be extended to tricrystal systems through physically interpretable nonlocal augmentation when a purely local description becomes insufficient, demonstrating strong physical consistency and robust generalizability across physical conditions.
Read the full abstract
Numerical Analysis
Analytical and numerical study of nonlinear Riesz-Caputo boundary value problems
Fractional boundary value problems are often used to model complex systems and processes characterized by memory effects and anomalous diffusion. In this paper, we consider nonlinear fractional boundary value problems of arbitrary order {\alpha} involving the Riesz-Caputo operator, which is particularly suited for modelling physical phenomena exhibiting symmetric diffusive effects. By reducing the problem to a dominant singular integral equation of Cauchy type and inverting it in closed form, we derive an integral representation of the solution, which we use to prove existence and uniqueness. The closed-form inversion also describes the typical behaviour of the solution near the endpoints of the interval and provides an exact singular solution, which we use as a test case. We then analyse a B-spline collocation method for the approximation of the solution, proving its convergence and illustrating it by numerical experiments.
Read the full abstract
General Topology
Intrinsic uniform structure on median algebras
We introduce the median uniformity $\mathcal U_{\mathrm m}$, an intrinsic precompact convex uniform structure on a median algebra. It is Hausdorff under natural assumptions, for instance for finite-rank median algebras. In the Hausdorff case, its uniform completion yields the Minimal Median Compactification (MMC). The induced topology $\tau_{\mathrm m}$ provides a natural higher-rank analogue of the interval topology on linearly ordered sets and of the shadow topology on rank-one median algebras. When the intrinsic topology $\tau_{\mathrm m}$ is Hausdorff and all intervals are compact, the MMC is the unique proper median compactification and is canonically isomorphic to the Roller–Fioravanti compactification. We apply this uniform framework to continuous actions of a topological group $G$ by median automorphisms. We show that the MMC is a median $G$-compactification. In the finite-rank case, the resulting compact $G$-system is Rosenthal representable and dynamically tame.
Read the full abstract
Mathematical Physics · Cross-listed from gr-qc
Nonlinear stability of continuously self-similar naked singularities for the Einstein-scalar field equations II: linearized stability
This is the second part of a series of papers proving the nonlinear stability of a one-parameter family of continuous self-similar $C^{1,\alpha}$ naked singularity solutions, with $0<\alpha\ll1$, to the spherically symmetric Einstein-scalar field equations. These solutions were constructed by Christodoulou and are known to be unstable under sufficiently rough perturbations due to the blue-shift instability mechanism. In complete contrast to the previous instability results, we establish the linearized stability for those naked singularity spacetimes under perturbations of the same regularity as the background, revealing the central role of regularity in determining the strength of the blue-shift instability mechanism, and showing that it is not triggered at the regularity level of the background spacetime. The linear analysis carried out in this paper provides the foundation for the nonlinear stability result established in the companion paper [W. Zheng, Nonlinear stability of the continuous self-similar naked singularities for the Einstein-scalar field equations I: main results]. Together with that companion paper, this yields the nonlinear stability of these continuously self-similar naked singularities.
Read the full abstract
Information Theory
GeoGS-CE: Learning Delay–Beam Channel Priors with 3D Gaussians for High-Mobility Scenarios
Wideband channel estimation (CE) in high-mobility scenarios remains challenging because channel responses vary rapidly, while practical systems can allocate only sparse pilots to accommodate dense users. Fortunately, many high-mobility environments, such as high-speed railways, exhibit scheduled trajectories, predictable velocities, and a limited number of dominant propagation paths. These properties induce a delay–beam power spectrum that is more stable than the instantaneous complex channel frequency response (CFR), less sensitive to the random phase coherence, and rich in geometric information. To exploit such environmental properties, we propose GeoGS-CE, a two-stage channel estimation framework for sparse-pilot high-mobility scenarios. In the offline stage, GeoGS-CE jointly models: 1) a scene-level 3D Gaussian representation that captures the non-line-of-sight (NLoS) geometric scattering support, and 2) a leakage-aware differentiable wireless rendering process that maps the NLoS Gaussians, together with an explicit virtual line-of-sight (LoS) component, to the measured delay–beam power spectrum, while accounting for practical OFDM delay and array leakage effects. In the online stage, the delay–beam power spectrum is predicted for each user location and used as a strong covariance prior, enabling accurate full-band and full-array CFR reconstruction and tracking through a linear MMSE estimator. Simulations based on channels generated from a segment of the Guangshen high-speed railway show that the proposed geometric prior substantially improves CFR reconstruction over pilot-only and non-geometric baselines.
Read the full abstract
Number Theory
On Drinfeld's representability theorem
In the seventies, V. G. Drinfeld proved that a moduli problem of deformations by quasi-isogenies of certain $p$-divisible groups with extra actions is representable by an explicit semi-stable model of the $p$-adic symmetric space. This theorem, known as Drinfeld's representability theorem, has been one of the cornerstones of geometric aspects in $p$-adic Hodge theory. The purpose of these notes is twofold. On the one hand we give a new and more transparent proof of Drinfeld's representability theorem; on the other hand, we give a detailed presentation of Drinfeld's moduli space and the formal model of the $p$-adic symmetric space.
Read the full abstract
Probability
Loop pruning and downward deviations for maximum local time of discrete-time simple random walks
We study downward deviations of the maximum local time of the discrete-time simple random walk on $\mathbb{Z}^d$, $d\ge 3$. In our previous paper \cite{li2026ldmaxlocal}, the corresponding upper bound was established, while the matching lower bound was left open. In the present paper, we prove this lower bound and hence obtain the sharp asymptotic formula for the downward-deviation probability. To provide a discrete-time analogue of the jump-chain/holding-time structure used in the continuous-time argument, we introduce a new random structure which we name as loop-pruned random walk and the associated loop-pruning decomposition, which is also of independent interest.
Read the full abstract
Number Theory
Hecke Eigenvalues of Ikeda Lifts
In this paper, we study the Hecke eigenvalues of Ikeda lifts. Using the spherical map for the Hecke algebra of the symplectic group, we obtain an explicit formula for the eigenvalues $\lambda_F(p^r)$. From this formula, we show that $\lambda_F(p^r)$ can be written as a polynomial in $p^{\pm 1/2}$ with a positive leading term. Furthermore, we prove that the coefficients of this polynomial are bounded and, as a consequence, the Hecke eigenvalues $\lambda_F(p^r)$ are positive for all sufficiently large primes $p$.
Read the full abstract
Probability
Stochastic integration with respect to a Lévy basis
We develop a stochastic integration theory for predictable integrands with respect to a Lévy basis. Our approach is based on decoupling inequalities for tangent sequences and reduces the construction of the stochastic integral essentially to the deterministic integration theory for infinitely divisible random measures developed by Rajput and Rosiński. We characterise the corresponding class of integrable predictable processes in terms of the semimartingale characteristics associated with the driving random measure and show that the resulting space of integrands possesses a natural Musielak-Orlicz type structure equipped with an F-norm. Furthermore, we establish continuity properties of the integral operator and a stochastic version of Lebesgue's dominated convergence theorem.
Read the full abstract
Number Theory
Duality of analytic Hopf algebras and the Amice transform
We construct global versions of the analytic Hopf algebras used in the $p$-adic Fourier theory of Amice and Mahler over a general Banach ring, independently of the choice of prime $p$. This is done by generalising Köthe echelon and coechelon spaces to an arbitrary base Banach ring $R$ and proving reflexivity and nuclearity results. We show how to define an analytic Hopf algebra structure on them and investigate their duality theory. The particular case of the Hopf algebra of analytic functions converging on the open unit disk around $1$ and its dual is studied in detail. Amice duality is recovered from this case by base-change to a $p$-adic ring. Most notably, when $R$ is the ring of integers with the trivial norm, we obtain a global analytic version of Amice duality that does not depend on $p$.
Read the full abstract
Number Theory
Eisenstein circle packings and the Eisenpint Schmidt arrangement
The Schmidt arrangement of an imaginary quadratic number field $K$ is the orbit of the extended real line under $\text{PSL}(2, \mathcal{O}_K)$ as Möbius transformations on the extended complex plane. If $K\neq\mathbb{Q}(\sqrt{-3})$, then the resulting set of circles can only intersect tangentially, leading to various classes of integral circle packings, including Apollonian circle packings. When $K=\mathbb{Q}(\sqrt{-3})$, circles can intersect at angles of $\frac{\pi}{3}$ and $\frac{2\pi}{3}$, making it unclear how to extract circle packings from the arrangement. The goal of this paper is to study a modification of the $\mathbb{Q}(\sqrt{-3})-$Schmidt arrangement called the "Eisenpint Schmidt arrangement" and associated integral "Eisenstein circle packings". In analogy to the study of Apollonian circle packings, we study the number theory of such packings, including associated families of quadratic forms, show the Eisenpint Schmidt arrangement is formed of exactly all primitive Eisenstein circle packings, show strong approximation and classify congruence obstructions, prove a density-one local-global statement, and find quadratic – but alas no cubic – reciprocity obstructions. Unexpected aspects of the Eisenstein case include the role of congruence subgroups, the bipartite nature of the packings and reciprocity obstructions, the coefficients of quadratic obstructions, an abundance of extra symmetry, and the need to use "first-odd" quadratic forms.
Read the full abstract
Algebraic Geometry
Exponential concentration for quantum periods via mirror symmetry
We investigate power series satisfying the exponential concentration property, and show that suitable modifications of hypergeometric series respect this property. As a geometric application, we prove that the quantum period of a Fano manifold possesses the same property, whenever the manifold admits a convenient weak Landau-Ginzburg model with non-negative coefficients.
Read the full abstract
Dynamical Systems
Conditions for spatial instabilities and pattern formation from monomial steady state parameterizations
We study the onset of spatial instabilities in reaction networks where the spatially homogeneous system admits a steady state parameterization. We formulate a sufficient condition – based on the signs of the constant and leading coefficients of the characteristic polynomial of the linearized Jacobian scaled by the diffusion coefficients – that guarantees a Turing-like instability to spatially inhomogeneous solutions on appropriately chosen domains $\Omega$. We also present a specific condition on the domain size $|\Omega|$ required to trigger this instability. As a consequence of employing a monomial parameterization, these conditions take the form of algebraic polynomial inequalities involving only rate constants and diffusion coefficients. We apply these ideas to a network describing the sequential and distributive (de-)phosphorylation of a protein at two binding sites, ultimately deriving a condition involving only the four catalytic constants of the enzymes and the diffusion coefficients of the four enzyme-substrate complexes that guarantees a Turing-like instability.
Read the full abstract
Mathematical Physics
Epstein vector zeta functions related to the ADE Lie algebras
We introduce a vector-valued generalization of the Epstein zeta functions associated with the root lattices of ADE-type Lie algebras. The quadratic forms defining these lattices correspond to the Gram matrices of the simple roots. Using the discriminant group D = P/Q, we construct vector-valued theta series that realize the Weil representation of the metaplectic group Mp(2,Z). The proposed Epstein vector zeta functions are obtained as the Mellin transform of these theta series. By exploiting the equivariance properties of the theta vectors, we derive a matrix functional equation of the Riemann type. We show that the existence of this functional equation is governed by a selection rule: it holds specifically for the subspace of C-invariant vectors, where C is the central element of Mp(2,Z). Finally, we provide a complete classification of the lattices and invariant subspaces for which this matrix functional equation is satisfied.
Read the full abstract
Algebraic Geometry
Homological Mirror Symmetry for Conic Bundle
We study the homological mirror symmetry statement where A-side is the conic bundle Hori–Vafa mirror $\mathcal{Y} = \{uv = f(z)\} \subset \mathbb{C}^2 \times (\mathbb{C}^\ast)^n$ for a Laurent polynomial $f$ in $(\mathbb{C}^\ast)^n$, and B-side is some a toric Calabi–Yau $(n+2)$-fold with a smooth anti-canonical divisor removed $\mathcal{X}^\circ = \mathcal{X} \setminus w^{-1}(-1)$. We show that when $\mathcal{X}$ is the canonical bundle of a toric Fano $n$-orbifold $S$ and $f$ is its Givental superpotential, the strong deformation retraction skeleton $\mathsf{L}$ of $\mathcal{Y}$ in the sense of RSTZ (Ruddat–Sibilla–Treumann–Zaslow in Geom. Topol. 18(3):1343–1395, 2014) has a Weinstein neighborhood $U$, such that the wrapped microlocal sheaf category $\mu\mathrm{Sh}^w_{\mathsf{L}}(\mathsf{L}) \cong \mathrm{Coh}(\mathcal{X}^\circ)$. This proves a microlocal categorical version of the SYZ mirror in (Abouzaid–Auroux–Katzarkov in Publ. math. IHÉS 123(1):199–282, 2016, Thm. 1.7). We also extend the definition of characteristic cycles for constructible sheaves in cotangent bundles from (Kashiwara–Schapira in Sheaves on Manifolds, Grundlehren math. Wiss. 292, Springer, 1990, Ch. IX) to finite-rank objects in $\mu\mathrm{Sh}^w_{\mathsf{L}}(\mathsf{L})$, and describe the characteristic cycles for objects mirror to a coherent sheaf supported on $S$.
Read the full abstract
Statistics Theory
Tests for the mean of high-dimensional data
We consider the problem of testing the mean of high-dimensional data when the dimension may grow without explicit rate restrictions relative to the sample size. The proposed procedure is based on the statistic V_n = n||Xn||^2, which avoids inversion of the covariance matrix and is therefore suitable for high-dimensional settings.We establish asymptotic distributional results for both fixed and increasing dimension by embedding the observations into the Hilbert space l2. Furthermore, we prove the asymptotic validity of a bootstrap approximation for the distribution of the test statistic. The resulting bootstrap test yields asymptotic level-a procedures without requiring sparsity assumptions or structural conditions on the covariance matrix. In all this, a new Central Limit Theorem in l2 is proving to be an extremely useful tool.
Read the full abstract
Group Theory
Greedy bases and relational complexity of diagonal type groups
A base for a subgroup $G$ of $\mathrm{Sym}(\Omega)$ is a sequence of elements of $\Omega$ with trivial pointwise stabiliser. The size of the smallest base for $G$ is denoted $b(G)$. There is a natural greedy algorithm to compute a base for $G$, and it was conjectured by Cameron in 1999 that there exists an absolute constant $c$ such that if $G$ is primitive then any base returned by this algorithm has size at most $cb(G)$. In this paper we determine the size of every base returned by the greedy algorithm when $G$ is a primitive group of diagonal type, and hence prove Cameron's conjecture for these groups. The relational complexity $\mathrm{RC}(G)$ of $G$ is a measure of the way in which the orbits of $G$ on $\Omega^k$ for various $k$ determine the action of $G$ on $\Omega$. Very few precise values of relational complexity are known, and in particular it is not known which primitive groups have relational complexity $3$. In this paper we prove that if $G$ is primitive of diagonal type then $\mathrm{RC}(G) \geqslant 4$, that this lower bound is attained by infinitely many such $G$, and that the relational complexity of the groups of diagonal type is unbounded.
Read the full abstract
Combinatorics
Subgraphs versus Orientations: Infinite families of equidistributions
A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that this result is an instance of a much broader set of enumerative identities between subgraphs and orientations corresponding to various connectivity constraints. Namely, given two sets of pairs of vertices $A=\{(u_i,v_i), i\in[k]\}$ and $B=\{(u_i',v_i'), i\in[l]\}$, we consider the orientations $\alpha$ of $G$ such that adding the elements of $A$ and $B$ as additional directed edges to $\alpha$ gives an orientation $\alpha'$ in which $v_i$ cannot reach $u_i$ for all $i\in[k]$, but $v_i'$ can reach $u_i'$ for all $i\in[l]$. We show that this set of orientations is equinumerous to a set of subgraphs satisfying the “same" connectivity constraints defined in terms of $A$ and $B$. We also extend our results to the enumeration of equivalence classes of orientations satisfying such connectivity constraints. Precisely, we consider the equivalence classes under cycle reversal, cocycle reversal, or cycle-cocycle reversal. We show that the equivalences classes are equinumerous to some sets of subgraphs defined by connectivity and acyclicity constraints.
Read the full abstract
Statistics Theory
Nearest-Neighbour Matching on Unbounded Supports and Covariate Shift Transfer
Expectations of multivariate functions with missing labels occur in various fields such as transfer learning and average treatment effects. Although non-parametric estimators based on nearest-neighbour matching are frequently used in this context, the existing literature assumes that the covariates live in some well-shaped compact subset of $\R^d$, with densities that are bounded away from zero. In this paper, we show that the usual rates of convergence can be achieved with minimal assumptions on the covariate supports. These assumptions are replaced with conditions on the source and target distributions, among which a measure of the tranferability between the two probability measures. We show that these conditions are general, can be applied to distributions supported on manifolds, and allow the target distribution to have a heavier tail than the source distribution. We also show that this control of the transferability is needed for any estimator to achieve good rates of convergence. Finally, applying our results to the estimation of treatment effects, we could relax the assumption that the assignment probabilities had to be bounded away from zero and one.
Read the full abstract
Operator Algebras · Cross-listed from quant-ph
Beyond trace-class and Hilbert-Schmidt – Interaction between operator ideals and von Neumann algebras in quantum physics
Starting from a thorough analysis of the conjugate $\overline{H}$ of a complex Hilbert space $H$, including its significant importance regarding a representation of the tensor product of two complex Hilbert spaces and its impact to the theorem of Fréchet-Riesz over to a revisit of applications of nuclear and absolutely $p$-summing operators in algebraic quantum field theory (AQFT) in the sense of Araki, Haag and Kastler ($p=2$) and more recently in the framework of general probabilistic spaces ($p=1$), we will outline that Banach operator ideals in the sense of Pietsch, or equivalently tensor products of Banach spaces in the sense of Grothendieck are even lurking in the foundations and philosophy of quantum physics and quantum information theory. In particular, we concentrate on their importance in AQFT (Theorem 5.27). In doing so, we revisit the role of trace-class operators in quantum theory and construct the enveloping $\tup{C}^\adj$-algebra, corresponding to an arbitrarily given normed operator ideal (Proposition 5.3 and Theorem 5.5). Applications are presented, including a purely linear algebraic description of the quantum teleportation process, thereby showing a link to quantum information theory, also due to the emergence of the Hadamard-Walsh transform and the controlled NOT gate (Example 4.18). All Hilbert spaces discussed in this paper may be nonseparable (and hence infinite-dimensional).
Read the full abstract
Optimization and Control
A New Constraint Qualification for Mixed Constrained Optimal Control
In recent developments, a novel set of necessary optimality conditions for mixed constrained optimal control problems, termed the asymptotic weak maximum principle, has been formulated. These novel conditions deviate from the classical ones by virtue of their sequential nature and the fact that they are satisfied regardless of the regularity conditions imposed on the mixed constraints. Furthermore, due to their asymptotic behaviour, these conditions serve as a precise tool for use as stopping criteria in numerical methods of solution. However, it should be noted that, in certain instances, these conditions may not be sufficiently robust to fully characterize optimal solutions, as they can be satisfied by processes that are not extremals. The present study proposes a novel constraint qualification, meticulously developed to address these asymptotic optimality conditions. It is demonstrated that the asymptotic weak maximum principle implies the classical weak maximum principle when the newly proposed constraint qualification is verified. It is further demonstrated that, in the smooth setting, this constraint qualification is the weakest one that possesses such a property. Additionally, this study present sufficient criteria for the validity of the newly proposed constraint qualification.