Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 2 March

Probability

Existence, properties, and parametric inference for possibly hyperuniform Gibbs perturbed lattices

This work lies at the intersection of Gibbs models and hyperuniform point processes. Classical Gibbs models, whether defined on lattices or in continuous space, provide flexible tools to describe interacting particle systems but are generally not hyperuniform. Conversely, known hyperuniform models such as the Ginibre process or perturbed lattices lack flexibility and typically cannot enforce physically relevant constraints such as hard-core interactions. We introduce a new class of models, termed Gibbs perturbed lattice models, which preserve a lattice structure while allowing interactions through a Hamiltonian defined on the perturbed particle locations. We establish existence results for the associated Gibbs measures, derive DLR-type equilibrium equations, and show that some models in this class exhibit hyperuniformity. Finally, we propose statistical inference methods based on the Takacs-Fiksel type approach and prove their asymptotic properties.
Read the full abstract

Information Theory

On Channel Model to Bridge the Gap between MIMO Design and Performance Requirements in 3GPP

Accurate channel modeling has become critical for evaluating multiple-input multiple-output (MIMO) performance, especially as 5G standardization matures and efforts toward 6G begin. Recent studies within the 3rd Generation Partnership Project (3GPP) have shown that the tapped delay line (TDL) model, currently used for performance testing, fails to capture the spatial propagation characteristics required for realistic MIMO evaluation. To address this limitation, the reduced clustered delay line (rCDL) model has been introduced as a more accurate alternative with manageable computational complexity, thereby enabling practical implementation in test equipment. This work investigates the rCDL through a comparative analysis with the legacy TDL. First, the angular characteristics of both models are examined. Then, their spatial profiles are compared with real-world measurements from a typical commercial deployment. The results reveal clear deficiencies in the TDL and show that the rCDL better matches measured propagation behavior. As a case study, channel state information (CSI) reporting performance is evaluated in single-user MIMO scenarios. The results show that, with appropriate simulation parameter settings, the rCDL enables clear discrimination between low- and high-resolution CSI reporting schemes, unlike the TDL. These findings confirm the relevance of the rCDL model for MIMO performance evaluation and support its use in current and future standardization efforts.
Read the full abstract

All authors Lynda Berrah, Raphael Visoz, Didier Le Ruyet, Anvar Tukmanov, Axel Müller, Alexander Hamilton, Matthew Baker

Probability · Cross-listed from cs.NE

Uniform-in-time concentration in two-layer neural networks via transportation inequalities

We quantify, uniformly over time and with high probability, the discrepancy between the predictions of a two-layer neural network trained by stochastic gradient descent (SGD) and their mean-field limit, for quadratic loss and ridge regularization. As a key ingredient, we establish T p transportation inequalities (p $\in$ {1, 2}) for the law of the SGD parameters, with explicit constants independent of the iteration index. We then prove uniform-in-time concentration of the empirical parameter measure around its mean-field limit in the Wasserstein distance W 1 , and we translate these bounds into prediction-error estimates against a fixed test function $\Phi$. We also derive analogous concentration bounds in the sliced-Wasserstein distance SW 1 , leading to dimension-free rates.
Read the full abstract

Optimization and Control

Time discretization of BSDEs with singular terminal condition using asymptotic expansion

We consider a class of backward stochastic differential equations (BSDEs) with singular terminal condition and develop a numerical scheme to approximate their solution. To this end, we extend an asymptotic development of the BSDE solution known from the power case, which arises from optimal liquidation problems, to more general generators. This expansion allows to obtain a suitable approximation of the BSDE solution close to the terminal time. Using this as a terminal condition, we analyze the error of a backward Euler implicit scheme and detail its dependence on the terminal condition.
Read the full abstract

Analysis of PDEs

Inverse problem for a multi-term time-fractional diffusion equation with the Caputo derivatives

This paper investigates an inverse source problem for a multi-term time-fractional diffusion equation with Caputo derivatives. The source term is separable as \(f(x)g(t)\), with the unknown spatial component \(f(x)\) reconstructed from an overdetermination condition at interior time \(t_0 \in (0, T]\). The elliptic part is governed by a self-adjoint positive differential operator \(A(x, D)\) of order \(m \ge 2\). The solution features a spectral representation using the multinomial Mittag-Leffler function, for which we derive novel precise asymptotic expansions. These asymptotics provide a uniform lower bound for the solution's characteristic denominator, enabling sufficient conditions for the existence of a classical solution. Uniqueness of the reconstructed source holds under natural assumptions on the data and \(g(t)\). Despite the problem's ill-posedness, high-regularity classical solutions are achievable under suitable structural conditions.
Read the full abstract

