Peer Revenue Returns subject to peer review

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Saturday 14 March

K-Theory and Homology

A general Mayer-Vietoris sequence in algebraic $K$-theory

This paper investigates the Mayer-Vietoris sequence for the Milnor square. While such sequences often involve elusive intermediate terms, we provide an explicit characterization of the key group $X$ in a new, more general variant of the sequence. By identifying $X$ as a categorical pullback, we provide a full, constructive proof of the modified Mayer-Vietoris sequence. Furthermore, we show that $X$ fits into a structural exact sequence involving the relative $K$-groups $K_{*}(A, B, I)$. Finally, we provide a homotopy-theoretic description of $X$ as the homotopy group of a suitable fiber, clarifying its structure, kernel , and image.
Read the full abstract

Mathematical Physics · Cross-listed from physics.bio-ph

Beyond Murray's Law: Non-Universal Branching Exponents from Vessel-Wall Metabolic Costs

Murray's cubic branching law ($\alpha=3$) predicts a universal diameter scaling exponent for all hierarchical transport networks, yet arterial trees yield $\alpha \sim 2.7-2.9$. We show that this discrepancy has a structural origin: Murray's universality is an artifact of cost homogeneity, not a biological property. Incorporating the empirical vessel-wall thickness law $h(r)=c_0 r^p$ ($p \approx 0.77$) introduces a third metabolic cost term $\propto r^{1+p}$ that renders the cost function inhomogeneous with incommensurate scaling exponents. By Cauchy's functional equation, homogeneity is necessary and sufficient for a universal branching exponent to exist; its absence implies non-universality, and Murray's law is identified as a singular degeneracy of the cost-function family rather than a general principle. We prove that the resulting scale-dependent exponent satisfies the strict bounds $(5+p)/2 < \alpha^*(Q) < 3$ independently of flow asymmetry (Theorem 4, Corollary 5). The static wall-tissue mechanism bounds the symmetric bifurcation exponent to $\alpha_t \in [2.90, 2.94]$ from measured parameters, marking a first-order symmetry breaking from Murray's law that narrows the empirical gap by one-third. The remaining discrepancy with the cardiovascular mean ($\alpha_{exp} \approx 2.70$) is not a model failure but a mathematical necessity that signals the independent contribution of pulsatile wave dynamics. Additionally, the wall cost breaks Murray's topological degeneracy, bounding the optimal branching number to small finite integers; binary bifurcation emerges as the physiologically selected minimum under steric constraints.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Generalized projection tests for function-valued parameters with applications to testing structural causal assumptions

Structural assumptions are central to the causal inference literature. In practice, it is often crucial to assess their validity or to test implications that follow from them. In many settings, such tests can be framed as evaluating whether a function-valued parameter equals zero. In this paper, we propose a class of generalized projection tests based on series estimators for function-valued parameters. We establish conditions under which the proposed tests are valid and illustrate their applicability through examples from the data fusion and instrumental variables literature. Our approach accommodates flexible machine learning methods for estimating nuisance parameters. In contrast to many existing approaches, the limiting distributions of the proposed test statistics are straightforward to compute under the null hypothesis. We apply our method to test the equality of conditional COVID-19 risk across vaccine arms in the COVID-19 Variant Immunologic Landscape (COVAIL) trial, and to test an instrumental variable compatibility condition in a study of the effect of family size on female labor supply.
Read the full abstract

History and Overview of Mathematics

A correspondence problem for mathematical proof

Mathematical proofs are often said to justify their conclusions by indicating the existence of a corresponding formal derivation. We argue that this widespread view relies on an under-examined notion of correspondence, or what it means for a particular derivation to ”correspond” to a particular proof. Mere existence of a formalization is not enough, and a substantive account of the required correspondence resolves into two criteria – adequate representation (of the original theorem) and tracking (of the steps in the original proof). An examination of the actually-existing formalization systems we have today shows the variety of quasi-empirical ways we establish these criteria, and points towards new burdens that may be placed on the future evolution of mathematics itself.
Read the full abstract

Analysis of PDEs

