Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 30 April

Mathematical Physics · Cross-listed from nlin.SI

Bilinear formalism for Schwarzian KP and Harry Dym hierarchies

We consider the Schwarzian KP and Harry Dym hierarchies in the framework of the bilinear formalism which is well known for such integrable hierarchies as KP, modified KP, BKP, Toda lattice and other. We show that, similarly to the bilinear formulation of the modified KP hierarchy, the Schwarzian KP can be reformulated as an integral bilinear equation for a pair of KP tau-functions with the property that any linear combination of them is again a tau function of the KP hierarchy. The Harry Dym hierarchy is then obtained as the Lax-Sato formulation of the SchKP one. The close connection with Backlund-Darboux transformations for integrable hierarchies is also discussed. Besides, it is shown that the SchKP hierarchy has a natural embedding into the multi-component KP hierarchy.
Read the full abstract

Optimization and Control · Cross-listed from stat.ML

A unified perspective on fine-tuning and sampling with diffusion and flow models

We study the problem of training diffusion and flow generative models to sample from target distributions defined by an exponential tilting of a base density; a formulation that subsumes both sampling from unnormalized densities and reward fine-tuning of pre-trained models. This problem can be approached from a stochastic optimal control (SOC) perspective, using adjoint-based or score matching methods, or from a non-equilibrium thermodynamics perspective. We provide a unified framework encompassing these approaches and make three main contributions: (i) bias-variance decompositions revealing that Adjoint Matching/Sampling and Novel Score Matching have finite gradient variance, while Target and Conditional Score Matching do not; (ii) norm bounds on the lean adjoint ODE that theoretically support the effectiveness of adjoint-based methods; and (iii) adaptations of the CMCD and NETS loss functions, along with novel Crooks and Jarzynski identities, to the exponential tilting setting. We validate our analysis with reward fine-tuning experiments on Stable Diffusion 1.5 and 3.
Read the full abstract

Mathematical Physics

Classical limit of the Pauli-Fierz dynamics

We study the Schrödinger evolution generated by the Pauli-Fierz Hamiltonian, a model for nonrelativistic quantum electrodynamics, in the classical limit $\hbar \rightarrow 0$. In this regime, we rigorously derive the Newton-Maxwell equations of classical electrodynamics as effective dynamics approximating the time evolution. Our result complements prior work by an alternative derivation that provides explicit estimates on the rate of convergence, justifying the validity of the approximation for a special class of initial data.
Read the full abstract

Algebraic Geometry

On logarithmic Poisson cohomology of a degenerate Poisson bivector in affine plane

In this paper, we show that for a given degenerate bivector $\pi= y^n\partial_x \wedge \partial_y$ with $n>1$, the classical Poisson cohomology group and the logarithmic Poisson cohomology group along the ideal $\mathcal{I}=y^n\mathbb{F}[x,y] $ are isomorphics in every dégrée. This result follows from determination of the logarithmic Hamiltonian operator and the logarithmic Poisson cochain complexe in order to compute the cohomological invariants associated to $\pi$. $\mathbb{F}$ is the field of characteristic 0.
Read the full abstract

All authors Kamtila Kari, Iskamlé Bruno, Diekouam Fotso Luc Éméry, Tcheka Calvin

Functional Analysis

Weighted Composition-differentiation operators on weighted Dirichlet spaces

We study weighted composition-differentiation operators of order $n,$ $D^n_{\psi,\varphi}f:= \psi\cdot f^{(n)}\circ \varphi$ on weighted Dirichlet spaces. Our main goal is to describe the operator-theoretic properties of $D^n_{\psi,\varphi}$ in terms of the inducing functions $\psi$ and $\varphi.$ We characterize bounded, compact, and Hilbert-Schmidt class of such operators and estimate their essential norms. Our approach relies on Carleson measures and the asymptotic behavior of inducing functions. Furthermore, we prove that $D^n_{\psi,\varphi}$ is bounded for all $\psi$ in the space precisely when $\|\varphi\|_\infty<1$ and $\varphi$ belongs to the multiplier algebra of the space. Finally, we give norm estimates for particular elliptic inducing functions and provide examples to demonstrate our results.
Read the full abstract

