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)

Friday 13 March

Dynamical Systems

Study of attractors and fractal functions on the product spaces and Dimensional aspects

In this paper, the product of the Hausdorff metric on the product space is defined and the equivalency between the product Hausdorff metric and the Hausdorff metric on the product space is established. The finite product of the iterated function systems (IFS) on the product space is considered and the relation between the attractor of the product IFS and the attractors of the co-ordinate IFSs is studied. Dimension bounds of the homogeneous and inhomogeneous attractors on the product space is established. Also, the product fractal interpolation function on the higher dimensional space is constructed.
Read the full abstract

Combinatorics

Sharp threshold for universality of cokernels of classical random matrix models over the $p$-adic integers

We prove that $\frac{\log n}{n}$ is the sharp threshold for universality of the distribution of cokernels of random matrices over $\mathbb{Z}_p$. More precisely, let $\alpha_n = \frac{c\log n}{n}$ for a constant $c>0$ and let $A(n)$ be an $\alpha_n$-balanced random matrix over $\mathbb{Z}_p$. For non-symmetric, symmetric, and alternating matrix models, we prove that if $c>1$, then the limiting distribution of the cokernel of $A(n)$ coincides with the universal distribution of the corresponding symmetry type, whereas universality fails at the critical scale $c=1$. This improves earlier universality results, which required $\alpha_n \gg \frac{\log n}{n}$, to the optimal threshold. As an application, we generalize the universality result for Sylow $p$-subgroups of sandpile groups of Erdős-Rényi random graphs to a broader class of Erdős-Rényi graph sequences. Our approach is based on a unified framework that simultaneously treats all symmetry types of random matrices as well as the random graph model, rather than handling each case separately.
Read the full abstract

Dynamical Systems · Cross-listed from q-bio.NC

Pulse desynchronization of neural populations by targeting the centroid of the limit cycle in phase space

The synchronized activity of neuronal populations can lead to pathological over-synchronization in conditions such as epilepsy and Parkinson disease. Such states can be desynchronized by brief electrical pulses. But when the underlying oscillating system is not known, as in most practical applications, to determine the specific times and intensities of pulses used for desynchronizaton is a difficult inverse problem. Here we propose a desynchronization scheme for neuronal models of bi-variate neural activity, with possible applications in the medical setting. Our main argument is the existence of a peculiar point in the phase space of the system, the centroid, that is both easy to calculate and robust under changes in the coupling constant. This important target point can be used in a control procedure because it lies in the region of minimal return times of the system.
Read the full abstract

All authors Ramón Guevara, Marco Zenari, Giorgio Nicoletti, Elisa Marini, Samir Suweis, Sandro Azaele, Marco Formentin

Dynamical Systems

Coincidence of invariant measure for the alternate base transformations

We characterize all pairs $(\beta,n),(\beta^\prime,m)$ such that the alternate $(\beta,n)$ and $(\beta^\prime,m)$-transformations $K_{(\beta,n)}$ and $K_{(\beta^\prime,m)}$ have the same absolutely continuous invariant measure, where $K_{(\beta,n)}(i,x)=(i+1 \mod 2 ,T_i(x))$ with $i\in\{0,1\}$, $T_0(x)=T_\beta (x)=\beta x \mod 1$, $T_1(x)=T_n(x)=nx\mod 1$ with $\beta>1$ real and $n\geq 2$ an integer.
Read the full abstract

Analysis of PDEs

Existence of traveling waves for the two-dimensional Zakharov system

Via a fixed point argument, we construct solitary waves for the two-dimensional Zakharov system that travel with any small speed $c \in \mathbb{R}^2$. Moreover, we investigate their asymptotic behavior.

Numerical Analysis

Surrogates for Physics-based and Data-driven Modelling of Parametric Systems: Review and New Perspectives

