Results 51 to 60 of about 23,253 (274)
Forecasting With Dynamic Factor Models Estimated by Partial Least Squares
ABSTRACT Dynamic factor models (DFMs) have found great success in nowcasting and short‐term macroeconomic forecasting when incorporating large sets of predictive information. The factor loadings are typically estimated cross‐sectionally with principal component analysis (PCA) or maximum likelihood (ML), which ignore whether the factors have predictive ...
Samuel Rauhala
wiley +1 more source
A Survey on Teaching and Learning Recursive Programming
We survey the literature about the teaching and learning of recursive programming. After a short history of the advent of recursion in programming languages and its adoption by programmers, we present curricular approaches to recursion, including a ...
Christian RINDERKNECHT
doaj +1 more source
All-order celestial OPE from on-shell recursion
We determine tree level, all-order celestial operator product expansions (OPEs) of gluons and gravitons in the maximally helicity violating (MHV) sector.
Lecheng Ren +3 more
doaj +1 more source
Industry Portfolio Volatility Connections and Industry Portfolio Returns
ABSTRACT This paper tracks dynamic connections that form among daily US industry portfolio return volatilities using a Bayesian time‐varying parameter VAR model. Market participants often focus on sectors to filter vast amounts of information, and this focus results in cross‐industry return predictability. We characterise connections that form over the
Michael Ellington +2 more
wiley +1 more source
Institutional Diversity in Banking and Economic Complexity
ABSTRACT In this paper, we test whether institutional diversity in banking systems is beneficial to economic complexity, using data for Italian provinces in the period 1998–2017. We compute different indexes that consider diversity from an ownership, institutional, business model and competition point of view and find that higher diversity has a ...
Beniamino Pisicoli
wiley +1 more source
How to succeed at Witten diagram recursions without really trying
Witten diagrams are basic objects for studying dynamics in AdS space, and also play key roles in the analytic functional bootstrap. However, these diagrams are notoriously hard to evaluate, making it extremely difficult to search for recursion relations ...
Xinan Zhou
doaj +1 more source
Halin's Grid Theorem for Digraphs
ABSTRACT Halin showed that every thick end of every graph contains an infinite grid. We extend Halin's theorem to digraphs. More precisely, we show that for every infinite family ℛ ${\rm{ {\mathcal R} }}$ of disjoint equivalent out‐rays there is a grid whose vertical rays are contained in ℛ ${\rm{ {\mathcal R} }}$.
Florian Reich
wiley +1 more source
Loop Amplitudes and Quantum Homotopy Algebras
We derive a recursion relation for loop-level scattering amplitudes of La- grangian field theories that generalises the tree-level Berends-Giele recursion relation in Yang-Mills theory.
Branislav Jurčo +3 more
doaj +1 more source
Reduction in a linear lambda-calculus with applications to operational semantics
We study beta-reduction in a linear lambda-calculus derived from Abramsky's linear combinatory algebras. Reductions are classified depending on whether the redex is in the computationally active part of a term ("surface" reductions) or whether it is ...
Simpson, Alexander, Alex Simpson
core +1 more source

