Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 30 March
In this paper, we consider the Ising model on random $d$-regular graphs (with $d\ge3$) and Erdös-Rényi graphs $G(n,d/n)$ (with $d>1$) at the critical temperature. We prove that the magnetization, i.e.\ the sum of the spins of a configuration, is typically of order $n^{3/4}$ and when multiplied by $n^{-3/4}$ converges in distribution to a non-trivial random variable, whose density we describe. In the regular graph case, the Small Subgraph Conditioning Method applies, and the limiting density is of the form $\frac1{Z}\exp(-C_d z^4)$. Surprisingly, in the Erdös-Rényi case, while the ratio of the second moment and first moment squared is bounded, the short cycle count is not enough to explain the fluctuations of the partition function restricted to a particular magnetization. We identify the additional source of randomness as path counts of slowly diverging length. This quantity is motivated by the heuristic that correlations between distant vertices are proportional to their local branching rate. Augmenting the Small Subgraph Conditioning Method with these path counts allows us to prove convergence of the magnetization to a non-deterministic limiting distribution. To our knowledge, the need to condition on graph observables beyond the cycle counts is a new phenomenon for spin systems. As further corollaries, we derive a polynomial lower bound on the mixing time of the stochastic Ising model on sparse random graphs at the critical temperature complementing recent upper bounds. Moreover, we establish the fluctuations of the free energy in the Erdös-Rényi case, answering a recent question of Coja-Oghlan et. al.
Analysis of PDEs
A mathematical description of the spin Hall effect of light in inhomogeneous media
We study Gaussian wave packet solutions for Maxwell's equations in an isotropic, inhomogeneous medium and derive a system of ordinary differential equations that captures the leading-order correction to geodesic motion. The dynamical quantities in this system are the energy centroid, the linear and angular momentum, and the quadrupole moment. Furthermore, the system is closed to first order in the inverse frequency. As an immediate consequence, the energy centroids of Gaussian wave packets with opposite circular polarisations generally propagate in different directions, thereby providing a mathematical proof of the spin Hall effect of light in an inhomogeneous medium.
Read the full abstract
Geometric Topology
Measurable boundary maps and Patterson–Sullivan measures for non-Borel Anosov groups on the Furstenberg boundary
In this paper we develop a theory for Patterson–Sullivan measures for non-Borel Anosov groups on the Furstenberg boundary. Previously, such a theory has been successfully developed for measures supported on the partial flag manifold associated to the Anosov condition, which coincides with the Furstenberg boundary only under the strongest Anosov condition, Borel Anosov. We establish existence, uniqueness, and ergodicity results for the measures on the Furstenberg boundary under arbitrary Anosov conditions; we show ergodicity of Bowen–Margulis–Sullivan measures on the homogeneous space; and we establish strict convexity results for the critical exponent associated to functionals on the entire Cartan subspace. Using this strict convexity, we establish an entropy rigidity result for Anosov groups with Lipschitz limit set. A key tool we develop is a new sufficient condition for the existence of a measurable boundary map associated to a Zariski dense representation. This result not only applies to Anosov groups, but also to transverse groups, mapping class groups, and discrete subgroups of the isometry groups of Gromov hyperbolic spaces.
Read the full abstract
Geometric Topology
Vector-valued horofunction boundaries and Patterson–Sullivan measures
In higher rank, there is a well-studied theory of Patterson–Sullivan measures supported on partial flag manifolds. However, establishing the existence and uniqueness of such measures is a difficult question. In this paper, we develop a theory for Patterson–Sullivan measures supported on certain vector-valued horofunction boundaries of the associated symmetric space, where existence is straightforward. We also introduce a notion of shadows for this compactification and establish a shadow lemma. For transverse groups, we prove uniqueness and ergodicity results.
Read the full abstract
Category Theory
A synthetic construction of universal cocartesian fibrations
We give a model-independent construction of directed univalent cocartesian fibrations of $(\infty,1)$-categories, and prove a straightening equivalence against such fibrations. The key step is showing that cocartesian fibrations descend along localisations, which we accomplish by analysing mapping spaces of localisations. Along the way we introduce a directed version of the join construction, giving a sequential colimit description of the full image of any functor.
Read the full abstract
Dynamical Systems
Stochasticity and probabilistic trajectory scoring are essential for data-driven closures of chaotic systems
Coarse-grained models of chaotic systems neglect unresolved degrees of freedom, inducing structured model error that limits predictability and distorts long-term statistics. Typical data-driven closures are trained to minimize error over a single time step, implicitly assuming Markovian dynamics and often failing to capture long-term behavior. Recent approaches instead optimize losses over finite trajectories. However, when such trajectory-based training is carried out with deterministic pointwise losses, it introduces a fundamental mathematical degeneracy. We prove that optimizing pointwise deterministic losses such as mean squared error over chaotic trajectories suppresses predictive variance, with corresponding loss of physical variability in long integrations. In contrast, strictly proper scoring rules avoid this degeneracy. By targeting forecast distributions rather than realized trajectories, they remove the penalty against predictive spread and align the long-lead optimum with the invariant measure. Using quasi-geostrophic turbulence as a canonical chaotic system, we validate this theory: one-step-trained closures fail to capture stable coarse-grained dynamics, while deterministic closures optimized over trajectories exhibit the variance-loss tendency predicted by our analysis. Stochastic closures calibrated over trajectories using the energy score, however, overcome both structural limitations, yielding skillful ensemble forecasts and realistic long-term statistics. Our results establish that both stochastic modeling and trajectory-based calibration are essential for faithfully representing the dynamics of coarse-grained systems.
Read the full abstract
Mathematical Physics
Invariant measures of randomized quantum trajectories
Quantum trajectories are Markov chains modeling quantum systems subjected to repeated indirect measurements. Their stationary regime depends on what observables are measured on the probes used to indirectly measure the system. In this article we explore the properties of quantum trajectories when the choice of probe observable is randomized. The randomization induces some regularization of the quantum trajectories. We show that non-singular randomization ensures that quantum trajectories purify and therefore accept a unique invariant probability measure. We furthermore study the regularity of that invariant measure. In that endeavour, we introduce a new notion of ergodicity for quantum channels, which we call multiplicative primitivity. It is a priory stronger than primitivity but weaker than positivity improving. Finally, we compute some invariant measures for canonical quantum channels and explore the limits of our assumptions with several examples.
Read the full abstract
Analysis of PDEs
Front Location for Go or Grow Models of Aerotaxis
We investigate the pushed-to-pulled transition for a minimal model for invasive fronts influence by “aerotaxis,” that is, when organisms follow oxygen gradients. We consider two singular reaction-advection-diffusion models for this. The version of primary interest arises as a hydrodynamic limit of a system of branching, rank-based interacting Brownian particles and features a nonlinear, nonlocal advection. The second version is introduced here as a local counterpart. We establish well-posedness for both models, with the local case requiring a novel use of the “shape defect function.” We further characterize the front location up to $O(1)$ precision in all cases, including the delicate boundary “pushmi-pullyu” case.
Read the full abstract
Numerical Analysis
Resonant solutions and (in)stability of the linear wave equation
We revise the analysis of the acoustic wave equation, addressing the question whether the classical well-posedness implies the existence of an isomorphism between prescribed solution and data spaces. This question is of interest for the design and the analysis of discretization methods. Expanding on existing results, we point out that established choices of solution and data space in terms of classical Bochner spaces must be expected to be incompatible with the existence of such an isomorphism, because of resonant waves. We formulate this observation in the language of the so-called inf-sup theory, with the help of an eigenfunction expansion, which reduces the original partial differential equation to a system of ordinary differential equations. We further verify that an isomorphism can be established, for each equation in the system, upon equipping the data space with a suitable resonance-aware norm. In the appendix, we extend our results to other time-dependent linear PDEs.
Read the full abstract
Numerical Analysis
Row-Splitting ILU Preconditioners for Sparse Least-Squares Problems
Preconditioning for overdetermined least-squares problems has received comparatively little attention, and designing methods that are both effective and memory-efficient remains challenging. We propose a class of ILU-based preconditioners built around a row-splitting strategy that identifies a well-conditioned square submatrix via an incomplete LU factorization and combines its incomplete factors with algebraic corrections from the remaining rows. This construction avoids forming the normal equations and is well suited to problems for which the normal matrix is ill-conditioned or relatively dense. Numerical experiments on test problems arising from practical applications illustrate the effectiveness of the proposed approach when used with a Krylov subspace solver and demonstrate it can outperform preconditioners based on incomplete Cholesky factorization of the normal equations, including for sparse-dense problems, where the splitting naturally isolates dense rows.
Read the full abstract
Dynamical Systems
Asymptotic behavior of solutions to linear evolution equations with time delay via a spectral theory on Gelfand triples
In this paper, a class of linear evolution equations with time delay is studied in which the presence of continuous spectrum on the imaginary axis obstructs the analysis of long-time dynamics. To address it, a generalized spectral framework on a Gelfand triple is utilized. When the spectral measure of the unperturbed term (a skew-adjoint operator) admits some analyticity condition, the resolvent is extended to a generalized resolvent. Called generalized spectrum, the collection of singularities on the Riemann surface of the generalized resolvent may differ from the spectrum in the usual sense because of the change of topology via the Gelfand triple. It is shown that under some compactness assumption, the generalized spectrum consists only of isolated generalized eigenvalues (resonance poles). This structure allows contour deformation in the inverse Laplace representation and yields exponential decay in a weak topology. As an application, we analyze the continuum limit of the Kuramoto-Daido model with time delay and prove linear stability of the incoherent state in the weak coupling regime.
Read the full abstract
Numerical Analysis
Divergence-free Linearized Neural Networks: Integral Representation and Optimal Approximation Rates
This paper studies the numerical approximation of divergence-free vector fields by linearized shallow neural networks, also referred to as random feature models or finite neuron spaces. Combining the stable potential lifting for divergence-free fields with the scalar Sobolev integral representation theory via ReLU$^k$ networks, we derive a core integral representation of divergence-free Sobolev vector fields through antisymmetric potentials parameterized by linearized ReLU$^k$ neural networks. This representation, together with a quasi-uniform distribution argument for the inner parameters, yields optimal approximation rates for such linearized ReLU$^k$ neural networks under an exact divergence-free constraint. Numerical experiments in two and three spatial dimensions, including $L^2$ projection and steady Stokes problems, confirm the theoretical rates and illustrate the effectiveness of exactly divergence-free conditions in computation.
Read the full abstract
Combinatorics
Optimal bounds for an Erdős problem on matching integers to distinct multiples
Let $f(m)$ be the largest integer such that for every set $A = \{a_1 < \cdots < a_m\}$ of $m$ positive integers and every open interval $I$ of length $2a_m$, there exist at least $f(m)$ disjoint pairs $(a, b)$ with $a \in A$ dividing $b \in I$. Solving a problem of Erdős, we determine $f(m)$ exactly, and show $$ f(m)=\min\bigl(m,\lceil 2\sqrt{m}\,\rceil\bigr) $$ for all $m$. The proof was obtained through an AI-assisted workflow: the proof strategy was first proposed by ChatGPT, and the detailed argument was subsequently made fully rigorous and formally verified in Lean by Aristotle. The exposition and final proofs presented here are entirely human-written. [This paper solves Problem #650 on Bloom's website "Erdős problems".]
Read the full abstract
Representation Theory
A path model for MV polytopes in type A_n
We introduce a one-skeleton path model for Mirkovic-Vilonen polytopes in type A_n. We prove that the Minkowski sum of (MV) polytopes corresponds to the concatenation of one-skeleton paths of this model. We show that MV polytopes induced by fundamental one-skeleton paths are Harder-Narasimhan polytopes. The paths given by an orientation of the fundamental alcove parameterize precisely the cluster variables in the initial seed of the coordinate ring C[N]. We also establish a correspondence between fundamental one-skeleton paths and folded galleries representing maximal faces of subword complexes. Under this correspondence, the comultiplication structure of C[N] matches the intrinsic comultiplication structure of folded galleries given by projections to sub-Coxeter complexes.
Read the full abstract
Mathematical Physics
Geometry of the Ising persistence problem and the universal Bonnet-Manin Painlevé VI distribution
We determine the full persistence probability distribution for a non-Markovian stochastic process, motivated by first-passage questions arising in interacting spin systems and allied systems. We show that this distribution is governed by a distinguished Painlevé VI system arising from an exact Fredholm Pfaffian structure associated with the integrable sech kernel, $K_{\mathrm{sech}}=1/(2 \pi \cosh[(x-y)/2])$. The universal persistence exponent originally obtained by Derrida, Hakim and Pasquier is recovered as an asymptotic observable and acquires a natural geometric interpretation. In the stationary scaling regime, the persistence probability admits an exact Pfaffian decomposition into even and odd Fredholm determinants of the integrable sech kernel. These determinants are controlled by a unique global solution of a second-order nonlinear ordinary differential equation, which is identified as a particular Painlevé VI equation. The corresponding Painlevé VI connection problem determines the persistence exponent as a limiting value at infinity. We further show that the Painlevé VI system governing persistence admits a direct geometric interpretation: the relevant solution coincides with the mean curvature of a one-parameter family of Bonnet surfaces immersed in $\mathbb R^3$. A folding transformation between such surfaces singles out the Painlevé VI equation with Manin coefficients $[0,0,0,0]$, which in particular governs the universal persistence distribution in the symmetric Ising case. In this framework, the persistence exponent is identified with the asymptotic mean curvature of the associated surface.
Read the full abstract
Information Theory
Version AoI Optimization under Power and General Distortion Constraints in Uplink NOMA
The Version Age of Information (VAoI) quantifies information freshness by measuring the number of versions the receiver lags behind. This paper studies VAoI minimization in an $M$-user uplink non-orthogonal multiple access (NOMA) system where users maintain single-packet buffers and transmissions are constrained by average power and information-quality constraints, modeled by a general distortion function. A fundamental trade-off arises: transmitting more bits per update improves information quality but increases power consumption, reducing transmission opportunities and increasing VAoI, while transmitting fewer bits has the opposite effect. We formulate a weighted-sum VAoI minimization problem as a convex optimization problem. However, users' power allocations are coupled through multiple-access capacity constraints per channel state, leading to exponential complexity. To address this, we develop a VAoI-agnostic stationary randomized policy that jointly optimizes scheduling, bit allocation, and power control without tracking instantaneous VAoI, and achieves a provable 2-approximation to the globally optimal average VAoI. Leveraging Lagrangian dual decomposition, we derive closed-form expressions for the scheduling probabilities and power allocations, and efficiently determine the optimal successive interference cancellation decoding order, avoiding exhaustive search Numerical results show that NOMA significantly outperforms time-division multiple access (TDMA): at high power budgets, NOMA achieves near-zero VAoI, whereas TDMA saturates at a non-zero value, consistent with the analysis. The proposed general distortion framework accommodates diverse bit-priority structures by assigning unequal importance to different bits within an update.
Read the full abstract
Algebraic Geometry
On the Codimension-1 $\mathrm{PGL}_4$ Orbit Closures in $\mathrm{Gr}(2,10)$
We study the natural action of $\mathrm{PGL}(V)$ on the Grassmannian $G=\operatorname{Gr}(2,\operatorname{Sym}^2 V^\vee)$, where $\dim V=4$ and points of $G$ are pencils of quadrics in $\mathbb{P}(V)\cong \mathbb{P}^3$. Here $\dim G=16$ while $\dim \mathrm{PGL}(V)=15$, so the generic orbit has codimension one and one expects a one-parameter family of generic orbits. We construct this family via the $j$-invariant of the discriminant binary quartic of a pencil. We then determine the codimension-one orbit closures and compute their Chow classes. The smooth codimension-one orbit closures are the reduced fibers of the $j$-map on the smooth locus, while the unique boundary divisor is the closure of the orbit of a nodal quartic complete intersection of arithmetic genus $1$ and geometric genus $0$. Every divisorial fiber of the rational $j$-map has class $12\sigma_1$ in $A^1(G)$. For the reduced codimension-one orbit closures one has $[\overline{O_a}]=12\sigma_1$ for $a\neq 0,1728,\infty$, $[\overline{O_{1728}}]=6\sigma_1$, $[\overline{O_0}]=4\sigma_1$, and $[T]=12\sigma_1$.
Read the full abstract
Differential Geometry
On the dimension of the space of static potentials on three-manifolds
We investigate the interplay between the dimension of the space of static potentials and the geometric and topological structure of the underlying static three-manifold. A partial classification of boundaryless static manifolds is obtained in terms of this dimension. We also treat the case of static manifolds with boundary. In particular, we prove that if a compact static manifold with boundary admits a static potential whose zero set is disjoint from the boundary, then the space of static potentials is necessarily one-dimensional. These results rely on a careful analysis of the relative positions of the zero sets of linearly independent static potentials - a technique originally introduced by Miao and Tam.
Read the full abstract
Algebraic Geometry
Two comparison theorems for semiring schemes
In this note, we compare the two approaches to semiring schemes as topological spaces with a structure sheaf and as a functor of points. We explain and prove the following two results: (1) the topological space can be recovered from the functor of points; (2) the two notions of semiring schemes are canonically equivalent as categories.
Read the full abstract
Combinatorics
A Gray code for arborescences of tournaments
We consider the following question of Knuth: given a directed graph $G$ and a root $r$, can the arborescences of $G$ rooted in $r$ be listed such that any two consecutive arborescences differ by only one arc? Such an ordering is called a pivot Gray code and can be formulated as a Hamiltonian path in the reconfiguration graph of the arborescences of $G$ under arc flips, also called flip graph of $G$. We give a positive answer for tournaments and explore several conditions showing that the flip graph of a directed graph may contain no Hamiltonian cycles.
Read the full abstract
Number Theory
Numeral systems with non-zero redundancy and their applications in the theory of locally complex functions
In this paper we study representations of real numbers in a numeral system with the base $a>1$ and alphabet (digits set) $A\equiv\{0,1,...,r\}$, $a-1<r\in N$ given by \[x=\sum\limits_{n=1}^{\infty}\frac{\alpha_n}{a^n}\equiv \Delta^{r_a}_{\alpha_1\alpha_2...\alpha_n...}, \alpha_n\in A.\] Since the alphabet is redundant the numbers from the interval $[0;\frac{r}{a-1}]$ have not a single representation and can even have a continuous set of different representations. We describe the geometry (topological and metric properties) of such representations (the $r_a$-representations) in terms of cylinders defined by \[\Delta^{r_a}_{c_1c_2...c_m}= \{x: x=\Delta^{r_a}_{c_1c_2...c_ma_1a_2...a_n...}, a_n\in A\},\] We analyze their properties in detail, including the specific nature of overlaps. We present results on the structural, variational, topological, metric and partially fractal properties of the function defined by \[f\left(x=\sum_{n=1}^{\infty}\frac{\alpha_n}{(r+1)^n}\right)= \Delta^{r_a}_{\alpha_1\alpha_2...\alpha_n...},\alpha_n \in A.\] We prove the function is continuous at all points of the interval $[0,1]$ that have a unique representation in the classical numeral system on the base $r+1$ and prove the function is discontinuous at points of a countable everywhere dense set in $[0,1]$. Furthermore, we show that the function is nowhere monotonic and has unlimited variation. In the particular case $r=1$ and $a=\frac{1+\sqrt{5}}{2}$, we specify fractal level sets with Hausdorff–Besicovitch dimension not less than $-\log_a2$.
Read the full abstract
Number Theory
One continuum class of fractal functions defined in terms of $Q^*_s$-representation
In the paper we study a class $F$ of multiparameter functions defined in terms of a polybasic $s$-adic $Q^{*}_{s}$-representation of numbers by \begin{equation*} f_a\bigl(x=\Delta^{Q^{*}_s}_{\alpha_1\alpha_2\ldots\alpha_n\ldots}\bigr) = \Delta^{Q^{*}s}_{|a_1-\alpha_1|\,|a_2-\alpha_2|\,\ldots\,|a_n-\alpha_n|\ldots}, \end{equation*} where $(a_n)$ is the sequence of digits for $s$-adic representation of the parameter $a\in[0,1]$, and \begin{equation*} \Delta^{Q^{*}_s}_{\alpha_1\alpha_2\ldots\alpha_n\ldots}= \beta_{\alpha_1 1}+ \sum_{n=2}^{\infty} \left( \beta_{\alpha_n n} \prod_{j=1}^{n-1} q_{\alpha_j j} \right) \end{equation*} is the $Q^{*}_{s}$-representation of real numbers generated by a positive stochastic matrix $\|q_{ij}\|$ with $\beta_{\alpha_n n}=\sum\limits_{i=0}^{\alpha_n-1} q_{in}$. In this paper we investigate the continuity of the function $f_a$ on the sets of $Q^{*}_{s}$-binary and $Q^{*}_{s}$-unary numbers. We prove that the functions in this class are continuous on the set of numbers with a unique $Q^{*}_{s}$-representation. Furthermore, we show that except for $f_0$ and $f_1$, all functions have a countable set of discontinuities at $Q^{*}_{s}$-binary points. We classify the topological types of the value sets of $f_a$ depending on the parameter $a$. We prove that, if the value set is of Cantor type, then it is zero-dimensional. We describe the structural properties of the level sets of $f_a$ in terms of the digits of the $s$-adic representation of $a$. In particular, we establish that a level set of the function $f_a$ can be an empty set, a finite set, or a continuum. For certain values of $s$ we provide examples of fractal level sets and calculate its fractal dimensions.
Read the full abstract
Dynamical Systems
Universal Approximation Constraints of Narrow ResNets: The Tunnel Effect
We analyze the universal approximation constraints of narrow Residual Neural Networks (ResNets) both theoretically and numerically. For deep neural networks without input space augmentation, a central constraint is the inability to represent critical points of the input-output map. We prove that this has global consequences for target function approximations and show that the manifestation of this defect is typically a shift of the critical point to infinity, which we call the “tunnel effect” in the context of classification tasks. While ResNets offer greater expressivity than standard multilayer perceptrons (MLPs), their capability strongly depends on the signal ratio between the skip and residual channels. We establish quantitative approximation bounds for both the residual-dominant (close to MLP) and skip-dominant (close to neural ODE) regimes. These estimates depend explicitly on the channel ratio and uniform network weight bounds. Low-dimensional examples further provide a detailed analysis of the different ResNet regimes and how architecture-target incompatibility influences the approximation error.
Read the full abstract
Information Theory · Cross-listed from quant-ph
Discriminating idempotent quantum channels
We study binary discrimination of idempotent quantum channels. When the two channels share a common full-rank invariant state, we show that a simple image inclusion condition completely determines the asymptotic behavior: when it holds, a broad family of channel divergences collapse to a closed-form, single-letter expression, regularization is unnecessary, and all error exponents (Stein/Chernoff/Hoeffding/strong-converse) are explicitly computable with no adaptive advantage. Crucially, this yields the strong converse property for this channel family. When the inclusion fails, asymmetric exponents become infinite, implying perfect asymptotic discrimination. We apply the results to GNS-symmetric channels, showing discrimination rates for large number of self-iterations converge exponentially fast to those of the corresponding idempotent peripheral projections. Without a common invariant state, we show that the same image inclusion still guarantees additivity of the sandwiched Rényi cb-divergence for every $\alpha>1$, which suffices to establish the strong converse property and single-letter expressions for the Stein exponents.
Read the full abstract
Probability
Exponential Bounds and Analyticity for the Tree Builder Random Walk
In this work we investigate a class of random walks that interacts with its environment called Tree Builder Random Walk (TBRW). In our settings, at each step, the walker adds a random number of vertices to its position sampled according to a distribution $Q$. Previous works showed that the walker is ballistic with a well-defined speed, and that the TBRW admits a renewal structure, meaning that the process can be split into i.i.d epochs. We show that the first renewal time has exponential tail. Moreover, we show two consequences of the light tail of the first renewal time: an exponential upper bound for the empirical speed of the walker, and, for the case in which the walker adds only one vertex with probability $p$, we show that the limiting speed is an analytic function of the parameter $p$. In some of our proofs, we apply techniques from bond percolation, which consist of extending probabilities to the complex numbers and using the Weierstrass $M$-test.
Read the full abstract
Dynamical Systems
Parabolic implosion in dimension 2
In this paper, we extend the theory of parabolic implosion in complex dimension 2 to the case of holomorphic maps tangent to the identity at order 2. We investigate the bifurcation phenomena that occur when a fully parabolic fixed point is perturbed. Under the assumption of a non-degenerate characteristic direction with a formal invariant curve and director $\alpha$ satisfying $\re\alpha> 2$, we establish the existence of Lavaurs maps as limits of iterates $f_{\epsilon_n}^n$ for specific sequences of the perturbation parameter $\epsilon_n$. Finally, we apply these results to prove the discontinuity of the Julia sets $J_1$ and $J_2$ for holomorphic endomorphisms of $\mathbb{P}^2$, generalizing classical one-dimensional results to this higher-dimensional setting.
Read the full abstract
Combinatorics
Enumeration of general planar hypermaps with an alternating boundary
In this paper, we extend the enumerative study of planar hypermaps with an alternating boundary introduced in an earlier work of Bouttier and the second author. In that article, an explicit rational parametrization was obtained for the associated generating function in the case of m-constellations, using a variant of the kernel method. We develop here a new strategy to obtain an algebraic equation in the general case, which includes maps decorated by the Ising model, through a classical many-to-one correspondence. One of the main steps of our strategy is the simultaneous elimination of two catalytic variables. We then apply this strategy to the case of Ising quadrangulations, where we obtain an explicit rational parametrization. As a consequence, we show that some notable properties of the constellations case are no longer satisfied in general.
Read the full abstract
Statistics Theory
LAD estimation of locally stable SDE
We prove the asymptotic mixed normality of the least absolute deviation (LAD) estimator for a locally $\alpha$-stable stochastic differential equation (SDE) observed at high frequency, where $\alpha\in(0,2)$. We investigate both ergodic and non-ergodic cases, where the terminal sampling time diverges or is fixed, respectively, under different sets of assumptions. The objective function for the LAD estimator is expressed in a fully explicit form without necessitating numerical integration, offering a significant computational advantage over the existing non-Gaussian stable quasi-likelihood approach. We also give illustrative numerical results that support our theoretical finding.
Read the full abstract
Information Theory
Learning Where to Look: UCB-Driven Controlled Sensing for Quickest Change Detection
We study the multichannel quickest change detection problem with bandit feedback and controlled sensing, in which an agent sequentially selects one of the data streams to observe at each time-step and aims to detect an unknown change as quickly as possible while controlling false alarms. Assuming known pre- and post-change distributions and allowing an arbitrary subset of streams to be affected by the change, we propose two novel and computationally efficient detection procedures inspired by the Upper Confidence Bound (UCB) multi-armed bandit algorithm. Our methods adaptively concentrate sensing on the most informative streams while preserving false-alarm guarantees. We show that both procedures achieve first-order asymptotic optimality in detection delay under standard false-alarm constraints. We also extend the UCB-driven controlled sensing approach to the setting where the pre- and post-change distributions are unknown, except for a mean-shift in at least one of the channels at the change-point. This setting is particularly relevant to the problem of learning in piecewise stationary environments. Finally, extensive simulations on synthetic benchmarks show that our methods consistently outperform existing state-of-the-art approaches while offering substantial computational savings.
Read the full abstract
Mathematical Physics · Cross-listed from nlin.SI
Rational solutions for algebraic solitons in the massive Thirring model
An algebraic soliton of the massive Thirring model (MTM) is expressed by the simplest rational solution of the MTM with the spatial decay of $\mathcal{O}(x^{-1})$. The corresponding potential is related to a simple embedded eigenvalue in the Kaup–Newell spectral problem. This work focuses on the hierarchy of rational solutions of the MTM, in which the $N$-th member of the hierarchy describes a nonlinear superposition of $N$ algebraic solitons with identical masses and corresponds to an embedded eigenvalue of algebraic multiplicity $N$. We show that the hierarchy of rational solutions can be constructed by using the double-Wronskian determinants. The novelty of this work is a rigorous proof that each solution is defined by a polynomial of degree $N^2$ with $2N$ arbitrary parameters, which admits $\frac{N (N-1)}{2}$ poles in the upper half-plane and $\frac{N(N+1)}{2}$ poles in the lower half-plane. Assuming that the leading-order polynomials have exactly $N$ real roots, we show that the $N$-th member of the hierarchy describes the slow scattering of $N$ algebraic solitons on the time scale $\mathcal{O}(\sqrt{t})$.