#### Filter Results:

- Full text PDF available (33)

#### Publication Year

2006

2017

- This year (5)
- Last 5 years (24)
- Last 10 years (47)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be compressed. Boldi and Vigna (WWW 2004), showed that Web graphs can be compressed down to three bits of storage per edge; we study the compressibility of social networks where again… (More)

We show that if a connected graph with $n$ nodes has conductance φ then rumour spreading, also known as randomized broadcast, successfully broadcasts a message within ~O(φ<sup>-1</sup> • log n), many rounds with high probability, regardless of the source, by using the PUSH-PULL strategy. The ~O(••) notation hides a polylog… (More)

Constraint-based approaches recently brought new insight into our understanding of metabolism. By making very simple assumptions such as that the system is at steady-state and some reactions are irreversible, and without requiring kinetic parameters, general properties of the system can be derived. A central concept in this methodology is the notion of an… (More)

The network inference problem consists of reconstructing the edge set of a network given traces representing the chronology of infection times as epidemics spread through the network. This problem is a paradigmatic representative of prediction tasks in machine learning that require deducing a latent structure from observed patterns of activity in a network,… (More)

We show that if a connected graph with <i>n</i> nodes has conductance &phis; then rumour spreading, also known as randomized broadcast, successfully broadcasts a message within <i>O</i>(log<sup>4</sup> <i>n</i>/&phis;<sup>6</sup>) many steps, with high probability, using the PUSH-PULL strategy. An interesting feature of our approach is that it draws a… (More)

- Flavio Chierichetti, Hilary Finucane, Zhenming Liu, Michael Mitzenmacher
- IEEE Transactions on Information Theory
- 2008

Floating codes are codes designed to store multiple values in a Write Asymmetric Memory, with applications to flash memory. In this model, a memory consists of a block of <i>n</i> cells, with each cell in one of q states {0,1,...,q -1}. The cells are used to represent k variable values from an ¿-ary alphabet. Cells can move from lower values to higher… (More)

User modeling on the Web has rested on the fundamental assumption of Markovian behavior --- a user's next action depends only on her current state, and not the history leading up to the current state. This forms the underpinning of PageRank web ranking, as well as a number of techniques for targeting advertising to users. In this work we examine the… (More)

- Flavio Chierichetti, Nilesh N. Dalvi, Ravi Kumar
- KDD
- 2014

Correlation clustering is a basic primitive in data miner's toolkit with applications ranging from entity matching to social network analysis. The goal in correlation clustering is, given a graph with signed edges, partition the nodes into clusters to minimize the number of disagreements. In this paper we obtain a new algorithm for correlation clustering.… (More)

- Flavio Chierichetti, Jon M. Kleinberg, Alessandro Panconesi
- SIAM J. Comput.
- 2012

When individuals in a social network make decisions that depend on what others have done earlier, there is the potential for a <i>cascade</i> to form --- a run of behaviors that are highly correlated. In an arbitrary network, the outcome of such a cascade can depend sensitively on the order in which nodes make their decisions, but to do date there has been… (More)