Open Access. Powered by Scholars. Published by Universities.®
Social and Behavioral Sciences Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Social and Behavioral Sciences
Simulating Subject Communities In Case Law Citation Networks, Jerrold Tsin Howe Soh
Simulating Subject Communities In Case Law Citation Networks, Jerrold Tsin Howe Soh
Research Collection Yong Pung How School Of Law
We propose and evaluate generative models for case law citation networks that account for legal authority, subject relevance, and time decay. Since Common Law systems rely heavily on citations to precedent, case law citation networks present a special type of citation graph which existing models do not adequately reproduce. We describe a general framework for simulating node and edge generation processes in such networks, including a procedure for simulating case subjects, and experiment with four methods of modelling subject relevance: using subject similarity as linear features, as fitness coefficients, constraining the citable graph by subject, and computing subject-sensitive PageRank scores. …
Determining The Number Of Communities In Degree-Corrected Stochastic Block Models, Shujie Ma, Liangjun Su, Yichong Zhang
Determining The Number Of Communities In Degree-Corrected Stochastic Block Models, Shujie Ma, Liangjun Su, Yichong Zhang
Research Collection School Of Economics
We propose to estimate the number of communities in degree-corrected stochastic block models based on a pseudo likelihood ratio. For estimation, we consider a spectral clustering together with binary segmentation method. This approach guarantees an upper bound for the pseudo likelihood ratio statistic when the model is over-fitted. We also derive its limiting distribution when the model is under-fitted. Based on these properties, we establish the consistency of our estimator for the true number of communities. Developing these theoretical properties require a mild condition on the average degree: growing at a rate faster than log(n), where n is the number …