Notes on an intuitive approach to elliptic homogenization

Elliptic homogenization is used to determine coarse-grained properties of materials with features on small scales for heat transfer and elasticity. When microstructural features of a material have rapid, periodic fluctuations, the solution corresponding to a "homogenized" coefficient field closely resembles the true solution based on the heterogeneous material. Most presentations of elliptic homogenization rely on methods from perturbation theory, which can make an intuitive, physical understanding of the homogenized coefficients elusive. In this set of notes, we derive the homogenized coefficients for one- and two-dimensional elliptic boundary value problems based on arguments which are physically motivated, and with no recourse to perturbation theory. Then, we discuss homogenization of the Laplace-Beltrami operator for heat conduction on thin surfaces with multiscale curvature, an example which has seen minimal treatment in existing literature.
Read the full abstract

Friday 13 March

Information Theory · Cross-listed from cs.AI

The Geometry of Knowing: From Possibilistic Ignorance to Probabilistic Certainty – A Measure-Theoretic Framework for Epistemic Convergence

This paper develops a measure-theoretic framework establishing when and how a possibilistic representation of incomplete knowledge contracts into a probabilistic representation of intrinsic stochastic variability. Epistemic uncertainty is encoded by a possibility distribution and its dual necessity measure, defining a credal set bounding all probability measures consistent with current evidence. As evidence accumulates, the credal set contracts. The epistemic collapse condition marks the transition: the Choquet integral converges to the Lebesgue integral over the unique limiting density. We prove this rigorously (Theorem 4.5), with all assumptions explicit and a full treatment of the non-consonant case. We introduce the aggregate epistemic width W, establish its axiomatic properties, provide a canonical normalization, and give a feasible online proxy resolving a circularity in prior formulations. Section 7 develops the dynamics of epistemic contraction: evidence induces compatibility, compatibility performs falsification, posterior possibility is the min-intersection of prior possibility and compatibility, and a credibility-directed flow governs support geometry contraction. This is not belief updating. It is knowledge contraction. Probability theory is the limiting geometry of that process. The UKF and ESPF solve different problems by different mechanisms. The UKF minimizes MSE, asserts truth, and requires a valid generative model. The ESPF minimizes maximum entropy and surfaces what evidence has not ruled out. When the world is Gaussian and the model valid, both reach the same estimate by entirely different routes – convergent optimality, not hierarchical containment. We prove this (Theorem 9.1) and compare both on a 2-day, 877-step orbital tracking scenario. Both achieve 1-meter accuracy. The UKF is accurate but epistemically silent. The ESPF is accurate and epistemically honest.
Read the full abstract

Optimization and Control

Period-aware asymptotic gain with application to a periodically forced synchronization circuit

The classical asymptotic gain (AG) is a concept known from the input-to-state stability theory. Given a uniform input bound, AG estimates the asymptotic bound of the output. Sometimes, however, more information is known about the input than just a bound. In this paper we consider the case of a periodic input. Under the assumption that the system converges to a periodic solution, we introduce a new gain, called period-aware asymptotic gain (PAG), which employs periodicity to enable a sharper asymptotic estimation of the output. Since the PAG can distinguish between short-period ("high-frequency") and long-period ("low-frequency") signals, it is able to rigorously quantify such properties as bandwidth, resonant behavior, and high-frequency damping. We discuss how the PAG can be computed and illustrate it with a numerical example from the field of power electronics.
Read the full abstract

Optimization and Control

Response-Aware Risk-Constrained Control Barrier Function With Application to Vehicles