Symplectic Geometry

Fueter equations and the search for a higher dimensional Hamiltonian Floer theory I: analytical foundations and compactness

We study a Floer-theoretic approach to harmonic maps from the two-torus into non-flat Kähler manifolds. Building on the complex-regularized polysymplectic (CRPS) formalism of [BF24], which provides a Hamiltonian description of harmonic maps for which the associated equations are elliptic, we analyze the compactness of the associated moduli spaces of Fueter maps. For compact quotients $Q$ of complex hyperbolic space, we exploit the structure of the Biquard-Gauduchon hyperkähler metric to prove relative compactness under suitable smallness assumptions on the Hamiltonian. In the flat case, we establish the necessary quantitative $L^\infty$-estimates and outline a perturbative strategy for the non-flat setting.
Read the full abstract

Analysis of PDEs

On the Eigenvalues of the Biharmonic Steklov Problem on a Thin Set

This paper investigates the asymptotic behavior of the eigenvalues of the biharmonic operator on a thin set with Steklov boundary condition. The thin set is taken to be a tubular neighborhood of a planar smooth domain. We show that, as the thickness of this neighborhood tends to zero, all eigenvalues of the biharmonic operator with Steklov boundary condition converge to zero.
Read the full abstract

Probability

On a fractional stochastic heat equation arising from the disordered pinning model

We study the mild Skorohod solution to the following fractional stochastic heat equation on $\mathbb{R}$: \begin{equation} \begin{cases} \partial_t u(t,x)=-(-\Delta)^{\rho/2} u(t,x) +\beta u(t,x)\delta_0(x)\xi(t),\\ u(0,\cdot)=u_0(x), \end{cases} \end{equation} where $-(-\Delta)^{\rho/2}$ with $\rho\in(0,2]$ is the fractional Laplacian and $\xi$ is a Gaussian noise with covariance $\mathbb{E}[\xi(t) \xi(s)]=|t-s|^{2H-2}$ for $H\in(\frac12, 1]$. This equation with $\rho\in(1,2]$ arises naturally in the study of the disordered pinning model. We show that the equation admits a local $L^2$-solution when $\rho = 2$, whereas, for $\rho \in (0,2)$, any solution–if it exists uniquely–cannot be $L^p$-integrable for any $p > 1$. Moreover, inspired by the recent work of Quastel, Ramirez and Virág, we prove that the equation has a unique global $L^1$-solution whenever $\frac{1}{\rho}+1<2H$. We also establish the strict positivity of the solution. Our work partially fills the gap in the study of the Weinrib-Halperin prediction.
Read the full abstract

All authors Zi'an Li, Jian Song, Ran Wei, Hang Zhang

Probability · Cross-listed from q-fin.RM

Asymptotics of Ruin Probabilities in a Subordinated Cramér-Lundberg Model

We study a dynamic model of a non-life insurance portfolio. The foundation of the model is a compound Poisson process that represents the claims side of the insurer. To introduce clusters of claims appearing, e.g. with catastrophic events, this process is time-changed by a Lévy subordinator. The subordinator is chosen so that it evolves, on average, at the same speed as calendar time, creating a trade-off between intensity and severity. We show that such a transformation always has a negative impact on the probability of ruin. Despite the expected total claim amount remaining invariant, it turns out that the probability of ruin as a function of the initial capital falls arbitrarily slowly depending on the choice of the subordinator.
Read the full abstract

Number Theory

Mass equidistribution for lifts on hyperbolic $4$-manifolds

This paper is part of a broader project to establish the quantum unique ergodicity conjecture for Hecke-Maass forms on arithmetic hyperbolic $4$-manifolds. The conjecture is known in dimensions $2$ and $3$, but dimensions $4$ and higher present a new difficulty: ruling out concentration along certain homogeneous submanifolds whose stabilizers are non-tempered. We overcome it here for the Pitale lifts, a family of non-holomorphic analogues of Saito-Kurokawa lifts. Our main new ingredient is a construction of an amplifier with exceptional geometric properties. To the best of our knowledge, this is the first successful use of amplification to rule out concentration along a non-tempered subgroup.
Read the full abstract

