#### Filter Results:

#### Publication Year

1990

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Diffusion is a fundamental graph process, underpinning such phenomena as epidemic disease contagion and the spread of innovation by word-of-mouth. We address the algorithmic problem of finding a set of k initial seed nodes in a network so that the expected size of the resulting cascade is maximized, under the standard independent cascade model of network… (More)

- Reid Andersen, Christian Borgs, Jennifer T. Chayes, Uriel Feige, Abraham D. Flaxman, Adam Tauman Kalai +2 others
- WWW
- 2008

High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommendations may incorporate this information. This paper focuses on networks that represent trust and recommendation systems that incorporate these trust relationships. The goal of a… (More)

We consider the general problem of finding the minimum weight b-matching on arbitrary graphs. We prove that, whenever the linear programming (LP) relaxation of the problem has no fractional solutions, then the belief propagation (BP) algorithm converges to the correct solution. We also show that when the LP relaxation has fractional solution then BP… (More)

- Christian Borgs, Jennifer Chayes, László Lovász
- 2008

For a symmetric bounded measurable function W on [0, 1] 2 and a simple graph F , the homomor-phism density t(F, W) = Z [0,1] V (F) Y ij∈E(F) W (xi, xj) dx. can be thought of as a " moment " of W. We prove that every such function is determined by its moments up to a measure preserving transformation of the variables. The main motivation for this result… (More)

We study random subgraphs of an arbitrary finite connected transitive graph G obtained by independently deleting edges with probability 1− p. Let V be the number of vertices in G, and let Ω be their degree. We define the critical threshold p c = p c (G, λ) to be the value of p for which the expected cluster size of a fixed vertex attains the value λV 1/3 ,… (More)

We consider the random 2-satisfiability problem, in which each instance is a formula that is the conjunction of m clauses of the form x ∨ y, chosen uniformly at random from among all 2-clauses on n Boolean variables and their negations. As m and n tend to infinity in the ratio m/n → α, the problem is known to have a phase transition at α c = 1, below which… (More)

We introduce a model for directed scale-free graphs that grow with preferential attachment depending in a natural way on the in- and out-degrees. We show that the resulting in- and out-degree distributions are power laws with different exponents, reproducing observed properties of the worldwide web. We also derive exponents for the distribution of in-… (More)

- Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda +1 other
- FOCS
- 1999

We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangular subsets of the hypercubic lattice Z d. We prove that under certain circumstances, the mixing time in a box of side length L with periodic boundary conditions can be exponential in L d−1. In other words, under these circumstances, the mixing in these widely… (More)

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 reconstruction threshold obtained in roughly a decade. We discuss the implications of our result for Glauber dynamics, phylogenetic reconstruction, and so-called "… (More)

A well-known result in game theory known as "the Folk Theorem" suggests that finding Nash equilibria in repeated games should be easier than in one-shot games. In contrast, we show that the problem of finding any (approximate) Nash equilibrium for a three-player infinitely-repeated game is computationally intractable (even when all payoffs are in {-1,0,1}),… (More)