Affiliation networks

DOI10.1145/1536414.1536474MaRDI QIDQ5172737zbMATH OpenOpenAlexFDO

Authors

Publication date 4 February 2015

Published in Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1536414.1536474

zbMATH Keywords

densificationdiametersocial networkssparsification

Mathematics Subject Classification ID

Distance in graphs (05C12) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11) Social networks; opinion dynamics (91D30)

Recommendations

• Random graph models of social networks
• Kronecker graphs: an approach to modeling networks
• scientific article; zbMATH DE number 6469213
• scientific article; zbMATH DE number 5994660
• Distance in the Forest Fire Model How far are you from Eve?

Cited in

(8)

• A network model characterized by a latent attribute structure with competition
• De-anonymization of heterogeneous random graphs in quasilinear time
• Overlapping communities and roles in networks with node attributes: probabilistic graphical modeling, Bayesian formulation and variational inference
• Modeling social networks through user background and behavior
• Estimating latent feature-feature interactions in large feature-rich graphs
• Random graph models of social networks
• Affiliation networks with an increasing degree sequence
• Clustering coefficient of a preferred attachment affiliation network

This page was built for publication: Affiliation networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5172737)