This paper proposes a unified control framework based on Response-Aware Risk-Constrained Control Barrier Function for dynamic safety boundary control of vehicles. Addressing the problem of physical model parameter mismatch, the framework constructs an uncertainty propagation model that fuses nominal dynamics priors with direct vehicle body responses. Utilizing simplified single-track dynamics to provide a baseline direction for control gradients and covering model deviations through statistical analysis of body response signals, the framework eliminates the dependence on accurate online estimation of road surface adhesion coefficients. By introducing Conditional Value at Risk (CVaR) theory, the framework reformulates traditional deterministic safety constraints into probabilistic constraints on the tail risk of barrier function derivatives. Combined with a Bayesian online learning mechanism based on inverse Wishart priors, it identifies environmental noise covariance in real-time, adaptively tuning safety margins to reduce performance loss under prior parameter mismatch. Finally, based on Control Lyapunov Function (CLF), a unified Second-Order Cone Programming (SOCP) controller is constructed. Theoretical analysis establishes convergence of Sequential Convex Programming to local Karush-Kuhn-Tucker points and provides per-step probabilistic safety bounds. High-fidelity dynamics simulations demonstrate that under extreme conditions, the method not only eliminates the output divergence phenomenon of traditional methods but also achieves Pareto improvement in both safety and tracking performance. For the chosen risk level, the per-step safety violation probability is theoretically bounded by approximately 2%, validated through high-fidelity simulations showing zero boundary violations across all tested scenarios.
Read the full abstract

Information Theory

JCAS-MARL: Joint Communication and Sensing UAV Networks via Resource-Constrained Multi-Agent Reinforcement Learning

Multi-UAV networks are increasingly deployed for large-scale inspection and monitoring missions, where operational performance depends on the coordination of sensing reliability, communication quality, and energy constraints. In particular, the rapid increase in overflowing waste bins and illegal dumping sites has created a need for efficient detection of waste hotspots. In this work, we introduce JCAS-MARL, a resource-aware multi-agent reinforcement learning (MARL) framework for joint communication and sensing (JCAS)-enabled UAV networks. Within this framework, multiple UAVs operate in a shared environment where each agent jointly controls its trajectory and the resource allocation of an OFDM waveform used simultaneously for sensing and communication. Battery consumption, charging behavior, and associated CO$_2$ emissions are incorporated into the system state to model realistic operational constraints. Information sharing occurs over a dynamic communication graph determined by UAV positions and wireless channel conditions. Waste hotspot detection requires consensus among multiple UAVs to improve reliability. Using this environment, we investigate how MARL policies exploit the sensing-communication-energy trade-off in JCAS-enabled UAV networks. Simulation results demonstrate that adaptive pilot-density control learned by the agents can outperform static configurations, particularly in scenarios where sensing accuracy and communication connectivity vary across the environment.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Advanced Quantum Annealing for the Bi-Objective Traveling Thief Problem: An $\varepsilon$-Constraint-based Approach

This paper addresses the Bi-Objective Traveling Thief Problem (BI-TTP), a challenging multi-objective optimization problem that requires the simultaneous optimization of travel cost and item profit. Conventional methods for the BI-TTP often face severe scalability issues due to the complex interdependence between routing and packing decisions, as well as the inherent complexity and large problem size. These difficulties render classical computing approaches increasingly inapplicable. To tackle this, we propose an advanced hybrid approach that combines quantum annealing (QA) with the $\varepsilon$-constraint method. Specifically, we reformulate the bi-objective problem into a single-objective formulation by restricting the second objective through adjustable $\varepsilon$-levels, determined within established upper and lower bounds. The resulting subproblem involves a sum of fractional terms, which is reformulated with auxiliary variables into an equivalent form. Subsequently, the equivalent formulation is transformed into a Quadratic Unconstrained Binary Optimization (QUBO) model, enabling direct solution via a quantum annealing (QA) solver. The solutions obtained from the quantum annealer are subsequently refined using a tailored heuristic procedure to further enhance overall performance. By leveraging the flexibility in selecting $\varepsilon$ parameters, our approach effectively captures a broad Pareto front, enhancing solution diversity. Experimental results on benchmark instances demonstrate that the proposed method effectively balances two objectives and outperforms baseline approaches in time efficiency.
Read the full abstract

All authors Nguyen Hoang Viet, Nguyen Xuan Tung, Trinh Van Chien, Won-Joo Hwang

Information Theory · Cross-listed from cs.AI

Theoretical Foundations of Latent Posterior Factors: Formal Guarantees for Multi-Evidence Reasoning

