Statistical mechanics of complex networks
Authors: Reka Albert, Albert-Laszlo Barabasi
Comments: 54 pages, submitted to Reviews of Modern Physics
Subj-class: Statistical Mechanics; Disordered Systems and Neural Networks; Mathematical Physics; Data Analysis, Statistics and Probability; Adaptation and Self-Organizing Systems; Networking and Internet Architecture
Journal-ref: Reviews of Modern Physics 74, 47 (2002)
This dissertations presents an algorithm on the webgraph for finding dense bipartite graphs wich represents web-communities.
By performing further steps of the algorithm several levels of communities are recognized which can be related to communites of former levels.
The web can be represented by a graph with special regions: SCC, IN, OUT and TENDRILS.
Regions are defined by the link-path-reach from one website to others.
The linkage to and from a website (in- and out-degree) seems to conform the power law, which is also mentioned in this document.
A pre-relational databases datamodel. "Preceeded" by the relational model since the flexibility of this makes it hard to work with. Now re-invented in RDF :)
F. Wu, A. Souza, T. Zhang, C. Fifty, T. Yu, and K. Weinberger. Proceedings of the 36th International Conference on Machine Learning, volume 97 of Proceedings of Machine Learning Research, page 6861--6871. PMLR, (09--15 Jun 2019)
P. Heim, J. Ziegler, and S. Lohmann. Proceedings of the International Workshop on Interacting with Multimedia Content in the Social Semantic Web (IMC-SSW 2008), volume 417 of CEUR Workshop Proceedings, page 49--58. Aachen, (2008)
R. Dindokar, N. Choudhury, and Y. Simmhan. IEEE International Workshop on Parallel and Distributed Computing for Large Scale Machine Learning and Big Data Analytics (ParLearning), Co-located with IPDPS, page 1185--1190. (2015)Short paper.