D-Separation, Forecasting, and Economic Science: A Conjecture
نویسندگان
چکیده
The paper considers the conjecture that forecasts from preferred economic models or theories d-separate forecasts from less preferred models or theories from the actual realization of the variable for which a scientific explanation is sought. Dseparation provides a succinct notion to represent forecast dominance of one set of forecasts over another; it provides, as well, a criterion for model preference as a fundamental device for progress in economic science. We demonstrate these ideas with examples from three areas of economic modeling. Word Count: 8348 JEL: B41; C45; C53 _______________ The authors are at Texas A&M University, College Station, Texas, USA. An early draft of this paper was presented at the 2009 SAS forecasting conference in Cary, North Carolina, USA. We thank Tom Fomby for the invitation to address the SAS group. Further, we thank two anonymous referees for substantive comment on an earlier draft of the paper.
منابع مشابه
Investigating Chaos in Tehran Stock Exchange Index
Modeling and analysis of future prices has been hot topic for economic analysts in recent years. Traditionally, the complex movements in the prices are usually taken as random or stochastic process. However, they may be produced by a deterministic nonlinear process. Accuracy and efficiency of economic models in the short period forecasting is strategic and crucial for business world. Nonlinear ...
متن کاملOn Silverman's conjecture for a family of elliptic curves
Let $E$ be an elliptic curve over $Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let $E^{(D)}(Bbb{Q})$ be the group of $Bbb{Q}$-rational points of $E^{(D)}$. It is conjectured by J. Silverman that there are infinitely many primes $p$ for which $...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملA Neural-Network Approach to the Modeling of the Impact of Market Volatility on Investment
In recent years, authors have focused on modeling and forecasting volatility in financial series it is crucial for the characterization of markets, portfolio optimization and asset valuation. One of the most used methods to forecast market volatility is the linear regression. Nonetheless, the errors in prediction using this approach are often quite high. Hence, continued research is conducted t...
متن کاملLattice Variant of the Sensitivity Conjecture
The Sensitivity Conjecture, posed in 1994, states that the fundamental measures known as the sensitivity and block sensitivity of a Boolean function f , s(f) and bs(f) respectively, are polynomially related. It is known that bs(f) is polynomially related to important measures in computer science including the decision-tree depth, polynomial degree, and parallel RAM computation time of f , but l...
متن کامل