Number Theory

Transfer principles and the Kato-Kuzumaki conjecture

We show that for tame valued fields of equal characteristic with divisible value group, the $C_i$ property lifts from the residue field to the valued field under suitable hypotheses on the residue field. We apply this transfer principle to prove Kato-Kuzumaki's conjecture in full generality for several arithmetically significant fields, for instance the field $\mathbf{C}(x_1,\dots,x_m)(\!(t_1)\!)\dots(\!(t_n)\!)$, and the perfections of both $\overline{\mathbf{F}}_p(x_1,\dots,x_m)(\!(t_1)\!)\dots(\!(t_n)\!)$ and $\mathbf{F}_p(\!(t_1)\!)\dots(\!(t_n)\!)$. Finally, we prove that $\mathbf{Q}_p$ satisfies the strong $C_1^1$ property, thereby answering a question of Wittenberg.
Read the full abstract

Numerical Analysis · Cross-listed from cs.CV

Neural Operator-Grounded Continuous Tensor Function Representation and Its Applications

Recently, continuous tensor functions have attracted increasing attention, because they can unifiedly represent data both on mesh grids and beyond mesh grids. However, since mode-$n$ product is essentially discrete and linear, the potential of current continuous tensor function representations is still locked. To break this bottleneck, we suggest neural operator-grounded mode-$n$ operators as a continuous and nonlinear alternative of discrete and linear mode-$n$ product. Instead of mapping the discrete core tensor to the discrete target tensor, proposed mode-$n$ operator directly maps the continuous core tensor function to the continuous target tensor function, which provides a genuine continuous representation of real-world data and can ameliorate discretization artifacts. Empowering with continuous and nonlinear mode-$n$ operators, we propose a neural operator-grounded continuous tensor function representation (abbreviated as NO-CTR), which can more faithfully represent complex real-world data compared with classic discrete tensor representations and continuous tensor function representations. Theoretically, we also prove that any continuous tensor function can be approximated by NO-CTR. To examine the capability of NO-CTR, we suggest an NO-CTR-based multi-dimensional data completion model. Extensive experiments across various data on regular mesh grids (multi-spectral images and color videos), on mesh girds with different resolutions (Sentinel-2 images) and beyond mesh grids (point clouds) demonstrate the superiority of NO-CTR.
Read the full abstract

All authors Ruoyang Su, Xi-Le Zhao, Sheng Liu, Wei-Hao Wu, Yisi Luo, Michael K. Ng

Information Theory · Cross-listed from quant-ph

Exposing Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fejér Filtering

Constrained quantum optimization algorithms need quantitative guarantees that connect circuit resources to the probability of actually sampling feasible or optimal solutions in finitely many shots. We establish such a connection by exposing a positive sampling law in which mixer-driven exploration and spectral selection can be controlled separately. We show that after removing interference between distinct cost eigenspaces as an analytic device, the measurement distribution becomes the normalized product of a mixer-induced exploration envelope and a Fejér spectral weight, with the former describing how the mixer spreads probability over the encoded manifold and the latter enhancing the target cost phase while suppressing spectrally separated nontarget phases. In this model, finite-shot success becomes a tractable competition between target weight and off-target leakage, yielding an explicit lower bound on the probability of sampling an optimum. For the primary bound, we rescale the cost Hamiltonian to an integer-valued spectrum, placing the wrapped cost phases on a controlled lattice for Fejér filtering. We then define $\delta$ as the minimum circular separation between the optimal phase and every nontarget phase. The single-shot success probability $q_0$ satisfies \[ q_0 \ge \frac{x}{1+x}, \qquad x = (p+1)^2 \sin^2\!\left(\frac{\delta}{2}\right) C_{\beta}, \] where $p$ is the filter order and $C_{\beta}$ is the mixer-envelope mass on the optimal set, exposing a finite-resource compensation law in which weaker phase separation or smaller envelope mass can be compensated by increased filter order and additional shots. The same filtering principle exposes a feasibility guarantee when applied to penalty phases. We further prove analogous bounds for nonlattice spectra through off-target suppression, extending our results beyond exact lattice normalization.
Read the full abstract

