Combinatorics · Cross-listed from cs.SI
Representing Higher-Order Networks: A Survey of Graph-Based Frameworks
Takaaki Fujita and Florentin Smarandache
Many real-world phenomena can be naturally represented using graphs and networks. Classical graph models, however, are generally restricted to pairwise interactions and may therefore be insufficient for capturing the richer structural relationships encountered in practical systems. Higher-order graph formalisms extend the classical framework by incorporating multiway, hierarchical, temporal, multilayer, recursive, and tensor-based interactions, thereby enabling more expressive representations of complex systems. This book provides a comprehensive overview of mathematical concepts and frameworks for modeling higher-order networks. It surveys foundational notions, extended frameworks, and newly introduced formalisms, with particular emphasis on their underlying structural principles, interrelationships, and respective modeling roles. Its primary objective is to offer a unified perspective that enables readers to compare diverse higher-order network models and to identify suitable mathematical tools for both theoretical investigation and practical application. Now in its fourth edition, this volume presents an expanded, revised, and corrected treatment of foundational concepts, established extensions, and recently introduced structures, while maintaining a unifying focus on the relationships among these models. It is intended to serve as a reference for researchers and students studying and comparing higher-order network models in combinatorics,
topology, applied mathematics, and related fields.
Read the full abstract ▾
Analysis of PDEs · Cross-listed from physics.flu-dyn
A simplified model for coupling Darrieus-Landau and diffusive-thermal instabilities
Prabakaran Rajamanickam
A simplified phenomenological model is proposed to couple the long-wave Darrieus–Landau (DL) instability and the short-wave diffusive-thermal (DT) instability in premixed flames. By identifying a cubic coupling term in the linear dispersion relation, representing the leading-order interaction between hydrodynamic expansion and diffusive transport, this framework moves beyond the traditional treatment of these instabilities in isolation. Two distinct asymptotic regimes are identified: the first recovers the classical Michelson–Sivashinsky equation for order-unity positive Markstein numbers $\mathcal M>0$, the second reveals a distinguished DL-DT crossover regime where both instabilities participate at equal order. In this crossover limit, where the Markstein number is small ($\mathcal M \sim \sqrt{\epsilon}$ with $\epsilon$ measuring thermal expansion), a generalized
evolution equation is derived featuring a nonlocal stabilising term controlled by the hydro-diffusive number $\mathcal{N} = \mathcal A/\delta_L^2$, where $\mathcal A$ is the hydro-diffusive area – the characteristic area over which hydrodynamic and diffusive transport processes interact. This term remains active even when Markstein stabilisation vanishes. Numerical solutions in sufficiently large domains based on our model reveal a distinctive chaotic regime in which the characteristic DL cusp structures are in persistent competition with small-scale wrinkles. This minimal unified framework thus captures the essential coupled dynamics governing flame front instability and provides a tractable explanation for the fine-scale cellular structures and accelerated growth rates observed, without recourse to the full complexity of the complete conservation equations.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Safe Decentralized Operation of EV Virtual Power Plant with Limited Network Visibility via Multi-Agent Reinforcement Learning
Chenghao Huang, Jiarong Fan, Weiqing Wang et al. (+1 more)
As power systems advance toward net-zero targets, behind-the-meter renewables are driving rapid growth in distributed energy resources (DERs). Virtual power plants (VPPs) increasingly coordinate these resources to support power distribution network (PDN) operation, with EV charging stations (EVCSs) emerging as a key asset due to their strong impact on local voltages. However, in practice, VPPs must make operational decisions with only partial visibility of PDN states, relying on limited, aggregated information shared by the distribution system operator. This work proposes a safety-enhanced VPP framework for coordinating multiple EVCSs under such realistic information constraints to ensure voltage security while maintaining economic operation. We develop
Transformer-assisted Lagrangian Multi-
Agent Proximal Policy Optimization (TL-MAPPO), in which EVCS
agents learn decentralized charging policies via centralized training with Lagrangian regularization to enforce voltage and demand-satisfaction constraints. A
transformer-based
embedding layer deployed on each EVCS
agent captures temporal correlations among prices, loads, and charging demand to improve decision quality. Experiments on a realistic 33-bus PDN show that the proposed framework reduces voltage violations by approximately 45% and operational costs by approximately 10% compared to representative multi-
agent DRL baselines, highlighting its potential for practical VPP deployment.
Read the full abstract ▾
All authors Chenghao Huang, Jiarong Fan, Weiqing Wang, Hao Wang
Numerical Analysis
Fast elementwise operations on tensor trains with alternating cross interpolation
Marc K. Ritter
Tensor trains (TTs), also known as
matrix product states (MPS), are compressed representations of high-dimensional data that can be efficiently manipulated to perform calculations on the data. In many applications, such as TT-based solvers for nonlinear partial differential equations, the most expensive step is an elementwise multiplication or similar elementwise operation on multiple TTs. Known error-controlled
algorithms for such operations scale as $O(\chi^4)$, where $\chi$ is the TT rank. If the rank of the output is smaller than $\chi^2$, it is possible to formulate
algorithms with better scaling. In this work, we present the alternating cross interpolation (ACI)
algorithm that performs such operations in $O(\chi^3)$, while maintaining error control. We demonstrate these properties on
benchmark problems, achieving a significant speedup for TT ranks that are commonly encountered in practical applications.
Read the full abstract ▾
Information Theory
DUGC-VRNet: Joint VR Recognition and Channel Estimation for Spatially Non-Stationary XL-MIMO
Jinhao Nie, Guangchi Zhang, Miao Cui et al. (+2 more)
In this letter, we address spatially non-stationary near-field channel estimation for extremely large-scale multiple-input multiple-output (XL-
MIMO) systems with a hybrid combining architecture. One key challenge in the considered problem lies in that conventional channel estimation
algorithms typically struggle to effectively identify and adapt to the partial
antenna visibility caused by varying visibility regions (VRs), thereby compromising estimation accuracy. To perform joint VR recognition and channel estimation, we integrate a deep unfolding network (DUN) with a graph convolution network (GCN), leading to a Deep Unfolding and Graph Convolution coupled, Visibility Region Aware Network (DUGC-VRNet). By leveraging the channel's graph structure, the GCN infers and feeds back VR information to dynamically guide the DUN's updates, thereby enhancing reliable channel estimation under spatial non-stationarity. To reduce DUGC-VRNet's complexity, we apply weight
pruning to obtain a lightweight network. Simulation results demonstrate that the DUGC-VRNet and its pruned variant achieve superior channel estimation and more accurate VR recognition under spatially non-stationary conditions.
Read the full abstract ▾
All authors Jinhao Nie, Guangchi Zhang, Miao Cui, Hao Fu, Xiaoli Chu
Dynamical Systems
A Structural Reduction of the Collatz Conjecture to One-Bit Orbit Mixing
Edward Y. Chang
We reduce the Collatz
conjecture to a fixed-modulus, one-bit orbit-mixing problem. Working with the compressed odd-to-odd Collatz map, we prove exact low-depth decomposition formulas at depths K = 3, 4, 5, reducing block-discrepancy terms to explicit run statistics. We then prove a Map Balance
Theorem: among the 2^(K-3), 1 burst residues modulo 2^K that initiate gaps, the counts mapping to gap starts congruent to 3 versus congruent to 7 (mod 8) differ by exactly 1 for every K >= 5. Thus all residual bias is orbit-level, not map-level. For the dominant n congruent to 1 (mod 8) class, the gap outcome depends on a single binary variable, bit 4 of the orbit value at burst-ending times, reducing the
conjecture to whether every orbit visits two residue classes modulo 32 with sufficient balance along a sparse subsequence.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
The Born Rule as the Unique Refinement-Stable Induced Weight on Robust Record Sectors
Marko Lela
This paper proves a conditional structural uniqueness
theorem for induced weight on robust record sectors within an admissible
Hilbert record layer. Its
theorem target and additive carrier differ from those of the standard Born-rule routes: additivity is not placed on the full projector
lattice, but on disjoint admissible continuation bundles through an extensive bundle valuation, from which the sector-level additive law is inherited under admissible refinement. Accordingly, the result is not a Gleason-type representation
theorem in different
language, but a distinct uniqueness
theorem about induced sector weight inherited from bundle additivity on admissible continuation structure. Under two explicit structural conditions, internal equivalence of admissible binary refinement profiles and sufficient admissible refinement richness, the quadratic assignment is the only non-negative refinement-stable induced weight on robust record sectors. In the main
theorem, refinement richness is secured by admissible binary saturation. A supplementary proposition shows that dense admissible saturation already suffices if continuity of the profile function is added. Under normalization, the result reduces to the standard Born assignment.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.DS
Multi-LLM Query Optimization
Arlen Dean, Zijin Zhang, Stefanus Jasin et al. (+1 more)
Deploying multiple large
language models (LLMs) in parallel to classify an unknown ground-truth label is a common practice, yet the problem of optimally allocating queries across heterogeneous models remains poorly understood. In this paper, we formulate a robust, offline query-planning problem that minimizes total query cost subject to statewise error constraints which guarantee reliability for every possible ground-truth label. We first establish that this problem is NP-hard via a reduction from the minimum-weight set cover problem. To overcome this intractability, we develop a surrogate by combining a union bound decomposition of the multi-class error into pairwise comparisons with Chernoff-type concentration bounds. The resulting surrogate admits a closed-form, multiplicatively separable expression in the query counts and is guaranteed to be feasibility-preserving. We further show that the surrogate is asymptotically tight at the optimization level: the ratio of surrogate-optimal cost to true optimal cost converges to one as error tolerances shrink, with an explicit rate of $O\left(\log\log(1/\alpha_{\min}) / \log(1/\alpha_{\min})\right)$. Finally, we design an asymptotic fully
polynomial-time approximation scheme (AFPTAS) that returns a surrogate-feasible query plan within a $(1+\varepsilon)$ factor of the surrogate optimum.
Read the full abstract ▾
All authors Arlen Dean, Zijin Zhang, Stefanus Jasin, Yuqing Liu
Probability
Pinning in non-critical half-space geometric last passage percolation
Sayan Das, Evgeni Dimitrov and Zongrui Yang
We study a symmetrized (half-space) version of
geometric last passage percolation with a boundary parameter $c$ that interpolates between subcritical, critical, and supercritical behavior. This model gives rise to a family of interlacing random curves, or a line ensemble, which encode both the usual last passage time and its higher-rank analogues. Although these ensembles are understood in most space-time regions, their behavior near the diagonal – where the boundary effects are strongest – has remained unclear outside the critical regime. We determine the universal scaling limits of the line ensemble in this near-diagonal region for both subcritical ($c < 1$) and supercritical ($c > 1$) phases. In the subcritical case, after appropriate centering and scaling, the entire line ensemble converges to the pinned half-space Airy line ensemble, a universal Brownian Gibbsian object recently constructed as a canonical limit for half-space models in the KPZ universality class in arXiv:2601.04546. In the supercritical case, we prove an analogous convergence together with a curve-separation phenomenon: the lower curves converge to the same pinned half-space Airy limit, while the top curve decouples and converges to Brownian motion. These results essentially complete the asymptotic description of half-space
geometric last passage percolation and provide a new rigorous instance of the pinned half-space Airy line ensemble as a universal scaling limit.
Read the full abstract ▾
Number Theory
On factorial reciprocals in Cantor sets
Kehao Lin, Yufeng Wu and Siyu Yang
Let $C$ be the middle-third Cantor set. We show that \[\left\{\frac{1}{n!}: n\in\mathbb{N}\right\}\cap C=\left\{1, \frac{1}{5!}\right\}.\] This answers a question recently posed by Jiang [J. Lond. Math. Soc., 113(1):e70408, 2026]. Our approach extends to general missing-digit sets, showing that, in any such set, there are only finitely many elements of the form $\frac{1}{n!}$, all of which can be effectively determined.
Read the full abstract ▾
Algebraic Topology · Cross-listed from cs.CG
Persistence-based topological optimization: a survey
Mathieu Carriere, Yuichi Ike, Théo Lacombe et al. (+1 more)
Computational
topology provides a tool, persistent homology, to extract quantitative descriptors from structured objects (images, graphs, point clouds, etc). These descriptors can then be involved in optimization problems, typically as a way to incorporate topological priors or to regularize machine learning models. This is usually achieved by minimizing adequate, topologically-informed losses based on these descriptors, which, in turn, naturally raises theoretical and practical questions about the possibility of optimizing such loss functions using gradient-based
algorithms. This has been an active research field in the topological data analysis community over the last decade, and various techniques have been developed to enable optimization of persistence-based loss functions with gradient descent schemes. This survey presents the current state of this field, covering its theoretical foundations, the algorithmic aspects, and showcasing practical uses in several applications. It includes a detailed introduction to persistence theory and, as such, aims at being accessible to mathematicians and data scientists newcomers to the field. It is accompanied by an open-source library which implements the different approaches covered in this survey, providing a convenient playground for researchers to get familiar with the field.
Read the full abstract ▾
All authors Mathieu Carriere, Yuichi Ike, Théo Lacombe, Naoki Nishikawa
Dynamical Systems
Four Limit Cycles in Three-Dimensional Competitive Lotka-Volterra Systems of Class 28 in Zeeman's Classification
Mingzhi Hu, Zhengyi Lu and Yong Luo
In this paper, a three-dimensional competitive Lotka-Volterra system with four limit cycles is constructed for class 28 in Zeeman's classification. Combined with existing results – from Gyllenberg and Yan (2009) for class 27, from Wang, Huang and Wu (2011) for class 29, and from Yu, Han and Xiao (2016) for class 26 – our finding indicates that there exist systems with at least four limit cycles for each class among classes 26 $-$ 29.
Read the full abstract ▾
Information Theory
Digital Twin-Assisted Measurement Design and Channel Statistics Prediction
Robin J. Williams, Mahmoud Saad Abouamer and Petar Popovski
Prediction of wireless channels and their statistics is a fundamental procedure for ensuring performance guarantees in wireless systems. Statistical
radio maps powered by Gaussian processes (GPs) offer flexible, non-parametric frameworks, but their performance depends critically on the choice of mean and covariance functions. These are typically learned from dense measurements without exploiting environmental geometry. Digital twins (DTs) of wireless environments leverage computational power to incorporate
geometric information; however, they require costly calibration to accurately capture material and propagation characteristics. This work introduces a hybrid channel prediction framework that leverages uncalibrated DTs derived from open-source maps to extract geometry-induced prior information for GP prediction. These structural priors are fused with a small number of channel measurements, enabling data-efficient prediction of channel statistics across the entire environment. By exploiting the uncertainty quantification inherent to GPs, the framework supports principled measurement selection by identifying informative probing locations under resource constraints. Through this integration of imperfect DTs with statistical learning, the proposed method reduces measurement overhead, improves prediction accuracy, and establishes a practical approach for resource-efficient wireless channel prediction.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
Probabilistic Geometric Alignment via Bayesian Latent Transport for Domain-Adaptive Foundation Models
Aueaphum Aueawatthanaphisut and Kuepon Auewattanapisut
Adapting large-scale foundation models to new domains with limited supervision remains a fundamental challenge due to latent distribution mismatch, unstable optimization dynamics, and miscalibrated uncertainty propagation. This paper introduces an uncertainty-aware probabilistic latent transport framework that formulates domain adaptation as a
stochastic geometric alignment problem in representation space. A
Bayesian transport operator is proposed to redistribute latent probability mass along Wasserstein-type geodesic trajectories, while a PAC-
Bayesian regularization mechanism constrains posterior model complexity to mitigate catastrophic overfitting. The proposed formulation yields theoretical guarantees on convergence stability, loss landscape smoothness, and sample efficiency under distributional shift. Empirical analyses demonstrate substantial reduction in latent
manifold discrepancy, accelerated transport energy decay, and improved covariance calibration compared with deterministic fine-tuning and
adversarial domain adaptation baselines. Furthermore, bounded posterior uncertainty
evolution indicates enhanced probabilistic reliability during cross-domain transfer. By establishing a principled connection between
stochastic optimal transport geometry and statistical generalization theory, the proposed framework provides new insights into robust adaptation of modern foundation architectures operating in heterogeneous environments. These findings suggest that uncertainty-aware probabilistic
alignment constitutes a promising paradigm for reliable transfer learning in next-generation deep representation systems.
Read the full abstract ▾
Dynamical Systems
Advances on Stable Ergodicity of Toral Automorphisms
Fernando Argentieri and Andrea Ulliana
We prove that all ergodic
automorphisms of the $N$-dimensional
torus with two dimensional center are stably ergodic. This includes all ergodic
automorphisms in dimension $N\leq 5$ or $N=7$. This generalizes a previous result of Rodriguez-Hertz, that required an additional algebraic condition on the carachteristic
polynomial of the linear
automorphism. The core of the proof is a minimality criterion.
Read the full abstract ▾
Algebraic Topology
A theory of twisted umkehr maps
Anssi Lahtinen
We develop a theory of umkehr maps for twisted generalized homology theories. In this theory, interesting umkehr maps, including generalizations of important classical ones, are induced by cartesian morphisms of a certain category opfibred over the category of spaces and continuous maps, making it possible to access them through universal properties.
Read the full abstract ▾