Optimization and Control

Structure-Preserving Optimal Control of Maxwell's Equations with Applications to Source Cloaking

We develop a structure-preserving solution framework for the optimal control of the time-dependent Maxwell's equations. Building on a well-posedness theory for a weak form of the forward problem, we first analyze a forward solver that couples Nédélec and Raviart–Thomas finite elements with Crank–Nicolson time stepping. The solver preserves the de~Rham structure, enforces a discrete Gauss law, exactly satisfies a per-time-step energy balance, and converges to the weak solution under low regularity assumptions on the problem data, which are dictated by the optimal control setting. To control the Maxwell system, we add the curl of a space-time current density as a source to Ampére's law. The curl form yields charge conservation without auxiliary constraints. We prove the well-posedness and continuity of the control-to-state map, derive the adjoint system and a gradient representation for a tracking-type objective functional, and formulate a discrete optimization scheme that inherits structure preservation from the forward solver. Our discrete stationarity conditions are consistent with their continuous counterparts, and the discrete optimal controls converge, with mesh and time refinements, to the continuous optima. We demonstrate the merits of our optimal control formulation and the theoretical developments by numerically solving a series of source-cloaking model problems.
Read the full abstract

All authors Harbir Antil, Yaw Owusu-Agyemang, Rohit Khandelwal, Jimmie Adriazola, Denis Ridzal

Probability · Cross-listed from cond-mat.stat-mech

Activated random walk exhibits self-organized criticality

To explain the ubiquity of power laws and fractals in nature, Bak, Tang, and Wiesenfeld formulated simple conditions for a system to self-organize into a critical state. Dickman, Muñoz, Vespignani, and Zapperi postulated that the self-organized critical state matches the critical state in corresponding fixed-energy models undergoing traditional phase transitions. Although the theory has been applied broadly over the past five decades, no mathematical model has been proven to exhibit the conjectured behavior. Indeed, the originally proposed abelian sandpile model displays nonuniversal behavior stemming from its slow mixing. Marking the first result of its kind, we prove that the 1-d activated random walk model mixes quickly into a stationary state with power-law avalanches and limiting critical density that equals the critical value for the fixed-energy version.
Read the full abstract

All authors Christopher Hoffman, Tobias Johnson, Matthew Junge, Josh Meisel

Functional Analysis

Range Characterization of the Weighted Divergent Beam and Cone Integral Transforms

We establish range characterizations, or data consistency conditions, for an integral transform that maps a function to its weighted integrals over conical surfaces in $\mathbb{R}^n$. We consider two different geometries for the cone vertices, which lead to mathematically distinct range conditions. We use the term conical Radon transform when the vertex set is a bounded convex subset of $\mathbb{R}^n$ including support of the input function. The second geometry is motivated by Compton camera imaging where the vertex set represents planar detector locations and is disjoint from the support of the input function representing the radiation density. We refer to the associated transform as the Compton transform. Our approach is based on a factorization into the $k$-weighted divergent beam transform and the spherical section transform. In the bounded convex vertex geometry, the range of the divergent beam component is described by a higher-order transport boundary-value problem, as studied by Derevtsov, Volkov, and Schuster [7]. In the planar detector geometry, we derive range conditions for the $k$-weighted divergent beam transform that generalize the planar cone-beam consistency conditions of Clackdoyle and Desbat [5]. Combining these results with the range characterization of the spherical section transform yields complete range descriptions for both the $k$-weighted conical Radon transform and the $k$-weighted Compton transform.
Read the full abstract

Statistics Theory

Fast Convergence for Weighted Least Squares Estimates

