Results 41 to 50 of about 1,186 (159)
Remarks on the Time Asymptotics of Schmidt Entropies
DynamicsSchmidt entropy is used as a common denotation for all Hilbert space entropies that can be defined via the Schmidt decomposition theorem; they include quantum entanglement entropies and classical separability entropies. Exact results about the asymptotic
Italo Guarneri
doaj +1 more source
Sequential Monitoring for Changes in GARCH(1,1) Models Without Assuming Stationarity
Journal of Time Series Analysis, Volume 46, Issue 5, Page 981-996, September 2025.ABSTRACT In this article, we develop two families of sequential monitoring procedure to (timely) detect changes in the parameters of a GARCH(1,1) model. Our statistics can be applied irrespective of whether the historical sample is stationary or not, and indeed without previous knowledge of the regime of the observations before and after the break.
Lajos Horváth +2 more
wiley +1 more source
A Novel Inverse Statistical Model for Lifetime and Reliability Analysis
Engineering Reports, Volume 7, Issue 8, August 2025.This paper introduces and studies the inverse Mustapha type‐II distribution (IMUIID), a new model obtained through the inverse transformation of the Mustapha type‐II distribution. The IMUIID is defined on the positive real line and offers enhanced flexibility in modeling lifetime and reliability data, particularly where traditional models may fail to ...
Tamer K. Ibrahim +3 more
wiley +1 more source
Packing Paths in Sparse Random Graphs
Random Structures &Algorithms, Volume 67, Issue 1, August 2025.ABSTRACT We consider an algorithmic problem on the Erdős–Rényi random graph G∼G(n,p)$$ G\sim G\left(n,p\right) $$ with p=(1+ε)/n$$ p=\left(1+\varepsilon \right)/n $$ for some fixed constant ε>0$$ \varepsilon >0 $$. At the start of the algorithm, it is not disclosed which pairs of vertices are adjacent or not. In each step of the algorithm, we can query
Vesna Iršič Chenoweth +2 more
wiley +1 more source
Structure of Lower Tails in Sparse Random Graphs
Random Structures &Algorithms, Volume 67, Issue 1, August 2025.ABSTRACT We study the typical structure of a sparse Erdős–Rényi random graph conditioned on the lower tail subgraph count event. We show that in certain regimes, a typical graph sampled from the conditional distribution resembles the entropy minimizer of the mean field approximation in the sense of both subgraph counts and cut norm.
Byron Chin
wiley +1 more source
Proceedings of the London Mathematical Society, Volume 131, Issue 2, August 2025.Abstract We study fine properties of the principal frequency of clamped plates in the (possibly singular) setting of metric measure spaces verifying the RCD(0,N)${\sf RCD}(0,N)$ condition, that is, infinitesimally Hilbertian spaces with nonnegative Ricci curvature and dimension bounded above by N>1$N>1$ in the synthetic sense.
Alexandru Kristály, Andrea Mondino
wiley +1 more source
Disease Transmission on Random Graphs Using Edge‐Based Percolation
Mathematical Methods in the Applied Sciences, Volume 48, Issue 11, Page 11265-11290, 30 July 2025.ABSTRACT Edge‐based percolation methods can be used to analyze disease transmission on complex social networks. This allows us to include complex social heterogeneity in our models while maintaining tractability. Here, we begin by reviewing the seminal works on this field in previous studies by Newman et al. (2002, 2003) and Miller et al. (2012).
Sicheng Zhao, Felicia Maria G. Magpantay
wiley +1 more source
The robust Orlicz risk with an application to the green photovoltaic power generation
Asian Journal of Control, Volume 27, Issue 4, Page 1655-1667, July 2025.Abstract We propose a novel recursive utility for controlling stochastic processes under risk and uncertainty. Our formulation uses a robustified Orlicz risk that can evaluate risk and uncertainty simultaneously. We focus on the control problem of a photovoltaic power generation system that supplies excess electricity for the secondary purpose of ...
Hidekazu Yoshioka, Motoh Tsujimura
wiley +1 more source
Independent Sets of Random Trees and Sparse Random Graphs
Journal of Graph Theory, Volume 109, Issue 3, Page 294-309, July 2025.ABSTRACT An independent set of size k in a finite undirected graph G is a set of k vertices of the graph, no two of which are connected by an edge. Let x k ( G ) be the number of independent sets of size k in the graph G and let α ( G ) = max { k ≥ 0 : x k ( G ) ≠ 0 }. In 1987, Alavi, Malde, Schwenk, and Erdős asked if the independent set sequence x 0 (
Steven Heilman
wiley +1 more source
A generalization of a theorem of Erdős-Rényi to $m$-fold sums and differences [PDF]
, 2014 Kathryn E. Hare, Shuntaro Yamagishi
openalex +3 more sources