Surrogate models provide compact relations between user-defined input parameters and output quantities of interest, enabling the efficient evaluation of complex parametric systems in many-query settings. Such capabilities are essential in a wide range of applications, including optimisation, control, data assimilation, uncertainty quantification, and emerging digital twin technologies in various fields such as manufacturing, personalised healthcare, smart cities, and sustainability. This article reviews established methodologies for constructing surrogate models exploiting either knowledge of the governing laws and the dynamical structure of the system (physics-based) or experimental observations (data-driven), as well as hybrid approaches combining these two paradigms. By revisiting the design of a surrogate model as a functional approximation problem, existing methodologies are reviewed in terms of the choice of (i) a reduced basis and (ii) a suitable approximation criterion. The paper reviews methodologies pertaining to the field of Scientific Machine Learning, and it aims at synthesising established knowledge, recent advances, and new perspectives on: dimensionality reduction, physics-based, and data-driven surrogate modelling based on proper orthogonal decomposition, proper generalised decomposition, and artificial neural networks; multi-fidelity methods to exploit information from sources with different fidelities; adaptive sampling, enrichment, and data augmentation techniques to enhance the quality of surrogate models.
Read the full abstract

Numerical Analysis

Weak Adversarial Neural Pushforward Method for Fractional Fokker-Planck Equations

We extend the Weak Adversarial Neural Pushforward Method (WANPM) to fractional Fokker-Planck equations, in which the classical Laplacian diffusion operator is replaced by the fractional Laplacian of order alpha in (0, 2]. The solution distribution is represented as the pushforward of a simple base distribution through a neural network, and the weak formulation is discretized entirely via Monte Carlo sampling without any temporal mesh. A key computational advantage is that plane-wave test functions are eigenfunctions of the fractional Laplacian, making the operator cost identical to that of classical diffusion for any alpha. We validate the method on seven benchmark problems with alpha = 1.5, spanning one and two spatial dimensions: the steady-state fractional Ornstein–Uhlenbeck (OU) process, a harmonic confining potential, a double-well potential, and a triple-well potential in one dimension, a steady-state 2D double-peak distribution, a time-dependent 2D ring distribution with rotational drift, and a five-dimensional harmonic potential. Each case is benchmarked against particle simulations using symmetric alpha-stable Lévy increments, and robust statistics confirm close agreement throughout. The method is mesh-free, requires no density evaluation or non-local quadrature, and provides a promising foundation for high-dimensional anomalous diffusion solvers.
Read the full abstract

Probability

Optimal Stopping for Systems Driven by the Brownian Sheet

We investigate optimal stopping problems for systems driven by the Brownian sheet. Our analysis is divided into two parts. In the first part we derive explicit solutions to two optimal stopping problems for the exponentially discounted Brownian sheet. The first problem consists in determining the optimal two-parameter first hitting point tau = (tau1,tau2) maximizing E[exp(-rho tau1 tau2) h(B(tau1,tau2))], where rho > 0 is a discount factor and h is a reward function. Restricting attention to first hitting points of levels, we obtain a closed-form characterization of the optimal stopping threshold. In particular, for linear rewards h(y)=y the optimal level is y_hat = (2 rho)^(-1/2). The second problem concerns optimal stopping of the integrated discounted Brownian sheet with payoff E[int_0^{tau1} int_0^{tau2} exp(-rho t x) B(t,x) dt dx]. We show that the optimal first hitting level is strictly positive and give an explicit representation of the value function in terms of the exponential integral function. The optimal threshold is characterized as the unique solution of a nonlinear equation derived from a Laplace transform identity for the product tau1 tau2. In the second and main part of the paper we develop a potential theoretic framework for two-parameter optimal stopping problems associated with stochastic partial differential equations driven by the Brownian sheet, proving that the value function is the least superharmonic majorant of the reward and establishing existence of optimal stopping points in the plane.
Read the full abstract

All authors Nacira Agram, Bernt Oksendal, Frank Proske, Olena Tymoshenko

Statistics Theory

The geometry of Stein's method of moments: A canonical decomposition via score matching

In this paper, we elucidate the geometry of Stein's method of moments (SMoM). SMoM is a parameter estimation method based on the Stein operator, and yields a wide class of estimators that do not depend on the normalizing constant. We present a canonical decomposition of an SMoM estimator after centering the score matching estimator, which sheds light on the central role of the score matching within the SMoM framework. Using this decomposition, we construct an SMoM estimator that improves upon the score matching estimator in the asymptotic variance. We also discuss the connection between SMoM and the Wasserstein geometry. Specifically, using the Wasserstein score function, we provide a geometrical interpretation of the gap in the asymptotic variance between the score matching estimator and the maximum likelihood estimator. Furthermore, it is shown that the score matching estimator is asymptotically efficient if and only if the Fisher score functions span the same space as the Wasserstein score functions.
Read the full abstract

Dynamical Systems

