Parameter estimation in a 3‐parameter p‐star random graph model

DOI10.1002/net.21992zbMath1530.91485arXiv1809.05952OpenAlexW3088426178MaRDI QIDQ6087121

Pietro Lenarda, Massimo Riccaboni, Giorgio Gnecco

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.05952

zbMATH Keywords

optimizationmean-field approximationgradient ascent\(p\)-star network modelmaximum log-likelihood estimationmaximum log-pseudo-likelihood estimation

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
• The distribution of degrees in a large random tree
• Coordinate descent algorithms
• Estimating and understanding exponential random graph models
• An introduction to large deviations for random graphs
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
• Graphical Models, Exponential Families, and Variational Inference
• Markov Graphs
• An Exponential Family of Probability Distributions for Directed Graphs
• Optimization Methods for Large-Scale Machine Learning
• Paths in graphs
• Iterative Solution of Nonlinear Equations in Several Variables
• A Survey of Statistical Network Models
• On the Convergence of Block Coordinate Descent Type Methods
• Numerical optimization. Theoretical and practical aspects. Transl. from the French

This page was built for publication: Parameter estimation in a 3‐parameter p‐star random graph model