給定一個有群體架構的網路，網路中有兩個競爭的產品(或是病毒)，這兩種競爭中的產品開始在網路中散播，當網路趨於穩定狀態時，我們想知道是否強勢的產品會將弱勢的產品整個吞併，擁有整個市占率?我們用實驗以及數值分析證明，網路在有群體的架構之下，兩個競爭中的產品較弱勢的那一方並不會完全被吞併，即使市占率低，但仍保有一定比例。我們也利用實際的網路L1 company(包含5793個節點以及30753條邊)來驗證我們的想法。

Contents
List of Figures
1 簡介
2 模型
3 方法
3.1 群體節點數相同
3.1.1 Random Graph
3.1.2 Rewire Regular Graph
3.1.3 數值分析
3.2 群體節點數不同
3.2.1 Random Graph
3.2.2 Rewire Regular Graph
3.2.3 數值分析
4 實驗結果
4.1 群體節點數相同
4.2 群體節點數不同
4.3 L1 Company
5 討論
6 結論

[1] PRAKASH, B. Aditya, et al. Winner takes all: competing viruses or ideas on fairplay networks. In: Proceedings of the 21st international conference on World Wide Web. ACM,
2012. p. 1037-1046.
[2] BEUTEL, Alex, et al. Interacting viruses in networks: can both survive?. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2012. p. 426-434.
[3] NEWMAN, Mark. Networks: an introduction. OUP Oxford,
2009.
[4] FIRE, Michael; PUZIS, Rami; ELOVICI, Yuval. Organization Mining Using Online Social Networks. arXiv preprint
arXiv:1303.3741, 2013.
[5] CHANG,Cheng-Shang, et al. A general probabilistic framework for detecting community structure in networks. In: INFOCOM, 2011 Proceedings IEEE. IEEE, 2011.p. 730-738.
[6] CLAUSET, Aaron; NEWMAN, Mark EJ; MOORE, Cristopher. Finding community structure in very large networks. Physical review E, 2004, 70.6: 066111.