Port-Hamiltonian multibody dynamics: Lagrangian formulation, consistent interconnection, structure-preserving simulation and index-reduction

This work introduces a port-Hamiltonian (PH) model for constrained mechanical systems, which is directly derived from the Lagrangian equations of motion. The present PH framework incorporates a singularity-free director representation of rigid body rotations, resulting in constant mass matrices. It is shown that the power-preserving interconnection of PH rigid-body subsystems is mathematically equivalent to the classical description of ideal joints using kinematic pairs. This establishes a PH multibody dynamics framework that is consistent with traditional modeling paradigms. Notably, the PH structure of the governing index-2 differential-algebraic equations enables the application of an implicit, structure preserving midpoint time integration. The proposed scheme is able to satisfy both the balance laws for total energy and angular momentum as well as the position-level constraints. These properties make the proposed method remarkably robust and enable stable long-term simulations. Furthermore, a variationally derived index-reduction strategy is incorporated that enforces velocity-level constraints in addition to position-level constraints while preserving the port-Hamiltonian structure. Numerical examples illustrate the favorable properties of the proposed formulation, which is well-suited for energy-based control design.
Read the full abstract

Optimization and Control

A New Kernel Regularity Condition for Distributed Mirror Descent: Broader Coverage and Simpler Analysis

Existing convergence analyses of distributed optimization methods in non-Euclidean geometries typically rely on kernel assumptions: (i) global Lipschitz smoothness and (ii) bi-convexity of the associated Bregman divergence function. Unfortunately, these conditions are violated by nearly all kernels used in practice, leaving a huge theory-practice gap. This work closes this gap by developing a unified analytical tool that guarantees convergence under mild conditions. Specifically, we introduce Hessian relative uniform continuity (HRUC), a regularity satisfied by nearly all standard kernels. Importantly, HRUC is closed under concatenation, positive scaling, composition, and various kernel combinations. Leveraging the geometric structure induced by HRUC, we derive convergence guarantees for mirror-descent-based gradient tracking without imposing any restrictive assumptions. More broadly, our analysis techniques extend seamlessly to other decentralized optimization methods in genuinely non-Euclidean and non-Lipschitz settings.
Read the full abstract

All authors Junwen Qiu, Ziyang Zeng, Leilei Mei, Junyu Zhang

Analysis of PDEs

An existence theorem for elliptic equations with nonlocal boundary conditions

The focus of this study is on exploring some qualitative properties of solutions to a class of semilinear elliptic problems in bounded domains, where the boundary conditions depend non-locally on the unknown solution at specified interior points and its integral. The primary approach integrates a fixed-point argument with refined asymptotic estimates to establish the existence and structure of solutions. Furthermore, the maximum principles are established under practical nonlocal-type boundary conditions.
Read the full abstract

Classical Analysis and ODEs

Polynomial curvelets on higher-dimensional spheres

In this article, we introduce and investigate polynomial curvelets on spheres, which form a class of Parseval frames for $L^2(\mathbb{S}^{d-1})$, $d \geq 3$. The proposed construction offers a directionally sensitive multiscale decomposition and provides a sparse representation of spherical data. As a main result, we derive a sharp pointwise localization bound which shows that the frame elements decay rapidly away from their center of mass, making them a powerful tool for position-based analyses. In contrast to previous constructions, polynomial curvelets are not limited in their directional resolution. Consequently, the frames established in this article are particularly powerful when it comes to the analysis of localized anisotropic features, such as edges. To illustrate this point, we show that, given a suitable test signal that exhibits (higher-order) discontinuities at the boundary $\partial A$ of a spherical cap $A\subset \mathbb{S}^{d-1}$, the corresponding curvelet coefficients peak precisely when the analysis function matches some segment of the boundary $\partial A$, both in terms of position and orientation. Otherwise, the coefficients decay rapidly.
Read the full abstract

Symplectic Geometry

More on explicit correspondence between gradient trees in $\mathbb{R}$ and holomorphic convex quadrilaterals in $T^{*}\mathbb{R}$

