Dynamical Systems
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Sunday 26 April
Let $ 1<\beta< 2 $, the sequence $\alpha(\beta)=\alpha(\beta)_1\alpha(\beta)_2\dotsb $ be the quasi-greedy $ \beta $-expansion of $ 1 $, and $ t\in [0,1) $ be a bifurcation parameter. The $\beta$-transformation is defined to be $T_{\beta}(x)=\beta x (mod 1) $ for $x\in [0,1)$. The Hausdorff dimension of the survivor set $K(t)=\{x\in [0,1)\colon T_{\beta}^k(x)\not\in (0,t), \forall k\geq0\} $ is equal to $ -\frac{\ln\lambda}{\ln\beta} $ under the condition that $ \sum_{i=k}^{\infty}\frac{\alpha(\beta)_i }{\beta^i}\geq t $ for any $ k\geq 1 $, where $ \lambda\in (0,1) $ is the smallest positive solution of the equation $\sum_{n=1}^{\infty}(\alpha(\beta)_n-t_n)x^n=1$ with $(t_n) $ being the quasi-greedy $\beta$-expansion of $t$. And the local Hölder exponent of the Hausdorff dimension function of $K(t) $ is larger than the value of the function itself.
Analysis of PDEs
On Global-in-time Solutions of Incompressible MHD Equations with Small Alfvén Numbers
In 1965 Kraichnan pointed out that a sufficiently strong background magnetic field, i.e. the case of small Alfvén number, will reduce the nonlinear interaction and inhibit the formation of strong gradients in the magnetohydrodynamic (abbr. MHD) system with $\mu=\nu\geqslant 0$, where ${\mu}$ and $\nu $ are the coefficients of kinematic viscosity and resistivity resp.. This means that the MHD system with ${\mu}=\nu\geqslant 0$ admits global-in-time large perturbation solutions with small Alfvén numbers. The existence of such large perturbation solutions was first mathematically verified in Hölder spaces by Bardos–Sulem–Sulem for the case ${\mu}=\nu= 0$ in 1988, and in Sobolev spaces by Cai–Cui–Jiang–Liu for the case ${\mu}=\nu> 0$ recently. In this paper, we further found a similar result for the general case “${\mu}>0$ and $\nu>0$", and provide a rigorous proof by developing a new approach, which includes a key bilinear estimate for dealing with the nonlinear interaction terms. Moreover both additional results for the vanishing behavior of the nonlinear interaction and the small Alfvén number limit of solutions are also established.
Read the full abstract
Information Theory · Cross-listed from cs.AI
Non-Stationarity Breaks Permutation Surrogates in Multi-Agent Reinforcement Learning: Diagnosis and Remedies
Reporting guidance for information-theoretic measures is rarely tested against ground truth. We test one guardrail in two multi-agent reinforcement learning games, a social dilemma and a coordination race, where directed influence between selected agent pairs is zero by construction, over 100 seeds. Omitting one precondition, exclusion of the non-stationary training transient, gives false-positive rates of 100.00% and 99.95%: agents annealing exploration independently, in runs that never met, are flagged as influencing one another. Excluding the transient reaches 3.05% in the social dilemma but 11.8% in the coordination game, so the non-stationarity must be treated and exclusion is neither the only way nor sufficient. What we recommend instead changes the null model. Series, statistic and estimand are left untouched: permuting the source within blocks of training time reaches 5.25% and 5.50%, the only one of the three at or below the size of the test in both games. The construction is not new, being a restricted permutation local to blocks of training time; the measurement is. A third null control, four learners in the social dilemma, defeats all three, and there conditioning costs three times what ours does, 15.20 points against 4.55. Titrating injected links separates it from conditioning on identical pairs, 82.5% against 58.0%, while the ablated test reports a positive with or without a link, so its apparent sensitivity is uninformative. Five block counts spanning 16 to 256 land in the nominal region. Code and data are released.
Read the full abstract
Mathematical Physics
Gradual eigenvector ergodization in coupled Ginibre matrices
Non-Hermitian random matrices provide a useful framework for understanding universal characteristics of dissipative quantum chaotic systems with loss or gain. We consider a model of two such systems represented by two independent $N\times N$ complex Ginibre matrices interacting via a deterministic matrix $c{\bf 1}_N$, where $c$ is the complex coupling parameter whose magnitude $|c|$ controls the interaction strength. We characterize quantitatively how the eigenvectors of the whole system, initially localized in one of the individual subsystems for $|c|=0$, eventually spread over the full system with growing interaction strength. The resulting asymptotic formula describing such spread in the limit $N\to \infty$ is very explicit and provides a full picture of the gradual ergodization of eigenvectors as a function of the coupling parameter $|c|$ in the whole transition regime. As a by-product of our method we also compute the mean eigenvalue density for our model at the origin of the spectral bulk $z=0$ in the fully ergodic regime, when the coupling is scaled with the matrix size as $c=\sqrt{N}\tilde{c}$. We find that as $N\to \infty$ the limiting density at the origin vanishes beyond the critical value $|\tilde{c}|=1.$ This is compatible with the expected split of the density support in the complex plane into two disjoint domains.
Read the full abstract
Mathematical Physics · Cross-listed from eess.SY
Defining the Magnetization State of LCF Magnets: From Material Properties to Motor-Level Metrics
Variable flux memory motors, which employ Low Coercive Force (LCF) magnets, achieve extended high-efficiency operation through controllable magnetization states. To address the need for a unified approach to defining and comparing the magnetization state (MS) across material and motor levels, this paper proposes four MS definitions: two based on intrinsic material properties-magnetic flux density B and magnetic polarization J-and two based on motor-level quantities-fundamental flux linkage and back-EMF components. These definitions are evaluated across the id, iq operating plane using finite element analysis on an interior PMSM with a hybrid magnet configuration (LCF and HCF: High Coercive Force) and a defined circuit setup. The results clarify the relationship between material-level behavior and measurable motor quantities. The proposed framework provides guidance for selecting appropriate MS metrics depending on the application objective, whether for material analysis, control implementation, or condition monitoring in variable flux machines.
Read the full abstract
Numerical Analysis
A well posed and stable canonical evaporation model problem for phase-change in two-phase flows
We formulate a well posed interface formulation for canonical one-dimensional evaporation two-phase model problems (the Stefan and Sucking problems) commonly used to validate production codes. We focus on the interface between the vapor and the liquid and derive conditions leading to an energy bound and well-posedness. Next, by mimicking the continuous analysis, we discretize using high order accurate numerical methods on summation-by-parts form, impose the interface conditions weakly and prove energy stability.
Read the full abstract
Combinatorics
Nonlinear maps preserving the polynomial
Let $\mathbb F$ be a field and $P \in \mathbb F [x_1,\ldots, x_n]$ be a homogeneous polynomial such that $|\mathbb F| > \deg(P)$ and $\phi, \psi\colon \mathbb F^n \to \mathbb F^n$ be two maps such that $P(\mathbf{x} + \lambda\mathbf{y}) = P(\phi(\mathbf{x}) + \lambda \psi (\mathbf{y}))$ for all $\lambda \in \mathbb F$ and $\mathbf{x}, \mathbf{y} \in \mathbb F^n.$ We provide the characterization of all such $\phi$ and $\psi$ for all polynomials in the case if $\mathrm{char}(\mathbb F) = 0$ and for all polynomials satisfying certain condition in the case if $\mathrm{char}(\mathbb F) > 0$. This characterization generalizes the existing results regarding the linear maps on matrices preserving the determinant, the immanant and other homogeneous polynomial functions of matrix entries. To obtain the main result of this paper, we introduce the vector space $\mathcal L_{P} \subseteq {\mathbb F^n}^*$ spanned by the range of the gradient field of $P \in \mathbb F[x_1,\ldots, x_n]$. Being a linear invariant associated with $P,$ this space has several remarkable properties and may also be used for studying the linear maps preserving $P$. In addition, we demonstrate how the main result could be applied to the particular polynomial matrix invariants. Namely, we provide an explicit description of corresponding pairs of nonlinear maps $\phi, \psi$ for the case where $P$ is equal to the Cullis' determinant of $n\times k$ rectangular matrix (with the assumption that $n \ge k + 2$ and $k \ge 3$).
Read the full abstract
Mathematical Physics
Deformed and undeformed localized wave solutions for the two-component (2+1)-dimensional Fokas-Lenells equation
In this paper, we focus on the two-component (2+1)-dimensional Fokas-Lenells equation, which models the propagation of ultrashort optical pulses in nonlinear media with multi-mode interactions and multi-dimensional effects. Firstly, we construct the determinant form of the generalized Darboux transformation (DT). Secondly, we obtain deformed solitons, deformed positons on the zero background and deformed breathers, deformed Y-shaped breathers on the nonzero backgrounds by DT method. Finally, the undeformed solutions including higher-order rogue wave solutions and breather-rogue wave solutions are derived by generalized DT. This work enriches the solution family associated with the equation, but also illustrates the efficiency of DT method in multi-dimensional and multi-component systems.
Read the full abstract
Analysis of PDEs
Uniqueness of Blow-ups for the Superconductivity Free Boundary Problem
We study the free-boundary equation \[ \Delta u=\chi_{\{|\nabla u|>0\}} \] near the origin. We prove that, at a singular point of \(\partial\{|\nabla u|>0\}\), the quadratic blow-up is unique. As noted in \cite[Notes to Chapter 7]{PSU2012}, little is known about the singular set for this problem. The usual Weiss–Monneau monotonicity argument does not seem to apply directly, because the inactive set is determined by the vanishing of \(\nabla u\), rather than by a sign condition on \(u\). The proof follows the quadratic part of the rescalings. Projecting onto the trace-free quadratic harmonics yields a finite-dimensional differential equation for the quadratic coefficient. Together with a Lyapunov identity and estimates on dyadic annuli, this implies convergence of the quadratic coefficient, and hence uniqueness of the blow-up.
Read the full abstract
General Topology
Countable Fan Tightness and Selection Games in Group-Valued Function Spaces
Game-theoretic characterizations of selection principles provide a powerful framework for analyzing covering properties through strategic interactions. For a Tychonoff space $X$ and a non-trivial metrizable arc-connected topological group $G$, we prove that Player~II has a winning strategy in the $\Omega$-Menger game on $X$ if and only if Player~II has a winning strategy in the countable fan tightness game on $C_p(X, G)$ at the identity function. The analogous equivalence is established between the $\Omega$-Rothberger game on $X$ and the countable strong fan tightness game on $C_p(X, G)$ at the identity function. These results extend the game-theoretic characterizations of Clontz from $G = \mathbb{R}$ to arbitrary metrizable arc-connected groups, and lift the selection-principle equivalences of Kočinac to the game-theoretic setting. As consequences, we establish that the game-theoretic tightness properties of $C_p(X,G)$ are independent of $G$, preserved under $G$-equivalence, and remain valid for Markov strategies.
Read the full abstract
Optimization and Control · Cross-listed from cs.GT
Strategically Robust Aggregative Games
In many multiagent settings, such as electric vehicle charging and traffic routing, agents must make decisions in the face of uncertain behavior exhibited by others. Often, this uncertainty arises from multiple sources, such as incomplete information, limited computation, or bounded rationality, ultimately impacting the aggregate behavior. To tackle this challenge, we follow recent work on strategically robust game theory and postulate that agents seek protection directly against deviations around the emergent behavior, as opposed to explicitly modeling all sources of uncertainty. Specifically, we propose that each agent protects itself against the worst-case aggregate behavior within an optimal-transport-based ambiguity set centered at the emergent aggregate population behavior. This leads to a novel equilibrium concept, called strategically robust Wardrop equilibrium, that enables one to interpolate between standard Wardrop equilibria (no robustness) and security strategies (maximum robustness). In the setting of convex aggregative games, we establish the existence of a pure strategically robust Wardrop equilibrium and provide tractable computational tools for computing it. Through an application in electric vehicle charging, we demonstrate that strategically robust Wardrop equilibria lead to better decisions, protecting agents against the uncertain aggregate behavior of the population. Remarkably, we also observe that strategic robustness can lead to lower equilibrium costs for all agents, uncovering a "coordination-via-robustification" effect.
Read the full abstract
Group Theory
Solvability of Groups via Cyclic Subgroup Count
In this paper, we provide new criteria for the solvability and supersolvability of a finite group based on its number of cyclic subgroups. A finite group G is called n-cyclic if it contains n cyclic subgroups. This paper also partially extends the classification of n-cyclic groups for n\geq 13.
Read the full abstract
Information Theory
Sensing-Assisted Secure Communication in MA-Aided ISAC: CRB Analysis and Robust Design
A core challenge in physical-layer security is the difficulty of obtaining the channel state information (CSI) of potential eavesdroppers. The inherent sensing functionality of integrated sensing and communication (ISAC) systems offers a promising solution by enabling the estimation of key parameters, such as the eavesdropper's angles of departure (AoDs). Capitalizing on this capability, we propose a sensing-assisted secure communication scheme for a movable antenna (MA)-aided ISAC system. The scheme comprises two stages: eavesdropper AoD sensing and secure communication. In the first stage, the base station (BS) optimizes the positions of its transmit and receive MAs to enhance sensing accuracy. We derive the closed-form Cramer-Rao bound (CRB) for the estimated AoDs to fundamentally characterize how MA positions influence the estimation uncertainty. In the second stage, the BS ensures secure communication by designing a robust beamforming vector that accounts for the AoD uncertainty region and by further optimizing the transmit MAs' positions to maximize the secrecy rate. To manage the end-to-end design, we formulate a joint optimization problem. This intractable non-convex problem is decomposed into two subproblems. For the first subproblem, we develop an alternating optimization (AO) algorithm to solve the CRB minimization problem. For the second subproblem, we solve the worst-case secrecy rate maximization problem using a method based on backward induction, convex hull construction, and AO. Finally, simulation results are provided to demonstrate the significant advantages of the proposed scheme compared to various benchmarks.
Read the full abstract
Number Theory
Large sieve inequality for sums of Legendre symbols over short intervals
Using the Burgess bound and the Selberg sieve, we obtain an upper bound for the second moment of sums of Legendre symbols over intervals , with the modulus ranging over primes . The bound is nontrivial and yields a power saving in , uniformly for , provided that , where as . This may be viewed as a short-interval analogue of a result of D. R. Heath-Brown (1995) on moments of quadratic character sums over the initial interval . In particular, it implies that, for any prescribed interval of this length, the quadratic residues and non-residues are asymptotically equidistributed for almost all primes . We also establish estimates for higher moments conditionally on the Generalised Riemann Hypothesis. These bounds rely on a sharp uniform estimate for the number of tuples of integers in a shifted interval whose product is a square.
Read the full abstract
Probability
Doubly Reflected Backward SDEs Driven by $G$-Brownian Motion with Quadratic Generator
In this paper, we study the doubly reflected backward stochastic differential equations driven by $G$-Brownian motion ($G$-BSDEs for short) when the generator has quadratic growth in the $z$-component. Based on the theory of $G$-BMO martingale and $G$-Girsanov theorem, we establish the existence and uniqueness result when the upper obstacle is almost a generalized $G$-Itô's process. Moreover, the solution can be approximated monotonically by the solutions to a family of penalized reflected $G$-BSDEs with a lower obstacle, which plays an important role to establish the relation between doubly reflected $G$-BSDEs and fully nonlinear partial differential equations with double obstacles.
Read the full abstract
Analysis of PDEs
On the Cauchy problem for the multi-dimensional compressible Navier-Stokes-Korteweg system: Global strong solutions with arbitrarily large initial data
Since the pioneering work of Korteweg (1901) and the subsequent refinement of capillary fluid models by Dunn and Serrin (1985), the global existence of strong solutions to the multi-dimensional compressible Navier-Stokes-Korteweg (NSK) system with arbitrarily large initial data has stood as a formidable open problem in fluid mechanics. This challenge was recently addressed by [Gu-Huang-Meng-Zhou, arXiv:2603.11762], who established the global existence of strong solutions for arbitrarily large initial data on the periodic domain $\mathbb{T}^N$ ($N=2,3$), provided that the viscosity coefficients satisfy a BD-type algebraic relation ($\mu(\rho) = \nu \rho^\alpha, \lambda(\rho) = 2\nu(\alpha-1)\rho^\alpha$) and the Korteweg stress tensor complies with a generalized Bohm identity ($\kappa(\rho) = \varepsilon^2 \alpha^2 \rho^{2\alpha-3}$). However, the existence of global strong solutions for the Cauchy problem under these conditions has remained an open question. In this paper, we resolve this problem by proving the global existence of strong solutions for the Cauchy problem ($\mathbb{R}^N$, $N=2,3$) with arbitrarily large initial data and non-vacuum far-field density. By employing a refined truncation analysis combined with an original modified Nash-Moser type iteration scheme, we overcome the difficulties arising from the lack of integrability for the density in the whole space. This result extends the large-data theory of compressible Navier-Stokes-Korteweg equations from bounded torus $\mathbb{T}^N$ to unbounded whole space $\mathbb{R}^N$, thus applicable to more general physical settings.
Read the full abstract
Optimization and Control
On Tikhonov Regularization for Direct and Indirect Data-Driven LQR Control
In recent years, the so-called `direct data-driven control' has been a topic of intense research, and it is expected that it will become prominent in future complex dynamical systems control. Within this framework, regularization not only implicitly enforces system identification, but also plays a crucial role in ensuring reliable closed-loop behavior. To further enhance the performance of data-driven controllers, we propose a new regularization method for direct data-driven LQR control of unknown LTI systems, based on a regularized covariance parameterization. Unlike existing data-driven techniques, the proposed method remains effective in handling ill-conditioned cases, such as when the data matrix has a large condition number. Then, we demonstrate that our method is equivalent to the indirect certainty-equivalence LQR combined with Tikhonov regularization. Furthermore, we extend our method to the design of controllers for unknown nonlinear systems using Koopman linear embedding. Finally, the simulation results validate the effectiveness and advantages of the proposed regularization method.
Read the full abstract
Dynamical Systems
Study of Air Pollution Impact on Human Health in Major Cities in India using Fractal Analysis
This study aims to examine the historical air pollution data from major Indian cities using fractal analysis to measure environmental risk. The fractal dimension of the major air pollutants is computed to evaluate the volatility and complexity of air quality patterns in Delhi, Kolkata, Mumbai, and Bengaluru. Fractal statistics is applied to analyze the fractal spectrum for each region, and further divided into different scales to capture the variation in air quality behaviour. This analysis reveals distinct fractal patterns for each city, showing different levels of environmental instability. These findings make fractal analysis a valuable tool for comparing air quality dynamics. This study offers a new way to measure changes in air quality, helping policymakers create targeted solutions for each city.
Read the full abstract
Functional Analysis
On positive Banach-Mazur distance
Combinatorics
On the Supremum of Singleton Ratios in Submodular Functions
Let $N$ be a finite set of cardinality $n$, and $a\in N$. A submodular function $f$ on $N$ with $f(a)=1$ is defined to be $a$-reduced if, for any decomposition $f=g+h$ into submodular functions where $h$ does not depend on $a$, it follows that $h$ is identically zero. The maximal possible value of $f$ on the remaining singletons defines a quantity $\lambda$ that characterizes the degree to which one variable can constrain the value of another; geometrically, it also limits the possible elongation of the associated submodular base polytope. We construct an example demonstrating that $\lambda$ can be as large as $\Omega(n/\log n)$. Furthermore, we establish a doubly exponential upper bound on $\lambda$. The problem of narrowing the gap between these bounds remains open.
Read the full abstract
Analysis of PDEs
On nonnegative solutions of the differential inequality $\Delta_pu+ \Delta_q u+V(x)u^s\leq 0$ on Riemannian manifolds
In this paper, we are concerned with differential inequalities with $(p,q)$-Laplacian operator on Riemannian manifolds. Using a test function argument, we establish Liouville-type theorems under the manifold's geometry and the potential's behavior at infinity. Finally, we give an example showing the sharpness when $V(x)$ is a positive constant.
Read the full abstract
Geometric Topology
Ropelength-Filtered Knot Densities
We study scale-invariant $p$-densities of knot types in Euclidean three-space, defined as the infimum over representatives of the length divided by an $L^p$-type mean of the pairwise chord lengths; the exponent $p$ is any value greater than minus one, including infinity, where the mean is the diameter. The unconstrained density is independent of the knot type. For exponents at most two, its common value is the density of the round circle, by the sharp mean-chord inequality; at the diameter endpoint it equals two; and for finite exponents greater than two it reduces to a planar convex extremal problem, in which the round circle fails to be extremal beyond an explicit threshold. To prevent this degeneration, which is caused by knotting at arbitrarily small scale, we introduce a ropelength filtration: at each level $\lambda$, the infimum is restricted to representatives whose ropelength is at most $\lambda$ times the ropelength of the knot type. The filtered density has minimizers, detects the unknot for exponents at most two, and converges to the unconstrained density as $\lambda$ tends to infinity. It is continuous in the exponent, including the diameter endpoint, and right-continuous in the filtration parameter. As a numerical test, we evaluate the density on published approximately tight configurations of the granny knot and the square knot. The sampled values differ by about 2.5 percent at exponent two, whereas their ordering is reversed at the diameter endpoint. These computations provide evidence that the ropelength filtration retains geometric information lost by the unconstrained theory.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Weak Moment Methods for Statistical Inference: with an Application to Robust Estimation
A companion paper develops a generalised framework in which a probability law is represented by a tempered distribution $T\in\mathcal{S}'$ - on the same footing as a density or characteristic function - and information is extracted by pairing $T$ with a positive Schwartz kernel $\varphi$ that acts as a measurement instrument rather than as part of the law; the resulting weak moments of all orders exist unconditionally. The present paper turns this into a methodology for statistical inference: estimation via weak moment matching, weak characteristic functions, weak cumulants, and regularised density reconstruction by Tikhonov inversion. Parametric inference proceeds directly from weak expectations, without reconstructing the density. The central result is that weak moment estimators are automatically locally robust in the sense of Hampel: their score is bounded and redescending, their influence function has a closed form, and their gross error sensitivity is finite in every identifiable parametric model - all inherited from the kernel's decay, with no ad hoc truncation. The kernel plays the role of Huber's tuning constant, but as a structural component of the model rather than a post-hoc modification. The framework is worked out for the Cauchy location model (where no classical moment estimator exists), a Student $t_3$ location-scale model, a bivariate Cauchy location model, a bivariate $t_3$ location-scale model, and a location of a moving atom (a non-dominated model). Monte Carlo comparisons show weak moment estimators matching or outperforming classical robust benchmarks under contamination; in the bivariate $t_3$ case the MLE scale estimate breaks down while the weak moment estimator converges at the parametric rate. The reconstruction route is inherently non-parametric and opens a path to weak density estimation.
Read the full abstract
Dynamical Systems · Cross-listed from physics.geo-ph
Studying the seismic activity of the earthquake in India using fractal analysis
Natural disaster strikes at any given moment from seemingly out of nowhere Akin to earthquake that strongly affects human with different magnitudes through the course of time. The main aim of this study is the fractal analysis of seismic activity data of India in the interval from 04-10-2016 to 31-05-2023. This includes analyzing the earthquake magnitudes and their epicenters using fractal statistics, which were studied at different scales to identify patterns in the data through the use of the fractal spectrum. The probabilities of future earthquakes with different magnitudes were estimated using the fractal model.
Read the full abstract
Optimization and Control
High-Probability Guarantees for Random Zeroth-Order (Stochastic) Gradient Descent
Zeroth-order optimization aims to minimize an objective function using only function evaluations, and is therefore fundamental in black-box optimization, hyperparameter tuning, bandit learning, and adversarial machine learning. While classical zeroth-order methods are well understood in expectation, much less is known about their high-probability behavior, especially for smooth and strongly convex objectives. In this paper, we establish high-probability convergence guarantees for random zeroth-order gradient descent in both deterministic and stochastic settings. For deterministic $L$-smooth and $\mu$-strongly convex objectives of $d$-dimension, we show that the classical two-query random zeroth-order method finds an $\varepsilon$-suboptimal solution with probability at least $1-\delta$ using \[ \mathcal{O}\left( \frac{dL}{\mu}\log\frac{1}{\varepsilon} + \log\frac{1}{\delta} \right) \] function queries. Thus, compared with the standard in-expectation complexity, only an additive logarithmic dependence on the confidence parameter is needed. For stochastic objectives, under a bounded-noise condition and without assuming uniformly bounded stochastic gradients, we prove that random zeroth-order stochastic gradient descent achieves an $\varepsilon$-suboptimal solution with probability at least $1-\delta$ using \[ \mathcal{O}\left( \frac{ d\log(1/\varepsilon) \left(\log(1/\varepsilon)+\log(1/\delta)\right) }{\varepsilon} \right) \] queries. Our results provide high-confidence counterparts to classical expectation-based zeroth-order convergence guarantees and clarify the additional cost required to obtain reliable performance guarantees.
Read the full abstract
Information Theory
DRL-Based Antenna Position Optimization For MA-Assisted OTFS System Under Imperfect CSI
In this paper, we introduce movable antenna (MA) technology into orthogonal time frequency space (OTFS) systems to enable wavelength-level antenna position optimization under imperfect channel state information (CSI), thereby mitigating deep fading. To accurately acquire CSI, we develop a sparse Bayesian learning method with variational inference (SBLVI) method. Based on estimated CSI, we formulate an MA position optimization problem with the objective of maximizing channel gain. Due to the highly non-convex character of the problem, we further develop a deep reinforcement learning (DRL) strategy to intelligently optimize MA positions. Simulation results show that the proposed SBLVI method significantly improves channel estimation accuracy over benchmark methods, and MA position optimization based on estimated CSI achieves substantially higher channel gains than the fixed-position antenna (FPA), demonstrating the effectiveness of the proposed MA-assisted OTFS system.
Read the full abstract
Probability
Scaling limits of Lévy walks with random velocities
This paper investigates Lévy walks with random velocities, extending classical models beyond constant speed assumptions. We derive scaling limits, demonstrating that diffusion depends on interplay between heavy-tailed duration and velocity distributions. Three distinct scaling regimes are identified, including a critical case with logarithmic corrections, offering a precise framework for modeling anomalous transport in heterogeneous systems.
Read the full abstract
Dynamical Systems
Root laminations of arbitrary degree
This paper studies the space of degree $d>1$ invariant q-laminations, i.e., geodesic laminations invariant under the $d$-tupling map of the circle and associated with equivalence relations. Our main construction associates a q-lamination with any degree $d$ critical portrait in a canonical way. Even though somewhat technical, this is the initial step in the program of classification of all degree $d$ invariant q-laminations.
Read the full abstract
Mathematical Physics · Cross-listed from cs.LG
Hamiltonian Graph Inference Networks: Joint structure discovery and dynamics prediction for lattice Hamiltonian systems from trajectory data
Lattice Hamiltonian systems underpin models across condensed matter, nonlinear optics, and biophysics, yet learning their dynamics from data is obstructed by two unknowns: the interaction topology and whether node dynamics are homogeneous. Existing graph-based approaches either assume the graph is given or, as in $\alpha$-separable graph Hamiltonian network, infer it only for separable Hamiltonians with homogeneous node dynamics. We introduce the Hamiltonian Graph Inference Network (HGIN), which jointly recovers the interaction graph and predicts long-time trajectories from state data alone, for both separable and non-separable Hamiltonians and under heterogeneous node dynamics. HGIN couples a structure-learning module – a learnable weighted adjacency matrix trained under a Hamilton's-equations loss – with a trajectory-prediction module that partitions edges into physically distinct subgraphs via $k$-means clustering, assigning each subgraph its own encoder and thereby breaking the parameter-sharing bottleneck of conventional GNNs. On three benchmarks – a Klein–Gordon lattice with long-range interactions and two discrete nonlinear Schrödinger lattices (homogeneous and heterogeneous) – HGIN reduces long-time energy prediction error and trajectory prediction error by six to thirteen orders of magnitude relative to baselines. A symmetry argument on the Hamiltonian loss further shows that the learned weights encode the parity of the underlying pair potential, yielding an interpretable readout of the system's interaction structure.
Read the full abstract
Combinatorics
Prime Square Order Cayley Graph of Cyclic Groups of Particular Valency
As a vital link between group theory and graph theory, Cayley graphs provide a geometric framework for encoding algebraic structures. This study explores the properties of Cayley graphs derived from cyclic groups whose order is the square of the product of three distinct prime numbers. We specifically examine cases where the connecting set is defined by the collection of all elements with an order equal to the square of a prime. A comprehensive analysis of these graphs is presented, focusing on structural characteristics such as connectivity, Eulerian properties, and Hamiltonicity. Furthermore, we determine several key graph parameters, including the clique number, chromatic number, independence number, and diameter.