Differential Geometry

Localized Curvature Domination and Rigidity of Harmonic Maps

We establish a localized Bochner-type rigidity theorem for harmonic maps between Riemannian manifolds. Let $f : (M,g) \to (\overline{M},\overline{g})$ be a harmonic map from a compact manifold. Instead of assuming a global nonpositivity condition on the sectional curvature of the target, we impose a curvature bound localized to the image $f(M)$, expressed via the maximal sectional curvature encountered along the image. We prove that if the minimal Ricci curvature of the domain dominates this image-dependent curvature bound in a sharp quantitative pinching inequality involving the maximal energy density of $f$, then the map is constant. At the critical threshold, we obtain a homothetic classification: the differential is parallel and the image is totally geodesic. The result replaces global curvature sign assumptions with an image-dependent curvature domination principle and yields a localized analogue of Yano-Ishihara-type rigidity.
Read the full abstract

Analysis of PDEs

Asymptotic stability threshold of the 2-D monotone shear flow with no-slip boundary condition

In this paper, we investigate the asymptotic stability threshold problem for the 2-D Navier-Stokes equations in a finite channel with no-slip boundary conditions, around monotone shear flow $(U(t,y),0)$. We establish that the flow is asymptotically stable under perturbations satisfying $\|u^{\mathrm{in}}\|_{H^2}\leq c\nu^{\frac12}$. To achieve the stability threshold $\nu^{\frac{1}{2}}$, the key ingredients of the proof include: sharp resolvent estimates for the vorticity based on weak-type resolvent bounds; weighted space-time estimates for the vorticity; pointwise estimates for the velocity. Furthermore, we handle the nonlinear term through a divergence formulation, which facilitates the sharp application of the aforementioned space-time estimates.
Read the full abstract

Analysis of PDEs

Construction of infinite time bubble tower solutions to critical wave maps equation

We construct infinite time bubble tower solutions to the critical wave maps equation taking values in the two-sphere. More precisely, for any integers $k\geq3$ and $J\geq1$, we construct a solution that is global in one time direction, has $k$-corotational symmetry, and asymptotically decomposes into $J$-many concentric bubbles of alternating signs with asymptotically vanishing radiation. The scales of each bubble are of order $t^{-\alpha_{j}}$ with $\alpha_{j}=(\frac{k}{k-2})^{j-1}-1$. This shows the existence of multi-bubble solutions with an arbitrary number of bubbles in soliton resolution, provided that $k\geq3$, global existence in one time direction, and alternating signs are considered. Our proof is based on modulation analysis with the method of backward construction. The key new ingredient is a Morawetz-type functional that provides suitable monotonicity estimates for solutions around multi-bubble configurations.
Read the full abstract

Probability · Cross-listed from q-bio.PE

Approximate message passing for block-structured ecological systems

Ecological interaction networks are rarely homogeneous: species naturally form communities with distinct interaction structures, resulting in block-structured variance and correlation profiles in the interaction matrix. We study the equilibrium properties of generalized Lotka-Volterra systems whose interaction matrices are random and non-symmetric with variance and correlation profiles. Based on recent advances in approximate message passing (AMP) for heterogeneous and correlated random matrices, we derive a set of self-consistent fixed-point equations that, in the large-$n$ limit, characterize the equilibrium abundance distribution. In particular, we show that this limiting distribution is an explicit mixture of truncated Gaussians, driven by the variance and correlation profiles. We then illustrate the ecological implications of this result through three applications involving two interacting communities. First, we show that local changes in the correlation profile within a single community induce system-wide responses in species persistence, revealing the non-local nature of persistence dynamics. Second, we find that communities dominated by mutualistic or competitive interactions are more robust to increasing inter-community coupling, whereas communities structured by predator-prey interactions are more prone to collapse. Third, we demonstrate that asymmetric interaction variance alone, in the complete absence of correlation, can generate feedback loop between communities.
Read the full abstract

Numerical Analysis

Importance sampling and active subspace in quasi-Monte Carlo

