Geometric Topology
Recognising conjugacy classes of Dehn twists on $\mathbb D_3$ via Dynnikov coordinates
Ferihe Atalan and Sergey Finashin
We describe in terms of Dynnikov coordinates the three orbits of the pure mapping class group action on the set of essential curves in a 3-punctured disc $\mathbb D_3$. For any essential curve $\gamma\subset\mathbb D_3$ we present an efficient
algorithm to untwist $\gamma$ into one of the 3 basic representatives of the orbits. In turn, we give transformation formulas between the Dynnikov and
torus $\mathbb Z^2$-coordinates for multicurves. Besides proving minimality of the
algorithm, we give an explicit minimal length formula in terms of the associated even continued fractions.
Read the full abstract ▾
Combinatorics
The chromatic number of $\mathbb{R}^8$ is at least 25
Jaan Parts
The lower bound for the chromatic number of the Euclidean space of dimension 8 is increased to 25.
Probability · Cross-listed from stat.ML
Power-Law Spectrum of the Random Feature Model
Elliot Paquette, Ke Liang Xiao and Yizhe Zhu
Scaling laws for neural networks, in which the loss decays as a power-law in the number of parameters, data, and compute, depend fundamentally on the spectral structure of the data covariance, with power-law
eigenvalue decay appearing ubiquitously in
vision and
language tasks. A central question is whether this spectral structure is preserved or destroyed when data passes through the basic building block of a neural network: a random linear projection followed by a nonlinear activation. We study this question for the random feature model: given data $x \sim N(0,H)\in \mathbb{R}^v$ where $H$ has $\alpha$-power-law spectrum ($\lambda_j(H ) \asymp j^{-\alpha}$, $\alpha > 1$), a Gaussian sketch
matrix $W \in \mathbb{R}^{v\times d}$, and an entrywise monomial $f(y) = y^{p}$, we characterize the
eigenvalues of the population random-feature covariance $\mathbb{E}_{x }[\frac{1}{d}f(W^\top x )^{\otimes 2}]$. We prove matching upper and lower bounds: for all $1 \leq j \leq c_1 d \log^{-(p+1)}(d)$, the $j$-th
eigenvalue is of order $\left(\log^{p-1}(j+1)/j\right)^{\alpha}$. For $ c_1 d \log^{-(p+1)}(d)\leq j\leq d$, the $j$-th
eigenvalue is of order $j^{-\alpha}$ up to a polylog factor. That is, the power-law exponent $\alpha$ is inherited exactly from the input covariance, modified only by a logarithmic correction that depends on the monomial degree $p$. The proof combines a dyadic head-tail decomposition with Wick chaos expansions for higher-order monomials and random
matrix concentration inequalities.
Read the full abstract ▾
Probability · Cross-listed from cond-mat.dis-nn
Rigorous Asymptotics for First-Order Algorithms Through the Dynamical Cavity Method
Yatin Dandi, David Gamarnik, Francisco Pernice et al. (+1 more)
Dynamical Mean Field Theory (DMFT) provides an asymptotic description of the dynamics of macroscopic observables in certain disordered systems. Originally pioneered in the context of
spin glasses by Sompolinsky and Zippelius (1982), it has since been used to derive asymptotic dynamical equations for a wide range of models in physics, high-dimensional statistics and machine learning. One of the main tools used by physicists to obtain these equations is the dynamical cavity method, which has remained largely non-rigorous. In contrast, existing mathematical formalizations have relied on alternative approaches, including Gaussian conditioning, large deviations over paths, or
Fourier analysis. In this work, we formalize the dynamical cavity method and use it to give a new proof of the DMFT equations for General First Order Methods, a broad class of dynamics encompassing
algorithms such as Gradient Descent and Approximate Message Passing.
Read the full abstract ▾
All authors Yatin Dandi, David Gamarnik, Francisco Pernice, Lenka Zdeborová
Classical Analysis and ODEs
Stability of the generalized Wehrl entropy and the local concentration of homogeneous polynomials
María Ángeles García-Ferrero and Joaquim Ortega-Cerdà
We study two notions of concentration for homogeneous
polynomials of degree $N$ in $d+1$ complex variables on the unit sphere: a local notion measuring the fraction of the $L^2$-norm supported on a measurable subset; and a global notion given by the generalized Wehrl
entropy. In both cases, the extremizers are known to be reproducing kernels, that is, monomials up to a
unitary rotation, by results of Lieb–Solovej. We establish stability results for both inequalities in higher dimensions. For the local concentration, we show that for sets of sufficiently small measure, the almost-maximizers are quantitatively close to reproducing kernels, both in the
polynomial and in the domain, extending previous resuls in one dimension. For the generalized Wehrl
entropy, we prove that for any non-linear convex function $\Phi$ and all sufficiently large degree $N$, the reproducing kernels are the unique minimizers up to stability, complementing recent results by Nicola-Riccardi-Tilli, which require a non-linearity condition near $1$ that exclude key examples such as the concentration functional. As a consequence, by passing to the large-$N$ limit, we recover stability results for both problems in the Bargmann-Fock space.
Read the full abstract ▾
General Topology · Cross-listed from physics.soc-ph
Distance Backbones Optimize Spreading Dynamics and Centrality Ranks in the Sparsification of Complex Networks
Bernardo Pereira, Felipe Xavier Costa and Luís M. Rocha
Detailed network models of social, biological and other complex systems are often dense, which increases their computational complexity in simulations and analysis. To address this challenge, graph sparsification is used to remove edges while preserving desired network properties. Distance backbones of weighted graphs, which remove edges that break a generalized triangle inequality for any given path-length measure, preserve all shortest paths of weighted graphs. They have been shown to typically sparsify graphs more, as well as preserve community structure and spreading dynamics better than alternative state-of-the-art methods. Here, We show that they significantly best preserve node centrality ranks, as well as local and global dynamics in spreading phenomena. This is done by introducing the distance backbone synthesis (DBS) to progressively sparsify weighted graphs according to a general family of nested distance backbones, whereby each edge is associated with the smallest distance backbone in which it appears. DBS provides a principled and natural method to sweep all degrees of sparsification possible while preserving connectivity, allowing us to precisely study (directed and undirected) weighted graph sparsification under multi-objective criteria. It provides an algebraically-principled explanation of edge importance by revealing the precise topological space associated with each edge. The theory is demonstrated with a battery of social contact networks obtained from real-world social activity in different scenarios. Our study also shows that the optimal preservation of node centrality and spreading dynamics happens for the distance backbone obeying the generalized triangle inequality for the path-length measure $g(x, y) = (\sqrt[3]{x}+\sqrt[3]{y})^3$, which removes more than half of the edges from the empirical networks studied.
Read the full abstract ▾
Dynamical Systems · Cross-listed from physics.med-ph
A mathematical model of tumor growth using fractional derivatives
Karen Escutia, Carlos Islas and Pablo Padilla
In this work, we investigate a fractional-order tumor growth model aimed at capturing
memory effects and nonlocal temporal dynamics inherent to tumor
evolution. The model is formulated using Caputo fractional derivatives and incorporates key biological mechanisms related to tumor growth, vascular interaction, and
cell clearance. To numerically solve the resulting fractional differential equations, a second-order fractional Runge-Kutta scheme is derived based on a truncated fractional Taylor expansion, providing an accurate and stable computational framework. The proposed model is calibrated using experimental tumor volume data from five patients, and its performance is evaluated through the Root Mean Square Deviation (RMSD) between numerical simulations and experimental observations. The results show that, for all patients considered, the fractional-order model significantly improves the agreement with experimental data compared to the classical integer-order formulation. An optimal fractional order {\alpha} < 1 is identified in each case, highlighting the relevance of
memory effects in tumor growth dynamics and their patient-specific nature. Further insight is obtained through phase-space and projection analyses, which reveal substantial
geometric differences between integer-order and fractional-order dynamics. Although the present study is based on a limited number of patient
datasets, the results demonstrate the potential of fractional-order modeling as a flexible and powerful framework for describing individualized tumor growth behavior. The proposed approach provides a solid basis for future extensions involving larger
datasets, uncertainty quantification, and the incorporation of treatment effects and control strategies.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ME
Variance Inference Beyond the Sandwich for Asymptotically Linear Estimators with Second-Order Remainders
Lin Li and Pengcheng Wu
Semiparametric
estimators admitting a von Mises expansion often reduce inference to the influence-function variance. This reduction is justified when the second-order remainder is negligible in variance, a condition that is stronger than the usual product-rate requirement guaranteeing classical asymptotic linearity. When the remainder contributes non-negligible variance, the standard sandwich can underestimate the total sampling variance and Wald intervals can undercover; we call this the near-boundary regime. We derive a finite-sample variance decomposition separating influence-function and remainder components, give a practical characterization of when sandwich variance can fail, and show that the leave-one-out jackknife and pairs cluster bootstrap can estimate the total variance under explicit regularity conditions. For the jackknife, consistency follows from a self-normalization argument; for the bootstrap, we work under a Mallows-2 consistency condition. An analytic expression for the amplification of the sandwich gap by intra-cluster correlation is derived for clustered data. A simulation study using a surrogate-assisted targeted learning
estimator in stepped-wedge cluster-randomized trials illustrates the regime: the variance ratio $\hat{V}_{\rm JK}/\hat{V}_{\rm Sand}$ is 1.14–1.38 and persistent across cluster counts, and the refined procedures substantially improve coverage.
Read the full abstract ▾
Optimization and Control
Tractable bank capital structure: optimal control under Basel III constraints
Erhan Bayraktar, Etienne Chevalier, Vathana Ly Vath et al. (+1 more)
Banks must optimize risky investments, dividend payouts, and capital structure under tight Basel III solvency and liquidity constraints, while costly equity issuance serves as a distress-recovery tool. We formulate this as a
stochastic control problem that reduces the high-dimensional balance-sheet dynamics to a tractable one-dimensional process in the asset-to-deposit ratio, with state-dependent investment limits. The resulting policy is simple and interpretable: pay dividends at an upper reflection barrier and, when needed, recapitalize only at the distress boundary, jumping to an optimal target level. We characterize these thresholds analytically and show their sensitivity to regulatory parameters. From a regulatory viewpoint, we use Monte Carlo simulation to solve an outer optimization problem and map the efficient frontier between shareholder value and survival probability, both with and without a leverage cap. In the illustrative parameter ranges studied here, tightening solvency requirements often yields the best safety–profitability trade-off.
Read the full abstract ▾
All authors Erhan Bayraktar, Etienne Chevalier, Vathana Ly Vath, Yuqiong Wang
Group Theory
Self-similarity of the generalized Baumslag-Solitar groups
Dessislava H. Kochloukova
We show that all residually finite generalized Baumslag-Solitar groups of rank $n \geq 1$, defined on a finite and connected graph, are self-similar. Furthermore we prove that all residually finite fundamental groups of (finite, connected) graph of groups where all vertex and edge groups are torsion-free and commensurable with the Heisenberg group and all edge groups properly embed in the corresponding vertex groups are self-similar.
Read the full abstract ▾
General Mathematics
Bessel Averaging, Fourier Decomposition, and the Value of the Borwein-Bailey-Girgensohn Series
Carlos Lopez Zapata
We study the Borwein–Bailey–Girgensohn sinusoidal series S_BBG = sum_{n=1}^\infty (1/n) * ((2+sin n)/3)^n, originally posed as an open problem by Borwein, Bailey, and Girgensohn, whose convergence was established by Boppana using the irrationality measure of pi. We present three unconditional results. First, applying the Weyl equidistribution
theorem with a quantitative Erdos–Turan bound, we split S_BBG = M + R, where M = sum_{n=1}^\infty I_n/n is a Bessel averaging series and |R| < infinity. Second, we evaluate M exactly via Fubini's
theorem and the
Fourier series of log(1-cos t): M = sum_{n=1}^\infty I_n/n = log 6. Third, we decompose the remainder R into a convergent series of
Fourier harmonics: R = sum_{k=1}^\infty 2*Re[G_k((2/3)e^{ik})], where each G_k(z) = sum_{n=1}^\infty c_k(n) z^n/n is a Dirichlet-type generating function built from the k-th
Fourier coefficients of (theta -> (1 + (sin theta)/2)^n). The series converges absolutely because |(2e^{ik})/3| = 2/3 < 1. Numerical computation strongly suggests S_BBG = Ei(log 3) = li(3) approx 2.16358...; we reduce this
conjecture to a single Diophantine identity for R and indicate the Mellin-transform approach most likely to settle it.
Read the full abstract ▾
Numerical Analysis
Maximum Entropy Least Squares Solutions of Overdetermined Linear Systems
Felice Iavernaro, Monica Lazzo and Lorenzo Pisani
We investigate the theoretical foundations of a recently introduced
entropy-based formulation of weighted least squares for the approximation of overdetermined linear systems, motivated by robust data fitting in the presence of sparse gross errors. The weight vector is interpreted as a discrete probability distribution and is determined by maximizing Shannon
entropy under normalization and a prescribed mean squared error (MSE) constraint. Unlike classical ordinary least squares, where the error level is an output of the minimization process, here the MSE value plays the role of a control parameter, and
entropy selects the least biased weight distribution achieving the prescribed accuracy. The resulting optimization problem is nonconvex due to the nonlinear coupling between the weights and the solution induced by the residual constraint. We analyze the associated optimality system and characterize stationary points through first- and second-order conditions. We prove the existence and local uniqueness of a smooth branch of
entropy-maximizing configurations emanating from the ordinary least squares solution and establish its global continuation under suitable nondegeneracy conditions. Furthermore, we investigate the asymptotic regime as the prescribed MSE tends to zero and show that, under appropriate assumptions, the limiting configuration concentrates on a largest subset of data consistent with the linear model, thus suppressing the influence of outliers. Two numerical experiments illustrate the theoretical findings and confirm the robustness properties of the method.
Read the full abstract ▾
Dynamical Systems
Combinatorial approximations of dynamical systems: a separated graph approach
Joan Claramunt
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs – a generalization of classical Bratteli diagrams – that encode the dynamics of a homeomorphism $h$ on a totally disconnected, compact metric space $X$. Unlike standard approaches, the separated graph framework allows us to explicitly disentangle the static structure of the space from the dynamics of the homeomorphism. We provide a step-by-step exposition of this construction applied to four fundamental examples: the two-sided shift, the bit-wise NOT (global flip) map, the classical odometer map and the shift map on the one-point compactification of the integers. Finally, we briefly discuss how minimal (and, more generally, essentially minimal) dynamical systems can be read directly from the separated graph. This approach builds upon recent work by P. Ara and the author, which provides a graph-theoretic model for dynamical systems given by surjective local homeomorphisms defined on totally disconnected compact metric spaces.
Read the full abstract ▾
Algebraic Geometry
Two-step nilpotent monodromy of local systems on special varieties
Junyan Cao, Ya Deng, Christopher D. Hacon et al. (+1 more)
We address a question of Campana by giving a criterion for when nilpotent local systems on quasi-projective varieties have 2-step nilpotent monodromy. As an application, we prove that the monodromy group of any complex local system on smooth complex quasi-projective variety that is special in the sense of Campana or $h$-special (e.g. containg a Zariski dense entire curve), is virtually 2-step nilpotent. This result sharply refines a
theorem of Cadorel, Yamanoi, and the second author. To establish this result, we develop a deformation theory for certain local systems on quasi-compact Kähler
manifolds by constructing universal deformations for such local systems.
Read the full abstract ▾
All authors Junyan Cao, Ya Deng, Christopher D. Hacon, Mihai Paun
Information Theory
DNA-MGC+: A versatile codec for reliable and resource-efficient data storage on synthetic DNA
Ramy Khabbaz, Jérémy Mateos, Marc Antonini et al. (+1 more)
The biochemical processes underlying DNA data storage, including synthesis, amplification, and sequencing, are inherently noisy, leading to insertion, deletion, and substitution errors as well as sequence dropouts that challenge reliable data
retrieval. Here we introduce DNA-MGC+, a DNA storage codec designed for reliable and resource-efficient
retrieval under diverse operating conditions. We evaluate DNA-MGC+ across various in silico and in vitro settings. In comparison with selected representative codecs, the results show that DNA-MGC+ consistently improves key performance metrics under explicit reliability constraints, including required sequencing depth, read cost, decoding time, storage density, and error-correction capability. In silico experiments show that DNA-MGC+ supports reliable decoding at error rates up to 24% for a 15-KB file, while separate scalability experiments demonstrate reliable decoding of files up to 200 MB at a 5% error rate. In vitro experiments involving a 24-KB file and electrochemical synthesis show that different DNA-MGC+ configurations achieve minimum sequencing depths below 3x and read costs below 3.5 nts/bit under both Illumina and Nanopore sequencing.
Read the full abstract ▾
All authors Ramy Khabbaz, Jérémy Mateos, Marc Antonini, Serge Kas Hanna
History and Overview of Mathematics
A Human Story of Curiosity and Relevance
Claire Burrin
Mathematics is changing. Computers are verifying proofs, checking calculations, and exploring complex structures that would overwhelm human effort. Yet curiosity-driven research is where tomorrow's breakthroughs are quietly prepared. In this invited article for the VSH-AEU Bulletin, these themes are illustrated through anecdotes centered on a mathematical object central to the author's work: the
lattice.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
High-Probability Bounds for SGD under the Polyak-Lojasiewicz Condition with Markovian Noise
Avik Kar, Siddharth Chandak, Rahul Singh et al. (+3 more)
We present the first uniform-in-time high-probability bound for SGD under the PL condition, where the gradient noise contains both Markovian and martingale difference components. This significantly broadens the scope of finite-time guarantees, as the PL condition arises in many machine learning and deep learning models while Markovian noise naturally arises in decentralized optimization and online system identification problems. We further allow the magnitude of noise to grow with the function value, enabling the analysis of many practical sampling strategies. In addition to the high-probability guarantee, we establish a matching $1/k$ decay rate for the expected suboptimality. Our proof technique relies on the Poisson equation to handle the Markovian noise and a probabilistic induction argument to address the lack of almost-sure bounds on the objective. Finally, we demonstrate the applicability of our framework by analyzing three practical optimization problems:
token-based decentralized linear regression, supervised learning with subsampling for
privacy amplification, and online system identification.
Read the full abstract ▾
All authors Avik Kar, Siddharth Chandak, Rahul Singh, Eric Moulines, Shalabh Bhatnagar, Nicholas Bambos
Differential Geometry
Weitzenböck Remainder Spectrum on Rational Homogeneous Varieties
Eder M. Correa, Lucas Almeida and Samuel Wainer
In this paper, we precisely describe the spectrum of closed invariant $(1,1)$-forms viewed as an operator acting on complex spinor bundles over rational homogeneous varieties. Using this result, we describe the spectrum of the Weitzenböck remainder of ${\rm{Spin}}^{c}$ Dirac operators on rational homogeneous varieties. In particular, we present an explicit formula for their smallest
eigenvalue. As a byproduct, we obtain a new lower bound for the
eigenvalues of the ${\rm{Spin}}^{c}$ Dirac operator, expressed in terms of Lie-theoretic data. Additionally, combining the Atiyah-Singer index
theorem with the Borel-Weil-Bott
theorem, we provide a complete classification of ${\rm{Spin}}^{c}$ structures on rational homogeneous varieties which admit harmonic spinors. In this last setting, we present an explicit formula for the index of the associated ${\rm{Spin}}^{c}$ Dirac operator in terms of Lie theory.
Read the full abstract ▾
Number Theory
Arithmetical structure of sumset intersections
Diego Marques and Melvyn B. Nathanson
The $h$-fold sumset of a set $A$ of integers is the set of all sums of $h$ not necessarily distinct elements of $A$. Let $(A_q)_{q=1}^{\infty}$ be a strictly decreasing sequence of sets of integers and let $A = \bigcap_{q=1}^{\infty} A_q$. Then $hA \subseteq \bigcap_{q=1}^{\infty} hA_q$ for all $h \geq 1$. Let $\mathcal{H}(A_q) = \{h \geq 1: hA = \bigcap_{q=1}^{\infty} hA_q\}$. The arithmetical structure of the sets $\mathcal{H}(A_q)$ is unknown. It is proved that for every $h_0 \geq 2$ there exist sequences $(A_q)_{q=1}^{\infty}$ such that $\{1,\ldots, h_0-1\} \subseteq \mathcal{H}(A_q)$ but $h_0 \notin \mathcal{H}(A_q)$ and also that there exist sequences $(A_q)_{q=1}^{\infty}$ such that $\{1, h_0 \} \subseteq \mathcal{H}(A_q)$ but $\{2,3, \ldots, h_0-1\} \cap \mathcal{H}(A_q) = \emptyset$.
Read the full abstract ▾
Combinatorics
Homogenized Graphical Shi Arrangements and Deformed Dumont Permutations
Sauvik Poddar, Rutuja Sawant and Umesh Shankar
We introduce the homogenized graphical Shi arrangement associated with a simple undirected graph $G$, which serves as a broad generalization of classical deformations of the braid arrangement, including the Shi and homogenized Linial arrangements studied by Lazar and Wachs. We demonstrate that the intersection
lattices of certain homogenized graphical Shi arrangements are isomorphic to the bond
lattices of naturally associated graphs. For a distinguished family of graphs, by employing non-broken-
circuit (NBC) techniques, we obtain explicit combinatorial interpretations of the arrangement's Möbius function and characteristic
polynomial. We achieve this by introducing generalisations of previously studied combinatorial objects: $\mathcal{R}$-deformed increasing-decreasing ($\mathcal{R}$-DID) forests and $\mathcal{R}$-D-permutations, establishing bijections between them to interpret the coefficients of the characteristic
polynomial in terms of $\mathcal{R}$-D-permutations with prescribed number of cycles. Furthermore, we explore refinements of $\mathcal{R}$-D-permutations by their starting letters. Finally, we also resolve an open
conjecture posed by Deutsch, Kitaev, and Remmel concerning the equidistribution of specific parity-constrained descent and ascent statistics.
Read the full abstract ▾
Commutative Algebra
Join-meet binomial algebras of distributive lattices
Barbara Betti and Takayuki Hibi
We investigate the defining ideal of the
algebra over a field generated by the join-meet binomials coming from a finite distributive
lattice. In the frame of
algebras with straightening laws, the problem when the defining ideal is generated by quadrics is studied.
Probability
The Non-Gaussian to Gaussian Transition: Pointwise Heat Kernel Estimates and Optimal Convergence Rates
Xianming Liu, Chongyang Ren and Mingyan Wu
We establish uniform pointwise estimates for the densities of a family of $\alpha$-stable processes with respect to the index $\alpha \in [\alpha_0,2]$ for some $\alpha_0>0$. In addition, we estimate the difference between the heat kernels of non-local and local operators, showing that it is controlled by the rate $2-\alpha$. Both estimates (see Proposition 2.4) are new to the literature. Furthermore, as an application, we achieve the optimal rate $2-\alpha$ for the pointwise estimate between the transition probabilities, as well as for the (weighted) total variation and Kantorovich distances between the invariant measures, of non-Gaussian and Gaussian
diffusion. These results are obtained under the assumption that the drifts are locally $\beta$-Hölder continuous, with the latter additionally requiring dissipativity. The results on transition probabilities (see
Theorem 2.3) are novel, while those on invariant measures (see
Theorem 2.7) significantly extend the existing literature.
Read the full abstract ▾
Analysis of PDEs
Concentrated solutions to fractional Schrödinger-Poisson system with non-homogeneous potentials
Lintao Liu and Haidong Yang
This paper mainly investigates several limit properties of normalized solutions for the fractional Schrödinger-Poisson system, including existence, concentration behaviors and local uniqueness. It is worth noting that our results on the existence and asymptotic behaviors of normalized solutions are obtained in a doubly nonlocal setting and without assuming homogeneity of the potential, which generalize the results in \cite{GDCDS} in several aspects and improve our previous work in \cite{LIUYANG}. Meanwhile, some precise properties of solution sequence such as energy estimates, decay estimates and uniform regularity are also established by introducing some new techniques.
Read the full abstract ▾
Mathematical Physics · Cross-listed from cond-mat.stat-mech
First-return time in fractional kinetics
M. Dahlenburg G. Pagnini
The first-return time is the time that it takes a random walker to go back to the initial position for the first time. We study the first-return time when random walkers perform fractional kinetics, specifically fractional
diffusion, that is modelled within the framework of the continuous-time random walk on homogeneous space in the uncoupled formulation with Mittag-Leffler distributed waiting-times. We consider both Markovian and non-Markovian settings, as well as any kind of symmetric jump-size distributions, namely with finite or infinite variance. We show that the first-return time density is indeed independent of the jump-size distribution when it is symmetric, and therefore it is affected only by the waiting-time distribution that embodies the
memory of the process. We perform our analysis in two cases: first jump then wait and first wait then jump, and we provide several exact results, including the relation between results in the Markovian and non-Markovian settings and the difference between the two cases.
Read the full abstract ▾
Probability · Cross-listed from stat.ML
Convergence of Two Time-Scale Stochastic Approximation: A Martingale Approach
Mathukumalli Vidyasagar
In this paper, we analyze the two time-scale
stochastic approximation (TTSSA)
algorithm introduced in Borkar (1997) using a martingale approach. This approach leads to simple sufficient conditions for the iterations to be bounded almost surely, as well as estimates on the rate of convergence of the mean-squared error of the TTSSA
algorithm to zero. Our theory is applicable to nonlinear equations, in contrast to many papers in the TTSSA literature which assume that the equations are linear. The convergence of TTSSA is proved in the "almost sure" sense, in contrast to earlier papers on TTSSA that establish convergence in distribution, convergence in the mean, and the like. Moreover, in this paper we establish different rates of convergence for the fast and the slow subsystems, perhaps for the first time. Finally, all of the above results to continue to hold in the case where the two measurement errors have nonzero conditional mean, and/or have conditional variances that grow without bound as the iterations proceed. This is in contrast to previous papers which assumed that the errors form a martingale difference sequence with uniformly bounded conditional variance. It is shown that when the measurement errors have zero conditional mean and the conditional variance remains bounded, the mean-squared error of the iterations converges to zero at a rate of $o(t^{-\eta})$ for all $\eta \in (0,1)$. This improves upon the rate of $O(t^{-2/3})$ proved in Doan (2023) (which is the best bound available to date). Our bound is virtually the same as the rate of $O(t^{-1})$ proved in Doan (2024), but for a Polyak-Ruppert averaged version of TTSSA, and not directly. Rates of convergence are also established for the case where the errors have nonzero conditional mean and/or unbounded conditional variance.
Read the full abstract ▾
Mathematical Physics · Cross-listed from cond-mat.soft
Directed Polymer Transfer Matrices as a Unified Generator of Distinct One-Point Fluctuation Laws
Sen Mu, Abbas Ali Saberi, Roderich Moessner et al. (+1 more)
We numerically revisit the transfer-
matrix formulation of directed
polymers in random media and show that a common finite-dimensional framework organizes the canonical one-point fluctuation laws in $(1+1)$ dimensions. For a fixed realization of the bulk disorder, full-space partition functions are obtained from the same time-ordered product $W(t)$ through endpoint contractions or a Brownian-weighted initial vector, while the half-space construction modifies only the transfer rule at the absorbing boundary. These choices yield distributions consistent with the standard KPZ subclasses: Tracy–Widom GUE for point-to-point geometry, Tracy–Widom GOE for point-to-line geometry, Tracy–Widom GSE for half-space point-to-point geometry, and Baik–Rains for the stationary line-to-point construction. In all four cases, the free-energy fluctuations grow as $t^{1/3}$, and the low-order cumulants approach the corresponding universal
benchmarks. The
matrix-product formulation also provides access to intrinsic spectral observables. For the leading
eigenvalue $\lambda_1(t)$, the fluctuations of $\ln\lambda_1(t)$ exhibit an intermediate $t^{1/3}$ regime, while the standardized distribution remains distinct from the canonical
benchmark laws over the studied time range.
Read the full abstract ▾
All authors Sen Mu, Abbas Ali Saberi, Roderich Moessner, Mehran Kardar
Information Theory
Function-Correcting Codes for Linear and Locally Bounded Functions Over a Finite Chain Ring
Gyanendra K. Verma and Abhay Kumar Singh
In this paper, we further extend the study of function-correcting codes in the homogeneous metric over a chain ring $\mathbb{Z}_{2^s}$ for broader classes of functions, namely, locally bounded functions and linear functions, and for weight functions, modular sum functions. e define locally bounded functions in the homogeneous metric over $\mathbb{Z}_{2^s}^k$ and investigate the locality of weight functions. We derive a Plotkin-like bound for irregular homogeneous distance code over $\mathbb{Z}_4$, which improves the existing bound. Using locality properties of functions, we establish upper and lower bounds on the optimal redundancy. We provide several explicit constructions of function-correcting codes for locally bounded functions, weight functions, and weight distribution functions. Using these constructions, we further discuss the tightness of the derived bound. We explicitly derive a Plotkin-like bound for linear function-correcting codes that reduces to the classical Plotkin bound when the linear function is bijective, we further discuss a construction of function-correcting linear codes over $\mathbb{Z}_{2^s}$.
Read the full abstract ▾
Geometric Topology
Complex Hyperbolic Elliptics Preserving Lagrangian Planes
Mengmeng Xu and Yibo Zhang
For a regular, real
elliptic isometry $f$ of finite order in $\mathbf{H}_{\mathbb{C}}^2$, we determine the explicit cellular structure of the Ford domain of $\langle f \rangle$ with respect to the extended Cygan metric, provided the centre of the Ford domain lies on the ideal boundary of a Lagrangian plane preserved by $f$. As an application, we give a sufficient condition for complex
hyperbolic $(n,\infty,\infty)$-triangle groups to be discrete and faithful that is easy to verify.
Read the full abstract ▾
Probability
Backward doubly stochastic differential equations with or without reflection under weak conditions
Shuxian Gao, Ying Hu and Jiaqiang Wen
In this paper, we study the solvability of backward doubly
stochastic differential equations (BDSDEs, for short), both with and without reflection, under weak conditions on the generator. First, when the generator $f$ is of general growth in $y$ and linear growth in $z$, we establish the existence, uniqueness, comparison principle, and the existence of maximal solutions. Second, when $f$ is of linear growth in $y$ and quadratic growth in $z$ with bounded terminal value, we prove the existence, uniqueness, and comparison principle. Finally, when $f$ is of general growth in $y$ and quadratic growth in $z$ with bounded terminal value, we prove the existence of maximal solutions.
Read the full abstract ▾
Numerical Analysis · Cross-listed from astro-ph.EP
A user-friendly package and workflow for generating effective homogeneous rheologies for the study of the long-term orbital evolution of multilayered planetary bodies
Yeva Gevorgyan
We present a user-friendly, open-source Wolfram
Language package that automates the construction of an effective homogeneous generalized Voigt rheology for a spherically symmetric, incompressible layered body with Maxwell solid layers. It provides a practical bridge between layered interior models and time-domain simulations of
tidal evolution. The package combines three components: (i) a forward computation of the degree-2
tidal Love number based on the propagator-
matrix formulation for incompressible stratified viscoelastic bodies; (ii) numerical identification of the secular relaxation poles and residues of the layered model; and (iii) inversion of the resulting response into the compliance of an equivalent homogeneous generalized Voigt body. The implementation is based on the equivalence established for multilayer Maxwell bodies and includes an optional dominant-mode selection procedure for obtaining reduced rheological models over a prescribed frequency range. The package returns the parameters of the equivalent homogeneous model, including elastic, gravitational, viscous, and Voigt-element contributions, in a format suitable for downstream numerical applications. As a case study, we apply the package to a five-layer lunar interior model and obtain its equivalent generalized Voigt representation, together with a reduced model that preserves the
tidal response over the frequency interval relevant for orbital
evolution while using fewer relaxation elements. This package makes the reduction from stratified viscoelastic interiors to effective homogeneous rheologies reproducible and accessible. It allows physical
tidal dissipation models to be used in long-term orbital and
spin-
evolution studies without having to repeatedly solve the full layered boundary-value problem.
Read the full abstract ▾