Algebraic Geometry
Tropical matroid Schubert varieties and the graded Möbius algebra
Seungkyu Lee
We introduce tropical matroid Schubert varieties, a tropical analogue of arrangement Schubert varieties associated with realisable matroids. We prove that the tropical
cohomology ring of the tropical matroid Schubert variety associated to any matroid $M$ is isomorphic to the graded Möbius
algebra $\operatorname{B}^\bullet(M)$. This yields a
geometric model for $\operatorname{B}^\bullet(M)$, extending the
geometric setting of arrangement Schubert varieties to arbitrary matroids, including non-realisable ones.
Read the full abstract ▾
Information Theory
Optimal Sampling and Actuation for Real-Time Monitoring of Markov Sources
Mehrdad Salimnejad, Anthony Ephremides, Marios Kountouris et al. (+1 more)
This paper studies efficient data management and timely information dissemination for real-time monitoring of an N-state Markov process, with the objective of enabling accurate state estimation and reliable actuation decisions. We analyze the real-time reconstruction error and the Age of Incorrect Information (AoII), and derive closed-form expressions for their time-averaged values under several sampling and transmission policies. We then formulate and solve constrained optimization problems to minimize the time-averaged reconstruction error and the average AoII under a time-averaged sampling frequency constraint. The resulting optimal sampling and transmission policies are compared to identify the conditions under which each policy is most effective. We further show that directly using the reconstructed state for actuation can degrade system performance, especially when the receiver is uncertain about the state estimate or when actuation is costly. These findings reveal that accurate state estimation alone does not necessarily lead to effective actuation, highlighting the importance of incorporating uncertainty into the decision-making process. To address this issue, we introduce a cost function, termed the Cost of Actions under Uncertainty (CoAU), which characterizes correct and incorrect actuation decisions under receiver-side uncertainty. We propose a randomized actuation policy and derive a closed-form expression for the probability of a correct actuation decision, defined as the event in which the CoAU equals zero. Finally, we formulate an optimization problem to find the optimal randomized actuation policy that maximizes this probability. The results show that the resulting policy substantially reduces incorrect actuator actions.
Read the full abstract ▾
All authors Mehrdad Salimnejad, Anthony Ephremides, Marios Kountouris, Nikolaos Pappas
Logic
Grothendieck's Equality vs Voevodsky's Equality
Thomas Eckl
We discuss how canonical and universal constructions, properties and characterizations interact with equality in the framework of Homotopy Type Theory, comparing it with Grothendieck's use of equality and shedding further light on (efficient) formalisation of mathematics. This is achieved by investigating examples that range from monoids, groups, rings and modules to
cohomology theories in the category of modules over commutative rings and culminate in a cohomological criterion of flatness.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.CC
An Unconditional Barrier for Proving Multilinear Algebraic Branching Program Lower Bounds
Deepanshu Kush
Since the breakthrough superpolynomial multilinear formula lower bounds of Raz (Theory of Computing 2006), proving such lower bounds against multilinear algebraic branching programs (mABPs) has been a longstanding open problem in algebraic complexity theory. All known multilinear lower bounds rely on the min-partition rank method, and the best bounds against mABPs have remained quadratic (Alon, Kumar, and Volk, Combinatorica 2020). We show that the min-partition rank method cannot prove superpolynomial mABP lower bounds: there exists a full-rank multilinear
polynomial computable by a
polynomial-size mABP. This is an unconditional barrier: new techniques are needed to separate $\mathsf{mVBP}$ from higher classes in the multilinear hierarchy. Our proof resolves an open problem of Fabris, Limaye, Srinivasan, and Yehudayoff (ECCC 2026), who showed that the power of this method is governed by the minimum size $N(n)$ of a combinatorial object called a $1$-balanced-chain set system, and proved $N(n) \le n^{O(\log n/\log\log n)}$. We prove $N(n) = n^{O(1)}$ by giving the chain-builder a binary choice at each step, biasing what was a symmetric random walk into one where the imbalance increases with probability at most $1/4$; a supermartingale argument combined with a multi-scale recursion yields the
polynomial bound.
Read the full abstract ▾
Probability
Delayed logistic equation as a limit of long memory Markov chains
Eldon Barros, Dirk Erhard, Tertuliano Franco et al. (+1 more)
We introduce and analyze a long-
memory continuous-time Markov chain on $\mathbb{R}_{+}$ whose jump mechanism depends explicitly on a state in the past. From the present state $x_0$, the process jumps to $x_0\left(1+\frac{1}{N}\right)$ or $x_0\left(1-\frac{x_{-\lfloor \tau N \rfloor}}{N^2}\right)$, each at rate $\tfrac{1}{2}$, where $x_{-\lfloor \tau N \rfloor}$ denotes the state located $\lfloor \tau N \rfloor$ jumps backward in time. Here the delay $\tau > 0$ is fixed and $N$ is the scaling parameter. The initial condition is prescribed by a vector of length $\lfloor \tau N \rfloor + 1$, all of whose entries are equal to $\mu N$. Using a genuine space-time replacement lemma, we prove that, as $N \to \infty$, the rescaled process converges to a deterministic limit governed by the Delayed Logistic Equation (also known as the Hutchinson equation) with delay $\tau$ and initial condition $\rho(t) \equiv \mu$ for $t \in [-\tau, 0]$.
Read the full abstract ▾
All authors Eldon Barros, Dirk Erhard, Tertuliano Franco, Milton Jara
Analysis of PDEs
Symmetry and rigidity results for Serrin's overdetermined type problems in weighted Riemannian manifolds
Laura Accornero and Giulio Ciraolo
We study Serrin's overdetermined boundary value problems in bounded domains on weighted Riemannian
manifolds. When the closure of the domain is compact, we establish a
rigidity result that characterizes both the solution and the geometry of the ambient
manifold. We further address the case of domains with non-compact closure for
manifolds conformally equivalent to the Euclidean space, possibly degenerating or becoming singular at a point, where both the weight and the conformal factor are radial functions.
Read the full abstract ▾
Algebraic Topology
On sifted homotopy colimits of algebras over an $N_{\infty}$-operad
Gregoire Marc
We prove that the forgetful functor from
algebras over an $N_{\infty}$-operad to equivariant spaces preserves sifted homotopy colimits
Analysis of PDEs
Two-species system with nonlocal interactions driven by Riesz potentials
Simone Fagioli and Valeria Iorio
This paper investigates a system of nonlocal continuity equations modelling the interaction of two species coupled through Riesz-type potentials. The model incorporates self- and cross-interaction kernels of possibly different fractional orders. By exploiting optimal transportation theory and the theory of gradient flows in Wasserstein spaces, we establish the existence of weak solutions under singularity assumptions on all interaction potentials, provided the cross-interaction ones satisfy a
symmetry condition. Our analysis extends previous results available for either single-species equations or multi-species systems with smoother cross-interaction kernels.
Read the full abstract ▾
Information Theory · Cross-listed from eess.SP
3D User Localization for Planar Arrays in LoS Near- and Far-Fields via Summed Phase Differences
Sergey Isaev and Nikola Zlatanov
This letter presents a phase-difference-based scheme for three-dimensional (3D) line-of-sight (LoS) user localization using a uniform planar array (UPA), applicable to both near-field and far-field regimes under the exact spherical-wave model. Unlike the previously studied two-dimensional (2D) uniform linear array (ULA) case, the 3D UPA case requires jointly exploiting the two array axes in order to recover the user's range, azimuth, and zenith angle. Adjacent-
antenna phase-differences are first estimated from uplink pilots and then summed along the array axes to obtain unwrapped phase-differences between widely separated
antenna elements. These summed phase-differences enable the construction of multiple three-equation systems whose solutions yield the user's range, azimuth, and zenith angle. We quantify the number of such equation systems, provide a representative closed-form
estimator that uses only three phase-difference sums, and propose an all-data nonlinear least-squares
estimator that exploits all available sums. Numerical results include a classical Fraunhofer near-field case and absolute 3D position RMSE in meters, and show near-CRB performance when the closed-form initialization is reliable. Moreover, unlike state-of-the-art baseline schemes, whose performance depends on well-tuned hyperparameters, the proposed
estimators are hyperparameter-free.
Read the full abstract ▾
Logic
Approximation of structures:local and global
Boris Zilber
We provide a mathematically rigorous definition of local approximation and demonstrate its applicability to some interesting classes of structures. In particular, we prove that any compact simple Lie group is locally approximated by finite groups. The definition and main examples are motivated by physics but the techniques are of model theory. Namely, we introduce the ultraproduct of emerging metric structures, which generalises the ultraproduct in metric model theory.
Read the full abstract ▾
Classical Analysis and ODEs
Characterizations of fractional operators via integral transforms
Daniel Cao Labora and Marc Jornet
In 1974, J. S. Lew established a reasonable
conjecture regarding an axiomatic characterization for the one-dimensional Riemann–Liouville integral. This
conjecture was proved by Cartwright and McMullen in 1978. After that, little further work has been done on this topic, except some extensions for the Stieltjes case in one and several variables. In this paper, we prove the necessity of the axioms established in the
conjecture of J. S. Lew using the Cauchy functional equation and Hamel bases. In addition, we give a proof for the characterization in several variables by employing the Titchmarsh
theorem, as a natural extension of the approach of Cartwright and McMullen. We also provide an alternative version and proof in one and several variables with Laplace transforms and the Cauchy functional equation, weakening parts of the continuity assumption. We show a similar result for the Riesz potential in terms of the
Fourier transform. Finally, we illustrate how the theory can be used for characterization in the context of fractional calculus with respect to a non-smooth integrator, based on transmutation and measures.
Read the full abstract ▾
Algebraic Topology
Pointed integral coalgebras and R-local homotopy theory
Manfred Stelzer
We show that, for a principal ideal domain R, the homotopy category of Bousfield R-local spaces injects fully faithful into a homotopy category of simplicial pointed flat coalgebras.
Analysis of PDEs
Well-Posedness of the Helmholtz Equation with Rough Coefficients
Peijun Li and Yichun Zhu
We establish the well-posedness of the Helmholtz equation with rough and compactly supported coefficients in Rd under sharp regularity assumptions. Using a paraproduct calculus in rescaled weighted Besov spaces, we rigorously define the product between the solution and the coefficient at the lowest regularity level without renormalization. A rescaled Lippmann-Schwinger formulation is shown to be equivalent to the Helmholtz equation with the Sommerfeld radiation condition. We prove existence, uniqueness, and explicit wavenumber dependent resolvent estimates in a general Lp setting, including an L2 theory relevant to scattering amplitudes. The results provide a sharp analytic foundation for wave propagation and scattering in highly irregular media.
Read the full abstract ▾
Information Theory
Signal Constellations with Enhanced Energy Efficiency for High-Speed Communication Systems
Mark Bykhovskiy
This paper proposes a new method for constructing multidimensional signal constellations (SC), referred to as SCOPT, for high-speed communication systems with enhanced energy efficiency (EE). In contrast to conventional approaches, the proposed method increases the minimum Euclidean distance (MED) between signals by increasing the normalized signal duration, without relying on coding or increasing transmit power. Analytical expressions for the demodulation error probability and the energy loss relative to the Shannon limit are derived. It is shown that, unlike classical Shannon-type constellations (SCSH), SCOPT enable reliable communication regimes in which the required signal-to-noise ratio may fall below the conventional Shannon limit within the adopted
geometric framework. The proposed constellations retain a simple structure compatible with standard modulation schemes such as QAM and APSK,making them suitable for practical implementation in modern communication systems. Numerical analysis demonstrates that SCOPT significantly outperform SCSH in terms of energy efficiency while requiring substantially shorter signal duration.
Read the full abstract ▾
Complex Variables
Identification of L-functions in the extended Selberg class by preimages of finite sets
Arpita Kundu and Abhijit Banerjee
In 2023, Li, Du, Yi proved a uniqueness
theorem for L functions in the extended Selberg class under the assumptions of positive degree, a shared functional equation, and the sharing of three complex values. This was later strengthened by the present authors, who showed that sharing an arbitrary finite set of complex values, counted with multiplicities, still forces equality of the two L functions, again under the assumption that they satisfy the same functional equation. In this paper, we significantly improve all these results. We completely remove the requirement that the two L functions satisfy the same functional equation, yet we still obtain the same strong uniqueness conclusion under far weaker hypotheses. As a major consequence, we prove that every
polynomial with distinct zeros is a strong uniqueness
polynomial for L functions.
Read the full abstract ▾
Probability
Uniform-in-time diffusion approximations for multiscale stochastic systems
Longjie Xie and Xicheng Zhang
This paper establishes a quantitative, uniform-in-time
diffusion approximation for the joint law of a broad class of fully coupled multiscale
stochastic systems. We derive a precise characterization of the limiting joint distribution as a specific skew-product of the conditional
equilibrium of the fast process and the homogenized law of the slow component, thereby providing a rigorous uniform-in-time formulation of the adiabatic elimination principle. The convergence rate explicitly separates the initial relaxation of the fast dynamics from the long-time homogenized
evolution and depends only on the regularity of the coefficients in the slow variable. As a consequence, we obtain the first quantitative identification of the limiting stationary distribution of the original multiscale system and prove the commutativity of the limits $\eps\to0$ and $t\to\infty$ for a large class of observables. Our framework accommodates unbounded and irregular coefficients, degenerate structures, and weakly mixing dynamics. We illustrate its scope with three applications: (i) a uniform-in-time averaging principle for fast-slow systems; (ii) a uniform Smoluchowski–Kramers approximation for degenerate Langevin systems, yielding convergence of the joint position-scaled velocity law and global-in-time asymptotics of key thermodynamic functionals (e.g., total energy,
entropy production, free energy); and (iii) the first uniform-in-time periodic homogenization result for SDEs with distributional drifts.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.LG
Performance of Neural and Polynomial Operator Surrogates
Josephine Westermann, Benno Huber, Thomas O'Leary-Roseberry et al. (+1 more)
We consider the problem of constructing surrogate operators for parameter-to-solution maps arising from parametric partial differential equations, where repeated forward model evaluations are computationally expensive. We present a systematic empirical comparison of neural operator surrogates, including a reduced-basis neural operator trained with $L^2_\mu$ and $H^1_\mu$ objectives and the
Fourier neural operator, against
polynomial surrogate methods, specifically a reduced-basis sparse-grid surrogate and a reduced-basis tensor-train surrogate. All methods are evaluated on a linear parametric
diffusion problem and a nonlinear parametric hyperelasticity problem, using input fields with algebraically decaying spectral coefficients at varying rates of decay $s$. To enable fair comparisons, we analyze ensembles of surrogate models generated by varying hyperparameters and compare the resulting Pareto frontiers of cost versus approximation accuracy, decomposing cost into contributions from data generation, setup, and evaluation. Our results show that no single method is universally superior.
Polynomial surrogates achieve substantially better data efficiency for smooth input fields ($s \geq 2$), with convergence rates for the sparse-grid surrogate in agreement with theoretical predictions. For rough inputs ($s \leq 1$), the
Fourier neural operator displays the fastest convergence rates. Derivative-informed training consistently improves data efficiency over standard $L^2_\mu$ training, providing a competitive alternative for rough inputs in the low-data regime when Jacobian information is available at reasonable cost. These findings highlight the importance of matching the surrogate methodology to the regularity of the problem as well as accuracy demands and computational constraints of the application.
Read the full abstract ▾
All authors Josephine Westermann, Benno Huber, Thomas O'Leary-Roseberry, Jakob Zech
Probability
Derivative estimates for SDEs with singular and unbounded coefficients
Pengcheng Xia, Longjie Xie and Xicheng Zhang
We develop a unified PDE-probabilistic framework for pointwise gradient and Hessian estimates of Markov
semigroups associated with
stochastic differential equations with singular and unbounded coefficients. Under mild local structural assumptions on the
diffusion matrix and integrability/regularity conditions on the drift, we obtain quantitative sharp short-time regularization estimates as well as long-time decay bounds (including exponential and
polynomial rates) for the first and second spatial derivatives of the
semigroup. A distinctive feature of our results is the explicit dependence of these estimates on local norms of the coefficients (through scale-invariant quantities), without requiring any global smoothness, boundedness or uniform ellipticity. In particular, our approach allows for degenerate or highly irregular behavior at infinity, subject to suitable local ellipticity and Lyapunov/ergodicity controls. As applications, we establish solvability and regularity results for Poisson equations on the whole space with singular coefficients, and we derive pointwise gradient estimates for SDEs with distributional drifts via a Zvonkin-type transform.
Read the full abstract ▾
Optimization and Control · Cross-listed from stat.ME
Convergence of projected stochastic natural gradient variational inference for various step size and sample or batch size schedules
Thomas Guilmeau, Hadrien Hendrikx and Florence Forbes
Stochastic natural gradient variational inference (NGVI) is a popular and efficient
algorithm for
Bayesian inference. Despite empirical success, the convergence of this method is still not fully understood. In this work, we define and study a projected
stochastic NGVI when variational distributions form an exponential family. Stochasticity arises when either gradients are intractable expectations or large sums. We prove new non-asymptotic convergence results for combinations of constant or decreasing step sizes and constant or increasing sample/batch sizes. When all hyperparameters are fixed, NGVI is shown to converge geometrically to a neighborhood of the optimum, while we establish convergence to the optimum with rates of the form $\mathcal{O}\left(\frac{1}{T^{\rho}} \right)$, possibly with $\rho \geq 1$, for all other combinations of step size and sample/batch size schedules. These rates apply when the target posterior distribution is close in some sense to the considered exponential family. Our theoretical results extend existing NGVI and
stochastic optimization results and provide more flexibility to adjust, in a principled way, step sizes and sample/batch sizes in order to meet speed, resources, or accuracy constraints.
Read the full abstract ▾
Analysis of PDEs
Weak-Strong Uniqueness for Second-Order Mean-Field Games
Rita Ferreira, Diogo Gomes and Bashayer Majrashi
We extend the weak-strong uniqueness principle for mean-field game (MFG) systems to a broad class of second-order stationary and time-dependent problems. Under standard monotonicity, growth, and coercivity assumptions on the
Hamiltonian, and relying strictly on the integrability exponents guaranteed by the existing theory for monotone MFG systems, we show that any weak solution must coincide with a given strong solution. Our analysis covers models with spatially dependent scalar
diffusion coefficients, using monotonicity arguments and a coefficient-adapted mollification strategy to manage the variable
diffusion terms. We extend this strategy to establish weak-strong uniqueness in the corresponding second-order, initial-terminal, time-dependent setting. Finally, to address the critical quadratic growth regime, we derive a new a priori second-order estimate for a stationary MFG system with logarithmic coupling. This estimate provides quantitative bounds on the solution in terms of the data, and yields weak-strong uniqueness in the range where the improved integrability yields $L^2$ control of the density. Since numerical and approximation methods for MFGs naturally yield weak solutions in the monotonicity sense, whereas strong solutions are known to exist in many settings, our results identify any weak limit produced by such methods with the strong solution whenever one exists.
Read the full abstract ▾
Optimization and Control
Distributed partial state estimation for linear state-space systems
Juhi Jaiswal, Thomas Berger and Nutan Kumar Tomar
This study is concerned with the problem of partial state estimation for linear time-invariant (LTI) distributed state-space systems. A necessary and sufficient condition is established in terms of a simple rank criterion involving the system coefficient
matrices, provided the communication graph is either directed, balanced and strongly connected or undirected and connected. The
estimator parameter
matrices are obtained by simple
matrix theory. Finally, a numerical example demonstrates the feasibility and effectiveness of the proposed theoretical results and design
algorithm.
Read the full abstract ▾
Mathematical Physics · Cross-listed from astro-ph.EP
Arches of chaos, heteroclinic connections of first-order MMRs and the chaotic transport of small bodies in the Sun-Jupiter system
Alessia Francesca Guido and Christos Efthymiopoulos
We investigate the heteroclinic connections between stable and unstable
manifolds of unstable periodic orbits associated with the most important mean motion resonances (MMRs) in the Sun-Jupiter planar restricted three-body problem. We explicitly compute the stable and unstable
manifolds of the unstable periodic orbits associated with the first order interior MMRs 2:1, 3:2, and the exterior MMR 2:3. We also compute short-time FLI maps showing the chaotic saddle structure created by the
manifolds of several interior or exterior MMRs other than the 1:1 (co-orbital) resonance. Transits of particles from the exterior to the interior of Jupiter's orbit and vice versa are allowed for Tisserand parameter lesser than 3, and are shown to exist through a variety of heteroclinic channels. Besides the classical ones by Koon et al., we find heteroclinic connections between
manifolds of short-period orbits around L3 and periodic orbits of interior or exterior first order MMRs, as well as direct connections between interior and exterior MMR
manifolds not involving co-orbital periodic orbits. Through these
manifolds and the corresponding FLI ridges, we explain the 'arches-of-chaos' in the asteroid orbital plane (a,e). Chaotic orbits shadowing heteroclinic trajectories exhibit resonance hopping, suggesting links to quasi-Hildas and Jupiter-family comets. Results are obtained in the circular RTBP but persist in the
elliptic problem.
Read the full abstract ▾
Information Theory · Cross-listed from eess.SP
DF-3DRME: A Data-Friendly Learning Framework for 3D Radio Map Estimation based on Super-Resolution Technique
Lin Zhu, Weifeng Zhu, Shuowen Zhang et al. (+2 more)
High-Resolution three-dimensional (3D)
radio maps (RMs) provide rich information about the
radio landscape that is essential to a myriad of wireless applications in the future wireless networks. Although deep learning (DL) methods have shown their effectiveness in RM construction, existing approaches require massive high-resolution 3D RM samples in the training
dataset, the acquisition of which is labor-intensive and time-consuming in practice. In this paper, our goal is to devise a data-friendly high-resolution 3D RM construction solution via training over a hybrid
dataset, wherein the RMs associated with a small fraction of environment maps (EMs) are of high-resolution, while those corresponding to the majority of EMs are of low-resolution. To this end, we propose a Data-Friendly 3D
Radio Map
Estimator (DF-3DRME), which comprises two processing stages. Specifically, in the first stage, we leverage the abundant low-resolution 3D RM samples to train a neural network, termed the LR-Net, for predicting the low-resolution 3D RM from the input EM, which provides a coarse characterization of the spatial
radio propagation. In the second stage, we employ an advanced super-resolution network, termed the SR-Net, to upscale the predicted low-resolution 3D RM to its high-resolution counterpart. Unlike the LR-Net, the SR-Net can be effectively trained with only the limited high-resolution 3D RM samples available in the hybrid
dataset. Experimental results demonstrate that the proposed framework achieves compelling reconstruction performance with only 4% of the EMs in the
dataset having high-resolution 3D RM labels, which significantly reduces data acquisition overhead and facilitates practical deployment.
Read the full abstract ▾
All authors Lin Zhu, Weifeng Zhu, Shuowen Zhang, Giuseppe Caire, Liang Liu
Statistics Theory · Cross-listed from cs.CL
Common TF-IDF variants arise as key components in the test statistic of a penalized likelihood-ratio test for word burstiness
Zeyad Ahmed, Paul Sheridan, Michael McIsaac et al. (+1 more)
TF-IDF is a classical formula that is widely used for identifying important terms within documents. We show that TF-IDF-like scores arise naturally from the test statistic of a penalized likelihood-ratio test setup capturing word burstiness (also known as word over-dispersion). In our framework, the alternative hypothesis captures word burstiness by modeling a collection of documents according to a family of beta-binomial distributions with a gamma penalty term on the precision parameter. In contrast, the null hypothesis assumes that words are binomially distributed in collection documents, a modeling approach that fails to account for word burstiness. We find that a term-weighting scheme given rise to by this test statistic performs comparably to TF-IDF on document classification tasks. This paper provides insights into TF-IDF from a statistical perspective and underscores the potential of hypothesis testing frameworks for advancing term-weighting scheme development.
Read the full abstract ▾
All authors Zeyad Ahmed, Paul Sheridan, Michael McIsaac, Aitazaz A. Farooque
Analysis of PDEs
Discrete adjoint gradient computation for multiclass traffic flow models on road networks
Paola Goatin, Axel Klar and Carmen Mezquita-Nieto
This paper applies a discrete adjoint gradient computation method for a multi-class traffic flow model on road networks. Vehicle classes are characterized by their specific velocity functions, which depend on the total traffic density, resulting in a coupled
hyperbolic system of conservation laws. The system is discretized using a Godunov-type finite volume scheme based on demand and supply functions, extended to handle complex junction coupling conditions – such as merges and diverges – and boundary conditions with buffer lengths to account for congestion spillback. The optimization of different travel-related performance metrics, including total travel time and total travel distance, is formulated as a constrained minimization problem and is accomplished through the use of an adjoint gradient approach, allowing for an efficient computation of sensitivities with respect to the chosen time-dependent control variables. Numerical simulations on a sample network demonstrate the efficiency of the proposed framework, particularly as the number of control parameters increases. This approach provides a robust and computationally efficient solution, making it suitable for large-scale traffic network optimization.
Read the full abstract ▾
Dynamical Systems · Cross-listed from cs.LG
Embedded Variational Neural Stochastic Differential Equations for Learning Heterogeneous Dynamics
Sandeep Kumar Samota, Reema Gupta and Snehashish Chakraverty
This study examines the challenges of modeling complex and noisy data related to socioeconomic factors over time, with a focus on data from various districts in Odisha, India. Traditional time-series models struggle to capture both trends and variations together in this type of data. To tackle this, a Variational Neural
Stochastic Differential Equation (V-NSDE) model is designed that combines the expressive dynamics of Neural SDEs with the generative capabilities of Variational Autoencoders (VAEs). This model uses an encoder and a decoder. The encoder takes the initial observations and district
embeddings and translates them into a Gaussian distribution, which determines the mean and log-variance of the first latent state. Then the obtained latent state initiates the Neural SDE, which utilize neural networks to determine the drift and
diffusion functions that govern continuous-time latent dynamics. These governing functions depend on the time index, latent state, and district
embedding, which help the model learn the unique characteristics specific to each district. After that, using a probabilistic decoder, the observations are reconstructed from the latent trajectory. The decoder outputs a mean and log-variance for each time step, which follows the Gaussian likelihood. The Evidence Lower Bound (ELBO) training loss improves by adding a KL-divergence regularization term to the negative log-likelihood (nll). The obtained results demonstrate the effective learning of V-NSDE in recognizing complex patterns over time, yielding realistic outcomes that include clear trends and random fluctuations across different areas.
Read the full abstract ▾
Optimization and Control
Theoretical Perspectives on Jabr-Type Convex Relaxations for AC Optimal Power Flow
Gabor Riccardi, Ambrogio Maria Bernardelli and Stefano Gualandi
The alternating current optimal power flow problem is a fundamental yet highly nonconvex optimization problem whose structure reflects both nonlinear power flow physics and the
topology of the underlying network. Among convex relaxations, the second-order cone relaxation introduced by Jabr has proven particularly influential, serving as a computationally efficient alternative to semidefinite relaxations and a foundation for numerous strengthening techniques. In recent years, a variety of approaches have been proposed to tighten Jabr-type relaxations, including cycle-based constraints, convex envelopes of multilinear terms, and dual reformulations. However, these developments are often presented independently, concealing their common
geometric and graph-theoretic foundations. This paper provides a structured review of strengthening techniques for the Jabr relaxation and develops a unifying perspective based on multilinear equalities. We reinterpret cycle constraints as multilinear consistency conditions, analyze their convexification through classical convex hull theory, and investigate the relationship between primal McCormick relaxations and dual extended formulations. In particular, we identify structural conditions under which these relaxations coincide and clarify the distinction between convexifying the interaction graph and convexifying the feasible set of the ACOPF. The resulting framework connects graph structure, multilinear convexification, and conic relaxations in a unified manner, offering both a conceptual synthesis of existing results and new insights for the design of stronger relaxations.
Read the full abstract ▾
General Topology
Invariant idempotent $\ast$-measures for generalized iterated function systems
Natalia Mazurenko and Mykhailo Zarichnyi
The notion of $\ast$-measure on a compact Hausdorff space can be defined for arbitrary continuous triangular norm $\ast$. The well-known Hutchinson-Barnsley theory deals with the iterated function systems (IFSs) of probability measures and establishes existence and uniqueness of invariant measures. In the previous paper, IFSs of $\ast$-measures were considered. In the present paper we deal with generalized invariant function systems (GIFSs) of $\ast$-measures, which are counterparts of GIFSs in the sense of Mihail and Miculescu. The notion of invariant $\ast$-measure is introduced for such GIFSs and we prove existence and uniqueness of such elements.
Read the full abstract ▾
Statistics Theory
Semiparametric Fisher Information in Models parametrized by a Normed Space
Telmo Pérez-Izquierdo
This paper studies semiparametric Fisher information in models parametrized by general normed spaces. The main contribution is to establish that positive semiparametric Fisher information is equivalent to the gradient of the parameter of interest lying in the range of the adjoint score operator. This result generalizes a key
theorem Van Der Vaart (1991) and provides a unified framework linking differentiability and information, beyond
Hilbert spaces. The paper develops a normed-space mean-square-differentiable models for two canonical problems: estimation of the average of a known transformation and estimation of a density at a point. In these applications, it shows that positive information holds if and only if the transformation has finite variance and if and only if the density has positive mass at the evaluation point, respectively. These findings offer a novel information-theoretic perspective on known minimax results and clarify the conditions under which root-n estimation is possible.
Read the full abstract ▾
Information Theory
On Minimum Distances for Error Correction and Detection of Generalized Network Code
Yulin Chen and Raymond W. Yeung
It is well known that the minimum distance for linear network codes plays the same role as the minimum distance for classical error control codes. However, Yang and Yeung (2008) discovered that for nonlinear network codes, the minimum distance for error correction is not always the same as the minimum distance for error detection. Inspired by the idea that the channel will affect the distances between the codewords, we establish the scheme of a generalized network channel and a generalized network code. Then, we systematically define the distances for error correction and error detection under the scheme of the generalized network code. We consider the joint error correction and detection in the generalized network code and obtain a complete characterization by introducing a distance and its refined version for this purpose. We enhance our understanding of the relation between various distances for error correction and detection in generalized network codes by proving some bounds on these distances.
Read the full abstract ▾