For given smooth functions $(f_1,\dots,f_n)$ on $M$, Fukaya and Oh showed that the moduli space of pseudoholomorphic disks in $T^*M$ which are bounded by Lagrangian sections $\{L_i^\epsilon=\operatorname{graph}(\epsilon df_i)\}$ is diffeomorphic to the moduli space of gradient trees in $M$ which consist of gradient curves of $\{f_i-f_j\}$. When the image of the pseudoholomorphic disk $w_\epsilon$ is a polygon in $\mathbb{C}\simeq T^*\mathbb{R}$, we can describe $w_\epsilon$ by a Schwarz-Christoffel map. In \cite{S25}, we proved that pseudoholomorphic disks $w_\epsilon$ converge to the gradient tree in the limit $\epsilon\to+0$ when the image of $w_\epsilon$ is a generic convex quadrilateral. In this paper, we show such a convergence for any convex quadrilaterals by studying the non-generic case.
Read the full abstract

Information Theory

Rethinking Mutual Coupling in Movable Antenna MIMO Systems

Movable antenna (MA) systems have emerged as a promising technology for future wireless communication systems. The movement of antennas gives rise to mutual coupling (MC) effects, which have been previously ignored and can be exploited to enhance the capacity of multiple-input multiple-output (MIMO) systems. To this end, we first model an MA-enabled point-to-point MIMO communication system with MC effects using a circuit-theoretic framework. The capacity maximization problem is then formulated as a non-concave optimization problem and solved via a block coordinate ascent (BCA)-based algorithm. The subproblem of optimizing MA positions is challenging due to the presence of the analytically intractable MC matrices. To overcome this difficulty, we develop a trust region method (TRM)-based algorithm to optimize MA positions, wherein Sylvester equations are employed to compute the derivatives of the inverse square roots of the MC matrices. Simulation results show significant capacity gains from leveraging MC effects, primarily due to customizable MC matrices and superdirectivity.
Read the full abstract

All authors Tianyi Liao, Wei Guo, Jun Qian, Shenghui Song, Jun Zhang, Khaled B. Letaief

Optimization and Control

A Level Set Method with Secant Iterations for the Least-Squares Constrained Nuclear Norm Minimization

We present an efficient algorithm for least-squares constrained nuclear norm minimization, a computationally challenging problem with broad applications. Our approach combines a level set method with secant iterations and a proximal generation method. As a key theoretical contribution, we establish the nonsingularity of the Clarke generalized Jacobian for a general class of projection norm functions over closed convex sets. This property and the (strong) semismoothness of our value function yield fast local convergence of the secant method. For the resulting nuclear norm regularized subproblems, we develop a proximal generation method that exploits low-rank structures without compromising convergence. Extensive numerical experiments demonstrate the superior performance of our approach compared to state-of-the-art methods.
Read the full abstract

Numerical Analysis

Convergence of a Control Volume Finite Element scheme for a cross-diffusion system modeling ion transport

An approximation of a system coupling the cross-diffusion of chemical species within a solvent, subjected to an electric field, is obtained through a control volume finite element (CVFE) scheme on general simplicial meshes in two or three space dimensions. The discrete unknowns of the numerical scheme are derived from the chemical potential of the species. The scheme is designed in order to fulfill entropy inequalities, yielding compactness properties for the discrete solutions and convergence to a weak solution of the continuous problem. Numerical illustrations of the convergence properties are provided in situations where diffusion of ionic species degenerates.
Read the full abstract

Optimization and Control

Data-driven Policies For Two-stage Stochastic Linear Programs

A stochastic program typically involves several parameters, including deterministic first-stage parameters and stochastic second-stage elements that serve as input data. These programs are re-solved whenever any input parameter changes. However, in practical applications, quick decision-making is necessary, and solving a stochastic program from scratch for every change in input data can be computationally costly. This work addresses this challenge for two-stage stochastic linear programs (2-SLPs) with varying right-hand sides for the first-stage constraints. We construct a Piecewise Linear Difference-of-Convex (PLDC) policy by leveraging optimal bases from previous solves. This PLDC policy retains optimal solutions for previously encountered parameters and provides high-quality solutions for new right-hand-side vectors. Our proposed policy directly applies to the extensive form of the 2-SLP. When stage decomposition algorithms, such as the L-Shaped and Stochastic Decomposition, are applied to solve the 2-SLPs, we develop L-Shaped- and Stochastic-Decomposition-guided static procedures to train the policy. We also develop a sequential procedure that iteratively tracks the quality of the learned policy and incorporates new basis information to improve it. We assess the performance of our policy through analytical and numerical techniques. Our compelling experimental results show that the policy prescribes solutions that are feasible and optimal for a significant percentage of new instances.
Read the full abstract

Algebraic Topology

Real Hochschild homology as an equivariant Loday construction

Equivariant Loday constructions are a means for providing geometric interpretations of equivariant homology theories. They are usually constructed for a simplicial $G$-set and a $G$-Tambara functor. We study situations where – depending on the isotropy subgroups occurring in the simplicial $G$-set – one can work with $H$-Tambara functors for a suitable subgroup $H$ of $G$. We apply this to give an interpretation of Real Hochschild homology of discrete $E_\sigma$-rings as equivariant Loday constructions where we consider $2m$-gons with a geometrically defined action of the dihedral groups $D_{2m}$ for all $m \geq 1$. The action of symmetric groups on $1$-skeleta of permutohedra also gives examples with isotropy groups $C_2$.
Read the full abstract

Analysis of PDEs

Uniform-in-time propagation of chaos and bifurcation in two-type adhesion systems

We study a nonlocal adhesion model for two interacting tumor cell phenotypes, combining diffusion, pairwise interactions, and random phenotypic switching. The system admits a microscopic diffusion–jump particle description whose mean-field limit is a nonlinear McKean–Vlasov equation on a product space encoding position and internal state. We first establish uniform-in-time propagation of chaos in the weak-interaction regime using a coupling approach that combines reflection coupling for the diffusion with an optimal coupling of the spin-flip dynamics. As a byproduct, we obtain exponential long-time contraction for the nonlinear McKean–Vlasov equation in the first-order Wasserstein distance, implying uniqueness of the stationary distribution. We also investigate the complementary regime of strong interactions, where the homogeneous equilibrium may lose stability through a bifurcation mechanism.
Read the full abstract

Functional Analysis · Cross-listed from cs.LG

A Fractional Fox H-Function Kernel for Support Vector Machines: Robust Classification via Weighted Transmutation Operators

Support Vector Machines (SVMs) rely heavily on the choice of the kernel function to map data into high-dimensional feature spaces. While the Gaussian Radial Basis Function (RBF) is the industry standard, its exponential decay makes it highly susceptible to structural noise and outliers, often leading to severe overfitting in complex datasets. In this paper, we propose a novel class of non-stationary kernels derived from the fundamental solution of the generalized time-space fractional diffusion-wave equation. By leveraging a structure-preserving transmutation method over Weighted Sobolev Spaces, we introduce the Amnesia-Weighted Fox Kernel, an exact analytical Mercer kernel governed by the Fox H-function. Unlike standard kernels, our formulation incorporates an aging weight function (the "Amnesia Effect") to penalize distant outliers and a fractional asymptotic power-law decay to allow for robust, heavy-tailed feature mapping (analogous to Lévy flights). Numerical experiments on both synthetic datasets and real-world high-dimensional radar data (Ionosphere) demonstrate that the proposed Amnesia-Weighted Fox Kernel consistently outperforms the standard Gaussian RBF baseline, reducing the classification error rate by approximately 50% while maintaining structural robustness against outliers.
Read the full abstract

Information Theory

Upward Spatial Coverage Recovery via Movable Antenna in Low-Altitude Communications

The rapid proliferation of unmanned aerial vehicle (UAV) applications imposes stringent requirements on continuous and reliable communication coverage in low-altitude airspace. Conventional cellular systems built upon fixed-position antennas (FPAs) are inherently constrained by static array geometries and limited mechanical degrees of freedom, which severely restrict their ability to adapt to highly dynamic three-dimensional (3D) propagation environments. Movable antenna (MA) technology has recently emerged as a promising paradigm to overcome these limitations by actively reconfiguring electromagnetic radiation characteristics through controllable antenna positioning and array orientation, thereby enabling flexible spatial coverage adaptation. To systematically quantify the airspace coverage capability of MA-enabled systems, this paper formulates a spatial coverage maximization problem over a discretized 3D voxel space. For each voxel, the received signal-to-noise ratio (SNR) is maximized via joint optimization of the MA's 3D positions and beamforming matrices. To efficiently solve the resulting non-convex problem, a hybrid particle swarm optimization and simulated annealing framework is developed to search for high-quality antenna configurations. Simulation results demonstrate that the proposed MA design framework substantially outperforms conventional FPA-based schemes in terms of spatial coverage, achieving coverage rates of 26.8% and 29.65% for airspace below 300m and 600m, respectively. Moreover, further coverage enhancement can be attained by incorporating mechanical tilt adjustment, highlighting the strong potential of MA technology for reliable low-altitude communication coverage.
Read the full abstract

All authors Kan Yu, Kaixuan Li, Yujia Zhao, Dingyou Ma, Qixun Zhang, Zhiyong Feng

Analysis of PDEs

Analysis of a Model for a Floating Platform Coupled with a Flexible Beam

We provide a rigorous mathematical analysis of a coupled system consisting of a floating platform in a fluid of finite depth, clamped to a flexible Euler-Bernoulli beam. The superstructure supports a rigid tip mass at its free end, resulting in a complex multi-physics interaction between potential flow, rigid-body dynamics, and elasticity. We derive the governing equations by coupling the linearised water-wave equations with the dynamics of the floating foundation and the tip-mass payload. The resulting system is formulated as an abstract Cauchy problem in an appropriate Hilbert space. By employing C0-semigroup theory, we establish its well-posedness. Finally, we derive the exact physical energy balance and prove the energy conservation of the system.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Upper Bounds for Local Learning Coefficients of Three-Layer Neural Networks

Three-layer neural networks are known to form singular learning models, and their Bayesian asymptotic behavior is governed by the learning coefficient, or real log canonical threshold. Although this quantity has been clarified for regular models and for some special singular models, broadly applicable methods for evaluating it in neural networks remain limited. Recently, a formula for the local learning coefficient of semiregular models was proposed, yielding an upper bound on the learning coefficient. However, this formula applies only to nonsingular points in the set of realization parameters and cannot be used at singular points. In particular, for three-layer neural networks, the resulting upper bound has been shown to differ substantially from learning coefficient values already known in some cases. In this paper, we derive a formula for an upper bound on local learning coefficients at a class of singular realization parameters in three-layer neural networks. This formula can be interpreted as a counting rule under budget, demand, and supply constraints. In the non-polynomial real-analytic case, the formula applies in general settings, whereas in the polynomial case it applies under the restriction that the true distribution has no hidden units. In particular, our result covers activation functions such as the swish function and also includes polynomial activation functions under the above restriction, thereby extending previous results to a broader class of activation functions. We further show that, when the input dimension is one, the numerical value given by the right-hand side of our upper-bound formula agrees with the previously known learning coefficient, thereby providing a useful comparison with known exact results. Our result also provides a systematic perspective on how the weight parameters of three-layer neural networks affect the learning coefficient.
Read the full abstract

Numerical Analysis

Computing the Nonnegative Low-Rank Leading Eigenmatrix and its Applications to Markov Grids and Metzler Operators

We consider in this paper the problem of computing a nonnegative low-rank approximation of the rightmost eigenpair of a linear matrix-valued real operator. We propose an algorithm based on the time integration of a suitable differential system, whose solution is parametrized according to a nonnegative factorization. The conservation of the nonnegativity is theoretically motivated by the Perron-Frobenius theorem, while the computation of the rightmost eigenpair is motivated by two applications: (1) a new class of Markov chains, which we called Markov grids, whose transition matrices can be decomposed as the sum of Kronecker products, and (2) spatially structured systems in growth-diffusion operators arising for example in population and epidemic dynamics. Theoretical analysis and computational experiments show the effectiveness of the algorithm compared to standard approaches.
Read the full abstract

Statistics Theory

Functional CLT for general sample covariance matrices

This paper studies the central limit theorems (CLTs) for linear spectral statistics (LSSs) of general sample covariance matrices, when the test functions belong to $C^3$, the class of functions with continuous third order derivatives. We consider matrices of the form $B_n=(1/n)T_p^{1/2}X_nX_n^{*}T_p^{1/2},$ where $X_n= (x_{i j} ) $ is a $p \times n$ matrix whose entries are independent and identically distributed (i.i.d.) real or complex random variables, and $T_p$ is a $p\times p$ nonrandom Hermitian nonnegative definite matrix with its spectral norm uniformly bounded in $p$. By using Bernstein polynomial approximation, we show that, under $\mathbb{E}|x_{ij}|^{8}<\infty$, the centered LSSs of $B_n$ have Gaussian limits. Under the stronger $\mathbb{E}|x_{ij}|^{10}<\infty$, we further establish convergence rates $O(n^{-1/2+\kappa})$ in Kolmogorov–Smirnov $O(n^{-1/2+\kappa})$, for any fixed $\kappa>0$.
Read the full abstract

