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)

Thursday 12 March

Information Theory · Cross-listed from cs.CR

Understanding Disclosure Risk in Differential Privacy with Applications to Noise Calibration and Auditing (Extended Version)

Differential Privacy (DP) is widely adopted in data management systems to enable data sharing with formal disclosure guarantees. A central systems challenge is understanding how DP noise translates into effective protection against inference attacks, since this directly determines achievable utility. Most existing analyses focus only on membership inference – capturing only a threat – or rely on reconstruction robustness (ReRo). However, under realistic assumptions, we show that ReRo can yield misleading risk estimates and violate claimed bounds, limiting their usefulness for principled DP calibration and auditing. This paper introduces reconstruction advantage, a unified risk metric that consistently captures risk across membership inference, attribute inference, and data reconstruction. We derive tight bounds that relate DP noise to adversarial advantage and characterize optimal adversarial strategies for arbitrary DP mechanisms and attacker knowledge. These results enable risk-driven noise calibration and provide a foundation for systematic DP auditing. We show that reconstruction advantage improves the accuracy and scope of DP auditing and enables more effective utility-privacy trade-offs in DP-enabled data management systems.
Read the full abstract

All authors Patricia Guerra-Balboa, Annika Sauer, Héber H. Arcolezi, Thorsten Strufe

Optimization and Control

Forecasting and Manipulating the Forecasts of Others

Finite-player dynamic games with dispersed private information are difficult because actions both move payoffs and reshape what opponents learn, generating hierarchies of beliefs about beliefs. This paper provides a recursive representation for this problem. The noise state records agents' beliefs about the underlying shocks that generate histories, so higher-order beliefs are generated by composition rather than tracked as separate state variables. In the canonical continuous-time LQG benchmark, the representation becomes explicit: beliefs, value gradients, and policy rules are deterministic impulse-response functions, and equilibrium is a deterministic fixed point in those functions. Any fixed point in the noise-state linear class is a Nash equilibrium against arbitrary admissible \(L^2\) deviations. The first-order system contains an information wedge, the shadow price of changing opponents' posteriors. In a two-player benchmark, the wedge explains why pooling gains are mostly strategic, why optimal precision allocation can starve an inefficient player of information, and why signal precision changes policy rules themselves, so separation fails.
Read the full abstract

Optimization and Control

Folding Mixed-Integer Linear Programs and Reflection Symmetries

For mixed-integer linear programming and linear programming it is well known that symmetries can have a negative impact on the performance of branch-and-bound and linear optimization algorithms. A common strategy to handle symmetries in linear programs is to reduce the dimension of the linear program by aggregating symmetric variables and solving a linear program of reduced dimension. In their work “Dimension Reduction via Color Refinement” (DRCR), Grohe, Kersting, Mladenov and Selman show that it is sufficient to run a fast color refinement algorithm to detect permutation symmetries and reduce the dimension of the linear program. We extend DRCR in two directions. First, we show that DRCR can be extended to reflection symmetries, which generalize permutation symmetries. Second, we show the folklore result that DRCR can be applied to the continuous columns of mixed-integer linear programs. In order to derive additional reductions on the integer variables we use affine totally unimodular decompositions to reformulate mixed-integer linear programs into mixed-integer linear programs with fewer integer variables. Computational experiments on MIPLIB 2017 collection set using SCIP 10 show that DRCR is an effective tool for handling symmetries. For the linear programming relaxations, DRCR with reflection symmetries yields a modest reduction in running time compared to the original DRCR procedure. For mixed-integer linear programming models, DRCR is very effective at reducing the solution time compared to the default configuration of SCIP. Moreover, the developed DRCR detection algorithms are fast and scale well to large problem instances.
Read the full abstract

Numerical Analysis

Global and local helicity-preservation in the finite element discretization of magnetic relaxation

