Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 30 April

Numerical Analysis · Cross-listed from cs.LG

A Short Note on Batch-efficient Divide-and-Conquer Algorithm for EigenDecomposition

EigenDecomposition (ED) is at the heart of many computer vision algorithms and applications. One crucial bottleneck limiting its usage is the expensive computation cost, particularly for a mini-batch of matrices in deep neural networks. Our previous work proposed a dedicated QR-based ED algorithm for batched small matrices (dim${<}32$). This short paper targets the limitation and proposes a batch-efficient Divide-and-Conquer based ED algorithm for larger matrices. The numerical test shows that for a mini-batch of matrices whose dimensions are smaller than $64$, our method can be much faster than the Pytorch SVD function.
Read the full abstract

Optimization and Control

Revealing Strategic Interactions in Network Games Under Decaying Active Probing

Revealing the interaction topology underlying strategic behavior is fundamental to prediction, intervention, and policy design in networked systems. Yet the interaction matrix is often unobservable, and passive observation of repeated actions fails to provide sufficient excitation for reliable recovery. This paper studies topology recovery in repeated linear-quadratic network games under decaying active probing, where probing inputs are injected into a subset of players and the unknown interaction matrix is inferred from the resulting action trajectories. We first characterize a structural recoverability condition that determines when noiseless probing experiments can make the interaction matrix identifiable. We then show that, under suitable stability and controllability assumptions, a concrete decaying probing signal guarantees exact finite-step recovery while preserving convergence of the repeated-play process. To handle decision perturbations, we further develop a reweighted sparse estimator that achieves almost-sure consistency together with finite-time exact support recovery. These results clarify what can be recovered in both noiseless and perturbed settings.
Read the full abstract

All authors Xiaoyu Xin, Longxu Zhang, Jinlong Lei, Yiguang Hong

Algebraic Geometry

Constructibility aspects of the cone conjecture

We establish two consequences of the Kawamata–Morrison–Totaro cone conjecture, and prove them unconditionally in all dimensions. First, for a K-trivial variety, the natural action of its automorphism group on the set of ample divisor classes of fixed volume has only finitely many orbits. Second, the number of (isomorphism classes of) minimal models for a given K-trivial variety is finite if these models admit a bounded polarization.
Read the full abstract

Geometric Topology

Convex Hull Volumes in Hyperbolic 3-Space

In this paper we provide a geometric condition satisfied by certain closed subsets of the Riemann sphere which implies that their hyperbolic convex hulls in $\mathbb{H}^3$ have infinite volume. As a corollary, we characterize continua in the Riemann sphere whose hyperbolic convex hulls have infinite volume, answering a question of Danny Calegari. Furthermore, we give a geometric characterization of planar self-similar sets whose hyperbolic convex hulls have infinite volume.
Read the full abstract

Optimization and Control

Boundedness of solutions in feedback systems with antithetic controllers

Antithetic feedback controllers have become a key experimental and theoretical tool in synthetic biology. Introduced by Khammash and collaborators about 10 years ago, they are employed in order to achieve the practical regulation of protein expression, including tracking and robust disturbance rejection. In closed-loop, there are unique equilibria which, depending on parameter values, can be unstable. It had been shown, however, that this instability is not arbitrary: any bounded trajectory that stays away from the equilibrium must converge to a periodic orbit. This motivated a long-standing open question: is every trajectory bounded? In other words, even if the equilibrium is unstable, can nonlinear effects prevent unbounded excursions in the state space? This paper provides an affirmative answer, establishing the boundedness of all solutions. Previous attempts to prove this fact using Lyapunov functions had no success. Instead, this paper takes a completely different approach, specific to antithetic configurations, in which the key idea is to think of the controller as providing a “persistently negative feedback” which acts far away from the equilibrium in such a way so as to keep trajectories from diverging. This new approach, although tailored to the antithetic controller, might be useful in other applications as well.
Read the full abstract

Group Theory

A characterization of virtually cyclic outer automorphism groups of right-angled Coxeter groups

Existing research gives conditions for when the outer automorphism group of a graph product of primary cyclic groups $W_\Gamma$ is finite, virtually abelian, or large. We seek to prove a set of conditions for when this outer automorphism group is virtually cyclic. To this end, we study the finite index subgroup $\text{Out}^0(W_\Gamma)$, which is generated by specific partial conjugations. The presence or absence of Coxeter and non-Coxeter separating intersections of links (SILs), separating triple intersections of links (STILs), and flexible separating intersections of links (FSILs) in $\Gamma$ determines algebraic properties of $\text{Out}^0(W_\Gamma)$. We identify each SIL with a pair of partial conjugations in $\text{Out}^0(W_\Gamma)$ and place restrictions on the SILs in $\Gamma$ to ensure that $\text{Out}^0(W_\Gamma)$ is virtually $\mathbb{Z}$ both when $\Gamma$ is connected or disconnected. In particular, this applies to the study of right-angled Coxeter groups. This paper is a slightly shorter version of the author's master's thesis from Tufts University.
Read the full abstract

Numerical Analysis

Thermodynamically Constrained Information Geometric Regularization for Compressible Flows

We construct and analyze a thermodynamic extension of the recently proposed information geometric regularization of Cao and Schäfer. The construction extends their shock-mitigating Hessian metric geometry using the Shannon entropy to constrain the regularized motion based on a thermodynamic length. Reformulating the equations in terms of mass and specific entropy explicitly connects the thermodynamic state to a position in the diffeomorphism group, allowing for a derivation of the regularized equations using an information geometric mechanics formalism based on geodesics on a Hessian manifold with a dual affine connection. The dynamics are defined using a pullback geometry for the Levi–Civita connection, describing constrained geodesic motion, and the cubic Amari–Chentsov tensor describing the information geometric correction. This new compressible fluid model introduces an anisotropic stress tensor to the momentum equation that vanishes along isentropic directions and an additional elliptic equation coupled to the barotropic regularization. Numerical simulations in one and two spatial dimensions demonstrate that the geometrically consistent incorporation of a thermodynamic constraint mitigates cusp singularities previously observed in other approaches while still maintaining the benefits of an inviscid regularization.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Quantum Anonymous Secret Sharing with Permutation Invariant Codes

Quantum secret sharing schemes are a family of quantum cryptographic protocols which provide secure quantum encodings, mapping one secret to multiple shares of information such that the original secret cannot be accessed without an authorized set of shares present for decoding. In this work, we describe a protocol that enables sender-anonymity during the secret decoding process. By using permutation-invariant QEC codes along with a set of anonymous quantum transmission algorithms, we construct a quantum anonymous secret sharing scheme that achieves sender-anonymity. We quantify information leakage in ramp quantum secret sharing schemes via the quantum conditional min-entropy, justifying it as a valid measure of leaked information by relating it to the Knill-Laflamme quantum error correction conditions. Finally, we evaluate several permutation-invariant codes using this measure to make observations on the information leakage of intermediate shares for each quantum anonymous secret sharing scheme.
Read the full abstract

Analysis of PDEs

Lipschitz Stability in the Simultaneous Determination of Polygonal Inclusions and Constant Conductivities

This work establishes a Lipschitz stability result for identifying unknown polygonal inclusions along with their unknown constant conductivity values, given boundary measurements encoded in the Dirichlet-to-Neumann map. We also obtain Lipschitz estimates for the Hausdorff distance between inclusion boundaries and for the difference of the conductivity values
Read the full abstract

Wednesday 29 April

Information Theory · Cross-listed from cs.NI

Accelerating Heterogeneous Agent Collaboration in Dynamic Edge Networks

