Properties of the largest connected component of encounter networks in the cities of New York and Tokyo.

We study the final configuration of the largest connected component for encounter networks obtained by using different values of the distance Δr that defines a co-coincidence. We present the size N (number of nodes of the largest component), the number of edges, the average number of neighbors 〈k〉, the average clustering coefficient 〈C〉 and quantities related with the distance in the network: length of the shortest path connecting two nodes, the diameter that gives the maximum possible distance and the average distance 〈d〉, which is the average shortest path among all pair of nodes. All the networks explored are analyzed by using the igraph package [65].