We present a complete theoretical characterization of Latent Posterior Factors (LPF), a principled framework for aggregating multiple heterogeneous evidence items in probabilistic prediction tasks. Multi-evidence reasoning arises pervasively in high-stakes domains including healthcare diagnosis, financial risk assessment, legal case analysis, and regulatory compliance, yet existing approaches either lack formal guarantees or fail to handle multi-evidence scenarios architecturally. LPF encodes each evidence item into a Gaussian latent posterior via a variational autoencoder, converting posteriors to soft factors through Monte Carlo marginalization, and aggregating factors via exact Sum-Product Network inference (LPF-SPN) or a learned neural aggregator (LPF-Learned). We prove seven formal guarantees spanning the key desiderata for trustworthy AI: Calibration Preservation (ECE <= epsilon + C/sqrt(K_eff)); Monte Carlo Error decaying as O(1/sqrt(M)); a non-vacuous PAC-Bayes bound with train-test gap of 0.0085 at N=4200; operation within 1.12x of the information-theoretic lower bound; graceful degradation as O(epsilon*delta*sqrt(K)) under corruption, maintaining 88% performance with half of evidence adversarially replaced; O(1/sqrt(K)) calibration decay with R^2=0.849; and exact epistemic-aleatoric uncertainty decomposition with error below 0.002%. All theorems are empirically validated on controlled datasets spanning up to 4,200 training examples. Our theoretical framework establishes LPF as a foundation for trustworthy multi-evidence AI in safety-critical applications.
Read the full abstract

Numerical Analysis

Stancu-Type Generalizations of Neural Network Operators with Perturbed Sampling Nodes

In this paper, we introduce a Stancu-type generalization of multivariate neural network operators (NNOs) by incorporating two parameters that perturb the sampling nodes. The proposed operators extend the existing NNOs by allowing flexibility in the placement of sampling nodes. We establish the well-definedness and boundedness of the operators and prove uniform convergence on compact domains. Furthermore, quantitative error estimates are derived in terms of the modulus of continuity, leading to a convergence rate result. A perturbation theorem is also established, showing how the Stancu-type operators differ from the existing NNOs. Numerical experiments are presented to illustrate the influence of the Stancu parameters on the approximations and to validate the theoretical results. Finally, an application to ECG signal reconstruction is considered, demonstrating that the proposed operators effectively preserve the essential characteristics of the signal while providing accurate approximations.
Read the full abstract

Probability

Parabolic-hyperbolic dichotomy through half-plane coexistence

Consider a unimodular random planar map (URM) with an invariant ergodic percolation having infinite primal and dual clusters. We say that there is half-plane coexistence if both the percolation and its dual have infinite clusters when restricted to a half-plane. Under mild assumptions on the percolation, we show that the URM is parabolic if and only if there is no half-plane coexistence, and it is hyperbolic if and only if there is half-plane coexistence. This extends the recent half-plane non-coexistence result for $\mathbb{Z}^2$ by Klausen and Kravitz and provides another manifestation of the parabolic-hyperbolic dichotomy for URM's.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

On thermalization in many-body classical Floquet systems

It is expected that a generic closed many-body system prepared in a well-behaved initial state and subjected to a periodic drive will eventually thermalize, i.e. approach the state of maximal entropy. This property, while compatible with and even demanded by the physical intuition, is much stronger than ergodicity or mixing and is difficult to justify mathematically. We describe an infinite set of classical many-body Floquet systems of algebraic origin for which thermalization of very general initial states can be proved. For example, we show that a Gibbs state of any sufficiently uniform local differentiable Hamiltonian heats up to infinite temperature at long times. We show that in agreement with the physical intuition, the only obstruction to thermalization is the existence of local observables which are periodic in time.
Read the full abstract

Probability · Cross-listed from stat.CO

The Continuous Rank Probability Score of a Generalized Beta-Prime Distribution and Some Special Cases

This working paper describes new results in derivations of the Continuous Ranked Probability Score of a generalized beta-prime distribution and several special cases, such as the Dagum distribution and Singh-Maddala distribution. Comparison with Monte Carlo estimates is also presented.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Measuring Extreme Tail Association