Quasi-Monte Carlo (QMC) is widely used in computational finance, and its efficiency strongly depends on the smoothness and effective dimension of the integrand. In this work, we propose a three-step approach, referred to as the IS\_AS\_PI method, which sequentially applies importance sampling (IS), the active subspace (AS) method and preintegration (PI). The proposed method overcomes the problem of empirical failure in constructing active subspaces when nonzero payoff gradients are rarely sampled. Here, empirical failure means that the estimated gradient information matrix is zero and thus provides no useful directions. We establish the orthogonal invariance of active subspaces and IS-active subspaces under suitable conditions. The method is applied to pricing Asian and basket options and estimating the Delta of Asian options under the Black–Scholes model. Numerical experiments show that the proposed method avoids this empirical failure in the deep out-of-the-money cases. Moreover, in all experiments, the proposed method with Laplace IS achieves the largest variance reduction factors, indicating the best performance, among the methods compared.
Read the full abstract

Information Theory

Type-Based Unsourced Multiple Access Over Fading Channels in Distributed MIMO With Application to Multi-Target Localization

We consider the problem of type estimation over unsourced multiple access fading channels in distributed multiple-input multiple-output (D-MIMO) systems. Unlike classical unsourced multiple access, type-based unsourced multiple access (TUMA) aims to estimate the type, i.e., the empirical distribution of transmitted messages. We extend our prior work on TUMA over additive white Gaussian channels to fading scenarios in which neither the transmitters nor the receiver have channel state information. To mitigate the impact of path-loss variability, we employ location-based codebook partitioning: users with similar large-scale fading coefficients use the same codebook. The decoder is built on the multisource approximate message passing algorithm proposed by Cakmak et al. (2025), and supports both centralized and distributed implementations. As an application, we demonstrate how TUMA enables efficient communication in a multi-target localization setting, where distributed sensors report to a D-MIMO receiver quantized target positions. We propose a performance cost function that combines localization errors with a misdetection penalty, and use it to characterize how performance depends on the fraction of resources assigned to sensing vs. communication, as well as on the number of bits used to quantize the positions of the targets.
Read the full abstract

All authors Kaan Okumus, Khac-Hoang Ngo, Giuseppe Durisi, Erik G. Ström

Number Theory

Jacob's ladders and the equivalent of the Fermat-Wiles theorem generated by the Hardy-Littlewood formula (1921)

In this paper we prove that the 105 years old Lemma 18 of Hardy and Littlewood from theirs fundamental paper \cite{2} is able to generate, for example, a continuum set of new $\zeta$-equivalents of the Fermat-Wiles theorem.

Representation Theory · Cross-listed from hep-th

Higgs Branch and VOA of 4d $\mathcal{N}=2$ SCFTs from IIB

We study the Higgs branch and associated vertex operator algebra (VOA) of 4d $\mathcal{N}=2$ superconformal field theories (SCFTs) from the geometric engineering of IIB superstring on canonical threefold singularities. For terminal singularities, we explain how to derive the 4d Higgs branch from their small resolution. We also investigate singularities with compact 4-cycles in their crepant resolution, and discuss different ways to compute their Higgs branch. Using a symplectic duality argument, we propose the first examples of 4d $\mathcal{N}=2$ SCFTs with the E-type Kleinian singularities as their Higgs branches, and conjecture their associated VOA to be affine E-type W-algebra. Many new VOAs with no known W-algebra descriptions are found, with conjectured associated varieties. We investigate the singularities associated with lisse VOAs and propose predictions for the BPS quivers of $D_N^N[k]$ and $E_7^{14}[k]$ from the perspective of deformed singularities. We further analyze the structure of the Schur index using the Coulomb branch IR formula, derive the expressions for the Schur index corresponding to these two classes of singularities, and illustrate, in a general setting, how the Schur index is determined by the BPS quiver.
Read the full abstract

Combinatorics

Quasi-Hermitian Varieties and Their Barlotti–Cofman Representation

Quasi-Hermitian varieties arise as higher-dimensional generalizations of non-classical unitals, including the Buekenhout–Metz (BM) and Buekenhout–Tits (BT) families. After reviewing known constructions and structural properties, we determine explicitly the BC representation of BM and BT quasi-Hermitian varieties in $\mathrm{PG}(3,q^2)$ inside $\mathrm{PG}(6,q)$. We show that BM varieties correspond to quadratic cones with hyperbolic base, whereas BT varieties give rise to non-quadratic cones, and we describe the associated configuration of spread elements in the section at infinity. These results provide a geometric interpretation of the non-classical nature of BM and BT varieties within the BC framework.
Read the full abstract