It is well-known that maximum likelihood estimates converge faster than the classic square root rate if the Fisher information is infinite. This is often the case when the effective region depends on the estimated parameters, or when density has a singularity inside the effective region at a point dependent on the estimated parameters. We present a one-parameter family of bivariate absolutely continuous distributions on the half-space with smooth densities. The effective domain is always the same half-space and does not depend on this parameter. The order of magnitude for the weighted least squares estimate is asymptotically smaller than the classic square root rate. For the Gaussian variance mixture case, the maximum likelihood estimate coincides with this weighted least squares estimate.
Read the full abstract

Probability · Cross-listed from stat.ME

Modeling Stock Returns and Volatility Using Bivariate Gamma Generalized Laplace Law

We consider a generalization of the variance-gamma (generalized asymmetric Laplace) distribution, defined as a normal mean - variance mixture with a gamma mixing distribution. While this model is typically studied in the univariate setting, we assume that the gamma mixing variable is observed alongside the primary variable, resulting in a bivariate framework. In this setting, maximum likelihood estimation becomes significantly simpler than in the standard univariate case, reducing to a form of classical linear regression. We derive explicit expressions for the resulting estimators. For certain parameter configurations, the estimators exhibit nonstandard convergence rates, exceeding the usual square-root rate. Finally, we illustrate the applicability of this model in financial contexts by analyzing stock index returns and associated volatility for several major indices.
Read the full abstract

Combinatorics · Cross-listed from cs.FL

The speed of convergence in the Cooper-Dutle dueling game

In 2013 Cooper and Dutle invented a dueling scenario where Alice and Bob shoot at each other until one is hit. Each shot is successful with some fixed probability $p$, $0 < p < 1$. The shooting order is given by a greedy algorithm, where at each step a shot is assigned to the player whose current probability of success is smaller. Cooper and Dutle observed that as $p \rightarrow 0$, the resulting sequence of shots (by Alice or Bob) converges to the infinite Thue-Morse sequence $\mathbf{t}$, but left the speed of convergence as an open problem. In this note we determine the speed of this convergence.
Read the full abstract

Combinatorics · Cross-listed from cs.LO

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes

Algorithmic meta-theorems explain the tractability of large classes of computational problems by linking logical expressibility with structural graph properties. While extensions of first-order logic such as FO+dp admit efficient model checking on graph classes excluding a fixed topological minor, comparable results for richer fragments of CMSO were previously unknown. We further develop the framework of Sau, Stamoulis, and Thilikos [SODA 2025] for fragmenting CMSO via annotated graph parameters, which restrict set quantification to vertex sets satisfying bounded structural conditions. Following this approach, we identify a fragment of CMSO, namely the one defined by allowing quantification only over sets having what we call low monodimensionality, that generalizes several previously-known logics and we show that model checking for this fragment, enhanced with the disjoint-paths predicate, is fixed-parameter tractable on topological-minor-free graph classes. Such classes essentially delimit the tractability for this logic on subgraph-closed classes. As a consequence, our results lift several known algorithmic meta-theorems beyond first-order logic to the topological-minor-free setting.
Read the full abstract

All authors Ignasi Sau, Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny

Dynamical Systems

Characterisation of Stability for Interval Translation Maps

An interval translation map (ITM) is a piece-wise translation $T \colon I \to I$ defined on a finite partition $I_1, \ldots, I_r$ of an interval $I$ into $r \ge 2$ subintervals. In contrast to classical interval exchange transformations (IETs), we do not require that the images of these subintervals are disjoint; in particular, ITMs are not assumed to be bijective. Thus, ITMs provide a natural non-invertible generalisation of IETs. In this paper, we formulate an appropriate notion of stability for general interval translation mappings and prove a characterisation of stability in terms of two dynamically natural properties called the Absence of Critical Connections and Matching. This result can be viewed as the foundational step towards the stability theory of general ITMs.
Read the full abstract

Analysis of PDEs

Local Asymptotic Patterns for Viscous Approximations of Conservation Laws

