17 resultados para Two-state Potts model
Resumo:
Semi-qualitative probabilistic networks (SQPNs) merge two important graphical model formalisms: Bayesian networks and qualitative probabilistic networks. They provade a very Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks and qualitative probabilistic networks. They provide a very general modeling framework by allowing the combination of numeric and qualitative assessments over a discrete domain, and can be compactly encoded by exploiting the same factorization of joint probability distributions that are behind the bayesian networks. This paper explores the computational complexity of semi-qualitative probabilistic networks, and takes the polytree-shaped networks as its main target. We show that the inference problem is coNP-Complete for binary polytrees with multiple observed nodes. We also show that interferences can be performed in time linear in the number of nodes if there is a single observed node. Because our proof is construtive, we obtain an efficient linear time algorithm for SQPNs under such assumptions. To the best of our knowledge, this is the first exact polynominal-time algorithm for SQPn. Together these results provide a clear picture of the inferential complexity in polytree-shaped SQPNs.
Resumo:
We consider a generalized two-species population dynamic model and analytically solve it for the amensalism and commensalism ecological interactions. These two-species models can be simplified to a one-species model with a time dependent extrinsic growth factor. With a one-species model with an effective carrying capacity one is able to retrieve the steady state solutions of the previous one-species model. The equivalence obtained between the effective carrying capacity and the extrinsic growth factor is complete only for a particular case, the Gompertz model. Here we unveil important aspects of sigmoid growth curves, which are relevant to growth processes and population dynamics. (C) 2011 Elsevier B.V. All rights reserved.