In this paper we present an estimation algorithm for Bayesian multiplex exponential random graphs (BmERGMs) under missing network data. Social actors are often connected with more than one type of relation, thus forming a multiplex network. It is important to consider these multiplex structures simultaneously when analyzing a multiplex network. The importance of proper models of multiplex network structures is even more pronounced under the issue of missing network data. The proposed algorithm is able to estimate BmERGMs under missing data and can be used to obtain proper multiple imputations for multiplex network structures. It is an extension of Bayesian exponential random graphs (BERGMs) as implemented in the Bergm package in R. We demon...
Real-world phenomena are often not fully measured or completely observable, raising the so-called m...
This paper compares several missing data treatment methods for missing network data on a diverse set...
In this paper we describe the main features of the Bergm package for the open-source R software whic...
In this paper we present an estimation algorithm for Bayesian multiplex exponential random graphs (B...
In this paper we present an estimation algorithm for Bayesian multiplex exponential random graphs (B...
Social network analysis has typically concerned analysis of one type of tie connecting nodes of the ...
Missing data on network ties are a fundamental problem for network analysis.The biases induced by mi...
We address inference problems associated with missing data using causal Bayesian networks to model t...
Random graphs, where the presence of connections between nodes are considered random variables, have...
In this thesis we developed, implemented, and evaluated multiple imputation algorithms for missing n...
Summary. Exponential-family random network (ERN) models specify a joint representation of both the d...
We propose a family of efficient algorithms for learning the parameters of a Bayesian network from i...
Missing data on network ties is a fundamental problem for network analyses. The biases induced by mi...
The most promising class of statistical models for expressing structural properties of social networ...
Real-world phenomena are often not fully measured or completely observable, raising the so-called m...
This paper compares several missing data treatment methods for missing network data on a diverse set...
In this paper we describe the main features of the Bergm package for the open-source R software whic...
In this paper we present an estimation algorithm for Bayesian multiplex exponential random graphs (B...
In this paper we present an estimation algorithm for Bayesian multiplex exponential random graphs (B...
Social network analysis has typically concerned analysis of one type of tie connecting nodes of the ...
Missing data on network ties are a fundamental problem for network analysis.The biases induced by mi...
We address inference problems associated with missing data using causal Bayesian networks to model t...
Random graphs, where the presence of connections between nodes are considered random variables, have...
In this thesis we developed, implemented, and evaluated multiple imputation algorithms for missing n...
Summary. Exponential-family random network (ERN) models specify a joint representation of both the d...
We propose a family of efficient algorithms for learning the parameters of a Bayesian network from i...
Missing data on network ties is a fundamental problem for network analyses. The biases induced by mi...
The most promising class of statistical models for expressing structural properties of social networ...
Real-world phenomena are often not fully measured or completely observable, raising the so-called m...
This paper compares several missing data treatment methods for missing network data on a diverse set...
In this paper we describe the main features of the Bergm package for the open-source R software whic...