Solutions to hyperbolic conservation laws can be approximated in many different ways: by vanishing viscosity, relaxations, discrete or semi-discrete numerical schemes, approximation with a nonlocal flux, etc$\ldots$ For some of these methods, general ${\bf L}^1$ convergence results are available. Aim of this paper is to understand the local behavior of these approximations, in a neighborhood of point where the hyperbolic solution has a singularity. Specifically: a point along a shock, or where two shocks interact, or where a new shock is formed. Given a sequence of $\epsilon$-approximate solutions, a general expectation is that, by a suitable local rescaling of coordinates, as $\epsilon\to 0$ a well defined limit is obtained. This corresponds to a specific “eternal solution" (globally defined both in space and in time) to the approximating equation. Precise results this direction are here given, in the case of vanishing viscosity.
Read the full abstract

Dynamical Systems

Topological Prevalence of Finite Type Interval Translation Maps

An interval translation map (ITM) is a map $T \colon I \to I$ defined as a piecewise translation on a finite partition of an interval $I$ into $r \ge 2$ subintervals. Unlike classical interval exchange transformations (IETs), the images of these subintervals are allowed to overlap, making ITMs a natural generalisation of IETs. An ITM $T$ is said to be of finite type if its attractor $\bigcap_{n\ge 0} T^n(I)$ is a finite union of intervals; in this case, restricted to this invariant set, $T$ is bijective and hence behaves like an IET. Otherwise, $T$ is of infinite type. In this paper, for every $r \ge 2$, we prove that the set of finite type ITMs contains an open and dense subset in the space of all possible ITMs on $r$ subintervals. This confirms a topological version of a long-standing conjecture due to Boshernitzan and Kornfeld.
Read the full abstract

Dynamical Systems

Transversality for Interval Translation Maps

An interval translation map (ITM) is a piece-wise translation $T \colon I \to I$ defined on a finite partition $I_1, \ldots, I_r$ of an interval $I$ into $r \ge 2$ subintervals. In contrast to classical interval exchange transformations (IETs), we do not require that the images of these subintervals are disjoint; in particular, ITMs are not assumed to be bijective. Thus, ITMs provide a natural non-invertible generalisation of IETs. In this paper, we prove a transversality theorem for a family of dynamically defined vector subspaces that encode the dynamics of a given ITM. As a consequence, we establish a perturbation result that gives a precise control of the first return dynamics to subintervals in $I$, while preserving the remaining global dynamics of the system. Beyond their independent interest, these results are a key technical ingredient in the proof of the Characterisation of Stability of ITMs in arXiv:2605.00190, and in the establishment of the topological version of the Boshernitzan–Kornfeld Conjecture in arXiv:2605.00186.
Read the full abstract

Algebraic Geometry

Stable Wild Vafa-Witten Bundles on the Projective Plane

This work explores the geometry of stable wild Vafa-Witten bundles over the complex projective plane $\mathbb{P}^2$. Specifically, we consider stable rank-two pairs $(E,\Phi)$, with $E\to\mathbb{P}^2$ a rank-two holomorphic vector bundle and $\Phi\in H^0(\mathbb{P}^2,\mathrm{End}_0E\otimes\mathcal{O}(d))$ for $d\geq0$, and compute the dimension of the moduli space of such stable pairs. Moreover, we classify stable pairs $(E,\Phi)$ when the underlying rank-two bundle $E$ splits or is the push-forward of a line bundle on $\mathbb{P}^1\times\mathbb{P}^1$. Lastly, we examine the fixed point locus of the natural $\mathbb{C}^*$-action on the moduli space.
Read the full abstract

Optimization and Control

Approximations and Learning for Decentralized Stochastic Control and Near Optimal Finite Window Policies

