Sebastien Roch

The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels (2006)

• Borgs, Christian,
• Chayes, Jennifer,
• Mossel, Elchanan,
• Roch, Sebastien

We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the first exact...

Network Delay Inference from Additive Metrics (2006)

• Bhamidi, Shankar,
• Rajagopal, Ram,
• Roch, Sebastien

We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multicast-based delay...

Bounding Fastest Mixing (2005)

• Roch, Sébastien; University Of California At Berkeley, USA; Sroch@stat.berkeley.edu

In a recent work, Boyd, Diaconis and Xiao introduced a semidefinite programming approach for computing the fastest mixing Markov chain on a graph of allowed transitions, given a target stationary...

Non-Colliding Random Walks, Tandem Queues, and Discrete Orthogonal Polynomial Ensembles (2001)

• König, Wolfgang; BRIMS, Hewlett-Packard Laboratories; Koenig@math.tu-berlin.de,
• O'Connell, Neil; BRIMS, Hewlett-Packard Laboratories; Noc@hplb.hpl.hp.com,
• Roch, Sébastien; École Polytechnique; Sebastien.roch@polytechnique.org

We show that the function <i>h(x)=prod_{i < j}(x_j-x_i)</i> is harmonic for any random walk in...