Skip to main content

Bernoulli Distribution

 Bernoulli Distribution:

  • Definition: The Bernoulli Distribution is a discrete probability distribution that models a random experiment with two possible outcomes - success (usually denoted as 1) and failure (usually denoted as 0). It is named after Swiss mathematician Jacob Bernoulli.


  • Probability Mass Function (PMF): The PMF of the Bernoulli Distribution is defined as:


  • Mean and Variance: The mean (expected value) of the Bernoulli Distribution is p, and the variance is p(1p).


    Mean

    The expected value of a Bernoulli random variable  is

    This is due to the fact that for a Bernoulli distributed random variable  with  and  we find



  • Variance

    The variance of a Bernoulli distributed  is

    We first find

    From this follows

    [2]

    With this result it is easy to prove that, for any Bernoulli distribution, its variance will have a value inside .


    Graphical Representation:

    Here's a bar graph illustrating the Bernoulli Distribution for different values of p:


    Bernoulli distribution
    Probability mass function
    Funzione di densità di una variabile casuale normale

    Three examples of Bernoulli distribution:

       and 
       and 
       and 


    In this graph, you can see that the probability of success (p) is represented by the height of the bar at x=1, and the probability of failure (1p) is represented by the height of the bar at x=0. Since it's a discrete distribution, there are only two possible outcomes.


    Parameters


    Support
    PMF
    CDF
    Mean
    Median
    Mode
    Variance
    MAD
    Skewness
    Ex. kurtosis
    Entropy
    MGF
    CF
    PGF
    Fisher information

  • Use Cases:

    • The Bernoulli Distribution is commonly used to model random experiments with binary outcomes, such as:
      • Coin flips (success = heads, failure = tails).
      • Pass/fail experiments (success = pass, failure = fail).
      • Click-through rate (success = click, failure = no click).

    It serves as the building block for other important distributions like the Binomial Distribution and the Geometric Distribution.

This distribution is fundamental in probability theory and statistics, especially when dealing with events that have only two possible outcomes.

Comments

Popular posts from this blog

Data Wrangling vs EDA

  Aspect Data Wrangling (Data Preprocessing) Exploratory Data Analysis (EDA) Objective Prepare raw data for modeling by cleaning, transforming, and formatting it appropriately. Explore and understand the data to gain insights, identify patterns, and make decisions on data handling and modeling. Order Typically performed as a preliminary step before EDA. Usually conducted after data wrangling to further investigate data characteristics. Data Handling Focuses on data cleaning, filling missing values, encoding categorical variables, and scaling features. Involves data visualization, statistical analysis, and summary statistics to uncover patterns, relationships, and anomalies. Techniques Techniques include imputation, outlier detection, feature scaling, and one-hot encoding. Techniques include histograms, scatter plots, box plots, correlation matrices, and descriptive statistics. Data Transformation Involves structural changes to the dataset, such as feature engineering, data normaliz...

What is Tensor Parallelism and relationship between Buffer and GPU

  Tensor Parallelism in GPU Tensor parallelism is a technique used to distribute the computation of large tensor operations across multiple GPUs or multiple cores within a GPU .   It is an essential method for improving the performance and scalability of deep learning models, particularly when dealing with very large models that cannot fit into the memory of a single GPU. Key Concepts Tensor Operations : Tensors are multidimensional arrays used extensively in deep learning. Common tensor operations include matrix multiplication, convolution, and element-wise operations. Parallelism : Parallelism involves dividing a task into smaller sub-tasks that can be executed simultaneously. This approach leverages the parallel processing capabilities of GPUs to speed up computations. How Tensor Parallelism Works Splitting Tensors : The core idea of tensor parallelism is to split large tensors into smaller chunks that can be processed in parallel. Each chunk is assigned to a different GP...

Infrastructure limitations ESX Server 4 vs ESXI 5

Some limitations in ESX Server 4 may constrain the design of data centers:[28][29] • Guest system maximum RAM: 255 GB • Host system maximum RAM: 1 TB[28] • Number of hosts in a high availability cluster: 32 • Number of Primary Nodes in ESX Cluster high availability: 5 • Number of hosts in a Distributed Resource Scheduler cluster: 32 • Maximum number of processors per virtual machine: 8 • Maximum number of processors per host: 160 • Maximum number of cores per processor: 12 • Maximum number of virtual machines per host: 320 • VMFS-3 limits files to 262,144 (218) blocks, which translates to 256 GB for 1 MB block sizes (the default) or up to 2 TB for 8 MB block sizes.[30] However, on a VMFS Boot drive, it is usually very difficult to use anything other than 1 MB Block size [31]. With ESXI 5 there has been some changes to these limits[32] • Guest system maximum RAM: 1 TB • Host system maximum RAM: 2 TB • Number of hosts in a high availability cluster: 32 • Maximum number ...