Results 211 to 220 of about 48,781 (279)
ABSTRACT We present four novel tests of equal predictive accuracy and encompassing á Pitarakis (2023, 2025) for factor‐augmented regressions. Factors are estimated using cross‐section averages (CAs) of grouped series and our theoretical findings are empirically relevant: asymptotic normality, robustness to an overspecification of the number of factors,
Alessandro Morico, Ovidijus Stauskas
wiley +1 more source
Steady bubbles and drops in inviscid fluids. [PDF]
Meyer D, Niebel L, Seis C.
europepmc +1 more source
ABSTRACT The relationship between trauma and addictive behaviors is well‐established, yet factors mediating this relationship remain understudied. Given the prevalence of addictive behaviors among collegiate populations, we used path analysis to explore the mediating role of arousal dysregulation in the relationship between childhood trauma and a ...
Amanda L. Giordano +3 more
wiley +1 more source
Convective stability of the critical waves of an FKPP-type model for self-organized growth. [PDF]
Kreten F.
europepmc +1 more source
Abstract Background Cyclothymic‐Hypersensitive Temperament (CHT) is characterised by mood instability, interpersonal hypersensitivity, and emotional hyperreactivity, traits frequently observed in general population as well as clinical settings but often eluding strict diagnostic classifications.
Anna Pezzella +9 more
wiley +1 more source
Objective Priors for Invariant e-Values in the Presence of Nuisance Parameters. [PDF]
Bortolato E, Ventura L.
europepmc +1 more source
Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree
ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) $\text{fas}(D)$ denote the minimum size of a feedback arc set in an oriented multigraph D $D$. In several papers, upper bounds for fas ( D ) $\text{fas}(D)$ were obtained for oriented multigraphs D $D$ with maximum degree upper‐bounded by a constant ...
Gregory Gutin +3 more
wiley +1 more source
Maximum persistent Betti numbers of Čech complexes. [PDF]
Edelsbrunner H, Kahle M, Kanazawa S.
europepmc +1 more source
Convergence rates in precise asymptotics II
Gut, Allan, Steinebach, Josef
openaire +1 more source
On Oriented Colourings of Graphs on Surfaces
ABSTRACT For an oriented graph G $G$, the least number of colours required to oriented colour G $G$ is called the oriented chromatic number of G $G$ and denoted χ o ( G ) ${\chi }_{o}(G)$. For a non‐negative integer g $g$ let χ o ( g ) ${\chi }_{o}(g)$ be the least integer such that χ o ( G ) ≤ χ o ( g ) ${\chi }_{o}(G)\le \unicode{x0200A}{\chi }_{o}(g)
Alexander Clow
wiley +1 more source