Deploying large language models (LLMs) at the network edge is hindered by their enormous cost, yet the reasoning quality they provide remains indispensable. Heterogeneous collaboration between edge small models and a server LLM has emerged as a promising direction, but existing methods fail under the dynamic conditions of multi-user contention, autoregressive generation, and time-varying resources. This paper puts forward a process reward model (PRM)-aided two-stage decoupled acceleration (PRADA) framework, which is built on a fundamental change of perspective: instead of querying a PRM online, which cripples multi-user systems with prohibitive latency, we use the PRM solely as an offline teacher. Its reasoning-quality intuition is fully distilled into a lightweight policy that screen each step locally, without any context upload, while a Lagrangian scheduler at the server resolves resource contention through a threshold-structured policy. Across diverse reasoning benchmarks, PRADA retains the vast majority of the LLM's accuracy while substantially reducing end-to-end latency. The results further reveal threshold effects for both server parallel capacity and total bandwidth: performance saturates beyond critical resource levels, after which the system bottleneck shifts from queuing to computation or from communication to contention. These structural findings provide actionable guidance for joint provisioning of computation and communication resources without requiring per-benchmark tuning.
Read the full abstract

General Mathematics

Asymptotic Convergence of Weniger's $\delta$-Transformation for a Class of Superfactorially Divergent Stieltjes Series

The resummation of superfactorially divergent series represents a significant computational challenge in mathematical physics. In the present paper the resummation of a specific class of Stieltjes series characterized by a moment sequence growing as $(2n)!$ will be addressed. Despite the fact that Carleman's condition is satisfied for these series, the convergence rate of Padé approximants is severely hindered by the logarithmic divergence of the associated Carleman series. Weniger's $\delta$ transformation is proposed as a highly efficient alternative resummation tool. By employing recently established results on the converging factors of superfactorially divergent Stieltjes series, an exact integral representation for the truncation error is obtained. This representation enables the rigorous derivation of the leading-order asymptotic behavior of the transformation error, as well as the estimation of the related convergence rate, for real positive arguments. Numerical experiments strongly support the theoretical findings, suggesting that the $\delta$ transformation offers a robust and computationally efficient framework for decoding this class of wildly divergent expansions
Read the full abstract

Mathematical Physics

Remarks on pairwise comparisons, transition amplitudes, and qubit states

We discuss a pairwise-comparison viewpoint on finite families of qubit states. Starting from transition amplitudes between pure states, we distinguish three associated levels of comparison data: complex amplitudes, transition probabilities, and phase-valued pairwise comparisons. In the non-orthogonal case, the phase data define a \(U(1)\)-valued reciprocal pairwise comparison structure. We show that the corresponding triangular defects are naturally related to normalized Bargmann invariants and therefore to geometric phases. This gives a simple interpretation of inconsistency-type quantities in terms of quantum kinematics. We also comment on realizability constraints coming from Gram matrices of rank at most two, and on the passage from unitary phase data to more general transition data. The aim of the paper is mainly conceptual: to isolate a common language between pairwise comparisons and elementary quantum geometry.
Read the full abstract

Information Theory

Delay-Doppler Domain Channel Estimation: What if Sparsity is Unknown?

Sparsity in the delay-Doppler (DD) domain enables efficient channel estimation, but the realization-wise sparsity level is rarely known in advance, and it fluctuates. What if we could estimate the channel without ever knowing how many delays or Dopplers are active? This paper answers that question. We propose a sparsity-agnostic structured estimator that requires no prior knowledge of delay or Doppler sparsity budgets. The key idea is to exploit the Cartesian-product structure of DD support (active delays share a common Doppler set) and to select the support dimensions directly from the data via the Bayesian information criterion. We instantiate the framework on an affine frequency division multiplexing system, where the observation model naturally admits an on-grid DD representation. Numerical results demonstrate that it recovers the exact support with high probability and achieves near-oracle channel reconstruction accuracy, consistently outperforming fixed-budget baselines and sparse Bayesian learning. The approach is waveform-agnostic and offers a practical, adaptive solution for DD-domain channel estimation under unknown and time-varying sparsity.
Read the full abstract

All authors Zijian Yang, Yulin Shao, Fen Hou, Shaodan Ma

General Mathematics

Hierarchical similarity-based approximate reasoning with restricted equivalence function

