activity
20092015
most citedImproved Mixing Condition on the Grid for Counting and Sampling Independent Sets

11 citations · 24 across the 7 of their papers we have counts for

collaborators

7 papers

math.PR2015

Recovering a Gaussian distribution from its minimum

Ricardo Restrepo, Carlos Marín, Jose Solano

Let be a Gaussian random vector such that . We consider the problem of determining the matrix , up to permutation, based on the knowl…

cs.DM2012

Frozen variables in random boolean constraint satisfaction problems

Michael Molloy, Ricardo Restrepo

We determine the exact freezing threshold, r^f, for a family of models of random boolean constraint satisfaction problems, including NAE-SAT and hypergraph 2-colouring, when the co…

math.PR2011★ 11 cited

Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets

Ricardo Restrepo, Jinwoo Shin, Prasad Tetali +2

We study the hard-core model defined on independent sets, where each independent set I in a graph G is weighted proportionally to , for a positive real parameter . For…

math.PR2010

Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees

Ricardo Restrepo, Daniel Stefankovic, Juan C. Vera +2

We study the effect of boundary conditions on the relaxation time of the Glauber dynamics for the hard-core model on the tree. The hard-core model is defined on the set of independ…

math.PR2010

A probabilistic approach to the asymptotics of the length of the longest alternating subsequence

Christian Houdré, Ricardo Restrepo

Let be the length of the longest alternating subsequence of a uniform random permutation . Classical probabilistic arguments are used to rederive the asymptoti…

cs.IT2010★ 6 cited

Memory Allocation in Distributed Storage Networks

Mohsen Sardari, Ricardo Restrepo, Faramarz Fekri +1

We consider the problem of distributing a file in a network of storage nodes whose storage budget is limited but at least equals to the size file. We first generate encoded sym…

cs.DM2009★ 7 cited

Reconstruction and Clustering in Random Constraint Satisfaction Problems

Andrea Montanari, Ricardo Restrepo, Prasad Tetali

Random instances of Constraint Satisfaction Problems (CSP's) appear to be hard for all known algorithms, when the number of constraints per variable lies in a certain interval. Con…