Dynamical Systems
Best Practices on QSP Model Reporting for Regulatory Use: perspectives from ISoP QSP SIG Working Group
Susana Zaph, Blerta Shtylla, Steve Chang et al. (+12 more)
Quantitative systems pharmacology (QSP) models are increasingly applied to inform decision making across drug development and to support regulatory interactions within model informed drug development (MIDD). QSP supports a broad range of applications across drug development and can be tailored to specific therapeutic areas, mechanisms of action, and contexts of use (CoU). While this diversity is a core strength of QSP, it also presents challenges for reporting for regulatory use. Despite the growing impact of QSP models, there is currently no established guidance on how QSP analyses should be documented and reported for regulatory purposes. This white paper, developed by the International Society of Pharmacometrics (ISoP) QSP Special Interest Group Working Group on Credibility Assessment of QSP for Regulatory Use, seeks to address this gap by proposing best practices for QSP model reporting in regulatory settings. The recommendations are grounded in collective real world experience from regulatory interactions and are aligned with reporting guidance established for physiologically based pharmacokinetic (PBPK) modeling and reporting principles outlined in ICH M15. Rather than prescribing a rigid, one size fits all template, this work proposes a flexible, tiered reporting framework that accounts for development phase and model impact. The proposed framework is intended to facilitate regulatory review and enhance transparency while accommodating the inherent diversity of QSP modeling.
Read the full abstract ▾
All authors Susana Zaph, Blerta Shtylla, Steve Chang, Yougan Cheng, Jingqi Q.X. Gong, Abhishek Gulati, Emma Hansson, Alexander Kulesza, Alexander V. Ratushny, Federico Reali, Conner Sandefur, Brian Schmidt, Fulya Akpinar Singh, Monica Susilo, Weirong Wang
Probability · Cross-listed from stat.ML
Intensity Dot Product Graphs
Giulio Valentino Dalla Riva and Matteo Dalla Riva
Latent-position random graph models usually treat the node set as fixed once the sample size is chosen, while graphon-based and random-measure constructions allow more randomness at the cost of weaker
geometric interpretability. We introduce Intensity Dot Product Graphs (IDPGs), which extend Random Dot Product Graphs by replacing a fixed collection of latent positions with a Poisson point process on a Euclidean latent space. This yields a model with random node populations, RDPG-style dot-product affinities, and a population-level intensity that links continuous latent structure to finite observed graphs. We define the heat map and the desire operator as continuous analogues of the probability
matrix, prove a spectral consistency result connecting adjacency singular values to the operator spectrum, compare the construction with graphon and digraphon representations, and show how classical RDPGs arise in a concentrated limit. Because the model is parameterized by an evolving intensity, temporal extensions through partial differential equations arise naturally.
Read the full abstract ▾
Information Theory · Cross-listed from stat.ML
Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
Ivan Lau and Jonathan Scarlett
In this paper, we study the problem of mean estimation under 1-bit communication constraints. We propose a novel adaptive mean
estimator based solely on randomized threshold queries, where each 1-bit outcome indicates whether a given sample exceeds a sequentially chosen threshold. Our
estimator is $(\epsilon, \delta)$-PAC for any distribution with a bounded mean $\mu \in [-\lambda, \lambda]$ and a bounded $k$-th central moment $\mathbb{E}[|X-\mu|^k] \le \sigma^k$ for any fixed $k > 1$. Moreover, our sample complexity is order-optimal in all such tail regimes, i.e., for every such $k$ value. For $k \neq 2$, our
estimator's sample complexity matches the unquantized minimax lower bounds plus an unavoidable $O(\log(\lambda/\sigma))$ localization cost. For the finite-variance case ($k=2$), our
estimator's sample complexity has an extra multiplicative $O(\log(\sigma/\epsilon))$ penalty, and we establish a novel information-theoretic lower bound showing that this penalty is a fundamental limit of 1-bit quantization. We also establish a significant adaptivity gap: for both threshold queries and more general interval queries, the sample complexity of any non-adaptive
estimator must scale linearly with the search space parameter $\lambda/\sigma$, rendering it vastly less sample efficient than our adaptive approach. Finally, we present algorithmic variants that (i) handle an unknown sampling budget, (ii) adapt to an unknown scale parameter $\sigma$ given (possibly loose) bounds, (iii) require only two stages of adaptivity to achieve order-optimal sample complexity at the expense of more general 1-bit queries, and (iv) leverage multiple local samples per 1-bit query to proportionally reduce communication costs.
Read the full abstract ▾
Numerical Analysis
Error Analysis of a Conforming FEM for Multidimensional Fragmentation Equations
Arushi and Naresh Kumar
In this work, we develop and analyze a higher-order finite element method for the multidimensional fragmentation equation. To the best of our knowledge, this is the first study to establish a rigorous, conforming finite element framework for high-order spatial approximation of multidimensional fragmentation models. The scheme is formulated in a variational setting, and its stability and convergence properties are derived through a detailed mathematical analysis. In particular, the $L^2$ projection operator is used to obtain optimal-order spatial error estimates under suitable regularity assumptions on the exact solution. For temporal discretization, a second-order backward differentiation formula (BDF2) is adopted, yielding a fully discrete scheme that achieves second-order convergence in time. The theoretical analysis establishes $ L^2$-optimal convergence rates of ${\cal O}(h^{r+1})$ in space, together with second-order accuracy in time. The theoretical findings are validated through a series of numerical experiments in two and three space dimensions. The computational results confirm the predicted error estimates and demonstrate the robustness of the proposed method for various choices of fragmentation kernels and selection functions.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Towards socio-techno-economic power systems with demand-side flexibility
Hanmin Cai, Federica Bellizio, Yi Guo et al. (+11 more)
Harnessing the demand-side flexibility in building and mobility sectors can help to better integrate renewable energy into power systems and reduce global CO2 emissions. Enabling this sector coupling can be achieved with advances in energy management, business models, control technologies, and power grids. The study of demand-side flexibility extends beyond engineering, spanning social science, economics, and power and control systems, which present both challenges and opportunities to researchers and engineers in these fields. This Review outlines recent trends and studies in social, economic, and technological advancements in power systems that leverage demand-side flexibility. We first provide a concept of a socio-techno-economic system with an abstraction of end-users, building and mobility sectors, control systems, electricity
markets, and power grids. We discuss the interconnections between these elements, highlighting the importance of bidirectional flows of information and coordinated decision-making. We then emphasize that fully realizing demand-side flexibility necessitates deep integration across stakeholders and systems, moving beyond siloed approaches. Finally, we discuss the future directions in renewable-based power systems and control engineering to address key challenges from both research and practitioners' perspectives. A holistic approach for identifying, measuring, and utilizing demand-side flexibility is key to successfully maximizing its multi-stakeholder benefits but requires further transdisciplinary collaboration and commercially viable solutions for broader implementation.
Read the full abstract ▾
All authors Hanmin Cai, Federica Bellizio, Yi Guo, Gabriele Humbert, Mina Montazeri, Julie Rousseau, Matthias Brandes, Arnab Chatterjee, Andrea Gattiglio, Leandro von Krannichfeldt, Emmanouil Thrampoulidis, Varsha N. Behrunani, Goran Strbac, Philipp Heer
Geometric Topology
A Dehornoy-Type Ordering on Bridge Positions of Links
Makoto Ozawa
By a
theorem of Hovland, bridge isotopy classes of $n$-bridge positions of links in $S^3$ correspond bijectively to Hilden double cosets $P_{2n}=H_{2n}\backslash B_{2n}/H_{2n}$. We use this correspondence to introduce Dehornoy-type orderings on bridge positions. After fixing a proper complexity function on $B_{2n}$, we assign to each double coset its Dehornoy-minimal braid among the elements of minimal complexity. Comparing these representatives by the Dehornoy order gives a strict total order $\prec_{D,n}$, and comparing them first by complexity and then by the Dehornoy order gives a strict well-order $\triangleleft_{D,n}$. For a link type $L$ and $n\geq b(L)$, we single out a canonical $n$-bridge position $\operatorname{CanPlat}_D^{(n)}(L)$: it is the $\triangleleft_{D,n}$-least element of the set of $n$-bridge positions of $L$, and the $\prec_{D,n}$-least element among those of minimal complexity, and its canonical braid coincides with the globally Dehornoy-minimal braid of minimal complexity representing $L$. We show by an example that, in general, it need not be least for $\prec_{D,n}$ on the whole set. Finally, we show that the fixed-level bridge finiteness
conjecture is equivalent to boundedness of the complexities of the canonical representatives, and to the existence of a $\triangleleft_{D,n}$-greatest $n$-bridge position.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
Inverse Laplace and Mellin integral transforms modified for use in quantum communications
Gustavo Alvarez and Igor Kondrashuk
Integral transformations are useful mathematical tool to work out signals and wave-packets in electronic devices. They may be used in software protocols. Necessary knowledge may come from
quantum field theory, in particular from
quantum chromodynamics, in which the optic
theorem and the renormalization group equation can be solved by a unique contour integral written in two different "dual" ways related between themselves by a complex map in the complex plane of Mellin variable. The inverse integral transformation should be modified to be applied for these contour integral solutions. These modified inverse transformations may be used in security protocols for
quantum computers. Here we do a brief review of the basic integral transforms and propose their modification for the extended domains.
Read the full abstract ▾
Analysis of PDEs
On partial type I solutions to the Axially symmetric Navier-Stokes equations
Qi S Zhang
Let $v= v_{r}e_{r} + v_{\th}e_{\th} + v_{3}e_{3}$ be a Leray-
Hopf solution to the axially symmetric Navier-Stokes equations (ASNS). We call it a partial type I solution if $v_r(x, t) \ge -C/\sqrt{T-t}$ for some constant $C>0$ and $(x, t) \in \mathbf{R}^3 \times [0, T)$. In this paper, it is proven that such solution does not blow up at time $T$ under the extra mild assumption that $|v_\theta(x, 0)| |x'|$ is bounded. This extends a well known result by two groups of people who proved the no blowup conclusion under the full type I condition: $|v(x, t)| \le C/\sqrt{T-t}$. The result also confirms the physical intuition that potential blow ups for ASNS are caused by super-critical inward radial velocity.
Read the full abstract ▾
Analysis of PDEs
Harnack inequality for anisotropic fully nonlinear equations with nonstandard growth
Sun-Sig Byun and Hongsoo Kim
We establish Harnack inequalities for viscosity solutions of a class of degenerate fully nonlinear anisotropic
elliptic equations with nonstandard growth, including anisotropic-$(p_i)$-
Laplacian type equations with rough coefficients. The estimates hold under the explicit exponent condition: \begin{align*} p_n < \frac{\left(n- \frac{\lambda}{\Lambda}\right)\bar{p}}{n-\frac{\lambda}{\Lambda}\bar{p}}\quad \text{ or }\quad \bar{p} \geq\frac{\Lambda}{\lambda}n, \end{align*} where $\bar{p}$ is the harmonic mean of $2 \leq p_1 \leq \cdots \leq p_n$. The key ingredient is a new max-type anisotropic barrier, constructed by maximizing over an auxiliary variable and balancing the different directional homogeneities. Combined with measure estimates and intrinsic-geometry arguments, this barrier yields the Harnack inequality. In the constant-coefficient case $\lambda=\Lambda$, we prove that the exponent condition is sharp for both weak and viscosity solutions. Using the same max-type approach, in the supercritical regime we construct a nontrivial nonnegative entire solution vanishing on a hyperplane, while at the critical threshold we construct positive entire solutions with arbitrarily large Harnack ratios. Finally, we exhibit a fully nonlinear counterexample showing that, for the general class, dependence of the admissible exponent range on the ellipticity ratio $\frac{\lambda}{\Lambda}$ cannot in general be removed.
Read the full abstract ▾
Optimization and Control · Cross-listed from cond-mat.stat-mech
Generative optimal transport via forward-backward HJB matching
Haiqian Yang, Vishaal Krishnan, Sumit Sinha et al. (+1 more)
Controlling the
evolution of a many-body
stochastic system from a disordered reference state to a structured target ensemble, characterized empirically through samples, arises naturally in non-
equilibrium statistical mechanics and
stochastic control. The natural relaxation of such a system - driven by
diffusion - runs from the structured target toward the disordered reference. The natural question is then: what is the minimum-work
stochastic process that reverses this relaxation, given a pathwise cost functional combining spatial penalties and control effort? Computing this optimal process requires knowledge of trajectories that already sample the target ensemble - precisely the object one is trying to construct. We resolve this by establishing a time-reversal duality: the value function governing the hard backward dynamics satisfies an equivalent forward-in-time HJB equation, whose solution can be read off directly from the tractable forward relaxation trajectories. Via the Cole-
Hopf transformation and its associated Feynman-Kac representation, this forward potential is computed as a path-space free energy averaged over these forward trajectories - the same relaxation paths that are easy to simulate - without any backward simulation or knowledge of the target beyond samples. The resulting framework provides a physically interpretable description of
stochastic transport in terms of path-space free energy, risk-sensitive control, and spatial cost geometry. We illustrate the theory with numerical examples that visualize the learned value function and the induced controlled
diffusions, demonstrating how spatial cost fields shape transport geometry analogously to Fermat's Principle in inhomogeneous media. Our results establish a unifying connection between
stochastic optimal control, Schrödinger bridge theory, and non-
equilibrium statistical mechanics.
Read the full abstract ▾
All authors Haiqian Yang, Vishaal Krishnan, Sumit Sinha, L. Mahadevan
Probability
Euler–Maruyama scheme for $\alpha$-stable SDE with distributional drift
Zimo Hao and Mingyan Wu
In this paper, we consider a class of
stochastic differential equations driven by symmetric non-degenerate $\alpha$-stable processes (including cylindrical ones) with $\alpha \in (1,2)$. We first establish a quantitative estimate for the Euler scheme under bounded drift $b(x)$, with an explicit dependence on $ \| b \|_{L^\infty}$. Then we obtain the weak convergence rates for the case where the drift coefficient belongs to a Besov space of negative order.
Read the full abstract ▾
Probability
A finite-sample Borel–Cantelli inequality under $m$-dependence
Chatchawan Panraksa
We prove an explicit finite-sample version of the Borel–Cantelli lemma under $m$-dependence. Given any $m$-dependent sequence of events $(A_k)_{1\leq k\leq N}$, we show that \[ \mathbb{P}\Bigl(\bigcup_{k=1}^N A_k\Bigr) \ge 1 - \exp\Bigl(-\frac{1}{m+1} \sum_{k=1}^{N} \mathbb{P}(A_k)\Bigr). \] The proof splits the index set into residue classes modulo $m+1$, so that each class consists of mutually independent events, and then applies an elementary product–to–exponential bound. We further derive a quantitative windowed corollary: if the partial sums satisfy \(\sum_{k=1}^{\phi(n)}\mathbb{P}(A_k)\ge n\) for all \(n\ge1\), then for every \(N\ge1\) and \(i\ge0\), \[ \mathbb{P}\Bigl(\bigcup_{k=i+1}^{\phi(i+N)} A_k\Bigr) \ge 1-\exp\Bigl(-\frac{N}{m+1}\Bigr). \] Finally, we present a complementary second-order refinement involving local pairwise intersection probabilities. These results complement the asymptotic and rate results of Lu, Shi and Zhao (2026) by providing explicit finite-$N$ bounds and a simple comparison framework for the baseline and second-order estimates.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ML
The Condition-Number Principle for Prototype Clustering
Romano Li and Jianfei Cao
We develop a
geometric framework that links objective accuracy to structural recovery in prototype-based clustering. The analysis is
algorithm-agnostic and applies to a broad class of admissible loss functions. We define a clustering condition number that compares within-cluster scale to the minimum loss increase required to move a point across a cluster boundary. When this quantity is small, any solution with a small suboptimality gap must also have a small misclassification error relative to a
benchmark partition. The framework also clarifies a fundamental trade-off between robustness and sensitivity to cluster imbalance, leading to sharp phase transitions for exact recovery under different objectives. The guarantees are deterministic and non-asymptotic, and they separate the role of algorithmic accuracy from the intrinsic
geometric difficulty of the instance. We further show that errors concentrate near cluster boundaries and that sufficiently deep cluster cores are recovered exactly under strengthened local margins. Together, these results provide a
geometric principle for interpreting low objective values as reliable evidence of meaningful clustering structure.
Read the full abstract ▾
Optimization and Control
Optimizing Treatment Allocation to Maximize the Health of a Population
Daniel Adelman, Alba V Olivares-Nadal and Miaolan Xie
Recent shifts in global health priorities have positioned Population Health Management (PHM) as a central area of focus. However, optimizing PHM strategies presents several challenges: managing high-dimensional patient
covariates, tracking their
evolution and long-term response to interventions, and accounting for the inflow and
outflow of individuals within the population. In this paper, we propose a novel approach based on Measurized MDPs that integrates these components. We consider a setting in which a treatment with population-level benefits is available but scarce, and model an MDP that optimizes the long-term distribution of the healthcare population under expected capacity constraints. This formulation allows us to bypass both the dimensionality and practical challenges of handling and tracking individual patient
covariates across the population. To ensure ethical compliance, we introduce a non-maleficence constraint that limits the allowable mortality rate. To solve the resulting infinite-dimensional problem, we use ADP and reduce the task to identifying a finite set of high-performing treated and untreated patients. Despite the complexity of the underlying structure, our approach yields a simple, clinically implementable index policy: a patient is selected for treatment if their adjusted impactability exceeds a specified threshold. The adjusted impactability captures the long-term consequences of receiving or not receiving treatment. While straightforward to apply, the policy remains flexible and can incorporate general machine learning models. Using CMS data, we show that our policy yields a statistically significant improvement over a myopic
benchmark. This advantage increases with the time horizon, consistent with the forward-looking nature of our policy. At the longest horizon tested, this corresponds to over 1,500 additional home days annually per 1,000 patients.
Read the full abstract ▾
Information Theory
Modeling and Analysis for Joint Design of Communication and Control
Xu Gan, Chongjun Ouyang and Yuanwei Liu
A unified analytical framework for joint design of communication and control (JDCC) is proposed. Within this framework, communication transmission delay and steady-state control variance are derived as the two fundamental JDCC performance metrics. The Pareto boundary is then established to characterize the optimal communication-control trade-off in JDCC systems. To further obtain closed-form expressions, their performance regions are derived under maximum-ratio transmission (MRT) and zero-forcing (ZF) beamforming. For system reliability evaluation, the communication-only and control-only outage probabilities are first derived. Based on these, the JDCC outage probability is defined to quantify the probability that the communication-delay and control-error requirements cannot be simultaneously satisfied. Its analytical expressions are then derived under both MRT and ZF schemes. Finally, numerical results validate the theoretical results and reveal that: (1) the Pareto boundary characterizes the trade-off frontier and performance limit of JDCC systems and (2) the JDCC reliability is jointly determined by the uplink-downlink closed-loop control and its coupling with communication.
Read the full abstract ▾
Information Theory
The Asymmetric Hamming Bidistance and Distributions over Binary Asymmetric Channels
Shukai Wang, Cuiling Fan, Chunming Tang et al. (+1 more)
The binary asymmetric channel is a model for practical communication systems where the error probabilities for symbol transitions $0\rightarrow 1$ and $1\rightarrow0$ differ substantially. In this paper, we introduce the notion of asymmetric Hamming bidistance (AHB) and its two-dimensional distribution, which separately captures directional discrepancies between codewords. This finer characterization enables a more discriminative analysis of decoding the error probabilities for maximum-likelihood decoding (MLD), particularly when conventional measures, such as weight distributions and existing discrepancy-based bounds, fail to distinguish code performance. Building on this concept, we derive a new upper bound on the average error probability for binary codes under MLD and show that, in general, it is incomparable with the two existing bounds derived by Cotardo and Ravagnani (IEEE Trans. Inf. Theory, 68 (5), 2022). To demonstrate its applicability, we compute the complete AHB distributions for several families of codes, including two-weight and three-weight projective codes (with the zero codeword removed) via strongly regular graphs and 3-class association schemes, as well as nonlinear codes constructed from symmetric balanced incomplete block designs (SBIBDs).
Read the full abstract ▾
All authors Shukai Wang, Cuiling Fan, Chunming Tang, Zhengchun Zhou
Geometric Topology
Chirality of torus-covering $T^2$-links of degree three
Hohto Bekki, Teruhisa Kadokami and Inasa Nakamura
A
torus-covering $T^2$-link of degree $n$ is a surface-link consisting of
tori, in the form of an unbranched covering of degree $n$ over the standard
torus. We focus on a
torus-covering $T^2$-link of degree 3, which is determined by a pair $(a,b)$ of 3-braids satisfying $ab=ba$, denoted by $\mathcal{S}_3(a,b)$. We investigate to what extent the chirality of $\mathcal{S}_3(a,b)$ is detected by invariants such as the triple linking numbers, the number of Fox $p$-colorings, and the quandle cocycle invariant associated with $p$-colorings. In particular, we determine the quandle cocycle invariant for $\mathcal{S}_3(a,b)$ associated with tri-colorings.
Read the full abstract ▾
Representation Theory
L-modules are mixed
Leslie Saper
Let X be the locally symmetric space associated to a reductive $\mathbb Q$-group G and an arithmetic subgroup $\Gamma$. An L-module M is a combinatorial model of a constructible complex of sheaves on $\widehat X$, the reductive Borel-Serre compactification of X whose strata $X_P$ are indexed by $\Gamma$-conjugacy classes of
parabolic $\mathbb Q$-subgroups P of G. We show that any L-module M is "mixed" in the sense it is an iterated mapping cone of maps to or from shifted weighted
cohomology L-modules on strata $X_P$ of $\widehat X$ with coefficients in V, an irreducible regular $L_P$-module. These weighted
cohomology "building blocks" are indexed (up to multiplicity) by V in the weak micro-support of M which is a computable local invariant. As an application we prove that the intersection
cohomology of $\widehat X$ is isomorphic to the weighted
cohomology of $\widehat X$, at least excluding $\mathbb Q$-types D, E, and F.
Read the full abstract ▾
Statistics Theory · Cross-listed from econ.EM
Identification in (Endogenously) Nonlinear SVARs Is Easier Than You Think
James A. Duffy and Sophocles Mavroeidis
We study identification in structural vector autoregressions (SVARs) in which the endogenous variables enter nonlinearly on the left-hand side of the model, a feature we term endogenous nonlinearity, to distinguish it from the more familiar case in which nonlinearity arises only through exogenous or predetermined variables. This class of models accommodates asymmetric impact multipliers, endogenous regime switching, and occasionally binding constraints. We show that, under weak regularity conditions, the model parameters and structural shocks are (nonparametrically) identified up to an orthogonal transformation, exactly as in a linear SVAR. Our results have the powerful implication that most existing identification schemes for linear SVARs extend directly to our nonlinear setting, with the number of restrictions required to achieve exact identification remaining unchanged. We specialise our results to piecewise affine SVARs, which provide a convenient framework for the modelling of endogenous regime switching, and their smooth transition counterparts. We illustrate our methodology with an application to the nonlinear Phillips curve, providing a test for the presence of nonlinearity that is robust to the choice of identifying assumptions, and finding significant evidence for state-dependent inflation dynamics.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
Mathematical analysis of one-layer neural network with fixed biases, a new activation function and other observations
Fabricio Macià and Shu Nakamura
We analyze a simple one-hidden-layer neural network with ReLU activation functions and fixed biases, with one-dimensional input and output. We study both continuous and discrete versions of the model, and we rigorously prove the convergence of the learning process with the $L^2$ squared loss function and the gradient descent procedure. We also prove the spectral bias property for this learning process. Several conclusions of this analysis are discussed; in particular, regarding the structure and properties that activation functions should possess, as well as the relationships between the spectrum of certain operators and the learning process. Based on this, we also propose an alternative activation function, the full-wave rectified exponential function (FReX), and we discuss the convergence of the gradient descent with this alternative activation function.
Read the full abstract ▾
Probability
Central Limit Theorem for Random Partial Sphere Coverings in High Dimensions
Steven Hoehner and Christoph Thäle
We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous
geometric analogue of the classical balls-into-bins problem. We establish a Central Limit
Theorem for the volume of the resulting random partial covering, showing that its fluctuations are asymptotically Gaussian. Moreover, we obtain a quantitative bound on the rate of convergence in the Kolmogorov distance. Our results hold both in fixed dimension and in a high-dimensional regime where the dimension grows at most logarithmically with $N$.
Read the full abstract ▾
Analysis of PDEs
Quantitative Hydrodynamic Limit of the Chern–Simons–Higgs System
Jeongho Kim and Bora Moon
We study the hydrodynamic limit of the Chern–Simons–
Higgs system, a relativistic gauge field model involving the Chern–Simons interaction. We introduce a single scaling parameter capturing both the non-relativistic (infinite speed of light) and semi-classical (vanishing Planck constant) regimes. This unified scaling allows us to justify the simultaneous non-relativistic and semi-classical limit, while retaining the nontrivial influence of the Chern–Simons gauge structure. Using a modulated energy method, we establish quantitative convergence rates toward the corresponding compressible Euler–Chern–Simons system as the scaling parameter tends to zero.
Read the full abstract ▾
Analysis of PDEs
Fredholm alternative for a general class of nonlocal operators
Francesco De Pas, Serena Dipierro and Enrico Valdinoci
We develop a Fredholm alternative for a fractional
elliptic operator~$\mathcal{L}$ of mixed order built on the notion of fractional gradient. This operator constitutes the nonlocal extension of the classical second order
elliptic operators with measurable coefficients treated by Neil Trudinger in~\cite{trudinger}. We build~$\mathcal{L}$ by weighing the order~$s$ of the fractional gradient over a measure (which can be either continuous, or discrete, or of mixed type). The coefficients of~$\mathcal{L}$ may also depend on~$s$, giving this operator a possibly non-homogeneous structure with variable exponent. These coefficients can also be either unbounded, or discontinuous, or both. A suitable functional analytic framework is introduced and investigated and our main results strongly rely on some custom analysis of appropriate functional spaces.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
Trotterization with Many-body Coulomb Interactions: Convergence for General Initial Conditions and State-Dependent Improvements
Di Fang and Xiaoxu Wu
Efficiently simulating many-body
quantum systems with Coulomb interactions is a fundamental question in
quantum physics,
quantum chemistry, and
quantum computing, yet it presents unique challenges: the
Hamiltonian is an unbounded operator; its
Hilbert space dimension grows exponentially with particle number; and the Coulomb potential is singular, long-ranged, and non-smooth, violating the regularity assumptions of many prior state-of-the-art many-body simulation analyses. In this work, we establish rigorous error bounds for Trotter formulas applied to these systems. Our first main result shows that for general initial conditions in the domain of the
Hamiltonian, second-order Trotter achieves a $1/4$ convergence rate with explicit
polynomial dependence of the error prefactor on the particle number. The
polynomial dependence on system size suggests that the
algorithm remains quantumly efficient, even without introducing any regularization of the Coulomb singularity. Such a worst-case rate has been observed in prior work for the hydrogen ground state, demonstrating its physical relevance. We further establish one-step local error lower bounds of order $5/4$ for both formulas, showing that the local exponent is sharp. Our second main result identifies a set of physically meaningful conditions on the initial state under which the convergence rates improve, with the full first-order and second-order rates recovered at sufficiently high angular momentum. Our theoretical findings are consistent with prior numerical observations. Our third main result establishes improved convergence rates for many-body fermionic Coulomb systems with initial data of different Sobolev regularity. In particular, even without imposing any additional regularity beyond the natural domain of the
Hamiltonian, both the first- and second-order Trotter formulas converge with rate $1/2$, rather than the general $1/4$ rate.
Read the full abstract ▾
Operator Algebras
The trace simplex of a noncommutative Villadsen algebra
George A. Elliott and Vincent M. Ruzicka
We construct a “noncommutative” Villadsen
algebra $B$ and show that, given an extreme tracial state $\nu$ on its canonical AF subalgebra, the subset of $T(B)$ consisting of those tracial states that equal $\nu$ when restricted to the canonical AF subalgebra is the Poulsen simplex. In particular, if the canonical AF subalgebra has a unique trace, then $T(B)$ is the Poulsen simplex. We go on to show that in certain instances, the tracial cone of a “classical” AF-Villadsen
algebra $D$ is isomorphic to the tracial cone of the
algebra obtained from $D$ by deleting all point evaluations.
Read the full abstract ▾
Probability
Stochastic fractional heat equation with general rough noise
Bin Qian and Ran Wang
Consider the following nonlinear one-dimensional
stochastic fractional heat equation $$\frac{\partial }{\partial t}u(t, x)= -(-\Delta)^{\alpha/2}u(t, x) +\sigma(t,x,u(t,x)) \dot{W}(t, x), $$ where $-(-\Delta)^{\alpha/2}$ is the fractional
Laplacian on $\mathbb R$ for $1<\alpha<2$, and $\dot{W}$ is a Gaussian noise that is white in time and behaves in space as a fractional Brownian motion with Hurst index $H$ satisfying $\frac{3-\alpha}{4}<H<\frac12$. When $\alpha=2$, Hu and Wang (Ann. Inst. Henri Poincaré Probab. Stat. 58 (2022) 379-423) studied the well-posedness of the solution and its Hölder continuity, removing the technical condition $\sigma(0)=0$ that was previously assumed in Hu et al. (Ann. Probab. 45 (2017) 4561-4616). Their approach relied on working in a weighted space with a suitable power decay function. For the case $\alpha\in (1,2)$, inspired by Hu and Wang, we investigate the well-posedness of the
stochastic fractional heat equation without imposing the technical condition of $\sigma(0)=0$, which was required in the earlier work of Liu and Mao (Bull. Sci. Math. {\bf181} (2022) 103207). In our analysis, precise estimates of the heat kernel associated with the fractional
Laplacian $-(-\Delta)^{\alpha/2}$ play a crucial role.
Read the full abstract ▾
Analysis of PDEs
Existence of weak solutions and regular solutions to the incompressible Schrödinger flow
Bo Chen, Guangwu Wang and Youde Wang
In this paper, we are concerned with the initial-Neumann boundary value problem of the Schrödinger flow for maps from a smooth bounded domain in an Euclidean space into $\mathbb{S}^2$. By adopting a novel method due to B. Chen and Y.D. Wang, we prove the existence of short-time regular solutions to this flow within the framework of Sobolev spaces when the underlying space is a smooth bounded domain in $\mathbb{R}^m$ with $m\leq 3$. Moreover, we also utilize the “complex structure approximation method" to establish the global existence of weak solutions to the incompressible Schrödinger flow in a smooth bounded domain of $\mathbb{R}^m$ (where $m\geq 1$).
Read the full abstract ▾
Optimization and Control
On Linear Critical-Region Boundaries in Continuous-Time Multiparametric Optimal Control
Lida Lamakani and Efstratios N. Pistikopoulos
When an optimal control problem is solved for all possible initial conditions at once, the initial-state space splits into critical regions, each carrying a closed-form control law that can be evaluated online without solving any optimization. This is the multiparametric approach to explicit control. In the continuous-time setting, the boundaries between these regions are determined by extrema of Lagrange multipliers and constraint functions along the optimal trajectory. Whether a boundary is a hyperplane, computable analytically, or a curved
manifold that requires numerical methods has a direct effect on how the partition is built. We show that a boundary is a hyperplane if and only if the relevant extremum is attained at either the initial time or the terminal time, regardless of the initial condition. The reason is that the costate is a linear function of the initial state at any fixed time, so when the extremum is tied to a fixed endpoint, the boundary condition is linear and the boundary normal follows directly from two
matrix exponentials and a linear solve. When the extremum occurs at a time that shifts with the initial condition, such as a switching time or an interior stationary point, the boundary is generally curved. We demonstrate the result on a third-order system, obtaining the complete three-dimensional critical-region partition analytically for the first time in this problem class. A comparison with a discrete-time formulation shows how sharply the region count grows under discretization, while the continuous-time partition remains unchanged.
Read the full abstract ▾
Operator Algebras
Villadsen algebras are singly generated
Chun Guang Li, Zhuang Niu and Vincent M. Ruzicka
We show that Villadsen
algebras, which are not Z-stable, are singly generated. More generally, we show that any simple unital AH
algebra with diagonal maps is singly generated.
Optimization and Control
A DC Composite Optimization via Variable Smoothing for Robust Phase Retrieval with Nonconvex Loss Functions
Kumataro Yazawa, Keita Kume and Isao Yamada
In this paper, we propose an optimization-based method for robust phase
retrieval problem where the goal is to estimate an unknown signal from a quadratic measurement corrupted by outliers. To enhance the robustness of existing optimization models with the $\ell_1$ loss function, we propose a generalized model that can handle DC (Difference-of-Convex) loss functions beyond the $\ell_1$ loss. We view the cost function of the proposed model as a composition of a DC function with a smooth mapping, and develop a variable smoothing
algorithm for minimizing such DC composite functions. At each step of our
algorithm, we generate a smooth surrogate function by using the Moreau envelope of each (weakly) convex function in the DC function, and then perform the gradient descent update of the surrogate function. Unlike many existing
algorithms for DC problems, the proposed
algorithm does not require any inner loop. We also present a convergence analysis in terms of a DC composite critical point for the proposed
algorithm. Our numerical experiment demonstrates that the proposed method with DC loss functions is more robust against outliers compared to existing methods with the $\ell_1$ loss.
Read the full abstract ▾