Magnetic relaxation drives plasma toward lower-energy equilibria under helicity constraints. In ideal magnetohydrodynamics (MHD), helicity is locally conserved, while resistive theories such as Taylor relaxation preserve only global helicity. This distinction has important implications for structure-preserving numerical methods. We compare three finite element formulations: an unconstrained scheme that does not conserve helicity, a mixed method based on finite element exterior calculus that preserves discrete local helicity on magnetically closed subdomains, and a Lagrange multiplier approach that enforces only global helicity conservation. Numerical experiments with magnetic knots and braids show that helicity-based constraints provide effective topological barriers when the relevant helicity-type invariant is nonzero, but do not fully characterize braided field-line topology when it vanishes. These results clarify both the strengths and the possible limitations of helicity-based structure-preserving finite element methods for magnetic relaxation.
Read the full abstract

All authors Patrick E. Farrell, Mingdong He, Kaibo Hu, Ganghui Zhang

Representation Theory

Twisted Gelfand-Ponomarev modules

In this expository paper, given a field $K$ and two automorphisms $\sigma, \tau \in \mathrm{Aut}(K)$, we give a self-contained proof of the classification of finite dimensional $K$-vector spaces equipped with two operators $F$ and $V$, respectively $\sigma$-linear and $\tau$-linear, such that $FV = VF = 0$. This classification was originally due to the combined results of Gelfand and Ponomarev (1968), and of Kraft (1975). Following a recent suggestion of Chai (2025), we reworked their classification in light of the notion of Kraft quivers. As an application, we generalize and give an algebraic proof of a theorem by Kottwitz and Rapoport concerning the existence of $F$-crystals.
Read the full abstract

Dynamical Systems

A geometric approach to exponentially small splitting: Zero-Hopf bifurcations of arbitrary co-dimension

