Skip to content
Sahithyan's S3
Sahithyan's S3 — Applied Statistics

Introduction to Applied Statistics

A continuation of 2nd semester’s Statistics section. Revise uniform, binomial, poisson distributions.

Moment

Numerical measures of the shape of a distribution. Denoted by E[Xk]\mathbb{E}[X^k].

For a variable XX with the mean μ\mu:

kk-th moment about the origin:

μk=E[Xk]\mu'_k = \mathbb{E}[X^k]

kk-th central moment (about the mean):

μk=E[(Xμ)k]\mu_k = \mathbb{E}[(X - \mu)^k]

Commonly used ones

  • 1st moment about origin - Mean
  • 2nd central moment - Variance
  • 3rd central moment - Skewness
  • 4th central moment - Kurtosis

Moment Generating Function

A mathematical function which encapsulates all moments of a random variable, into a single function. Defined as:

MX(t)=E[etX]M_X(t) = \mathbb{E}[e^{tX}]

Here

  • XX is the random variable
  • tt is the parameter, close to 0 where MGF usually exists
  • etXe^{tX} is the exponential function applied to tXtX
  • E(etX)\mathbb{E}(e^{tX}) is the expected value of the transformed distribution
  • MX(t)M_X(t) is the moment generating function

Here exponential function is applied to tXtX, because of its Taylor series expansion. By differentiating the Taylor series expansion, the moments can be obtained.

E[Xk]=dkdtkMX(t)t=0\mathbb{E}[X^k] = \frac{d^k}{dt^k}M_X(t)\bigg|_{t=0}

Probability Distribution

Poisson point process

A mathematical model used to describe random points scattered in space or time, where the points occur independently of each other.

Key properties:

  • Independence: The number of points in disjoint regions are independent random variables.
  • Homogeneity: λ\lambda is a known constant throughout the space or time interval.

Poisson point processes are fundamental in modeling random arrivals (such as phone calls, radioactive decay events, or raindrops falling) and serve as the basis for more complex stochastic processes.

Memorylessness

A property of probability distributions. Describes situations where previous failures or elapsed time does not affect future trials or further wait time.

A random variable XX is said to be memoryless if for all s,t0s, t \geq 0:

P(X>s+tX>s)=P(X>t)P(X > s + t \mid X > s) = P(X > t)

Only the geometric and exponential distribution are memoryless.