Statistics Theory · Cross-listed from eess.SP

Detection of weak signals under arbitrary noise distributions

Detecting weak signals buried in complex, non-Gaussian noise is a fundamental challenge in science and engineering, with applications ranging from radar systems and communications to industrial monitoring and gravitational wave detection. The Rao detector, a key concept in this domain, achieves asymptotically optimal performance as the number of measurements increases, but requires precise knowledge of the data's statistical properties, often relying on simplified noise models. We propose a hybrid framework that combines a lightweight neural network with the Rao detection framework to address this limitation. The neural network, trained on noise-only data, learns the optimal multivariate nonlinearity, transforming noisy data to enhance signal detectability. The newly introduced LRao detector then fully extracts the signal information, achieving asymptotically optimal performance even under challenging noise conditions. Validated on both simulated and real-world magnetic sensor data, our method significantly outperforms conventional approaches. By bridging data-driven techniques with model-based signal processing, it offers a robust and interpretable solution for signal detection across diverse applications.
Read the full abstract

All authors J. Zschetzsche, M. Weimar, O. Lang, S. Schuster, A. Haberl, S. Schertler, B. Lehner, J. Reisinger, M. Huemer, S. Rotter

Information Theory

The Expurgated Error Exponent is Not Universally Achievable

We study the universal attainability of the expurgated error exponent for discrete memoryless channels (DMCs). While the random-coding exponent is known to be universally attainable for every fixed input distribution via maximum mutual information (MMI) decoding for DMCs, it remains open whether the expurgated exponent can be attained universally. We show that this is not the case in general. Specifically, we construct a family of DMCs for which no single sequence of codes can attain the expurgated exponent simultaneously for all channels in the family, even at rate zero. In addition, for the same channel family, we show that MMI decoding fails to achieve the expurgated exponent for any channel in the family.
Read the full abstract

Optimization and Control

Block-coordinate Plug-And-Play Methods with Armijo-like line-search for Image Restoration

In this paper, we develop a class of block-coordinate forward-backward methods for solving non-convex and non-separable composite optimization problems, and specialize them to imaging inverse problems within the Plug-and-Play (PnP) framework based on Gradient Step (GS) denoisers. The block-coordinate strategy is designed to reduce the high memory consumption associated with the computation of GS denoisers, whose implementation typically requires storing large computational graphs. The proposed methods allow for the joint use of inertial acceleration, variable metric strategies, inexact proximal computations, and adaptive steplength selection via an appropriate line-search procedure. Under mild assumptions on the objective function, we establish a sublinear convergence rate and the stationarity of the limit points. Moreover, convergence of the entire sequence of the iterates is guaranteed under a Kurdyka-Łojasiewicz assumption. Numerical experiments on ill-posed imaging problems, including deblurring and super-resolution, demonstrate that the proposed PnP approach achieves state-of-the-art reconstruction quality while substantially reducing GPU memory requirements, making it particularly suitable for large-scale and resource-constrained imaging applications.
Read the full abstract

Optimization and Control

LOTUS: A Warm-Start Framework for Powering Dual Decomposition in Large-Scale Two-Stage Stochastic Programs

Solving large two-stage stochastic mixed-integer programs is computationally challenging. We propose LOTUS, a subset-based warm-start framework that enhances Dual Decomposition under fixed time budgets. By initializing the dual search with informed multipliers, LOTUS accelerates primal convergence and partially alleviates the impact of weak LP relaxations. Through an extensive computational study on production planning instances, we show that, within two hours, LOTUS yields significantly better primal solutions in 45.83% of cases, while being outperformed by Dual Decomposition in only 4.17%.
Read the full abstract

All authors Emma Cornielje, Berend Markhorst, Alessandro Zocca, Rob van der Mei

Numerical Analysis

Solving Inverse PDE Problems using Minimization Methods and AI

