Arrow Research search

Author name cluster

Juan Vera 0001

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

8 papers
1 author row

Possible papers

8

SODA Conference 2011 Conference Paper

Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees

  • Ricardo Restrepo
  • Daniel Stefankovic
  • Juan Vera 0001
  • Eric Vigoda
  • Linji Yang

We study the effect of boundary conditions on the relaxation time of the Glauber dynamics for the hardcore lattice gas model on the n -vertex regular b -ary tree of height h. The hard-core model is defined on independent sets weighted by an activity (or fugacity) Λ on trees. Reconstruction studies the effect of a ‘typical’ boundary condition, i. e. , fixed assignment to the leaves, on the root. The threshold for when reconstruction occurs (and a typical boundary influences the root in the limit h → ∞) has been of considerable recent interest since it appears to be connected to the efficiency of certain local algorithms on locally tree-like graphs. The reconstruction threshold occurs at ω ≈ ln b/b where Λ = ω(1 + ω) b is a convenient re-parameterization of the model. We prove that for all boundary conditions, the relaxation time τ in the non-reconstruction region is fast, namely τ = O ( n 1+ o b (1) ) for any ω ≤ ln b/b. In the reconstruction region, for all boundary conditions, we prove τ = O ( n 1+δ+ o b (1) ) for ω = (1 + δ) ln b/b, for every δ > 0. In contrast, we construct a boundary condition, for which the Glauber dynamics slows down in the reconstruction region, namely τ = Ω( n 1+δ/2− o b (1) ) for ω = (1 + δ) ln b/b, for every δ > 0. The interesting part of our proof is this lower bound result, which uses a general technique that transforms an algorithm to prove reconstruction into a set in the state space of the Glauber dynamics with poor conductance.

SODA Conference 2010 Conference Paper

Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees

  • Prasad Tetali
  • Juan Vera 0001
  • Eric Vigoda
  • Linji Yang

We prove that the mixing time of the Glauber dynamics for random k -colorings of the complete tree with branching factor b undergoes a phase transition at k = b (1 + o b (1))/ln b. Our main result shows nearly sharp bounds on the mixing time of the dynamics on the complete tree with n vertices for k = Cb /ln b colors with constant C. For C ≥ 1 we prove the mixing time is. On the other side, for C < 1 the mixing time experiences a slowing down, in particular, we prove it is and. The critical point C = 1 is interesting since it coincides (at least up to first order) to the so-called reconstruction threshold which was recently established by Sly. The reconstruction threshold has been of considerable interest recently since it appears to have close connections to the efficiency of certain local algorithms, and this work was inspired by our attempt to understand these connections in this particular setting.

STOC Conference 2008 Conference Paper

Logconcave random graphs

  • Alan M. Frieze
  • Santosh S. Vempala
  • Juan Vera 0001

We propose the following model of a random graph on n vertices. Let F be a distribution in R + n(n-1)/2 with a coordinate for every pair ij with 1 ≤ i,j ≤ n. Then G F,p is the distribution on graphs with n vertices obtained by picking a random point X from F and defining a graph on n vertices whose edges are pairs ij for which X ij ≤ p. The standard Erdos-Renyi model is the special case when F is uniform on the 0-1 unit cube. We determine basic properties such as the connectivity threshold for quite general distributions. We also consider cases where the X ij are the edge weights in some random instance of a combinatorial optimization problem. By choosing suitable distributions, we can capture random graphs with interesting properties such as triangle-free random graphs and weighted random graphs with bounded total weight.

STOC Conference 2007 Conference Paper

Randomly coloring planar graphs with fewer colors than the maximum degree

  • Thomas P. Hayes
  • Juan Vera 0001
  • Eric Vigoda

We study Markov chains for randomly sampling k -colorings of a graph with maximum degree δ. Our main result is a polynomial upper bound on the mixing time of the single-site update chain knownas the Glauber dynamics for planar graphs when k=Ω(δ/logδ). Our results can be partially extended to the more general case where the maximum eigenvalue of the adjacency matrix of the graphis at most δ 1-ε , for fixed ε > 0.

v2026.09.13