Optimal Designs on Undirected Network Structures for Network-Based Models

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：41

、訪客IP：18.220.137.164

姓名

陳玟秀(Wen-Hsiu Chen) 查詢紙本館藏

畢業系所

統計研究所

論文名稱

(Optimal Designs on Undirected Network Structures for Network-Based Models)

相關論文

★ Optimal Multi-platform Designs Based on Two Statistical Approaches	★ Subdata Selection : A- and I-optimalities
★ On the Construction of Multi-Stratum Factorial Designs	★ A Compression-Based Partitioning Estimate Classifier
★ On the Study of Feedforward Neural Networks: an Experimental Design Approach	★ Bayesian Optimization for Hyperparameter Tuning with Robust Parameter Design
★ Unreplicated Designs for Random Noise Exploration	★ Optimal Designs for Simple Directed/Weighted Network Structures
★ Study on the Prediction Capability of Two Aliasing Indices for Gaussian Random Fields	★ Predictive Subdata Selection for Gaussian Process Modeling
★ Data Reduction for Subsample in Gaussian Process	★ Gaussian Process Modeling with Weighted Additive Kernels

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 (2026-6-30以後開放)

摘要(中)

在生活中，具有網路結構的例子無所不在，例如在農業實驗、生物信息學、醫學實驗、機器學習、物理學、社會科學和許多其他科學領域，再加上社交網路的快速發展，網路相關的議題已經成為一個新興的研究領域。為一個實驗單位指派處理會影響該實驗單位及其鄰居，並同時產生了處理效應和網路效應。在實驗設計的文獻中，Parker, Gilmour, and Schormans (2017) 和 Chang, Phoa, and Huang (2021) 都採用了線性網路效應模型來處理網路實驗。然而，這種模型並未得到廣泛應用。Kolaczyk and Csárdi (2014) 回顧了網路的統計模型，例如指數隨機圖模型和網路區塊模型。Zhang et al. (2019) 考慮了一種基於網路的邏輯斯迴歸模型來描述網路效應。本文擴展 Kolaczyk and Csárdi (2014) 以及 Zhang et al. (2019) 的想法提出了一種新的網路統計模型，並尋找最佳設計的條件。最後，我們通過模擬和真實例子來說明我們的理論且提供相對應的最佳設計。

摘要(英)

With the rapid growth of social network services, network-related studies have become a burgeoning research area. Allocating a treatment to a unit affects the unit as well as its neighbors, simultaneously resulting in a treatment effect and a network effect. In the literature of experimental designs, Parker, Gilmour, and Schormans (2017) and Chang, Phoa, and Huang (2021) both adopted a linear network effect model to design experiments on general networks. However, this model has not been heavily recognized. Kolaczyk and Csárdi (2014) reviewed statistical models for network graphs such as exponential random graph models and network block models. Zhang et al. (2019) considered a network-based logistic regression model to describe the network effect. In this thesis, we propose a new statistical model for networks in the same spirit as Kolaczyk and Csárdi (2014) and Zhang et al. (2019). Moreover, we derive conditions for selecting optimal designs. Finally, we illustrate our theory through simulations and real examples.

關鍵字(中)

★ 社交網路
★ 處理效應
★ 網路效應
★ 網路建模
★ 二分圖/循環圖/路徑圖
★ D最佳化準則

關鍵字(英)

★ Social network
★ Treatment effect
★ Network effect
★ Network modeling
★ Bipartite/Cycle/Path graph
★ D-optimality

論文目次

中文摘要 … i
Abstract … ii
Contents … iii
List of Figures … iv
List of Tables … v
1 Introduction … 1
2 Literature Review … 2
3 Model and Criterion … 5
3.1 Model … 5
3.2 Optimality Criterion … 6
4 Numerical Results with Real Applications … 13
4.1 ϕˆ=0 and m=2 ... 13
4.2 ϕˆ=MLE and m=2 ... 22
5 Real Networks 27
5.1 Teenage Friends and Lifestyle Study ... 27
5.2 Friendship and Unionization in a Hi-tech Firm … 28
5.3 Discussion of Student Government … 30
6 Conclusion 34
Appendix … 35
A.1 ϕˆ=0andm=3 … 35
A.2 ϕˆ=MLE and m=3 … 45
References … 60

參考文獻

Almquist, Z. W. and Butts, C. T. (2014). Logistic network regression for scalable analysis of networks with joint edge/vertex dynamics, Sociological Methodology, 44(1), 273-321.
Anderson C. J., Wasserman S., and Crouch B. (1999). A p* primer: logit models for social networks, Social Networks, 21, 37-66.
Besag, J. and Kempton, R. (1986). Statistical analysis of field experiments using neighbouring plots, Biometrics, 42(2), 231-251.
Borgatti S.P., Everett M.G., Freeman L.C. (2002). Ucinet for Windows: Soft- ware for Social Network Analysis, Harvard, MA: Analytic Technologies.
Chang, M. C., Phoa, F. K. H., and Huang, J. W. (2021). Optimal designs for network experimentations with unstructured treatments, manuscript.
Druilhet, P. (1999). Optimality of neighbour balanced designs, J. Statist. Plann. Inference, 81(1), 141-152.
Fienberg, S. E., and Wasserman, S. S. (1981). Categorical Data Analysis of Single Sociometric Relations, Sociological Methodology, 12, 156-192.
Frank, O. and Strauss, D. (1986). Markov random graphs, Journal of the American Statistical Association, 81, 832-842.
Goodreau, S. M., Kitts, J. A., and Morris, M. (2009). Birds of a feather, or friend of a friend? Using exponential random graph models to investigate adolescent social networks, Demography, 46(1), 103-25.
Harris, J. K. (2014). An introduction to exponential random graph modeling, Sage Publications, Inc.
Holland, P. W. and Leinhardt S. (1981). An exponential family of probability distributions for directed graphs, Journal of the American Statistical Association, 76(373), 33-50.
Holland, P. W., Laskey, K. B., and Leinhardt, S. (1983). Stochastic blockmodels: first steps, Social Networks, 5(2), 109-137.
Jiao, C., Wang, T., Liu, J.,Wu, H., Cui, F., and Peng, X. (2017). Using exponential random graph models to analyze the character of peer relationship networks and their effects on the subjective well-being of adolescents, Front Psychol, 8, 583.
Karrer, B. and Newman, M. E. (2011). Stochastic blockmodels and community structure in networks, Physical Review E, 83(1), 016107.
Kiefer, J., and Wolfowitz, J. (1960). The equivalence of two extremum problems, Canadian Journal of Mathematics, 12, 363-366.
Kolaczyk, E. D. and Csárdi, G. (2014). Statistical Analysis of Network Data with R, Springer.
Lusher, D., Koskinen, J., and Robins, G. (2011). Exponential Random Graph Mod- els for Social Networks: Theories, Methods, and Applications, Cambridge University Press.
Nowicki, K. and Snijders, T. A. B. (2001). Estimation and prediction for stochastic blockstructures, Journal of the American Statistical Association, 96(455), 1077-1087.
Ostrowski, A. (1952). Sur quelques applications des fonctions convexes et concaves au sens de I. Schur, J. Math. Pures Appl. (9), 31, 253-292.
Parker, B. M., Gilmour, S. G., and Schormans, J. (2017). Optimal design of experiments on connected units with application to social networks. J. R. Stat. Soc. Ser. C. Appl. Stat., 66(3), 455-480.
R Core Team (2020). R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria. URL https://www.R-project.org/.
Robins, G., Pattison, P., and Wasserman, S. (1999). Logit models and logistic regressions for social networks: III. valued relations, Psychometrika, 64(3), 371-394.
Robins, G., Elliott, P., Pattison, P. (2001a). Network models for social selection processes, Social Networks, 23, 1-30.
Robins, G., Pattison, P., and Elliott, P. (2001b). Network models for social influence processes, Psychometrika, 66, 161-190.
Robins G., Pattison P., Kalish Y., and Lusher D. (2007). An introduction to exponential random graphs (p∗) models for social networks, Social Networks, 29, 173- 191.
Skvoretz, J. and Faust, K. (1999). Logit models for affiliation networks, Sociological Methodology, 29, 253-280.
Snijders, T. A. B. (2002). Markov Chain Monte Carlo Estimation of Exponential Random Graph Models, Journal of Social Structure, 3, 2-37.
Wang, Y. J., and Wong, G. Y. (1987). Stochastic blockmodels for directed graphs, Journal of the American Statistical Association, 82(397), 8-19.
Wasserman, S. and Pattison, P. (1996). Logit models and logistic regressions for social networks: I. an introduction to Markov graphs and p-star, Psychometrika, 61(3), 401-425.
Wasserman, S. and Pattison, P. (1999). Logit models and logistic regressions for social networks: II. multivariate relations, British Journal of Mathematical and Statistical Psychology, 52(2), 169-193.
Zhang, X., Pan, R., Guan, G., Zhu, X., and Wang, H. (2019). Logistic regression with network structure. Statist. Sinica, to appear.

指導教授

張明中(Ming-Chung Chang)

審核日期

2021-7-23

推文