Many physical and engineering systems require solving direct problems to predict behavior and inverse problems to determine unknown parameters from measurement. In this work, we study both aspects for systems governed by differential equations, contrasting well-established numerical methods with new AI-based techniques, specifically Physics-Informed Neural Networks (PINNs). We first analyze the logistic differential equation, using its closed-form solution to verify numerical schemes and validate PINN performance. We then address the Porous Medium Equation (PME), a nonlinear partial differential equation with no general closed-form solution, building strong solvers of the direct problem and testing techniques for parameter estimation in the inverse problem. Our results suggest that PINNs can closely estimate solutions at competitive computational cost, and thus propose an effective tool for solving both direct and inverse problems for complex systems.
Read the full abstract

Numerical Analysis

Multi-patient Inverse Estimation of Effective Membrane Diffusion Coefficients in Calcium-Citrate Hemodialysis

We propose a multi-patient inverse modeling framework for identifying effective calcium and citrate diffusion coefficients in hollow-fiber hemodialysis devices. The approach relies on a coupled forward model combining axisymmetric fluid dynamics with multi-species convection-reaction-diffusion, together with a derivative-free optimization strategy to estimate membrane transport parameters from outlet concentration measurements. To account for inter-patient variability, physiological input parameters are first generated from clinical data and complemented by a patient-specific hydraulic calibration step, ensuring physical consistency across the synthetic cohort. The inverse problem is formulated as a global least-squares minimization aggregating residuals over multiple patients. Numerical experiments on synthetic data demonstrate multi-patient identifiability of the diffusion coefficients in the exact-data setting. Robustness with respect to measurement noise is subsequently assessed by perturbing observable outputs at various noise levels, and sensitivity analyses are performed to quantify the influence of membrane transport parameters on model predictions. The methodology is then applied to real clinical data obtained from an AK200 Gambro/Nikkiso DBB07 dialysis system. The results indicate that aggregating information from several patients substantially improves parameter identifiability and stability compared to single-patient inversions. Overall, this work provides a physically consistent and computationally tractable framework for multi-patient parameter estimation in dialysis models, and opens perspectives for large-scale personalization through physics-informed surrogate modeling.
Read the full abstract

Analysis of PDEs

Localizing acoustic and electromagnetic waves in space and time

We study time-dependent acoustic and electromagnetic waves governed by the scalar wave equation or Maxwell's equations in a bounded three-dimensional domain. We establish the existence of time-dependent boundary excitations that can be prescribed on any open subset of the boundary of the domain such that the associated waves are strongly localized in space in the sense that they possess arbitrarily large norms in a given subdomain and on a given time-interval, while remaining arbitrarily small in any other given subdomain for all times. Similarly, we also show the existence of boundary data such that the associated waves are strongly localized in time in the sense that they possess arbitrarily large norms in a given subdomain and on a given time-interval, while remaining arbitrarily small on the same subdomain but on any other prescribed time-interval. In case that we have access to the possibly inhomogeneous coefficients in the wave equation or in the Maxwell system, we also give explicit constructions to obtain boundary data that generate these localized waves, and we comment on possible applications.
Read the full abstract

Information Theory

Energy Efficiency Maximization for Integrated Sensing and Communications in Satellite-UAV MIMO Systems

This paper investigates energy efficiency maximization in an integrated sensing and communication framework for satellite-UAV MIMO systems, where a LEO satellite and a UAV simultaneously serve ground users and perform target sensing. Both the satellite and UAV are equipped with uniform planar arrays of transmit antennas, enabling a distributed multi-user and multi-target architecture. We derive the achievable downlink throughput by considering that the high-altitude satellite maintains a line-of-sight (LoS) link with users, while adopting a probabilistic model for the UAV that accounts for the likelihood of both LoS and non-line-of-sight conditions. The energy efficiency maximization problem is formulated as a complex non-convex optimization problem, subject to power constraints, quality of service (QoS) requirements, and beampattern gain constraints for accurate sensing. To tackle this challenge, we propose an efficient alternating optimization algorithm capable of handling the complex search space and QoS guarantees. Numerical results across diverse scenarios with multiple users demonstrate that the proposed method achieves high energy efficiency while meeting both communication and sensing performance targets.
Read the full abstract

All authors Ngo Tran Anh Thu, Pham Dang Anh Duc, Bui Trong Duc, Nguyen Minh Quan, Trinh Van Chien, Hoang D. Le