Some Information Theoretic Ideas Useful in Statistical Inference

Papaioannou, Takis; Ferentinos, Kosmas; Tsairidis, Charalampos
June 2007
Methodology & Computing in Applied Probability;Jun2007, Vol. 9 Issue 2, p307
Academic Journal
In this paper we discuss four information theoretic ideas and present their implications to statistical inference: (1) Fisher information and divergence generating functions, (2) information optimum unbiased estimators, (3) information content of various statistics, (4) characterizations based on Fisher information.


Related Articles

  • Generating functions and the performance of backtracking adaptive search. W. Baritompa; D. Bulger; G. Wood // Journal of Global Optimization;Feb2007, Vol. 37 Issue 2, p159 

    Abstract??Backtracking adaptive search is a simplified stochastic optimisation procedure which permits the acceptance of worsening objective function values. Key properties of backtracking adaptive search are defined and obtained using generating functions. Examples are given to illustrate the...

  • On a Batch Arrival Queuing System Equipped with a Stand-by Server during Vacation Periods or the Repairs Times of the Main Server. Khalaf, Rehab F.; Madan, Kailash C.; Lukas, Cormac A. // Journal of Probability & Statistics;2011, p1 

    We study a queuing system which is equipped with a stand-by server in addition to the main server. The stand-by server provides service to customers only during the period of absence of the main server when either the main server is on a vacation or it is in the state of repairs due to a sudden...

  • A POISSON GENERALIZATION BASED ON COUNTS THAT ARE DELAYED BUT NOT LOST. Haight, Frank A. // Operations Research;Sep/Oct66, Vol. 14 Issue 5, p943 

    This paper deals with a model in which Poisson events in fixed time periods are recorded with probability a and left to accumulate into the succeeding period with probability 1-α. The distribution of number of events recorded is obtained, together with its mean, variance, and generating function.

  • Entanglement of Positive Definite Functions on Compact Groups. Korbicz, J.; Wehr, J.; Lewenstein, M. // Communications in Mathematical Physics;Jul2008, Vol. 281 Issue 3, p753 

    We define and study entanglement of continuous positive definite functions on products of compact groups. We formulate and prove an infinite-dimensional analog of the Horodecki Theorem, giving a necessary and sufficient criterion for separability of such functions. The resulting characterisation...

  • Counting Special Families of Labelled Trees. Song, Chunwei // Annals of Combinatorics;2006, Vol. 10 Issue 2, p271 

    A labelled tree rooted at its least labelled vertex is Least-Child-Being-Monk if it has the property that the least labelled child of 0 is a leaf. One of our main results is that the number of Least-Child-Being-Monk trees labelled on {0, 1, 2,... , n + 1} is equal to n n . More generally, let...

  • An operator approach to the Al-Salam–Carlitz polynomials. Chen, William Y. C.; Saad, Husam L.; Sun, Lisa H. // Journal of Mathematical Physics;Apr2010, Vol. 51 Issue 4, p043502 

    We present an operator approach to Rogers-type formulas and Mehler’s formula for the Al-Salam–Carlitz polynomials Un(x,y,a;q). By using the q-exponential operator, we obtain a Rogers-type formula, which leads to a linearization formula. With the aid of a bivariate augmentation...

  • Counting â„“-letter subwords in compositions. Mansour, Toufik; Sirhan, Basel O. // Discrete Mathematics & Theoretical Computer Science (DMTCS);Jun2006, Vol. 8 Issue 3, p285 

    Let ℕ be the set of all positive integers and let A be any ordered subset of ℕ. Recently, Heubach and Mansour enumerated the number of compositions of n with m parts in A that contain the subword τ exactly r times, where τ ∈ {111, 112, 221, 123}. Our aims are (1) to...

  • Queuing system with infinite buffer and stepwise inflow intensity. Golovko, N.; Karetnik, V.; Peleshok, O. // Automation & Remote Control;Oct2009, Vol. 70 Issue 10, p1662 

    The queuing system with infinite buffer, single server, and exponential servicing was considered. A double stochastic Poisson flow whose intensity λ( t) is a stepwise process with exponentially distributed constancy intervals arrives to it. It was assumed that the values of process λ( t)...

  • Asymptotics of Smallest Component Sizes in Decomposable Combinatorial Structures of Alg-Log Type. Li Dong; Zhicheng Gao; Panario, Daniel; Richmond, Bruce // Discrete Mathematics & Theoretical Computer Science (DMTCS);Mar2010, Vol. 12 Issue 2, p197 

    A decomposable combinatorial structure consists of simpler objects called components which by themselves can not be further decomposed. We focus on the multi-set construction where the component generating function C(z) is of alg-log type, that is, C(z) behaves like c + d(1 - z/ρ)α (ln 1 /...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics