পদ্ধতির তুলনা করুন

	Exponential Random Graph Model (ERGM / p*)	কার্যকারণ আবিষ্কার অ্যালগরিদম (PC, FCI, LiNGAM)
ক্ষেত্র	নেটওয়ার্ক বিশ্লেষণ	কার্যকারণ অনুমান
পরিবার	Process / pipeline	Regression model
উদ্ভবের বছর	1986 (foundational); modern ERGM framework 1996–2007	2000
প্রবর্তক	Frank & Strauss (1986); extended by Wasserman & Pattison (1996) and Robins et al. (2007)	Spirtes, Glymour & Scheines (PC/FCI); Shimizu et al. (LiNGAM)
ধরন	Probabilistic generative network model	Causal structure learning
মৌলিক উৎস	Robins, G., Pattison, P., Kalish, Y., & Lusher, D. (2007). An introduction to exponential random graph (p*) models for social networks. Social Networks, 29(2), 173-191.	Spirtes, P., Glymour, C., & Scheines, R. (2000). Causation, Prediction, and Search (2nd ed.). MIT Press. ISBN: 978-0262194402
অপর নাম	ERGM, p-star model, p* model, Üstel Rastgele Graf Modeli (ERGM / p*)	PC algorithm, FCI algorithm, LiNGAM, causal structure learning
সম্পর্কিত	6	5
সারসংক্ষেপ	The Exponential Random Graph Model (ERGM), also known as the p* model, is a statistical framework for network analysis that models the probability of an observed network as a function of its local structural features — such as reciprocity, triangles, and degree distribution. Developed from the foundational work of Frank and Strauss (1986) and extended into the modern framework by Wasserman and Pattison (1996) and Robins et al. (2007), ERGM is the inferential standard for social network analysis, capable of testing whether observed network structures arise by chance or reflect genuine social processes.	Causal discovery is a family of algorithms that automatically learn a directed acyclic graph (DAG) describing causal structure directly from observational data. The constraint-based PC and FCI algorithms were developed by Spirtes, Glymour and Scheines (2000), while the LiNGAM model of Shimizu et al. (2006) exploits linear non-Gaussian structure to orient edges.