<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Posts | Rishi</title>
    <link>https://rishidarkdevil.github.io/post/</link>
      <atom:link href="https://rishidarkdevil.github.io/post/index.xml" rel="self" type="application/rss+xml" />
    <description>Posts</description>
    <generator>Wowchemy (https://wowchemy.com)</generator><language>en-us</language><lastBuildDate>Sat, 22 Jul 2023 00:00:00 +0000</lastBuildDate>
    <image>
      <url>https://rishidarkdevil.github.io/media/icon_hucf31d7374fc459aedebb55d24d710d3c_248924_512x512_fill_lanczos_center_3.png</url>
      <title>Posts</title>
      <link>https://rishidarkdevil.github.io/post/</link>
    </image>
    
    <item>
      <title>The Asymmetric Coin Toss Problem</title>
      <link>https://rishidarkdevil.github.io/post/the-asymmetric-coin-toss-problem/</link>
      <pubDate>Sat, 22 Jul 2023 00:00:00 +0000</pubDate>
      <guid>https://rishidarkdevil.github.io/post/the-asymmetric-coin-toss-problem/</guid>
      <description>&lt;p&gt;As promised I am back with a new problem from the collection. For new readers, I have recently started a new series where I bring interesting probability puzzles and their solutions to present some revealing aspect of our thought process — something which I really wanted when I learnt about Probability (someone who can walk me through each step and guide why some way of thinking was wrong). You can also contribute your problems or solutions to this series, by reaching me out on LinkedIn, Twitter, Instagram or Email.&lt;/p&gt;
&lt;p&gt;The problem goes like this…&lt;br&gt;
&lt;strong&gt;Two gamblers are playing a coin toss game. Gambler A has (n + 1) fair coins; B has n fair coins. What is the probability that A will have more heads than B if both flip all their coins?&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Read my detailed solution at: &lt;a href=&#34;https://medium.com/@rishidarkdevil/an-asymmetric-coin-toss-problem-fc3835631af8&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;The Asymmetric Coin Toss Problem&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>The Successive Wins Problem</title>
      <link>https://rishidarkdevil.github.io/post/the-successive-wins-problem/</link>
      <pubDate>Thu, 20 Jul 2023 00:00:00 +0000</pubDate>
      <guid>https://rishidarkdevil.github.io/post/the-successive-wins-problem/</guid>
      <description>&lt;p&gt;I fortuitously ran into one of my old friend, who instigated my interest in probability puzzles once again. This time not just with a problem but an entire collection of it. So, I decided to devote some time and effort to create a series of blog posts to bring them to you accompanied by their solution. If you are interested about this series follow me to stay tuned. You can also contribute your problems or solutions to this series, by reaching me out on LinkedIn, Twitter, Instagram or Email.&lt;/p&gt;
&lt;p&gt;The problem goes like this…&lt;br&gt;
&lt;strong&gt;To encourage Elmer’s promising tennis career, his father offers him a prize if he wins (at least) two tennis sets in a row in a three-set series to be played with his father and the club champion alternately: father-champion-father (FCF) or champion-father-champion (CFC), according to Elmer’s choice. The champion is a better player than Elmer’s father. Which series should Elmer choose? Assume that Elmer stops playing when he has satisfied the winning rule or cannot satisfy the winning rule anymore.&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Read my detailed solution at: &lt;a href=&#34;https://medium.com/@rishidarkdevil/the-successive-wins-problem-f4d4397853d5&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;The Successive Wins Problem&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Kernel Density Estimation — A Gentle Introduction to Non-Parametric Statistics</title>
      <link>https://rishidarkdevil.github.io/post/kernel-density-estimation/</link>
      <pubDate>Fri, 03 Feb 2023 00:00:00 +0000</pubDate>
      <guid>https://rishidarkdevil.github.io/post/kernel-density-estimation/</guid>
      <description>&lt;blockquote&gt;
&lt;p&gt;Normality is a Myth!&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;Back in the 20th century, when Statistics was still in its infancy and computers weren’t that popular, it was norm to assume normality as the distribution from which data was generated. It was mostly because it made the calculations less tedious in the age when all results were hand calculated.&lt;/p&gt;
&lt;p&gt;But with the rise of computational power these assumptions can safely be put aside and more insights can be drawn directly for the data. Even the availability of data in this Big Data era made Statisticians to adopt more modern techniques — Non-Parametric Statistics. Here we will discuss one such method to estimate the probability distribution, Kernel Density Estimation.&lt;/p&gt;
&lt;p&gt;Read More at: &lt;a href=&#34;https://medium.com/@rishidarkdevil/kernel-density-estimation-a-gentle-introduction-to-non-parametric-statistics-6a5259d26eff&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;Kernel Density Estimation — A Gentle Introduction to Non-Parametric Statistics&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Revisiting Logistic Regression — A Gentle Introduction to Generalized Linear Models</title>
      <link>https://rishidarkdevil.github.io/post/logistic-regression/</link>
      <pubDate>Fri, 03 Feb 2023 00:00:00 +0000</pubDate>
      <guid>https://rishidarkdevil.github.io/post/logistic-regression/</guid>
      <description>&lt;blockquote&gt;
&lt;p&gt;All models are wrong, but some are useful&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;The two fundamental pillars of supervised statistical learning — Regression and Classification. Simple Linear Regression and Logistic Regression is how many of us have started our journey in Statistics and Data Science. A long-standing debate still prevails on why is Logistic Regression a Classification Model instead of a Regression Model?&lt;/p&gt;
&lt;p&gt;Here we revisit Logistic Regression from an intuitive perspective along with statistical rigor. We will briefly touch up on the concepts behind Generalized Linear Model along with an optional section on Iterative Re-weighted Least Squares (IRLS) to fit these models.&lt;/p&gt;
&lt;p&gt;Read More at: &lt;a href=&#34;https://medium.com/@rishidarkdevil/revisiting-logistic-regression-a-gentle-introduction-to-generalized-linear-models-27baae1550f&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;Revisiting Logistic Regression — A Gentle Introduction to Generalized Linear Models&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>The Three Musketeers in a Semicircle Problem</title>
      <link>https://rishidarkdevil.github.io/post/the-three-musketeers-in-a-semicircle-problem/</link>
      <pubDate>Sat, 29 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://rishidarkdevil.github.io/post/the-three-musketeers-in-a-semicircle-problem/</guid>
      <description>&lt;p&gt;I came across this interesting problem on which my seniors were brainstorming late at night. It requires a bit knowledge of continuous random variables in probability and little bit visualization capability.&lt;/p&gt;
&lt;p&gt;The problem goes like this… &lt;br&gt;
&lt;strong&gt;There are three musketeers who stand on a circle randomly, which follows Uniform(0, 2πr) independently where r is the radius of the circle. They can help each other if they are close enough in case of a sudden attack by the enemies. Find the probability of them lying on the same semicircle.&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Read my detailed solution at: &lt;a href=&#34;https://medium.com/@rishidarkdevil/the-three-musketeers-in-a-semicircle-538677acc067&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;The Three Musketeers in a Semicircle Problem&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>The Rabbit and the Stone Problem</title>
      <link>https://rishidarkdevil.github.io/post/the-rabbit-and-stone-problem/</link>
      <pubDate>Thu, 27 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://rishidarkdevil.github.io/post/the-rabbit-and-stone-problem/</guid>
      <description>&lt;p&gt;I have this friend of mine, who constantly pokes me to solve interesting puzzles. He sometimes even rings me up, just to look at the problem he sent :P This is one of those problems, that I enjoyed working on. It requires understanding of basic probability theory, counting and some time to stick to a problem that interests you.&lt;/p&gt;
&lt;p&gt;The problem goes like this… &lt;br&gt;
&lt;strong&gt;There are 7 stones in a row labelled 1 to 7 from left to right. A rabbit starts at stone 1 and on each turn hops to a new stone that they haven’t visited yet. After visiting all the stones, what is the probability the rabbit made exactly one leftwards jump?&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Read my detailed solution at: &lt;a href=&#34;https://medium.com/@rishidarkdevil/the-rabbit-and-the-stone-problem-90ff6c1d54e0&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;The Rabbit And The Stone Problem&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>The Classic Urn Color Change Problem</title>
      <link>https://rishidarkdevil.github.io/post/the-classic-urn-color-change-problem/</link>
      <pubDate>Sat, 22 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://rishidarkdevil.github.io/post/the-classic-urn-color-change-problem/</guid>
      <description>&lt;p&gt;Anyone who has taken probability class in their college or school is familiar with probability problems involving the classic urn (basically a bag) setup which contains balls of different colors and the professor asks you to find the probability of occurrence of some stupid pattern. This is one of those problems.&lt;/p&gt;
&lt;p&gt;The problem goes like this… &lt;br&gt;
&lt;strong&gt;You are given an urn with 100 balls (50 black and 50 white). You pick balls from urn one by one without replacements until all the balls are out. A black followed by a white or a white followed by a black is “a color change”. Calculate the expected number of color changes if the balls are being picked randomly from the urn.&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Read my detailed solution at: &lt;a href=&#34;https://medium.com/@rishidarkdevil/classic-urn-color-change-problem-c82a24aa549&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;The Classic Urn Color Change Problem&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>The Chessboard High Five Problem</title>
      <link>https://rishidarkdevil.github.io/post/the-chessboard-high-five-problem/</link>
      <pubDate>Fri, 21 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://rishidarkdevil.github.io/post/the-chessboard-high-five-problem/</guid>
      <description>&lt;p&gt;Just another day, when I was browsing through my Instagram feed, my friend sent me this interesting yet not so difficult problem involving understanding of basic probability, counting and bit of time to pause the temptation to scroll the rest of your Instagram feed.&lt;/p&gt;
&lt;p&gt;So, the problem went like this..&lt;br&gt;
&lt;strong&gt;Imagine you have a regular 8 x 8 chessboard, with 64 people standing on each of the 64 squares. At the same time every person turns to face one of their neighbors with equal chances i.e. say the person near the center of the chessboard can face any direction with 1/4 probability, a person at the top of the chessboard (but not the corners) has probability 1/3 to face any of its neighbors, similarly all others. Now, if two people are facing each other they give each other a high five. Find the expected number of high fives.&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Read my detailed solution at: &lt;a href=&#34;https://medium.com/@rishidarkdevil/the-chessboard-high-five-problem-fafcae9acfdb&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;The Chessboard High Five Problem&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    
  </channel>
</rss>
