Critical stationary fluctuations in reaction--diffusion processes

This paper establishes that for a one-dimensional reaction-diffusion process combining symmetric simple exclusion and critical Glauber dynamics, the rescaled total magnetization converges to a non-Gaussian distribution with a quartic-exponential density, while the density field's fluctuations on zero-mean modes vanish, indicating that the macroscopic behavior is dominated by the magnetization mode.

Luis Cardoso, Claudio Landim, Kenkichi TsunodaWed, 11 Ma🔢 math

Uniform Lorden-type bounds for overshoot moments for standard exponential families: small drift and an exponential correction

This paper establishes uniform Lorden-type moment bounds for the overshoot of random walks with sign-changing increments from standard exponential families in the small-drift regime, demonstrating that these bounds improve to a constant of 1 for large barriers and providing explicit exponential convergence rates interpreted through optimal transport metrics.

El'mira Yu. Kalimulina, Mark Ya. KelbertWed, 11 Ma📊 stat

Small noise asymptotics for a class of jump-diffusions with heavy tails for large times

This paper establishes that for positive recurrent Lévy diffusions driven by scaled Brownian motion and α\alpha-stable processes ($1<\alpha<2$) in the small noise regime, the large-time limiting behavior of the one-dimensional marginal distribution is determined by the optimal value of a deterministic control problem featuring both continuous and impulse controls.

Sumith Reddy Anugu, Siva R. Athreya, Vivek S. BorkarWed, 11 Ma🔢 math

Fine asymptotics of the magnetization of the annealed dilute Curie-Weiss model

This paper establishes sharp cumulant bounds for the magnetization in the annealed dilute Curie-Weiss model under high-temperature conditions with an external magnetic field, thereby proving a central limit theorem with convergence rates, a moderate deviation principle, concentration inequalities, and mod-Gaussian convergence for the regime where p3N2p^3 N^2 \to \infty.

Fabian Apostel, Hanna Döring, Kristina SchubertWed, 11 Ma🔢 math-ph

A stochastic Gordon-Loeb model for optimal cybersecurity investment under clustered attacks

This paper proposes a continuous-time stochastic extension of the Gordon-Loeb model that incorporates Hawkes processes to capture attack clustering, demonstrating through dynamic programming that accounting for such clustering yields more responsive and effective cybersecurity investment policies compared to traditional static or Poisson-based approaches.

Giorgia Callegaro, Claudio Fontana, Caroline Hillairet, Beatrice OngaratoWed, 11 Ma💰 q-fin

Sampling on Discrete Spaces with Temporal Point Processes

This paper introduces a novel sampling framework using multivariate temporal point processes modeled as coupled infinite-server queues to efficiently sample from discrete distributions with downward-closed support, demonstrating superior performance over existing birth-death and Zanella processes while enabling biologically plausible recurrent neural network applications.

Cameron A. Stewart (Gatsby Computational Neuroscience Unit, University College London, London, U.K), Maneesh Sahani (Gatsby Computational Neuroscience Unit, University College London, London, U.K)Wed, 11 Ma📊 stat

Geometric early warning indicator from stochastic separatrix structure in a random two-state ecosystem model

This paper proposes a robust geometric early warning indicator based on the width of the stochastic separatrix in a two-state ecosystem model, which successfully predicts rapid under-ice phytoplankton blooms in the Arctic where conventional critical slowing down signals fail due to strong noise or limited data.

Yuzhu Shi, Larissa Serdukova, Yayun Zheng, Sergei Petrovskii, Valerio LucariniWed, 11 Ma🔢 math

Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets

This paper proves that randomly initialized, polynomially over-parameterized convolutional neural networks contain structured subnetworks capable of approximating smaller networks without training, by developing new mathematical tools to overcome previous limitations in analyzing the Strong Lottery Ticket Hypothesis for structured pruning.

Arthur da Cunha, Francesco d'Amore, Emanuele NataleWed, 11 Ma🤖 cs.LG