Simultaneous occurrences of extreme events need not imply symmetric or reciprocal tail dependence. However, most existing measures of extremal dependence are inherently symmetric and hence often fail to capture directional influence in tail association. We introduce a rank-based measure of Extreme Tail Association (ETA) for bivariate data quantifying such directional influence of one variable on another in extreme tail regions. The proposed estimator is easily computable, consistent with its population counterpart, and asymptotically normal under mild conditions, allowing for statistical inference. We further develop a formal test for asymmetry in tail association based on a multiplier bootstrap procedure. The practical relevance of the methodology is illustrated using data on extreme price movements in major cryptocurrencies. Beyond providing a flexible tool for extremal association, the proposed framework offers a substantive argument for investigating causal relationships in extreme scenarios.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Robust Sequential Tracking via Bounded Information Geometry and Non-Parametric Field Actions

Standard sequential inference architectures are compromised by a normalizability crisis when confronted with extreme, structured outliers. By operating on unbounded parameter spaces, state-of-the-art estimators lack the intrinsic geometry required to appropriately sever anomalies, resulting in unbounded covariance inflation and mean divergence. This paper resolves this structural failure by analyzing the abstraction sequence of inference at the meta-prior level (S_2). We demonstrate that extremizing the action over an infinite-dimensional space requires a non-parametric field anchored by a pre-prior, as a uniform volume element mathematically does not exist. By utilizing strictly invariant Delta (or \nu) Information Separations on the statistical manifold, we physically truncate the infinite tails of the spatial distribution. When evaluated as a Radon-Nikodym derivative against the base measure, the active parameter space compresses into a strictly finite, normalizable probability droplet. Empirical benchmarks across three domains–LiDAR maneuvering target tracking, high-frequency cryptocurrency order flow, and quantum state tomography–demonstrate that this bounded information geometry analytically truncates outliers, ensuring robust estimation without relying on infinite-tailed distributional assumptions.
Read the full abstract

Probability

Multi-floor generalization of TASEP

We consider an interacting particle system, which generalizes the classical totally asymmetric simple exclusion process (TASEP), in that each site can contain up to a fixed finite number of particles, and the particle movement is governed by a back-pressure (BP) algorithm (also often called MaxWeight). There are $N$ sites (with $N$ finite or infinite), each may contain at most $c$ particles, $1 \le c < \infty$. New particles enter the system at the left-most site $1$ as a Poisson process of rate $\alpha\le 1$, unless site $1$ has $c$ particles. Particles (if any) are removed from the right-most site $N$ as a Poisson process of rate $\beta \le 1$. The left-to-right movement of particles between neighboring sites is governed by the BP rule: one particle moves from site $n$ to $n+1$ at epochs of a rate $1$ Poisson process, as long as the former site has strictly more particles than the latter. When $c=1$, this is the standard TASEP. Our main results address the asymptotics of the stationary distribution of a finite system, and especially the limit of the flux (current) as $N\to\infty$. In particular, we prove that interesting non-trivial phase transitions take place in a system with $c>1$. For example, if $c>1$ and $1/2 \le \beta \le 1$, the maximum limiting flux $1/4$ is achieved as long as $\alpha \ge \alpha_c^*$, where $\alpha_c^* < 1/2$ is some non-trivial threshold. (For the standard TASEP the threshold is $1/2$.) We also put forward a general conjecture about the stationary distribution asymptotics under an arbitrary parameter setting. We illustrate our formal results and the conjecture by simulations, and identify interesting directions for further research.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

A Lyapunov Characterization of Robust D-Stability with Application to Decentralized Integral Control of LTI Systems

The concept of matrix D-stability plays an important role in applications, ranging from economic and biological system models to decentralized control. Here we provide necessary and sufficient Lyapunov-type conditions for the robust (block) D-stability property. We leverage this characterization as part of a novel Lyapunov analysis of decentralized integral control for MIMO LTI systems, providing sufficient conditions guaranteeing stability under low-gain and under arbitrary connection and disconnection of individual control loops.
Read the full abstract

Analysis of PDEs

Conformally invariant equations with negative critical exponents on the three dimensional hyperbolic space

We establish a symmetry result for positive entire solutions with a prescribed growth rate to the following fourth order equation on the 3-dimensional hyperbolic space $\mathbb{H}^3$: \[ P_2 u = - u^{-7}, \] where $P_2$ denotes the fourth-order Paneitz operator. We prove that any positive solution $u$ on $\mathbb{H}^3$ exhibiting exponential growth at infinity must, up to hyperbolic isometries, be radial and strictly decreasing with respect to some point $P \in \mathbb{H}^3$. Fourth order equations with negative critical growth on 3-dimensional Euclidean space $\mathbb{R}^3$ has been studied by Choi and Xu in \cite{CX09 }, and subsequently by McKenna and Reichel \cite{MR03} and Xu \cite{Xu05}. Unlike the Euclidean case, the behavior of the Green's function of $P_2$ is substantially different, which prevents us from using the moving plane (sphere) method directly.
Read the full abstract

All authors Debdip Ganguly, Jungang Li, Guozhen Lu, Jianxiong Wang

Combinatorics

Vertex-minor universality of a random graph

Given a graph $G$ and a vertex $v\in V(G)$, a local complementation at $v$ on $G$ is an operation that replaces the induced graph on the neighborhood of $v$ by its complement. A graph $H$ is a vertex-minor if $H$ can be obtained from $G$ by a sequence of vertex deletions and local complementation. A graph is said to be $k$-vertex-minor universal if it contains every $k$-vertex graph on any $k$-subset of vertices as a vertex minor. Previously, Ascoli–Fredrickson–Fredrickson–McFarland–Post proved that with high probability $G(n,1/2)$ is $\Omega(\sqrt{n})$-vertex-minor universal. Furthermore, they conjectured that with high probability $G(n,p)$ and $G(n,1-p)$ are $\Omega(p\sqrt{n})$-vertex-minor universal for all $\omega(1/\sqrt{n})\le p\le 1/2$. In this short note, we confirm this conjecture up to an extra logarithm factor and show that this is true with probability $1-2^{-\Omega(p^2n)}$ if $\Omega(\log n/\sqrt{n})\le p\le 1/2$. Together with a complementary result which applies to the regime where $1/\sqrt{n}\le p\le n^{-1/3}$ produced by an internal model at OpenAI, the conjecture is fully confirmed.
Read the full abstract

Optimization and Control · Cross-listed from cs.GT

Dynamic Wholesale Pricing under Censored-Demand Learning

This paper studies dynamic wholesale pricing and ordering in a two-tier supply chain where firms share POS data and learn about demand from censored demand data. When stockouts occur, unmet demand is unobserved, so the retailer's order quantity affects not only current profits but also the informativeness of future demand signals. This creates a strategic interaction between pricing, ordering, and learning: the manufacturer can influence the pace of learning through wholesale prices, whereas the retailer internalizes the effect of inventory decisions on future information. We analyze a finite-horizon dynamic game in which a manufacturer sets a wholesale price, the retailer then chooses an order quantity, demand is realized, and both firms observe sales. For Weibull demand with a conjugate prior, we extend a dimensionality-reduction approach from single-agent inventory learning models to a strategic supply-chain setting and use it to establish the existence of a Markov perfect equilibrium. For exponential demand, we further show that the equilibrium is unique and admits a recursive characterization. Our numerical analysis shows that public learning can create conflicting incentives in the supply chain: In order to induce larger orders and reduce future censoring, the manufacturer chooses a wholesale price that is lower than a myopic benchmark. By contrast, because of its forward-looking ordering incentive, the retailer may prefer slower learning to avoid strengthening the manufacturer's future wholesale-pricing position.
Read the full abstract

Numerical Analysis · Cross-listed from physics.med-ph

Tau-induced atrophy drives functional connectivity disruption in Alzheimer's disease

