856 resultados para C33 - Models with Panel Data
Resumo:
We consider the asymptotics of the invariant measure for the process of spatial distribution of N coupled Markov chains in the limit of a large number of chains. Each chain reflects the stochastic evolution of one particle. The chains are coupled through the dependence of transition rates on the spatial distribution of particles in the various states. Our model is a caricature for medium access interactions in wireless local area networks. Our model is also applicable in the study of spread of epidemics in a network. The limiting process satisfies a deterministic ordinary differential equation called the McKean-Vlasov equation. When this differential equation has a unique globally asymptotically stable equilibrium, the spatial distribution converges weakly to this equilibrium. Using a control-theoretic approach, we examine the question of a large deviation from this equilibrium.
Resumo:
Similar quantum phase diagrams and transitions are found for three classes of one-dimensional models with equally spaced sites, singlet ground states (GS), inversion symmetry at sites and a bond order wave (BOW) phase in some sectors. The models are frustrated spin-1/2 chains with variable range exchange, half-filled Hubbard models with spin-independent interactions and modified Hubbard models with site energies for describing organic charge transfer salts. In some range of parameters, the models have a first order quantum transition at which the GS expectation value of the sublattice spin < S-A(2)> of odd or even-numbered sites is discontinuous. There is an intermediate BOW phase for other model parameters that lead to two continuous quantum transitions with continuous < S-A(2)>. Exact diagonalization of finite systems and symmetry arguments provide a unified picture of familiar 1D models that have appeared separately in widely different contexts.
Resumo:
Similar quantum phase diagrams and transitions are found for three classes of one-dimensional models with equally spaced sites, singlet ground states (GS), inversion symmetry at sites and a bond order wave (BOW) phase in some sectors. The models are frustrated spin-1/2 chains with variable range exchange, half-filled Hubbard models with spin-independent interactions and modified Hubbard models with site energies for describing organic charge transfer salts. In some range of parameters, the models have a first order quantum transition at which the GS expectation value of the sublattice spin < S-A(2)> of odd or even-numbered sites is discontinuous. There is an intermediate BOW phase for other model parameters that lead to two continuous quantum transitions with continuous < S-A(2)>. Exact diagonalization of finite systems and symmetry arguments provide a unified picture of familiar 1D models that have appeared separately in widely different contexts.
Resumo:
We address the task of mapping a given textual domain model (e.g., an industry-standard reference model) for a given domain (e.g., ERP), with the source code of an independently developed application in the same domain. This has applications in improving the understandability of an existing application, migrating it to a more flexible architecture, or integrating it with other related applications. We use the vector-space model to abstractly represent domain model elements as well as source-code artifacts. The key novelty in our approach is to leverage the relationships between source-code artifacts in a principled way to improve the mapping process. We describe experiments wherein we apply our approach to the task of matching two real, open-source applications to corresponding industry-standard domain models. We demonstrate the overall usefulness of our approach, as well as the role of our propagation techniques in improving the precision and recall of the mapping task.
Resumo:
Sequential Monte Carlo (SMC) methods are popular computational tools for Bayesian inference in non-linear non-Gaussian state-space models. For this class of models, we propose SMC algorithms to compute the score vector and observed information matrix recursively in time. We propose two different SMC implementations, one with computational complexity $\mathcal{O}(N)$ and the other with complexity $\mathcal{O}(N^{2})$ where $N$ is the number of importance sampling draws. Although cheaper, the performance of the $\mathcal{O}(N)$ method degrades quickly in time as it inherently relies on the SMC approximation of a sequence of probability distributions whose dimension is increasing linearly with time. In particular, even under strong \textit{mixing} assumptions, the variance of the estimates computed with the $\mathcal{O}(N)$ method increases at least quadratically in time. The $\mathcal{O}(N^{2})$ is a non-standard SMC implementation that does not suffer from this rapid degrade. We then show how both methods can be used to perform batch and recursive parameter estimation.
Resumo:
Published as an article in: Oxford Bulletin of Economics and Statistics, 2009, vol. 71, issue 4, pages 491-518.