L1centrality - Graph/Network Analysis Based on L1 Centrality
Analyze graph/network data using L1 centrality and prestige. Functions for deriving global, local, and group L1 centrality/prestige are provided. Routines for visual inspection of a graph/network are also provided. Details are in Kang and Oh (2024a) <doi:10.48550/arXiv.2404.13233> and Kang and Oh (2024b) <doi:10.48550/arXiv.2408.12078>.
Last updated 1 months ago
graph-algorithmssocial-network-analysiscpp
3.90 score 6 scripts 337 downloadsrvMF - Fast Generation of von Mises-Fisher Distributed Pseudo-Random Vectors
Generates pseudo-random vectors that follow an arbitrary von Mises-Fisher distribution on a sphere. This method is fast and efficient when generating a large number of pseudo-random vectors. Functions to generate random variates and compute density for the distribution of an inner product between von Mises-Fisher random vector and its mean direction are also provided. Details are in Kang and Oh (2024) <doi:10.1007/s11222-024-10419-3>.
Last updated 11 months ago
random-samplingspherevon-mises-fishercpp
3.00 score 1 stars 3 scripts 252 downloads