Nicholas Pippenger

collaborators

3 papers

math.PR2005

The Linking Probability of Deep Spider-Web Networks

Nicholas Pippenger

We consider crossbar switching networks with base $b$ (that is, constructed from $b \times b$ crossbar switches), scale $k$ (that is, with $b^{k}$ inputs, $b^{k}$ outputs and $b^{k}$ link…

math.PR2004

The average amount of information lost in multiplication

Nicholas Pippenger

We show that if X and Y are integers independently and uniformly distributed in the set {1, ..., N}, then the information lost in forming their product (which is given by the equiv…

math.CO2004

Random cyclations

Nicholas Pippenger

Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. T…