<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Network Science on Bluue Whale</title><link>https://bluuewhale.github.io/ko/tags/network-science/</link><description>Recent content in Network Science on Bluue Whale</description><image><title>Bluue Whale</title><url>https://bluuewhale.github.io/images/profile.jpg</url><link>https://bluuewhale.github.io/images/profile.jpg</link></image><generator>Hugo -- 0.152.2</generator><language>ko-kr</language><lastBuildDate>Sat, 22 Aug 2026 22:21:36 +0900</lastBuildDate><atom:link href="https://bluuewhale.github.io/ko/tags/network-science/index.xml" rel="self" type="application/rss+xml"/><item><title>Community Detection</title><link>https://bluuewhale.github.io/ko/posts/community-detection/</link><pubDate>Mon, 23 Mar 2026 23:18:53 +0900</pubDate><guid>https://bluuewhale.github.io/ko/posts/community-detection/</guid><description>Modularity가 어떤 발상에서 나온 지표인지, 그리고 이를 최적화하는 Louvain과 Leiden 알고리즘이 어떻게 다른지 살펴봅니다.</description></item></channel></rss>