Alzheimer's disease involves progressive tau accumulation and spread, leading to regional brain atrophy and disruption of large-scale functional networks. While tau propagation and tissue degeneration have been widely modeled, how atrophy dynamics translate into functional connectivity (FC) degradation remains unclear. Here, we develop a multiphysics framework integrating anisotropic tau reaction-diffusion, finite-deformation biomechanics, and network modeling to link tau-driven atrophy with FC changes. Model fidelity is evaluated by quantitatively comparing simulated atrophy patterns with imaging-derived measurements. Using longitudinal structural and functional MRI, we identify an approximately linear relationship between regional atrophy rates and FC change. We then construct an atrophy-informed structural network degradation matrix from model-predicted region-specific atrophy rates and embed it into a neural oscillation model to predict FC disruption. Our results show that (i) the coupled reaction-diffusion-biomechanical model reproduces observed regional atrophy, (ii) regional atrophy rates parsimoniously predict longitudinal FC changes, and (iii) the atrophy-informed degradation matrix captures the direction and relative magnitude of regional FC disruption. By converting tau-driven atrophy into predictive FC trajectories, the proposed framework offers a clinically interpretable avenue for forecasting disease progression and informing trial design.
Read the full abstract

All authors Kun Jiang, Can Liao, Sujin Jiang, Haidong Lin, Jixin Hou, Tianming Liu, Gang Li, Taotao Wu, Yiqi Mao, Ellen Kuhl, Xianqiao Wang, Xianyan Chen

Optimization and Control

Feedback Control and Local Convexification of Wasserstein Gradient Flows

Building on the feedback stabilization framework that we developed for McKean-Vlasov PDEs, we treat a class of entropy-regularized free energies $F = E + \sigma\mathrm{Ent}$ on the flat torus, with $E$ possibly nonconvex and nonlocal, and show that the resulting controlled system admits a gradient flow formulation in Wasserstein space. Specifically, we realize the Wasserstein Hessian at a target stationary measure $\bar\mu$ as a self-adjoint operator with compact resolvent and show that its negative is unitarily equivalent to the generator of the linearized dynamics. The resulting feedback stabilization can then be interpreted as a local convexification of the free energy landscape: for any prescribed threshold $\delta > 0$, the control, obtained from an algebraic Riccati equation for the linearized problem, induces a finite-rank perturbation of the Wasserstein Hessian that lifts its spectrum above $\delta$, yielding local displacement convexity on a Hölder neighborhood of $\bar\mu$ in regimes where the uncontrolled energy is nonconvex or slowly contracting. Under a local well-posedness assumption, $\bar\mu$ is moreover a locally exponentially stable equilibrium of the closed-loop dynamics, with rate at least $\delta$. The framework covers McKean-Vlasov models and extends to moment-constrained Fokker-Planck dynamics and Fokker-Planck equations on closed Riemannian manifolds.
Read the full abstract

Optimization and Control

State-space models through the lens of ensemble control

State-space models (SSMs) are effective architectures for sequential modeling, but a rigorous theoretical understanding of their training dynamics is still lacking. We formulate continuous-time SSM parameter-path optimization as an ensemble optimal control problem: each input sequence generates a corresponding state trajectory in the ensemble, while the trainable parameter path forms a common control shared by all trajectories. Within this formulation, model evaluation is represented by the forward state equation and backward sensitivity propagation by the corresponding adjoint equation. We show that the Hamiltonian gradient with respect to the control variable represents the negative first-variation density of the reduced ensemble objective. Using this representation, we analyze a Bregman mirror-descent scheme for the continuous-time ensemble objective; in Euclidean geometry this reduces to functional projected gradient descent. State-adjoint and Hamiltonian-gradient stability yield two-sided relative curvature of the reduced objective and relative convexity under sufficient regularization. We further show that in the relatively convex regime the optimal-control problem admits a minimizer, which is unique under relative strong convexity. For SSMs, the explicit stability-generated defect $\kappa_{\mathrm{stab}}^{\mathrm{SSM}}$ gives an $O(1/k)$ objective rate at $\tau=\kappa_{\mathrm{stab}}^{\mathrm{SSM}}$ and geometric convergence to the unique minimizer for $\tau>\kappa_{\mathrm{stab}}^{\mathrm{SSM}}$, under the stated stepsize condition.
Read the full abstract