In this paper, we present a geometric approach to exponentially small splitting in zero-Hopf bifurcations of arbitrary co-dimension. In further details, we consider a family of problems that generalizes the third order Michelsen/Kuramoto-Sivashinsky-type equations $\epsilon^{2(\kappa-1)} f'''+f'={Q}(f)$, where ${Q}$ is an arbitrary real polynomial with $\kappa=\operatorname{degree}Q\ge 2$ simple real roots. For $\epsilon=0$, the system has $(\kappa-1)$-many heteroclinic connections and we describe the exponentially small splitting for each connection for all $0<\epsilon\ll 1$ under a separate nondegeneracy condition. In particular, we find that the $j$th-splitting is of the form $\epsilon^{-\frac{3\kappa}{2}}\exp\left({-\epsilon^{1-\kappa}T^j}\right)(C^j+\mathcal O(\epsilon))$, where $T^j>0$ can be calculated explicitly and be interpreted as the blowup time of special unbounded solutions of the $\epsilon=0$-limiting system in imaginary time $f'=iQ(f)$. Our approach extends a similar geometric method developed by the present author for the generic zero-Hopf bifurcation of co-dimension two, which does not rely on explicit time-parametrizations of the unperturbed heteroclinic connections and their singularities in the complex plane. Instead, we work exclusively in the complexified phase space and relate the exponentially small splitting to the lack of analyticity of center-like invariant manifolds of associated generalized saddle-nodes.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Integrability from Homotopy Algebras

Homotopy algebraic methods have become increasingly influential in studying field theories. We consider semi-holomorphic Chern-Simons theory and its relation with the principal chiral model. In particular, we establish an explicit quasi-isomorphism between the cyclic $L_\infty$-algebras governing both theories which directly gives the Lax connection. This provides a concrete example for studying integrability of a two-dimensional system through the homotopy algebraic lens.
Read the full abstract

All authors Luigi Alfonsi, Leron Borsten, Mehran Jalali Farahani, Hyungrok Kim, Martin Wolf, Charles Alastair Stephen Young

Probability · Cross-listed from physics.ao-ph

Breaching the Barrier: Transition Pathways of Coral Larval Connectivity Across the Eastern Pacific

Genetic analyses indicate minimal gene flow across the so-called Eastern Pacific Barrier (EPB) in larvae of the reef-building coral Porites lobata. Notably, Clipperton Atoll, situated on the eastern side of the EPB, is the only site that exhibits detectable genetic connectivity with the Line Islands, which lie to the west of the EPB. To elucidate the relationship between this genetic signal and large-scale Pacific Ocean circulation, we analyze historical trajectories of surface-drifting buoys from the Global Drifter Program (GDP). We first discretize the GDP drifter trajectories into a Markov chain representation and subsequently apply transition path theory (TPT) in combination with Bayesian inference. The TPT analysis identifies reactive trajectories – pathways that connect the Line Islands to Clipperton Atoll with minimal detours – whose travel times do not exceed 5 months, which is taken as an upper bound for the larval survival time of P. lobata. Consistently, the posterior distribution of transport from Pacific islands west of the EPB to Clipperton Atoll attains a local maximum in the Line Islands at a travel time of approximately 2.5 months. Our probabilistic characterization of the Lagrangian dynamics therefore supports a scenario of weak, but non-negligible, permeability of the EPB, in agreement with the genetic evidence, and it motivates a refined dynamical definition of the EPB based on the remaining duration of reactive trajectories. Furthermore, our results indicate that the connectivity between the Line Islands and Clipperton Atoll is governed primarily by the seasonal modulation of the North Equatorial Countercurrent, rather than by the phase of the El Niño–Southern Oscillation (ENSO). Finally, Clipperton Atoll's role as a terminal sink for trajectories is relevant to the planned mining operations.
Read the full abstract

All authors Maria Olascoaga, Francisco Beron-Vera, Gage Bonner, Cora McKean

Dynamical Systems · Cross-listed from cs.GT

Social Distancing Equilibria in Games under Conventional SI Dynamics

The mathematical characterization of social-distancing games in classical epidemic theory remains an important question, for their applications to both infectious-disease theory and memetic theory. We consider a special case of the dynamic finite-duration SI social-distancing game where payoffs are accounted using Markov decision theory without discounting, while distancing is constrained by threshold-linear running-costs, and the running-cost of perfect-distancing is finite. In this special case, we are able construct strategic equilibria satisfying the Nash best-response condition explicitly by integration. Our constructions are obtained using a new change of variables which simplifies the geometry and analysis. As it turns out, there are no singular solutions, and a time-dependent bang-bang strategy consisting of a wait-and-see phase followed by a lock-down phase is always the unique strategic equilibrium. We also show that in a delay strategy space the bang-bang Nash equilibrium is an ESS, and that the optimal public policy exactly corresponds with the game equilibrium. Social distancing only turns out to be a valuable tool in reducing outbreak burden when the outbreak response delay falls in a Goldilocks zone, determined by the speed of outbreak detection and the relative rolling cost of social distancing.
Read the full abstract

Optimization and Control

Convergence of the Frank-Wolfe Algorithm for Monotone Variational Inequalities

We consider the Frank-Wolfe algorithm for solving variational inequalities over compact, convex sets under a monotone $C^1$ operator and vanishing, nonsummable step sizes. We introduce a continuous-time interpolation of the discrete iteration and use tools from dynamical systems theory to analyze its asymptotic behavior. This allows us to derive convergence results for the original discrete algorithm. Consequently, every cluster point of the iterates is a solution of the underlying variational inequality, the distance from the iterates to the solution set converges to zero, and the Frank-Wolfe gap vanishes asymptotically. In the strongly monotone case, the solution is unique and the iterates converge to it. In particular, this proves Hammond's conjecture on the convergence of generalized fictitious play. We also discuss rates of convergence and under what assumptions rates can be shown.
Read the full abstract

Dynamical Systems

A geometric approach to exponentially small splitting: The generic zero-Hopf bifurcation of co-dimension two

In this paper, we consider the unfolding of the real-analytic and generic zero-Hopf bifurcation of co-dimension two. It is well-known that in an open set of parameter space the splitting of one-dimensional stable and unstable manifolds is beyond all orders. This paper provides a new geometric dynamical-systems-oriented proof for the exponentially small splitting. As a novel aspect, we relate the exponentially small splitting to the lack of analyticity of center-like manifolds of generalized saddle-nodes. Moreover, the blowup method plays an important technical role as a systematic way to relate dynamics on different orders of magnitude. Finally, as our approach takes place in the (complexified) phase space, we do not rely on an explicit time-parametrization of the unperturbed heteroclinic connection. We therefore believe that our approach has general interest.
Read the full abstract

General Topology

Lifted Takahashi Convexity on the Isbell-Convex Hull of an Asymmetrically Normed Real Vector Space

Künzi and Yildiz introduced convexity structures in the sense of Takahashi for $T_{0}$-quasi-metric spaces. In this article, we continue this line of study on the Isbell-convex hull of an asymmetrically normed real vector space. Using the canonical hull quasi-metric and the vector-space operations on $\mathcal{E}(X,\|\cdot\|)$, we define a lifted convexity structure \[ \mathbb W(f,g,\lambda)=\lambda f\oplus(1-\lambda)g \] and show that $(\mathcal{E}(X,\|\cdot\|),q_{\mathcal{E}},\mathbb W)$ is a convex $T_{0}$-quasi-metric space. We further prove compatibility with the canonical embedding and relate the construction to $W$-convexity of minimal function pairs.
Read the full abstract

Combinatorics · Cross-listed from eess.SY

Maximum-Entropy Random Walks on Hypergraphs

Random walks are fundamental tools for analyzing complex networked systems, including social networks, biological systems, and communication infrastructures. While classical random walks focus on pairwise interactions, many real-world systems exhibit higher-order interactions naturally modeled by hypergraphs. Existing random walk models on hypergraphs often focus on undirected structures or do not incorporate entropy-based inference, limiting their ability to capture directional flows, uncertainty, or information diffusion in complex systems. In this article, we develop a maximum-entropy random walk framework on directed hypergraphs with two interaction mechanisms: broadcasting where a pivot node activates multiple receiver nodes and merging where multiple pivot nodes jointly influence a receiver node. We infer a transition kernel via a Kullback–Leibler divergence projection onto constraints enforcing stochasticity and stationarity. The resulting optimality conditions yield a multiplicative scaling form, implemented using Sinkhorn–Schrödinger-type iterations with tensor contractions. We further analyze ergodicity, including projected linear kernels for broadcasting and tensor spectral criteria for polynomial dynamics in merging. The effectiveness of our framework is demonstrated with both synthetic and real-world examples.
Read the full abstract

All authors Anqi Dong, Anzhi Sheng, Xin Mao, Can Chen

Group Theory

Profinite isomorphisms, stable commutator length, and fixed point properties

We construct Grothendieck pairs witnessing that stable commutator length and quasimorphisms are not profinite invariants, answering a question of Echtler and Kammeyer. Moreover, we recover the fact that property FA, property NL (which obstructs actions on hyperbolic spaces), and property FW$_\infty$ (which obstructs actions on finite-dimensional CAT(0) cube complexes) and the existence of non-abelian free subgroups are not profinite invariants. The method combines Rips constructions with iterated group-theoretic Dehn filling on hyperbolic virtually special groups.
Read the full abstract

Metric Geometry

A Complete Graphic Statics for Rigid-Jointed 3D Frames. Part 2: Homology of loops

This paper extends graphic statics by describing the forces and moments in any 3D rigid-jointed frame structure in terms of cell complexes using homology theory of algebraic topology. Graphic statics provides a highly geometric way to represent the equilibrium in bar structures. Unlike traditional matrix-based linear structural analysis which represents a structure as a set of nodes connected by bars, graphic statics imagines that the bar network defines a variety of higher-dimensional objects (polygonal faces, polyhedral cells, polytopes). These objects are related to piecewise-linear stress functions, the liftings of Maxwell, Rankine or Cremona. The requirement for such stress-functions to be plane-faced places a major limitation on the set of structures that can be analysed, as in many structures the spaces between bars do not correspond to flat polygonal regions. The CW-complexes of cellular homology provide a far-reaching generalisation of geometric notions such as polygons, polyhedra and polytopes, and their use here removes the requirement that spaces between bars must be flat. Here we demonstrate how any frame structure with bar-like members can be decomposed into a union of closed loops, each consisting of a closed circuit of bars. For general structures these loops are general closed space curves which cannot be spanned by flat polygons. Using chains of CW-complexes makes the new theory applicable to a much richer set of structural geometries. Unlike most descriptions of graphic statics, this approach is not restricted to purely axial forces. Shear forces, bending moments and torsional moments are included naturally, as described in Part 1 of this sequence of papers. Later papers will extend the approach to displacements, rotations and Virtual Work, and will give greater detail on how the loop formalism may be lifted toinvolve higher dimensional CW-complexes.
Read the full abstract

Functional Analysis

Spectral finiteness, quantum norm continuity and classical points

We prove various notions of uniform continuity for compact-quantum-group representations on Hilbert or Banach spaces equivalent to having finite spectrum, i.e. finitely many isotypic components. This generalizes the classical analogue for compact-group representations on Banach spaces, and relies in part on Riemann-Lebesgue-type decay properties for Fourier coefficients of elements in minimal tensor products with compact-quantum-group function algebras.
Read the full abstract

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

Active Brownian Dynamics in Channels: First-Passage and Spatiotemporal Properties via Siegmund Duality

Accumulation at boundaries represents a widely observed phenomenon in active systems with implications for microbial ecology and engineering applications. To rationalize the underlying physics, we study the first-passage properties and spatial distributions of an active Brownian particle (ABP) in a channel. Leveraging Siegmund duality, we establish a direct mapping between the propagators of ABPs with absorbing and hard-wall boundary conditions, yielding analytical results in both problems. We analyze the system across low and high activity regimes – quantifying persistent motion relative to diffusion – and show that active motion, together with a favorable initial orientation, typically lowers the mean first-passage time relative to passive diffusion. Notably, the full time-dependent propagator between hard walls approaches a wall-accumulated stationary state, given by the derivative of the splitting probability as a consequence of Siegmund duality.
Read the full abstract

Optimization and Control

Expanding Flow Shop Tasks Based on Recursive Functions

The paper discusses several extensions of the recursive representation of the flow shop scheduling problem. It is shown that recursive functions make it possible to describe multiple extensions in a single problem. The paper considers altogether six extensions. The examples consider three types of recursive functions: functions associated with the machine, functions that adjust the procession time based on constraints, and functions that control the feasibility of the schedule. The structure of the superpositions of these functions is presented, and also descriptions of several objective functions by recursive functions are presented. Then the general requirements for a recursive function are formulated and its properties are described. Finally, a demonstration of the formulation of new problems is provided using examples of simple flow shop extensions and branch and bound optimization.
Read the full abstract

All authors Boris Kupriyanov, Alexander Lazarev, Alexandr Roschin, Frank Werner

Mathematical Physics · Cross-listed from quant-ph

Operationalism, Causality, and Quantum Theory: a mostly time symmetric perspective

This is a book about operational probabilistic theories. The standard approach in such theories is from a time forward perspective. In this book we mostly take a time symmetric perspective. This presents a branding problem. Is this a niche book merely about time symmetry? No. This is a comprehensive book about operational probabilistic theories, but mostly from a time symmetric perspective. In fact, this book consists of (1) a simple book about simple operations having simple causal structure (where all the inputs are before all the outputs), and (2) a complex book about complex operations that can have complicated causal structure (a complex operation is equipped with a causal diagram). For the simple case we are able to show that the time symmetric perspective is equivalent to the time forward perspective. In each book we set up (A) operational probabilistic theories (OPTs) in terms of operations, (B) Operational Quantum Theory (OQT) in terms of operator tensors which correspond to operations, and (C) the theory of Hilbert objects which can be doubled up to give operator tensors. Operations are required to be physical which guarantees that circuits built out of operations have probabilities between 0 and 1 and that certain causality conditions are met. We prove that when we wire together operations the resulting networks are also physical. We model Sorkin's impossible measurements with complex operations and show that physicality prevents anomalous signalling. We develop diagrammatic notation for Hilbert objects. This includes mirrors for doubling up and mirror theorems. We use this framework to prove time symmetric causal dilation theorems for various causal diagrams.
Read the full abstract

Analysis of PDEs

Fractional $p$-caloric functions are Lipschitz

We study the parabolic fractional $p-$Laplace equation $\partial_t u+(-\Delta_p)^su = 0$ in the degenerate range $2 < p < 2/(1-s)$. We show that weak solutions are Lipschitz continuous in space and, if $p > 1/(1-s)$, also in time. We also prove a comparison principle for both weak and viscosity solutions, and establish the equivalence between the two notions of solution.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Chemical Reaction Networks Learn Better than Spiking Neural Networks

We mathematically prove that chemical reaction networks without hidden layers can solve tasks for which spiking neural networks require hidden layers. Our proof uses the deterministic mass-action kinetics formulation of chemical reaction networks. Specifically, we prove that a certain reaction network without hidden layers can learn a classification task previously proved to be achievable by a spiking neural network with hidden layers. We provide analytical regret bounds for the global behavior of the network and analyze its asymptotic behavior and Vapnik-Chervonenkis dimension. In a numerical experiment, we confirm the learning capacity of the proposed chemical reaction network for classifying handwritten digits in pixel images, and we show that it solves the task more accurately and efficiently than a spiking neural network with hidden layers. This provides a motivation for machine learning in chemical computers and a mathematical explanation for how biological cells might exhibit more efficient learning behavior within biochemical reaction networks than neuronal networks.
Read the full abstract

Probability

Low-Rank and Sparse Drift Estimation for High-Dimensional Lévy-Driven Ornstein–Uhlenbeck Processes

We study drift estimation for discretely observed high-dimensional Lévy-driven Ornstein–Uhlenbeck processes when the drift admits a low-rank-plus-sparse approximation. A localized, increment-truncated pseudo-likelihood is regularized by nuclear and entrywise $\ell_1$ norms. A weighted joint-cone argument and restricted cancellation condition yield non-asymptotic Frobenius oracle inequalities for exact and approximate structure. The stochastic complexity is $rd+s\log d$, with explicit discretization, truncation, and Lévy-regime sample-complexity terms. We derive operator- and infinity-norm score bounds from a Gaussian-width inequality and give a proximal-gradient algorithm. In 100-replicate experiments with mixed low-rank-plus-sparse drift, the estimator reduces mean relative Frobenius error by 4.4–5.9% versus localized Lasso and wins 89–92% of paired paths. Component diagnostics show that these gains concern recovery of the total drift rather than exact identification of its low-rank and sparse components.
Read the full abstract

Representation Theory

A metrically complete and Krull–Schmidt space of multiparameter persistence modules

We show that the observable category of q-tame multiparameter persistence modules satisfies good metric and algebraic properties: it forms a complete metric space with respect to the interleaving distance, and it is Krull–Schmidt in the sense that every object admits an essentially unique decomposition into indecomposables. Moreover, we show that these metric and algebraic structures are compatible: two objects are at distance zero if and only if they are isomorphic. We argue that the observable category of q-tame multiparameter persistence modules is the right setup for multiparameter persistence by showing that many of the categories already considered in the literature form full subcategory of this category. We also characterize precompact sets in terms of finite representation type of certain discretizations, and show that the image of several of the main constructions in multiparameter persistence is precompact.
Read the full abstract

Optimization and Control

Controlled Swarm Gradient Dynamics

We consider the global optimization of a non-convex potential $U : \mathbb{R}^d \to \mathbb{R}$ and extend the controlled simulated annealing framework introduced by Molin et al. (2026) to the class of swarm gradient dynamics, a family of Langevin-type mean-field diffusions whose noise intensity depends locally on the marginal density of the process. Building on the time-homogeneous model of Huang and Malik (2025), we first analyze its invariant probability density and show that, as the inverse temperature parameter tends to infinity, it converges weakly to a probability measure supported on the set of global minimizers of $U$. This result justifies using this family of invariant measures as an annealing curve in a controlled swarm setting. Given an arbitrary non-decreasing cooling schedule, we then prove the existence of a velocity field solving the continuity equation associated with the curve of invariant densities. Superimposing this field onto the swarm gradient dynamics yields a well-posed controlled process whose marginal law follows exactly the prescribed annealing curve. As a consequence, the controlled swarm dynamics converges toward global minimizers with, in principle, arbitrarily fast convergence rates, entirely dictated by the choice of the cooling schedule. Finally, we discuss an algorithmic implementation of the controlled dynamics and compare its performance with controlled simulated annealing, highlighting some numerical limitations.
Read the full abstract

Probability

High-temperature free energy for non-convex mean-field spin glasses with Mattis interactions

We study enriched mean-field vector spin glasses whose covariance function need not be convex. In a quantitative short-time regime, corresponding to sufficiently high temperature in the usual physical parameterization, we prove convergence of the quenched free energy to the differentiable solution of a infinite-dimensional Hamilton–Jacobi equation proposed for non-convex models. We identify that solution through its characteristics and a unique fixed point. The argument does not assume replica symmetry. We then allow a general continuous Mattis interaction $N G(m_N)$, obtain the corresponding variational formula, and prove a quenched large deviation principle for $m_N$. As an explicit application, we treat a bipartite model with Mattis fields, which is closely related to the Restricted Boltzmann Machine. The application requires neither a replica-symmetry assumption nor ellipticity or Nishimori identities; its restriction is the same quantitative high-temperature condition as in the general theorem.
Read the full abstract

Probability

Parisi formula and large deviations for mean-field spin glasses with Mattis interactions

We consider convex mean-field vector spin glasses perturbed by a general Mattis interaction $N G(m_N)$, where $m_N$ is a bounded vector-valued empirical average and $G$ is continuous. We prove a Parisi-type variational formula for the limiting quenched free energy and a quenched large deviation principle for $m_N$, both at every temperature. The approach is simple and modular: the only model-specific spin-glass input is the variational formula for every linear tilt of $m_N$ together with differentiability of the resulting free energy. The classical Gärtner–Ellis, Varadhan, and Bryc transfers then treat an arbitrary continuous $G$. Thus the same argument applies to a broad class of empirical observables and Mattis potentials, without a separate constrained-free-energy calculation for each model. As a scalar specialization, the framework contains the Gaussian spin-glass surrogate used in mismatched rank-one matrix estimation.
Read the full abstract

Analysis of PDEs

Fluid-Structure interactions with Navier- and full-slip boundary conditions

We show the existence of weak solutions to the fluid-structure interaction problem of a largely deforming viscoelastic bulk solid with a viscous fluid governed by the incompressible Navier-Stokes equations. In contrast to previous works, the fluid is allowed to slip along the solid boundary; namely, the so called Navier-slip boundary conditions are considered. Such boundary conditions naturally involve the time-changing outer normal of the fluid domain. Hence, their dependence on the varying geometry is one degree higher than in the previously considered no-slip case, which makes it necessary to adjust the concept of weak coupled solutions. Two classes of test functions are introduced: test functions that are continuous over the fluid-solid domain, and fluid-only test functions with nonzero tangential component at the boundary. The weak equations are established until the point of contact, and moreover, compatibility with the strong formulation is shown.
Read the full abstract

Optimization and Control

Well-posedness of boundary control systems and application to ISS for coupled heat equations with boundary disturbances and delays

This paper studies the existence of solutions and, in particular, the well-posedness of a class of boundary control systems. Our main result provides explicit and verifiable conditions on the system data that guarantee continuous dependence of solutions on the initial data and $L^p$-inputs. The proof relies on a new boundedness estimate for the input/output maps of linear time-invariant infinite-dimensional systems with unbounded control and observation operators. The developed technique is applied to derive specific conditions for the exponential input-to-state stability of boundary-coupled heat equations with boundary disturbances and time-delays.
Read the full abstract

Optimization and Control

Gradient-robustness in optimization subject to stationary Navier-Stokes equations

In this article, we discuss gradient robust discretizations for the simulation of non-linear incompressible Navier-Stokes problem and the optimal control of such flow. We consider several formulations of the flow problem that are equivalent for the continuous non-linear forward problem and compare their gradient robust discretization. We will then discuss the influence of the chosen formulation on the adjoint equations needed for gradient computation in the solution of the optimal control problem.
Read the full abstract

Differential Geometry

Geometric inequalities and the Alexandrov-Bakelman-Pucci technique

In this expository paper, we discuss a unified framework for proving various geometric inequalities, based on the so-called Alexandrov-Bakelman-Pucci technique. Examples include Cabré's proof of the classical isoperimetric inequality in Euclidean space; the Fenchel-Willmore-Chen inequality for the mean curvature of a submanifold; the sharp version of the Michael-Simon Sobolev inequality for submanifolds; the sharp version of Ecker's logarithmic Sobolev inequality for submanifolds; and the Sobolev inequality for complete manifolds with nonnegative Ricci curvature and Euclidean volume growth. Finally, we discuss a connection to the work of Heintze and Karcher on the volume of a tubular neighborhood of a hypersurface in a manifold with nonnegative Ricci curvature.
Read the full abstract