Given that the restricted equivalence functions (REFs) can serve to measure the similarity of two fuzzy sets, this motivates the integration of REFs with similarity-based approximate reasoning systems to enhance inference capabilities. Therefore, this work primarily constructs hierarchical similarity-based approximate reasoning (SBAR) using REFs. Specifically, we first characterize REFs with a given aggregation function, then discuss the approximation equality of SBAR method proposed by Raha et al. with REFs. Finally, we suggest two REF-based hierarchical Raha's SBAR methods which efficiently restrain the explosion of fuzzy rules.
Read the full abstract

General Mathematics

A revised and extended version of McShane-Whitney extensions for fuzzy Lipschitz maps

In the paper [E. Jiménez-Fernández, J. Rodríguez-López, E. A. Sánchez-Pérez, Fuzzy Sets and Systems 406 (2021),66-81], a McShane-Whitney extension theorem is presented for real-valued fuzzy Lipschitz maps between fuzzy metric spaces. Specifically, the codomain space is considered as a so-called Euclidean fuzzy metric space $(\mathbb{R},M_{\phi,g},\ast).$ However, while the function $\phi$ is only required to be increasing, some results of the paper implicitly assume that $\phi$ is invertible, even though this is not explicitly stated. We propose here an alternative possibility that only requires $\phi$ to be also left-continuous.
Read the full abstract

All authors Eduardo Jiménez-Fernández, Jesús Rodríguez-López, Aurora Sánchez-Martín-Orozco, Enrique A. Sánchez-Pérez

General Mathematics

Lattice-like property of quasi-arithmetic means: revisited

We show that every family of quasi-arithmetic means generated by (a subset of) $\mathcal{C}^1$ functions with nonvanishing derivative which is bounded (from below or from above) by a quasi-arithmetic mean, possesses the best (lower or upper) bound which is a quasi-arithmetic mean generated by a function belonging to the same family.
Read the full abstract

General Mathematics

Measuring and aggregating {\epsilon}-T-transitive fuzzy relations

The transitivity of fuzzy relations plays an important role in fuzzy set theory, artificial intelligence, clustering and decision-making. However, it is often difficult for fuzzy relations to satisfy the transitivity property in many practical applications. This has motivated researchers to investigate the degree to which a fuzzy relation is transitive. Therefore, this work first investigates two different measures of T-transitivity for fuzzy relations using some well-known fuzzy implications. And then, the relationship between two different degrees of transitivity is investigated. Further, the concept of an {\epsilon}-T-transitive fuzzy relation is introduced, and the aggregation functions that preserve the {\epsilon}-T-transitivity of fuzzy relations are characterized. Finally, the {\epsilon}-T-transitive fuzzy relation is utilized to make inferences and cluster objects. Compared to finding the T-transitive closure, it is reasonable to cluster objects using the {\epsilon}-T-transitive fuzzy relation under the permissible error.
Read the full abstract

General Mathematics

Manifold Fractional Harmonic Transform for 3D Point Clouds

Point clouds can be regarded as discrete samples of smooth manifolds and are typically analyzed via the eigenfunctions of the Laplace-Beltrami operator. This paper extends manifold spectral analysis to the fractional domain, enabling continuous interpolation between the spatial and spectral domains for point cloud data. First, a point cloud manifold fractional harmonic transform (PMFHT) is proposed, with its fundamental properties rigorously derived, along with the associated convolution, correlation, and sampling theorems. These theoretical results establish a solid foundation for stable fractional-order spectral representation on manifolds. Second, within the PMFHT framework, two representative algorithms are developed. On the one hand, by integrating multi-order PMFHT with chaotic phase modulation, a point cloud encryption scheme is constructed, characterized by a large key space and high sensitivity to key perturbations. On the other hand, an optimal filter is designed in the fractional manifold spectral domain, leading to a maritime target detection method specifically tailored for point cloud data, which effectively suppresses sea clutter while preserving weak target energy under low signal-to-clutter ratio conditions. Finally, experiments on measured data validate the effectiveness of the proposed algorithms.
Read the full abstract

Algebraic Geometry

Perfectoid splitting and global $+$-regularity for smooth hypersurfaces

