Log-linear model: Difference between revisions
en>Melcombe distinguish log-linear and logistic |
en>Duoduoduo m typo |
||
Line 1: | Line 1: | ||
{{Multiple issues| | |||
{{unreferenced|date=July 2010}} | |||
{{sections|date=October 2012}} | |||
{{tone|date=July 2012}} | |||
{{expert-subject|mathematics|date=August 2011}} | |||
}} | |||
{{merge to|Coupon collector's problem|date=August 2011}} | |||
The '''[[coupon collector's problem]]''' can be solved in several different ways. The [[generating function]] approach is a [[combinatorial]] technique that allows to obtain precise results. | |||
This technique uses the [[probability generating function]] (PGF) <math>G(z)</math> where <math>[z^q] G(z)</math> is the probability that ''q'' steps are taken to collect the ''n'' coupons i.e. <math>T=q</math> | |||
and the expectation is given by | |||
:<math>\operatorname{E}(T) = \left. \frac{\mathrm{d}}{\mathrm{d}z} G(z) \right|_{z=1}.</math> | |||
<math>G(z)</math> can be calculated explicitly as follows : | |||
:<math> G(z) = | |||
\frac{n}{n} z | |||
\frac{1}{1-\frac{1}{n} z} | |||
\frac{n-1}{n} z | |||
\frac{1}{1-\frac{2}{n} z} | |||
\frac{n-2}{n} z | |||
\frac{1}{1-\frac{3}{n} z} | |||
\frac{n-3}{n} z | |||
\cdots | |||
\frac{1}{1-\frac{n-1}{n} z} | |||
\frac{n-(n-1)}{n} z.</math> | |||
In this equation, It can be found some features : | |||
:<math> \frac{1}{1 - p z} = 1 + p z + p^2 z^2 + p^3 z^3 + \cdots,</math> | |||
This is the PGF of an event that has probability ''p'' occurring zero or more times, with the exponent of ''z'' counting the number of times. We split the sequence of coupons into segments. A new segment begins every time a new coupon is retrieved for the first time. The PGF is the product of the PGFs of the individual segments. | |||
Applying this to <math>G(z)</math>, It represents the following sequence of events: | |||
* retrieve the first coupon (no restrictions at this time) | |||
* retrieve the first coupon some number of times | |||
* retrieve the second coupon (probability <math>(n-1)/n</math>) | |||
* retrieve a mix of the first and second coupons some number of times | |||
* retrieve the third coupon (probability <math>(n-2)/n</math>) | |||
* retrieve a mix of the first, second, and third coupons some number of times | |||
* retrieve the fourth coupon (probability <math>(n-3)/n</math>) | |||
* <math>\ldots</math> | |||
* retrieve the last coupon (probability <math>(n-(n-1))/n</math>). | |||
In the following, <math>H_n</math> and <math>H_n^{(2)}</math> denote [[harmonic number]]s. | |||
The function <math>G(z)</math>, first simplified before deriving the expectation, can be expressed as follows : | |||
:<math> G(z) = z^n | |||
\frac{n-1}{n-z} | |||
\frac{n-2}{n-2z} | |||
\frac{n-3}{n-3z} | |||
\cdots | |||
\frac{n-(n-1)}{n-(n-1)z} | |||
</math>. | |||
In this function, the following formula can be used to obtain the derivative of <math>G(z)</math> : | |||
:<math> \frac{\mathrm{d}}{\mathrm{d}z} \frac{n-k}{n-kz} = \frac{k(n-k)}{(n-kz)^2}</math> | |||
so thus | |||
:<math>\frac{\mathrm{d}}{\mathrm{d}z} G(z) = | |||
G(z) | |||
\left( | |||
\frac{n}{z} | |||
+ \frac{1}{n-z} | |||
+ \frac{2}{n-2z} | |||
+ \frac{3}{n-3z} | |||
\cdots | |||
+ \frac{n-1}{n-(n-1)z} | |||
\right) | |||
</math>. | |||
From this equation, it can be found <math>\operatorname{E}(T)</math> as following : | |||
:<math> | |||
\operatorname{E}(T) = \left. \frac{\mathrm{d}}{\mathrm{d}z} G(z) \right|_{z=1} | |||
= G(1) | |||
\left( | |||
n | |||
+ \frac{1}{n-1} | |||
+ \frac{2}{n-2} | |||
+ \frac{3}{n-3} | |||
\cdots | |||
+ \frac{n-1}{n-(n-1)} | |||
\right) | |||
</math> | |||
or | |||
:<math>\operatorname{E}(T) = n + \sum_{k=1}^{n-1} \frac{k}{n-k}.</math> | |||
The next formula is useful for simplifying the <math>\operatorname{E}(T)</math>: | |||
:<math> \sum_{k=1}^{n-1} \frac{k}{n-k} = | |||
\sum_{k=1}^{n-1} \left( \frac{k}{n-k} - \frac{n}{n-k} \right) + n H_{n-1} = | |||
n H_{n-1} - (n-1)</math> | |||
so that | |||
:<math> \operatorname{E}(T) = n + n H_{n-1} - (n-1) = n H_{n-1} + 1 = n H_n, | |||
\quad \mbox{QED.}</math> | |||
The PGF <math>G(z)</math> makes it possible to obtain an exact value for the [[variance]]. | |||
:<math>\operatorname{Var}(T) = | |||
\operatorname{E}(T(T-1)) + \operatorname{E}(T) - \operatorname{E}(T)^2,</math> | |||
This formula consists entirely of [[factorial moment]]s that can be calculated from the PGF. The value of <math>\operatorname{E}(T)</math> is already found. | |||
The remainder can be calculated as follows : | |||
:<math>\operatorname{E}(T(T-1)) = | |||
\left. \left( \frac{\mathrm{d}}{\mathrm{d}z} \right)^2 G(z) \right|_{z=1}.</math> | |||
This derivative is | |||
:<math> | |||
\begin{align} | |||
& G(z) | |||
\left( | |||
\frac{n}{z} | |||
+ \frac{1}{n-z} | |||
+ \frac{2}{n-2z} | |||
+ \frac{3}{n-3z} | |||
\cdots | |||
+ \frac{n-1}{n-(n-1)z} | |||
\right)^2 \\ | |||
+ & \; | |||
G(z) | |||
\left( | |||
- \frac{n}{z^2} | |||
+ \frac{1^2}{(n-z)^2} | |||
+ \frac{2^2}{(n-2z)^2} | |||
+ \frac{3^2}{(n-3z)^2} | |||
\cdots | |||
+ \frac{(n-1)^2}{(n-(n-1)z)^2} | |||
\right) | |||
\end{align} | |||
</math> | |||
Evaluation at <math>z=1</math> yields | |||
:<math> | |||
\begin{align} & | |||
n^2 H_n^2 - n + \sum_{k=1}^{n-1} \frac{k^2}{(n-k)^2} = | |||
n^2 H_n^2 - n + \sum_{k=1}^{n-1} \frac{(n-k)^2}{k^2} \\ = & \; | |||
n^2 H_n^2 - n + n^2 H_{n-1}^{(2)} - 2 n H_{n-1} + (n-1). | |||
\end{align} | |||
</math> | |||
As all value has been found, the conclusion can be reached at the following: | |||
:<math> | |||
\begin{align} | |||
\operatorname{Var}(T) & = \; | |||
n^2 H_n^2 - 1 + n^2 H_{n-1}^{(2)} - 2 n H_{n-1} + n H_{n-1} + 1 - n^2 H_n^2 \\ & = \; | |||
n^2 H_{n-1}^{(2)} - n H_{n-1} < \frac{\pi^2}{6} n^2, \quad \text{QED.} | |||
\end{align}</math> | |||
{{DEFAULTSORT:Coupon Collector's Problem (Generating Function Approach)}} | |||
[[Category:Named probability problems]] | |||
[[Category:Games (probability)]] | |||
[[Category:Combinatorics]] | |||
[[Category:Articles containing proofs]] |
Revision as of 21:18, 6 April 2013
Hostgator is a large independently possessed hosting business operating from several state of the art centers in Dallas, Texas. Hostgator was founded in 2002, because then they have actually expanded rapidly and currently host over 400,000 websites.
Hostgator offers numerous different hosting packages, and deal with a broad array of customers. From the first time webmaster who needs simple, stress cost-free hosting for their personal website; all the way with to big corporations, who require specialist devoted hosting services.
Hostgator's hosting packages can be split into 3 teams; basic shared hosting plans (suitable for the huge bulk people), reseller hosting strategies (these are generally for people and companies that want to "resell" their account resources to consumers of their own), and lastly committed server strategies (these accounts give client their own server, so they don't have to share its resources with anyone else). Really few of us will every need a devoted server so this testimonial will focus on the shared hosting strategies that Hostgator offer.
Attributes
Hostgator's 3 major shared hosting plans are named: "Hatchling" (the entry level plan priced at $6.95 / month), "Child" (this is the most popular plan, and it is likely to satisfy the requirements of a really wide range of customers), and "Swamp" (similar as the "Baby" plan, however with increases in bandwidth and disk space, priced at $14.95 / month).
For a complete list of features and a side by side contrast of all hosting strategies you should see Hostgator's website below. Below is a testimonial of the most vital features of the "Baby" strategy, this is most likely the most ideal plan for the majority of users, and it is our favorite plan.
Disk space 100GB - This amount has actually been just recently upgraded by Hostgator from 5GB to a huge 100GB. All users are most likely to discover it impossible to tire this quantity of disk space.
Bandwidth 1000GB/month - Also enhanced is the bandwidth allotment, from 75GB to a relatively extreme 1000GB. Once again virtually absolutely no opportunity of making use of all that, but it's good to understand that you absolutely won't be dealing with additional costs for reviewing your limitation, even if you have an extremely hectic internet site(s).
Website Studio website home builder - This is an excellent free program that permits you to build your site from scratch. You have over 500 design templates and color schemes to select from. You require no HTML experience, or code writing understanding. It provides the most basic possible method of making an expert looking site in a really short area of time. Nonetheless, there is no have to take my word for it, as Hostgator offers us with a trial version of the software application on their internet site!
Unrestricted add-on domains - This truly is the stand out function of this hosting plan (the "Hatchling" strategy just permits 1 domain), and allows you to host as lots of internet sites as you like on a single account, at no additional expense. This permits you to make full use of your massive bandwidth and disk space allowances, and host numerous internet sites at a portion of the regular cost.
99.9 % Uptime guarantee - This generally tells us that Hostgator is a significant host offering a trusted service. If uptime drops below this figure in any provided month then you do not spend for that months hosting, it's as basic as that! We would never ever think about making use of a host that did not provide a strong uptime assurance; this is simply because there is only one great reason why a host will not offer an uptime assurance - undependable uptime!
30 Day money back guarantee - This has become a pretty conventional function in the webhosting community, though it's good to have for added assurance.
Immediate setup - Many hosting providers take 24-48 hours to setup your account however Hostgator guarantees to have you up and running in under 15 minutes (they do not charge a setup charge either)!
Endless MySQL databases - This is really helpful because each Fantastico (see below) script requires its own MySQL database.
Fantastico DeLuxe - This remarkable program permits you to instantly install over 50 scripts through your control board. Scripts include blog sites, forums, galleries, buying carts, and more.
If you cherished this article and also you would like to receive more info pertaining to Hostgator Coupons generously visit our own web site. Unrestricted e-mail accounts - Permits you to have as many, or as few, different email addresses as you like.
It contains numerous features and offers good performance. Best of all, there is a complete working demo on the Hostgator website, so you can test it out yourself!
Customer service and technical support
Hostgator offers us 24/7 phone support, and live online chat. The fact that you are provided 2 options to receive instantaneous technical support at any time of the day is excellent. Our experience has actually always been really good when speaking to Hostgator, their operatives are extremely respectful and most significantly they appear to understand their things when dealing with technical issues.
Performance
The efficiency from Hostgator's servers is outstanding! Hostgator location much tighter limitations on the variety of websites sharing the exact same server compared with most various other shared hosting carriers. This offers higher dependability since less stress is put on the servers; and it also greatly enhances the rate at which your web pages run.
Server efficiency is an additional one of the essential areas where Hostgator distinguish themselves from the crowd of various other host.
Our decision
Overall there is so much to such as about the method Hostgator does company, they actually do appear to have a great grasp on what the typical customer requires from a web hosting provider. Rarely do you come across reports of unhappy Hostgator customers, and after hosting with them ourselves we now understand why! At simply $9.95 / month for the "Baby" strategy (which includes limitless domains); anyone looking to host more than one internet site has a rather easy decision to make.
The coupon collector's problem can be solved in several different ways. The generating function approach is a combinatorial technique that allows to obtain precise results.
This technique uses the probability generating function (PGF) where is the probability that q steps are taken to collect the n coupons i.e.
and the expectation is given by
can be calculated explicitly as follows :
In this equation, It can be found some features :
This is the PGF of an event that has probability p occurring zero or more times, with the exponent of z counting the number of times. We split the sequence of coupons into segments. A new segment begins every time a new coupon is retrieved for the first time. The PGF is the product of the PGFs of the individual segments.
Applying this to , It represents the following sequence of events:
- retrieve the first coupon (no restrictions at this time)
- retrieve the first coupon some number of times
- retrieve the second coupon (probability )
- retrieve a mix of the first and second coupons some number of times
- retrieve the third coupon (probability )
- retrieve a mix of the first, second, and third coupons some number of times
- retrieve the fourth coupon (probability )
- retrieve the last coupon (probability ).
In the following, and denote harmonic numbers.
The function , first simplified before deriving the expectation, can be expressed as follows :
In this function, the following formula can be used to obtain the derivative of :
so thus
From this equation, it can be found as following :
or
The next formula is useful for simplifying the :
so that
The PGF makes it possible to obtain an exact value for the variance.
This formula consists entirely of factorial moments that can be calculated from the PGF. The value of is already found.
The remainder can be calculated as follows :
This derivative is
As all value has been found, the conclusion can be reached at the following: