On urn models, non-commutativity and operator normal forms
نویسندگان
چکیده
منابع مشابه
On Generalized Pólya Urn Models
We study an urn model introduced in the paper of Chen and Wei [2], where at each discrete time step m balls are drawn at random from the urn containing colors white and black. Balls are added to the urn according to the inspected colors, generalizing the well known Pólya-Eggenberger urn model, case m = 1. We provide exact expressions for the expectation and the variance of the number of white b...
متن کاملOn death processes and urn models
In this work we are concerned with so-called Pólya-Eggenberger urn models, which in the simplest case of two colors can be described as follows. At the beginning, the urn contains n white and m black balls. At every step, we choose a ball at random from the urn, examine its color and put it back into the urn and then add/remove balls according to its color by the following rules: if the ball is...
متن کاملOn commutativity of duality operator and propagation operator of linear codes generated from algebraic curves
Based on the construction of linear codes recently proposed by Niederriter and Xing, a corresponding generator matrix is derived. The duality operator and the propagation operator of these extended linear codes are studied. A sufficient and necessary condition under which these two operators are commutative is obtained. This commutative property is found useful for constructing the correspondin...
متن کاملInformational independence: Models and normal forms
The concept of informational independence plays a key role in most knowledge-based systems. J. Pearl and his co-researchers have analysed the basic properties of the concept and have formulated an axiomatic system for informational independence. This axiomatic system focuses on independences among mutually disjoint sets of variables. We show that in the context of probabilistic independence a f...
متن کاملNon–commutativity in Teleportation
We show, using the no–disentanglement theorem, that to teleport (exactly) any set of non–commuting states (i.e., a set containing at least two non–commuting states), it is necessary to have an entangled channel. We further show that to teleport any set of commuting states it is sufficient to have a classically correlated channel. Using this result we provide a simple proof of the fact that any ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 2010
ISSN: 0375-9601
DOI: 10.1016/j.physleta.2010.10.003