In this paper, we prove that smooth Calabi–Yau hypersurfaces of degree $d$ over complete unramified discrete valuation rings with residue characteristic $p$ are perfectoid split if $p$ is larger than the relative dimension and $p\nmid d$. We also show that unramified lifts of smooth Fano hypersurfaces over fields of characteristic $p>0$ are globally $+$-regular if $p\ge \dim X$ and $p\nmid d$.
Read the full abstract

Metric Geometry

Exact Flatness Constant for One-Point Convex Bodies and the Discrete Isominwidth Problem: The Planar Case

A variant of the flatness problem from integer programming is studied, in which one considers convex bodies in $\mathbb{R}^d$ with at most $k$ interior lattice points. The maximum lattice width of such a body is denoted by Flt(d,k) and it is related to the classical flatness constant as well as a conjectural dual version of Minkowski's convex body theorem due to Makai. Moreover, it is shown that Flt(2, 1) = 3, i.e., any planar convex body with at most one interior point has lattice width at most three. This leads to an isominwidth inequality for the lattice point enumerator of planar convex bodies.
Read the full abstract

All authors Gennadiy Averkov, Giulia Codenotti, Ansgar Freyer, Kyle Huang

Algebraic Geometry

Triangulation of Points Constrained to a Plane

We study the set of image tuples arising from fixed cameras observing varying planar 3-dimensional point configurations. We derive a formula for the number of complex critical points of the triangulation problem, which seeks to reconstruct such configurations from noisy image data. Valid for an arbitrary number of views, this formula quantifies the intrinsic algebraic complexity of planar triangulation. We validate our theoretical findings through numerical experiments on both synthetic and real data, demonstrating that incorporating the planar incidence constraints leads to faster point reconstruction and improved accuracy compared to unconstrained triangulation.
Read the full abstract

Probability

Statistical Inference for Homogenization Limits Driven by Wiener or Hermite Processes

We study the effective estimation of the diffusivity and Hurst parameter for the homogenized limit of a class of slow/fast systems. Depending on the system parameters, this limit solves a stochastic differential equation driven by either a Wiener process or a Hermite process. In the class of models we consider, the fast variable is a fractional Ornstein–Uhlenbeck process. We show that estimators constructed from the homogenized limit remain consistent when applied to appropriately subsampled data generated by the original slow/fast system. A key tool in our analysis is the consistency of renormalized quadratic variations for a family of additive functionals of the fast process. Using Wiener chaos expansions, we obtain an \(L^2\)-orthogonal decomposition of these renormalized quadratic variations. This allows us to show that, under appropriate subsampling conditions, the consistency properties of the estimators are preserved even when the data is generated by the slow/fast system rather than the homogenized limit. We also show that, under stricter subsampling conditions, a non-central limit theorem is preserved in the case where the fluctuations of the estimator around the true value are non-Gaussian. As a direct consequence of convergence in \(L^2\), we obtain consistency of an estimator for the limiting self-similarity that does not require knowledge of the limiting diffusivity. Finally, we show that our results apply to a class of one-dimensional fluctuation models.
Read the full abstract

Combinatorics

Root-to-Leaf Path Random Walks, Normalized Hodge Laplacians, and Cheeger Inequalities on Simplicial Complexes

We introduce root-to-leaf path random walks on double covers of graded signed graphs and analyze their behavior in a general setting. Viewing simplicial complexes within this framework, we show that these walks induce the natural normalization of the coboundary operator and of the Hodge Laplacians while preserving the basic structural features of combinatorial Hodge theory. We then derive Cheeger inequalities for the upper side of the normalized Hodge spectrum, identify the coherent structures governing these bounds, and combine the up- and down-cases into sharper estimates.
Read the full abstract

All authors Francesco Viganò, Tolga Birdal, Michael T. Schaub, Mauricio Barahona

Representation Theory

Asymptotic Vanishing of Stiefel–Whitney Classes for $\mathrm{GL}_n(\mathbb{F}_q)$

