Moment-based parameter estimation in binomial random intersection graph models

DOI10.1007/978-3-319-67810-8_1MaRDI QIDQ5045290zbMATH OpenOpenAlexFDO

Authors Joona Karjalainen, Lasse Leskelä

Publication date 4 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

network motifmodel fittingmoment estimatorsparse graphoverlapping communitiestwo-mode networkstatistical network model

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Abstract: Binomial random intersection graphs can be used as parsimonious statistical models of large and sparse networks, with one parameter for the average degree and another for transitivity, the tendency of neighbours of a node to be connected. This paper discusses the estimation of these parameters from a single observed instance of the graph, using moment estimators based on observed degrees and frequencies of 2-stars and triangles. The observed data set is assumed to be a subgraph induced by a set of $n_0$ nodes sampled from the full set of $n$ nodes. We prove the consistency of the proposed estimators by showing that the relative estimation error is small with high probability for $n_{0}gg{n}^{2/3}gg1$. As a byproduct, our analysis confirms that the empirical transitivity coefficient of the graph is with high probability close to the theoretical clustering coefficient of the model.

Recommendations

• Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
• The method of moments and degree distributions for network models
• New consistent and asymptotically normal parameter estimates for random-graph mixture models
• Moment-Based Estimation of Stochastic Kronecker Graph Parameters
• Asymptotics in undirected random graph models parameterized by the strengths of vertices

Cited in

(9)

• The number of triangles in random intersection graphs
• Weighting estimation under bipartite incidence graph sampling
• Moment-Based Estimation of Stochastic Kronecker Graph Parameters
• Clique and cycle frequencies in a sparse random graph model with overlapping communities
• Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
• Parameter estimation in a 3‐parameter p‐star random graph model
• Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions
• Assortativity and bidegree distributions on Bernoulli random graph superpositions
• Clustering and percolation on superpositions of Bernoulli random graphs

This page was built for publication: Moment-based parameter estimation in binomial random intersection graph models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045290)