1 Algorithm Before proceeding with the proof, let us first introduce some notation along with elementary definitions. We denote a graph G = {V,E}, where V is the set of nodes and E the set of edges. It may also be described by its adjacency matrix. Definition 1. Adjacency Matrix: A symmetric matrix with binary elements such that Au,v = 1, provided there… (More)

@inproceedings{Chaintreau69982,
title={6998 - 2 : Analysis of Social Information Networks Mar 3 , 2011 Lecture 7 – Effect of Network Topology},
author={Augustin Chaintreau and Evangelia D. Skiani}
}