Decentralized stochastic control problems are difficult to study due to information structure dependent subtleties, which prevent many classical methods in stochastic control from being applicable. In this paper we consider such problems with general standard Borel spaces under two related information structures. (a) the one-step delayed information sharing pattern (OSDISP) where agents share their information with one-step delay, and (b) the $K$-step periodic information sharing pattern (KSPISP), where information is shared periodically. It is known that OSDISP and KSPISP problems admit a centralized reduction where the agents view the problem from the perspective of a centralized controller that uses the common information to prescribe function valued actions (local policies) which map each agent's private information to an optimal action in the original problem. We provide rigorous approximation results and performance bounds for the KSPISP and OSDISP problems, which results from replacing the full common information by a finite sliding window of information and we establish near optimality of such policies. The latter depends on a predictor stability condition in expected total variation. As a further contribution, we show that under the information structures provided, corresponding Q-learning algorithms (in quantized or finite memory forms) converge asymptotically to near optimal solutions. While restrictive and hypothetical conditions have been presented in the literature, our contributions are thus to provide, to our knowledge, the first explicit conditions and rigorous approximation and learning results for such decentralized problems with general spaces.
Read the full abstract

Optimization and Control

Moral Hazard in LTI Dynamics: A Hypothesis Testing Approach

Many incentive design problems must contend with information asymmetries due to non-observation of efficiency (adverse selection) or non-observation of effort (moral hazard). And although a growing body of literature considers incentive design in control systems, the problem of designing incentives for control systems under information asymmetries has been less well-studied. This paper considers a model of moral hazard within control systems. In our model, the control system is described by an (affine) linear time-invariant (LTI) system with process noise. There is an agent who gets to choose (from between two choices) a linear state-feedback controller to apply to the LTI system, with one of the state-feedback controllers having a higher quadratic cost on the control inputs than the other. Our goal is to design a payment scheme that incentivizes the agent to choose the state-feedback controller that minimizes a quadratic cost on system states plus the time-discounted payment amount, subject to the understanding that the agent bears the control cost while being risk-averse with respect to their time-discounted payment. We formulate the problem as a constrained optimization, and prove that for a payment given after a fixed (but optimizable) time horizon the optimal payment scheme chooses the payment amount using a likelihood ratio hypothesis test. We numerically demonstrate our results by applying the derived optimal payment scheme to two examples: load frequency control (LFC) in power systems and wellness interventions for body weight loss.
Read the full abstract

All authors Jaewon Jeong, Pan-Yang Su, S. Shankar Sastry, Anil Aswani

Mathematical Physics · Cross-listed from quant-ph

Asymptotic Replacement for Quantum Channel Products with Applications to Inhomogeneous Matrix Product States

We develop a product-level trace-Dobrushin theory for finite-dimensional quantum channel products and apply it to deterministic and stationary random inhomogeneous matrix product states in left-canonical CPTP gauge. For a product of channels, the centered trace-Dobrushin coefficient quantifies the residual dependence on the input state, and its decay is the criterion for trace-norm forgetting. In the deterministic setting, this decay is equivalent to asymptotic replacement by a moving replacement channel. For two-sided products, pullback forgetting produces a unique boundary state, which determines the canonical replacement family. For stationary random CPTP cocycles, submultiplicativity of the product coefficient yields a trace-Dobrushin Lyapunov exponent. We prove that the almost sure negativity of this exponent is equivalent to quenched trace-norm memory loss and gives exponential forward and pullback convergence to a unique dynamically stationary random replacement channel. When the \(\varrho\)-mixing profile of the channel environment tends to zero, we obtain annealed super-polynomial estimates, while independence gives annealed exponential estimates. Finally, we transfer these estimates to inhomogeneous matrix product states whose auxiliary transfer maps are CPTP. These channel estimates transfer to deterministic and stationary random inhomogeneous MPS, giving infinite-volume limits of trace-closed finite-volume states, quantitative boundary stability, and correlation bounds governed by the same auxiliary product coefficients.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback

Reinforcement learning from human feedback (RLHF) is a central post-training tool for aligning large language models, but its training reward is only a learned proxy for true human utility. This creates a decision problem under objective misspecification: the policy is optimized against an estimated reward, while deployment performance is governed by an unobserved population preference. The resulting gap leads to reward over-optimization, where proxy reward keeps improving after true quality deteriorates. We propose distributionally robust regret optimization (DRRO) for RLHF with a Wasserstein ambiguity set over reward laws, using promptwise $\ell_p$ distances between reward vectors as transport costs. Unlike standard distributionally robust optimization, which pessimizes worst-case value, DRRO pessimizes worst-case regret relative to the best policy under the same plausible reward perturbation. We show that the expressive-policy problem decomposes into promptwise regret problems. For each prompt, the inner adversary has a dual-norm closed form; under the $\ell_1$ transport cost used by our algorithm, the optimizer has a water-filling structure. These results lead to a practical policy-gradient algorithm that adds a simple sampled bonus to GRPO-style training. Theory and experiments both show that DRRO is less over-pessimistic than standard DRO and mitigates over-optimization more effectively than existing baselines.
Read the full abstract

Differential Geometry

Lipschitz rigidity for scalar curvature on singular manifolds in odd dimensions

The main result of this article is a Llarull-type rigidity statement for scalar curvature on Riemannian spin manifolds with cone-like singularities in odd dimensions. The even dimensional analog was proven in an earlier work together with Simone Cecchini, Bernhard Hanke and Thomas Schick using index theory and the analysis of abstract cone operators, which applies to Dirac operators associated with generalized cone metrics. We will extend the analysis of abstract cone operators, apply it to twisted Dirac operators on singular manifolds and combine it with a spectral flow argument to prove the main result.
Read the full abstract

Spectral Theory

Negative spectrum of non-local operators with periodic potential

The paper deals with spectral analysis of non-local operators arising in population dynamics models. We consider negative periodic perturbations of non-local operators of the convolution type. Such operators describe evolutions of the first correlation function in the stochastic birth and death dynamcis in the presence of suppression forces that increase mortality. We consider the case when the birth kernel can be non-symmetric and spatially heterogeneous. It has been proven that any negative periodic perturbation of the equilibrium dynamics generator shifts the spectrum to the left half-plane and, consequently, such a perturbation of mortality leads to the population extinction in any dimension.
Read the full abstract

Probability

Persistence in perturbed contact models in continuum

Can a local disaster lead to extinction? We answer this question in this work. In the paper \cite{PZ-PPI} we considered contact processes on locally compact metric spaces with state dependent birth and death rates and formulated sufficient conditions on the rates that ensure the existence of invariant measures. One of the crucial conditions in \cite{PZ-PPI} was the critical regime condition, which meant the existence of a balance between birth and death rates in average. In the present work, we reject the criticality condition and suppose that the balance condition is violated. This implies that the evolution of the correlation functions of the contact model under consideration is determined by a nonlocal convolution type operator perturbed by a (negative) potential. We show that local peaks in mortality do not typically lead to extinction. We prove that a family of invariant measures exists even without the criticality condition and these measures can be described using the Feynman-Kac formula.
Read the full abstract

Rings and Algebras

Combinatorics on finite words and the length of a finite-dimensional associative algebra

Let $f_W(n)$ be the number of different factors of length $n$ appearing in $W$. A classical result of Morse and Hedlund, stated in 1938, asserts that an infinite word $W$ is ultimately periodic if and only if $f_W(n)\leq n$ for some $n\in \mathbb N$. In this paper, we describe the form of finite words that satisfy the condition $f_W(n)\leq n$. We study relations between power avoidance and subword complexity of a finite word. We apply our combinatorial results to study the interrelations between various numerical invariants of finite-dimensional associative algebras.
Read the full abstract

Rings and Algebras

Identities in differential perm algebras