All authors Jian Cui, Zhijun Liu, Jiang Hu, Zhidong Bai

Optimization and Control · Cross-listed from eess.SY

On the strict-feedback form of hyperbolic distributed-parameter systems

The paper is concerned with the strict-feedback form of hyperbolic distributed-parameter systems. Such a system structure is well known to be the basis for the recursive backstepping control design for nonlinear ODEs and is also reflected in the Volterra integral transformation used in the backstepping-based stabilization of parabolic PDEs. Although such integral transformations also proved very helpful in deriving state feedback controllers for hyperbolic PDEs, they are not necessarily related to a strict-feedback form. Therefore, the paper looks at structural properties of hyperbolic systems in the context of controllability. By combining and extending existing backstepping results, exactly controllable heterodirectional hyperbolic PDEs as well as PDE-ODE systems are mapped into strict-feedback form. While stabilization is not the objective in this paper, the obtained system structure is the basis for a recursive backstepping design and provides new insights into coupling structures of distributed-parameter systems that allow for a simple control design. In that sense, the paper aims to take backstepping for PDEs back to its ODE origin.
Read the full abstract

Combinatorics

Chvátal-Erdős condition for 2-factors with at most two components in graphs

It is well-known that Chvátal and Erdős stated that any graph of order at least three whose independence number is no greater than its connectivity is Hamiltonian; that any graph whose independence number is no greater than its connectivity minus one is Hamilton-connected; and that any graph whose independence number is no greater than its connectivity plus one is traceable. Kaneko and Yoshimoto [J. Graph Theory 43 (2003) 269–279] showed that every 4-connected graph of order at least six has a 2-factor with two components if its independence number is no greater than its connectivity. In this paper, we show that any connected graph of order at least three times its connectivity plus three has a 2-factor with at most two components, except for one exceptional class, if its independence number is no greater than its connectivity plus one. Our result is best possible.
Read the full abstract

Probability

Synchronization by noise for stochastic differential equations driven by fractional Brownian motion

We investigate synchronization by noise for stochastic differential equations (SDEs) driven by a fractional Brownian motion (fbm) with Hurst index $H\in(0,1)$. Provided that the SDE has a negative top Lyapunov exponent, we show that a weak form of synchronization occurs. To this aim we use tools from stochastic dynamical systems, random dynamical systems and characterize the support of an invariant measure of a random dynamical system in a non-Markovian setting.
Read the full abstract

Optimization and Control

Improving critical buildings energy resilience via shared autonomous electric vehicles – A sequential optimization framework

The interdependence between electric power systems and transportation systems is rapidly increasing due to the high adoption of Electric Vehicles (EVs) and their charging infrastructures. Electric vehicles can represent additional load for the power system, but can also bring new opportunities for contributing to the efficient and resilient operations of the power grid. This is mainly because of their ability to provide back power to the system when it is not used for transportation, essentially serving as a moving battery source for the power grid. This so-called Vehicle-to-Grid (V2G), Vehicle-to-Building (V2B), or, generally, Vehicle-to-X (V2X) capability of EVs has been extensively studied in the literature. However, the upcoming development of autonomous driving systems and their integration within sharing mobility services can significantly add to the possibilities of interaction between the transportation system and the power grid. This paradigm is studied to a much lesser extent in the existing literature. Shared Autonomous Electric Vehicles (SAEVs) could allow for more control of the actions of the fleet allowing for large-scale coordinated responses both to mobility and energy demands. This coordinated response can be particularly useful for providing emergency power services in case of power loss while maintaining a high level of transportation service. Thus, improving the overall resilience of the system. In this work, we develop a dynamic optimization framework to evaluate the potential contribution of the SAEV fleet for improving critical buildings' energy resilience via V2B services. The model considers passengers' pick-up and transportation, relocation of vehicles, and battery charging and discharging. Power outage scenarios for critical buildings are considered and the potential of the SAEV fleet to fully or partially respond to the emergency power outage is studied. In addition, sensitivity analysis for key parameters such as the outage parameters is introduced. The results of the case study for the Ile-de-France region in France shows that the SAEV fleet has the potential to provide V2B service for critical building at an acceptable loss of passenger total waiting time on the transportation side. Furthermore, it is shown that it is capable of satisfying the emergency power load at a lower cost compared to investing in extra backup generators unless the outage occurs at significantly high frequencie
Read the full abstract