3
$\begingroup$

You are given a rectangular $n_1\times n_2$ grid with one light bulb $b_i$ at every node. Each bulb is on or off with probability $p$ and $1-p$, respectively, and furthermore you know that exactly $m$ bulbs are on. Equip the grid with the Manhattan metric $d$, and look at the set of distances between distinct bulbs which are on:

$S:=\{d(b_i,b_j): i\neq j, b_i \textrm{ and } b_j \textrm{ are on}\}.$

To understand how close two lit bulbs should be, I would like to compute the expected value of the random variable $X:=\min S$ (in terms of $n_1,n_2,p$ and $m$). Any hints on how to start thinking about this problem?

Thank you.

  • 1
    @user17240: Expected values of a minimum, maximum or absolute value are often hard because if you write these out explicitly they have different analytic expressions for different cases that depend in a complicated manner on the relative magnitudes of the elementary variables; it's usually much easier to compute an expected value of a quantity that's defined by a single analytic expression in the elementary quantities.2012-07-30

0 Answers 0