We study the asymptotic behavior of Stiefel–Whitney classes of irreducible orthogonal representations of the finite general linear groups $\mathrm{GL}_n(\mathbb{F}_q)$. Building on recent formulas expressing these classes in terms of character values at elements of order dividing $2$, we relate questions about characteristic classes to problems of $2$-adic divisibility of character values. For fixed odd $q$, we show that as $n \to \infty$, the values of irreducible orthogonal characters become highly divisible by powers of $2$ for almost all representations. As a consequence, the proportion of irreducible orthogonal representations with trivial first and second Stiefel–Whitney classes tends to $1$, and if $q \equiv 1 \pmod{4}$, the same holds for the fourth Stiefel–Whitney class. In particular, almost all orthogonal representations are spinorial in the large rank limit. In contrast, when the rank is fixed and $q \to \infty$, the behavior is markedly different. Focusing on $\mathrm{GL}_2(\mathbb{F}_q)$, we show that the second Stiefel–Whitney class vanishes with limiting probability $3/8$ among irreducible orthogonal representations.
Read the full abstract

Algebraic Geometry

Hodge theory and K-stability of some very symmetric hypersurfaces

We study some interesting hypersurfaces that naturally arise when studying the period map on the moduli space of hypersurfaces, in the context of Sung Gi Park's recent work on studying the GIT moduli space of hypersurfaces via the minimal exponent. We compute the Hodge structure on the singular cohomology and the intersection cohomology of these hypersurfaces, and also show the $K$-polystability of certain mildly singular degenerate hypersurfaces among them. In particular, the following hypersurface is $K$-polystable for $l \geq 2$: $$ \{ x_{11}\cdots x_{1d} + \ldots + x_{ld} \cdots x_{ld} = 0\} \subset \PP^{ld-1}.$$
Read the full abstract

Combinatorics · Cross-listed from cs.DS

Designing sparse temporal graphs satisfying connectivity requirements

Connectivity of temporal graphs has been widely studied both as graph theory and as gossip theory. In particular, it is well known that in order to connect every vertex to every other, a temporal graph needs to have at least $2n-4$ edges where $n$ is the number of vertices. This paper investigates the optimal number of edges required to satisfy partial connectivity requirements. We introduce the problem of Connectivity Request Satisfaction where we are given a directed graph that we call the request graph, where an arc from $u$ to $v$ means that we need to be able to go from $u$ to $v$. Our goal is to build a temporal graph on the same vertex set with as few temporal edges as possible that would satisfy all the requests. When the graph we build is directed, we prove that the number of temporal arcs required is $n-\mathrm{cc}+\mathrm{dfvs}$ where $\mathrm{cc}$ is the number of connected component of the request graph and $\mathrm{dfvs}$ is the size of its smallest directed feedback vertex set. It follows that the problem is NP-complete but inherits fixed parameter tractability properties of Directed Feedback Vertex Set. When the graph we build is undirected, we establish a characterization of strongly connected request graphs that admit a solution with $n-1$ edges: it is possible if and only if any set of pairwise non-vertex-disjoint closed walks all share a common vertex. We prove that this criteria can be tested in polynomial time.
Read the full abstract

All authors Thomas Bellitto, Jules Bouton Popper, Justine Cauvi, Bruno Escoffier, Raphaëlle Maistre-Matus

Analysis of PDEs

Anchored Peskin Problem

The Immersed Boundary Method has long served as a robust computational framework for fluid-structure interactions, yet the rigorous analysis of 1D Peskin filaments anchored to rigid boundaries remains sparse. In this paper, we generalize the classical Peskin problem to the half-plane by considering an elastic filament whose endpoints are anchored to a no-slip wall. Moving beyond the algebraic complexity of the traditional Blake image system, we utilize the boundary-symmetric formulation of Gimbutas, Greengard, and Veerapaneni. This representation allows for a transparent decomposition of the hydrodynamic interactions into a free space principal part and a regularizing reflected component without resorting to hypersingular integral operators. Through this framework, we prove that the leading-order evolution of the anchored filament is governed by a fractional Laplacian equipped with homogeneous Dirichlet boundary conditions. We characterize the stationary states of the system, proving that all equilibria are circular arcs connecting the anchor points, a result that holds for a broad class of elastic energy densities. By framing the non-local dynamics in weighted little Hölder spaces, we establish local well posedness and prove that the filament exhibits instantaneous $C^\infty$ regularization in both space and time. This work provides a rigorous analytical foundation for anchored filaments in bounded domains and suggests a spectrally accurate numerical path for simulating tethered biological structures.
Read the full abstract

