Table 1.
Aggregation of the iWiW network to a town-level.
Fig 1.
Weighted degree distribution of town network, loops excluded. Weights are the total number of user-to-user links between two towns. Weighted degrees were binned into 104 intervals for P(w) calculation; blue hollow circle symbols represent the bins; black plus symbols represent the mean of weighted degree by each unique value of P(w). The slope of the solid line is -1.4, which fits P(w) values with R2 = 0.66.
Fig 2.
The probability of links as function of distance.
Probability P(d) is plotted as function of distance on a log-log scale. The straight line depicts a power-law d-0.6.
Fig 3.
Edge weight and node strength distributions.
(A) The distribution of weights is unimodal and with a maximum at the value of 1. The tail ends at 7.68 indicating that a large fraction of the ties represent very low number of connections compared to a small set of high links indicating large number of personal ties. (B) Node strength s(1) rises as population increases. The capital, Budapest with its 2 million inhabitants is an outlier. (C) The heat map of the density of
as a function of
and the distance between towns i and j shows a complex distribution that is dominated by a large number of weak ties between distant locations. (D)
has a unimodal distribution with values between –2.61 and 3.29 and with a modus at –0.77. (E) Node strength s(2) decreases as population increases but fluctuation is high across large towns. Budapest is again an outlier. (F) The heat map of the density of
as a function of
and the distance between towns i and j illustrates that the highest edge weights are between towns that are in geographical proximity.
Fig 4.
Spatial structure and modularity.
(A) The strongest 0.3% of all edges are depicted in network (4,081 edges). (B) The Louvain method finds 5 modules in the
network; towns belonging to the same module are depicted with same colors. (C) The strongest 0.3% of all edges are depicted in
network (4,081 edges). (D) The illustrated community structure contains 14 modules in the
network. This community structure has the highest modularity index out of the Louvain algorithm runs we present in Table 2. Towns belonging to the same module are depicted with same colors. Created by own data, with base map of OpenStreetMap cartography licensed as CC BY-SA.
Table 2.
Network modularity.