1 code implementation • 13 Feb 2019 • Yohsuke Murase, Hang-Hyun Jo, János Török, János Kertész, Kimmo Kaski
Assuming that the nodal attributes are independently drawn from an arbitrary distribution $\rho(h)$ and that the sampling probability $r(h_i , h_j)$ for a link $ij$ of nodal attributes $h_i$ and $h_j$ is also arbitrary, we are able to derive exact analytic expressions of the sampled network for such network characteristics as the degree distribution, degree correlation, and clustering spectrum.
Physics and Society Social and Information Networks
1 code implementation • 27 Nov 2015 • János Török, Yohsuke Murase, Hang-Hyun Jo, János Kertész, Kimmo Kaski
For example, while it is expected that the degree distribution of the whole social network has a maximum at a value larger than one, we get a monotonously decreasing distribution as observed in empirical studies of single channel data.
Physics and Society Social and Information Networks
