Stochastic Blockmodels for Directed Graphs
\textit{P. W. Holland} and \textit{S. Leinhardt} [ibid. 76, 33-64 (1981; Zbl 0457.62090)] proposed the \(p_ 1\) model for the analysis of binary directed graph data in network studies. Such a model provides information about the attractiveness and expansiveness of the individual nodes in the network, as well as the tendency of a pair of nodes to reciprocate relational ties. When the nodes are a priori partitioned into subgroups based on attributes such as race and sex, the density of ties from one subgroup to another can differ considerably from that relating another pair of subgroups, thus creating a situation called blocking in social networks. The \(p_ 1\) model completely ignores this extra piece of information and is, therefore, unable to explain the block structure. Blockmodels that are simple extensions of the \(p_ 1\) model are proposed specifically for such data. An iterative scaling algorithm is presented for fitting the model parameters by maximum likelihood. The methodology is illustrated in detail on two empirical examples.
- Bayesian Models for Directed Graphs
- Estimation and Prediction for Stochastic Blockstructures
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Chapter 10. Blockmodels
- The stochastic topic block model for the clustering of vertices in networks with textual edges
- Metric inference for social networks
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- A stochastic block model for interaction lengths
- Statistical evaluation of algebraic constraints for social networks
- Multiple change points detection and clustering in dynamic networks
- Network-based naive Bayes model for social network
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
- Dealing with reciprocity in dynamic stochastic block models
- Testing goodness of fit of random graph models
- Generating realistic labelled, weighted random graphs
- Portal nodes screening for large scale social networks
- Robust unsupervised cluster matching for network data
- Consistency of community detection in networks under degree-corrected stochastic block models
- Diclique clustering in a directed random graph
- Model selection in overlapping stochastic block models
- Attributed graph clustering with subspace stochastic block model
- Identifying overlapping terrorist cells from the Noordin Top actor-event network
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Structural factorization of latent adjacency matrix, with an application to auto industry networks
- Modeling the social media relationships of Irish politicians using a generalized latent space stochastic blockmodel
- A case study on the shareholder network effect of stock market data: an SARMA approach
- Grouped spatial autoregressive model
- A generalized Weisfeiler-Lehman graph kernel
- Bootstrap inference for network vector autoregression in large-scale social network
- On community structure validation in real networks
- Identifiability and parameter estimation of the overlapped stochastic co-block model
- Multivariate spatial autoregressive model for large scale social networks
- Mixture network autoregressive model with application on students' successes
- Posterior contraction rates for stochastic block models
- Bayesian estimation of the latent dimension and communities in stochastic blockmodels
- Characterization of topic-based online communities by combining network data and user generated content
- Crawling subsampling for multivariate spatial autoregression model in large-scale networks
- Vertex nomination: the canonical sampling and the extended spectral nomination schemes
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- The dynamic stochastic topic block model for dynamic networks with textual edges
- The dynamic random subgraph model for the clustering of evolving networks
- A dynamic logistic regression for network link prediction
- The random subgraph model for the analysis of an ecclesiastical network in Merovingian Gaul
- Hierarchical clustering with discrete latent variable models and the integrated classification likelihood
- An alternative class of models to position social network groups in latent spaces
- Stochastic blockmodels with a growing number of classes
- scientific article; zbMATH DE number 6389775 (Why is no real title available?)
- Regression analysis of asymmetric pairs in large-scale network data
- Bayesian degree-corrected stochastic blockmodels for community detection
- Model-based clustering for populations of networks
- Statistical mechanics of the directed 2-distance minimal dominating set problem
- Birds of a feather or opposites attract -- effects in network modelling
- Goodness of Fit of Logistic Regression Models for Random Graphs
- Bayesian Analysis of Directed Graphs Data with Applications to Social Networks
- Sensitivity to noise variance in a social network dynamics model
- Three‐dimensional blockmodels
- Asymptotic distributions in random graphs with applications to social networks
- Estimation and Prediction for Stochastic Blockstructures
- Statistical inference on random dot product graphs: a survey
- A semiparametric extension of the stochastic block model for longitudinal networks
- Community extraction in multilayer networks with heterogeneous community structure
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- A BAYESIAN APPROACH TO MODELING STOCHASTIC BLOCKSTRUCTURES WITH COVARIATES
- p2: a random effects model with covariates for directed graphs
- Regression of directed graphs on independent effects for density and reciprocity
- A classification for community discovery methods in complex networks
- Modeling the dynamics of social networks using Bayesian hierarchical blockmodels
- Review of statistical network analysis: models, algorithms, and software
- Semirandom Stochastic Block Models
- A dynamic process interpretation of the sparse ERGM reference model
- Weighted directed networks with a differentially private bi-degree sequence
- Testing and Estimation of Social Network Dependence With Time to Event Data
- Grouped network vector autoregression
- Chain-referral sampling on stochastic block models
- Clustering and community detection in directed networks: a survey
- scientific article; zbMATH DE number 7307464 (Why is no real title available?)
- Spatial autoregression with repeated measurements for social networks
- Efficient discovery of overlapping communities in massive networks
- Statistical inference in a directed network model with covariates
- Frequentist consistency of variational Bayes
- Model selection in random effects models for directed graphs using approximated Bayes factors
- Chapter 10. Blockmodels
- Dynamic Stochastic Blockmodel Regression for Network Data: Application to International Militarized Conflicts
- Triangular Concordance Learning of Networks
- Mixture models and networks: The stochastic blockmodel
- Testing for association in multiview network data
- Poisson degree corrected dynamic stochastic block model
- Network Functional Varying Coefficient Model
- Universal rank inference via residual subsampling with application to large networks
- Mutual information for the sparse stochastic block model
- Subnetwork estimation for spatial autoregressive models in large-scale networks
- Embedded topics in the stochastic block model
- Graphical Assistant Grouped Network Autoregression Model: A Bayesian Nonparametric Recourse
- Distributed estimation and inference for spatial autoregression model with large scale networks
- Survival Mixed Membership Blockmodel
- Consistent two-stage estimation in heterogeneous network autoregressive model
- Computationally efficient inference for latent position network models
- Count network autoregression
- Applications of dual regularized Laplacian matrix for community detection
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Heterogeneous connection effects
- Clustering Time-Evolving Networks Using Temporal Exponential-Family Random Graph Models with Conditional Dyadic Independence and Dynamic Latent Blocks
- Multiplex Depth for Network-Valued Data and Applications
- Threshold models for high-dimensional time series with network structure
This page was built for publication: Stochastic Blockmodels for Directed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4720642)