logo Netzschleuder network catalog, repository, and centrifuge

slovenian_magazines — Slovenian magazine readership (1999-2000)

Description

Co-readership of 124 Slovenian newspapers, magazines and journals, from a survey of more than 100,000 people conducted by the CATI Center (Ljubljana) in 1999 and 2000, in which respondents were asked which magazines and journals they read. The network is the one-mode projection of the bipartite network of readers and publications: two publications are connected by an edge weighted by the number of respondents who read both, and each publication has a self-loop weighted by its total number of readers.

The network has the following properties:

  • (Node) name: the title of the publication.
  • (Node) type: the type of publication (1: daily newspapers, 2: business magazines, 3: computer magazines, 4: home and furnishing, 5: fashion, 6: weekly news magazines, 7: free papers, 8: men's special-interest magazines, 9: teen magazines, 10: regional papers, 11: special-interest magazines, 12: women's special-interest magazines, 13: TV guides, 14: women's magazines).
  • (Edge) weight: the number of respondents reading both publications (or, for self-loops, the publication).
Tags
Social Preferences Weighted Projection Metadata
Added
2026-10-25
Citation
Upstream URL [Errno 111] Connection refused
https://web.archive.org/web/20040115073428/http://vlado.fmf.uni-lj.si/pub/networks/data/2mode/journals.htm
Networks
Tip: hover over a column header for a description.
Column legend
$\left<k\right>$
Mean degree
$\sigma_k$
Standard deviation of the degrees
$\lambda_h$
Largest eigenvalue of the Hashimoto (non-backtracking) matrix
$\tau$
Random walk mixing time
$r$
Degree assortativity
$c$
Global clustering coefficient
$\oslash$
(Pseudo-) diameter
$S$
Relative size of the largest component
NPs
Node properties
EPs
Edge properties
Name Nodes Edges $\left<k\right>$ $\sigma_k$ $\lambda_h$ $\tau$ $r$ $c$ $\oslash$ $S$ Kind Mode NPs EPs gt GraphML GML csv
slovenian_magazines 124 6,096 98.32 22.73 101.90 0.52 -0.20 0.85 2 1.00 Undirected Unipartite name type weight 11 KiB 27 KiB 26 KiB 24 KiB
Ridiculograms*
* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.