Estimating Parameters of a Directed Weighted Graph Model with Beta-Distributed Edge-Weights
We introduce a directed, weighted random graph model, where the edge-weights are independent and beta distributed with parameters depending on their endpoints. We will show that the row- and column-sums of the transformed edge-weight matrix are sufficient statistics for the parameters, and use the theory of exponential families to prove that the ML estimate of the parameters exists and is unique. Then an algorithm to find this estimate is introduced together with convergence proof that uses properties of the digamma function. Simulation results and applications are also presented.
Unable to display preview. Download preview PDF.
- 5.M. Bolla and A. Elbanna, “Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm,” J. Probab. Stat., Article ID 657965 (2015).Google Scholar
- 7.M. Grasmair, Fixed point iterations, https://wiki.math.ntnu.no/_media/ma2501/2014v/fixedpoint.pdf
- 8.C. J. Hillar and A. Wibisono, “Maximum entropy distributions on graphs,” ArXiv, arXiv:1301.3321v2 (2013).Google Scholar
- 9.S. L. Lauritzen, Graphical Models, Oxford University Press (1995).Google Scholar