방법 비교

	Small-World and Scale-Free Network Analysis	네트워크 임베딩
분야	네트워크 분석	네트워크 분석
계열	Process / pipeline	Process / pipeline
기원 연도	1998 (small-world); 1999 (scale-free)	2014 (DeepWalk); 2016 (Node2Vec)
창시자	—	—
유형	Descriptive / exploratory network analysis	Representation learning / unsupervised network method
원전	Watts, D.J. & Strogatz, S.H. (1998). Collective Dynamics of 'Small-World' Networks. Nature, 393(6684), 440-442.	Grover, A. & Leskovec, J. (2016). Node2Vec: Scalable Feature Learning for Networks. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 855-864.
별칭	Küçük Dünya ve Ölçek-Bağımsız Ağ Analizi, small-world network, scale-free network, preferential attachment analysis	node embedding, graph embedding, network representation learning, Ağ Gömme (Node2Vec, DeepWalk, LINE)
관련	9	3
요약	Small-world and scale-free network analysis tests whether a real-world network exhibits two landmark topological signatures identified in 1998-1999: the Watts-Strogatz small-world property (high local clustering combined with short average path lengths) and the Barabási-Albert scale-free property (a degree distribution that follows a power law, meaning a small number of hubs connect to a disproportionately large share of other nodes). Together these frameworks transformed network science by showing that many social, biological, and technological networks share a common structural grammar.	Network embedding is a family of representation-learning methods that map each node of a graph into a dense, low-dimensional vector while preserving the network's structural properties. The approach was formalised for social-network data by Perozzi, Al-Rfou, and Skiena with DeepWalk (2014), which adapted the Word2Vec skip-gram model to random walks on graphs, and extended by Grover and Leskovec with Node2Vec (2016), which introduced a biased random walk that balances breadth-first and depth-first exploration. These embeddings turn relational data into feature vectors that standard machine-learning classifiers and clustering algorithms can consume directly.