Geometric Topology

Hard Legendrian unknots

We initiate the study of Reidemeister hardness of Legendrian unknot front projections. Using normal rulings, we obstruct several infinite families of hard unknot diagrams from being drawn with max-tb unknot fronts, along with 1.7 million of the 2.6 million hard unknot diagrams studied in \cite{applebaum2024unknottingnumberhardunknot}. We construct infinitely many smoothly hard max-tb unknot diagrams, and bound their minimum possible writhe. With respect to these bounds, our constructions are conjecturally sharp.
Read the full abstract

Optimization and Control

Reliability-based Topology Optimization using Large Deviation Theory

Reliability-based topology optimization (RBTO) requires repeated estimation of small failure probabilities and their gradients, making conventional nested Monte Carlo approaches computationally prohibitive for large scale structural problems. We propose an RBTO framework that integrates large deviation theory~(LDT) with stochastic gradient descent~(SGD) to address this challenge. LDT provides closed-form exponential rate estimates of rare event probabilities, enabling accurate gradient computation without parametric assumptions on the failure density and without evaluating a full nested reliability loop at every iteration. These LDT-based gradient estimates are used directly to drive a mini batch SGD update of the design variables using only a few random samples per iteration. The framework is validated on three benchmarks, namely, a two-dimentional (2D) simply supported rectangular beam, a 2D L-shaped beam, and a three-dimentional (3D) cantilever beam, under both compliance-based and stress-based failure criteria. Across these examples, the RBTO designs achieve failure probabilities lower than their robust topology optimization counterparts, demonstrating that optimizing for performance under uncertainty alone does not guarantee the satisfaction of explicit reliability constraints. Therefore, the proposed framework offers a computationally efficient route to reliable structural design under uncertainty, with direct relevance to safety-critical engineering applications.
Read the full abstract

All authors Maryam Maghazeh, Ayyappan Unnikrishna Pillai, Mohammad Masiur Rahaman, Subhayan De

Probability

An Analysis of the Diaconis-Holmes-Neal Markov Chain Sampler Under Generalized Unimodal Underlying Probabilities

Upon the introduction of the Metropolis algorithm, the question of how many steps in the Markov chain were needed to achieve convergence to stationarity became apparent. The convergence was rather slow, i.e. for a process on $n$ states the number of steps needed to achieve convergence to stationarity was found to be on the order of $n^2$ if the underlying distribution is uniform. The obvious problem with Metropolis et. al is that the Markov chain is reversible. In other words, for any state $j$ we can move from $j$ to $j + 1$ and back to $j$ in two steps. To correct for this, Diaconis, Holmes, and Neal improved Metropolis et. al by introducing a non-reversible Markov chain. The Diaconis-Holmes-Neal sampler, as it is known, is a Markov chain on two copies of $n$ states, a $+1$ copy and a $-1$ copy. Applications of the Diaconis-Holmes-Neal sampler include Markov chain sampling and situations in statistical physics, among others. However, an answer to the question of how many steps are needed to achieve convergence to stationarity was required. Hildebrand showed that if the underlying probabilities are log-concave then the sampler achieves convergence to stationarity in at least a constant multiple of $n$ steps. Nonetheless, the question of whether a similar convergence exists when the underlying probabilities are instead unimodal was posed in Hildebrand. While Lange answered the question in the three simplest cases - the simple case, the function of $n$ case, and the asymmetric function of $n$ case - and Lange answered the question in the general symmetric unimodal case, the general unimodal case is left to this paper.
Read the full abstract