Spectral Theory

Problems in spectral analysis of canonical Hamiltonian systems

This note focuses on recent results in spectral analysis of canonical systems of differential equations obtained via the approach developed in our previous papers \cite{MIF1, MP3, etudes, etudes2, PZ, Direct}. Many of our results are motivated by the pioneering research of Barry Simon and his co-authors; see, for instance, the papers cited in the main text. We discuss solutions to the inverse spectral problem (ISP) for canonical Hamiltonian systems and mixed spectral problems for Schrödinger operators. One of our goals is to show connections of ISP with classical tools of analysis, such as the Hilbert transform, orthogonal polynomials, the gap problem and solutions to the Riemann-Hilbert problem. We illustrate our results with examples and discuss further questions.
Read the full abstract

Optimization and Control

Single-Event Multinomial Full Kelly via Implicit State Positions

For a single event with finitely many mutually exclusive outcomes, the full Kelly problem is to maximize expected log wealth over nonnegative stakes together with an optional cash position. The optimal formula is classical, but the support-selection step is often presented via Lagrange multipliers. This note gives a shorter state-price derivation. A cash fraction $c$ acts as an implicit position in every outcome: in terminal-wealth terms, it is equivalent to a baseline stake $cq_i$ on outcome $i$, where $q_i$ is the state price. On any active support, explicit bets therefore only top up favorable outcomes from this baseline $cq_i$ to the optimal total stake $p_i$. This yields the formula $x_i = (p_i - c q_i)_+$, the threshold rule $p_i/q_i > c$, and, after sorting outcomes by $p_i/q_i$, a one-pass greedy algorithm for support selection. The result is standard in substance, but the implicit-position viewpoint gives a compact proof and a convenient way to remember the solution.
Read the full abstract

Numerical Analysis

Computing the Gross-Pitaevskii Ground State via Wasserstein Gradient Flow in Diffeomorphism Space

We compute the ground state $u$ of the Gross–Pitaevskii equation (GPE) via Wasserstein gradient descent in diffeomorphism space. We represent the density $\rho=u^2$ as the push-forward of a fixed reference measure through a parameterized transport map $T_\theta$, realized by a boundary-preserving Neural ODE. The Wasserstein gradient flow on probability densities then lifts to natural gradient descent in the finite-dimensional parameter space, with metric tensor given by the pullback of the Wasserstein metric. The method is entirely mesh-free and preserves the unit-mass constraint without normalization. We present numerical experiments in dimensions $d=1$ to $4$, with separable and non-separable potentials, using a product transport map in the separable case and a full map with coupled components in the non-separable one. The tests suggest that the output of the parameterized Wasserstein gradient flow (PWGF) can be used as an effective warm start for conventional solvers such as the $H^1$ Sobolev gradient flow.
Read the full abstract

Category Theory

Polarities, voltages, and capacitors: a categorical approach to hulls, envelopes, and completions

This article provides a general framework in the context of category theory where one can recognize as particular instances of the same abstract construction several notions of completion, envelope, and hull, such as the Boolean algebra completion of a Boolean algebra, the Dedekind–MacNeille completion of an ordered set, the multiplier ring of a ring, the multiplier algebra and the von Neumann envelope of a C*-algebra. Towards our goal, we lay the foundations of polarized category theory, which is a refinement of classical category theory where categories are endowed with two distinguished classes of positive and negative arrows. We define in this context the notion of polarity, and voltage. We explain how a voltage can be created through a capacitor, which is essentially a polarized version of the notion of reflective subcategory. In particular, this produces a completion functor (which in the classical case is just the reflector) which assigns to each object its completion or hull. These applies even when the completion is not (and cannot be) given by a functor on the whole category, as it is most often the case. In this framework, we obtain a general theorem ensuring the existence and uniqueness of a functorial completion functor. The corresponding completion of each object is characterized by its two universal properties with respect to positive and negative arrows.
Read the full abstract