Let $(P,\cdot,d)$ be a differential perm algebra over a field of characteristic zero, i.e. an associative algebra satisfying $(ab)c=(ba)c$ and equipped with a derivation $d$. We study polynomial identities in the algebras obtained by the derived operations \[ a\prec b=ab',\quad a\succ b=a'b,\quad a\blacklozenge b=ab'+ba',\quad a\bullet b=a'b+ab',\quad a\Diamond b=ab'-ba',\quad a\circ b=a'b-ab', \] where $a'=d(a)$. We first prove that any nontrivial differential polynomial identity that does not belong to the right annihilator of the free differential perm algebra implies a differential identity of the form $a_1'a_2'\cdots a_m'=0$ for some positive integer $m$. We then obtain explicit generating sets and determine the dimensions of the multilinear homogeneous components of the subalgebras of the free differential perm algebra generated by $X$ with respect to the products $\blacklozenge$ and $\bullet$. Finally, we construct perm-Witt type Lie and Leibniz algebras arising naturally from differential perm algebras.
Read the full abstract

Algebraic Geometry

Cylinders and the zero locus of the plinth ideal

Given a $\mathbb{G}_\mathrm{a}$-action on an affine variety $X$, we show that the complement of the union of all principal invariant cylinders in $X$ is equal to the zero locus of the plinth ideal of the corresponding locally nilpotent derivation.

Probability · Cross-listed from cond-mat.stat-mech

Graph theoretic derivation of mutual linearity for transient probabilities and hitting time distributions in Markov networks

For irreducible, time-homogeneous Markov networks, mutual linearity has recently been established for both occupation probabilities and network currents in the stationary regime as well as in the non-stationary regime in Laplace space. The derivation of this property for the stationary distribution utilized the Markov chain tree theorem, which also allows for an explicit combinatorial expression of the response ratios under variation of a single transition rate. The extension of this result was proven at the trajectory level by employing the Doob Meyer decomposition. By employing the all-minors matrix-tree theorem, we show that this property also follows from a graph theoretic formulation and derive explicit combinatorial expressions for the non-stationary response ratios. The stationary result follows as the long time limit. We also show that the small-time asymptotics are entirely determined by minimal path distances in the underlying graph. Finally we use the graph theoretic approach to prove that mutual linearity also extends to hitting time densities.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Entanglement Enabled Data Transmission over an Arbitrarily Varying Channel

Shared randomness is the central ingredient for stabilizing symmetrizable communication systems against arbitrarily varying jammers. Given the presence of the jammer, however, the question arises how this precious resource could have been distributed. Several works discuss the use of external sources for this task. In this work, we show, based on the most standard optical communication model, how the sender and receiver can employ entangled two-mode squeezed states to counter the jamming attack of an energy-limited jammer during the distribution phase when both the sender and jammer are allowed to use binary phase shift keying and two-mode squeezed vacuum states.
Read the full abstract

Optimization and Control

An Adaptive Variable Neighborhood Search for a Family of Set Covering Routing Problems with an Application in Disaster Relief Operations

This paper studies a variant of the Set Covering Routing Problem (SCRP) motivated by post-disaster humanitarian logistics. We consider a hybrid distribution concept in which the majority of transportation is performed by helicopters, while ground transport is limited to the last mile, addressing severe accessibility constraints in disaster-affected regions. The resulting problem integrates landing site location, routing, and covering decisions, incorporating features of the Multi-Vehicle Covering Tour Problem (m-CTP) and the Vehicle Routing with Demand Allocation Problem (VRDAP) in a facility-capacitated, multi-depot setting. Due to the computational complexity of the problem, we develop an Adaptive Variable Neighborhood Search (AVNS) that combines established routing operators with novel mechanisms for covering decisions. The performance of the proposed approach is evaluated on benchmark instances for the related m-CTP and VRDAP problems, demonstrating competitive solution quality compared to problem-specific state-of-the-art approaches. Furthermore, we apply our AVNS to a real-world case study based on the 2024 flash floods in Afghanistan. The results highlight the practical relevance of the proposed framework and provide managerial insights into effective distribution strategies for disaster response operations.
Read the full abstract

All authors Andreas Hagn, Jan Krause, Moritz Stargalla, Lorenza Moreno