Statistical Inference in a Directed Network Model With Covariates

@article{Yan2018StatisticalII,
  title={Statistical Inference in a Directed Network Model With Covariates},
  author={Ting Yan and Binyan Jiang and Stephen E. Fienberg and Chenlei Leng},
  journal={Journal of the American Statistical Association},
  year={2018},
  volume={114},
  pages={857 - 868}
}
ABSTRACT Networks are often characterized by node heterogeneity for which nodes exhibit different degrees of interaction and link homophily for which nodes sharing common features tend to associate with each other. In this article, we rigorously study a directed network model that captures the former via node-specific parameterization and the latter by incorporating covariates. In particular, this model quantifies the extent of heterogeneity in terms of outgoingness and incomingness of each… 
Undirected network models with degree heterogeneity and homophily
  • T. Yan
  • Computer Science, Mathematics
  • 2018
TLDR
A unified theoretical framework is established under which the consistency of the moment estimator hold as the size of networks goes to infinity as well as its asymptotic representation that can be used to characterize its limiting distribution.
A Unified Framework for Inference in Network Models with Degree Heterogeneity and Homophily
TLDR
A unified theoretical framework is established under which the consistency of the moment estimator holds as the size of networks goes to infinity and the asymptotic representation of the moments estimator of the homophily parameter contains a bias term.
Semiparametric Analysis of Network Formation
TLDR
A statistical model for directed network formation that features both node-specific parameters that capture degree heterogeneity and common parameters that reflect homophily among nodes is considered, which is shown to have desirable asymptotic properties under sequences of growing networks.
A network Poisson model for weighted directed networks with covariates
  • MengXu, Q. Wang
  • Mathematics
    Communications in Statistics - Theory and Methods
  • 2021
The edges in networks are not only binary, either present or absent, but also take weighted values in many scenarios (e.g., the number of emails between two users). The covariate-p0 model has been
A Sparse β-Model with Covariates for Networks
Data in the form of networks are increasingly encountered in modern science and humanity. This paper concerns a new generative model, suitable for sparse networks commonly observed in practice, to
A Sparse $\beta$-Model with Covariates for Networks
Data in the form of networks are increasingly encountered in modern science and humanity. This paper concerns a new generative model, suitable for sparse networks commonly observed in practice, to
AN ECONOMETRIC MODEL OF NETWORK FORMATION WITH DEGREE HETEROGENEITY
I introduce a model of undirected dyadic link formation which allows for assortative matching on observed agent characteristics (homophily) as well as unrestricted agent level heterogeneity in link
An Econometric Model of Link Formation with Degree Heterogeneity
I introduce a model of undirected dyadic link formation which allows for assortative matching on observed agent characteristics (homophily) as well as unrestricted agent level heterogeneity in link
Nonparametric regression for multiple heterogeneous networks
TLDR
A multi- graphon model is proposed which allows node-level as well as network-level heterogeneity, and it is shown how information from multiple networks can be leveraged to enable estimation of the multi-graphon via standard nonparametric regression techniques, e.g. kernel regression, orthogonal series estimation.
A sparse $p_0$ model with covariates for directed networks
We are concerned here with unrestricted maximum likelihood estimation in a sparse p0 model with covariates for directed networks. The model has a density parameter ν, a 2n-dimensional node parameter
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 125 REFERENCES
Semiparametric Analysis of Network Formation
TLDR
A statistical model for directed network formation that features both node-specific parameters that capture degree heterogeneity and common parameters that reflect homophily among nodes is considered, which is shown to have desirable asymptotic properties under sequences of growing networks.
Null models for network data
TLDR
This work shows how the logistic-linear model and the implicit log- linear model may be viewed as instances of a broader class of null models, with the property that all members of this class give rise to essentially the same likelihood-based estimates of link probabilities in sparse graph regimes.
Analysis of Partially Observed Networks via Exponential- family Random Network Models
TLDR
A theory of inference for ERN models when only part of the network is observed is developed, as well as specific methodology for missing data, including non-ignorable mechanisms for network-based sampling designs and for latent class models.
An Econometric Model of Network Formation With Degree Heterogeneity
I formulate and study a model of undirected dyadic link formation which allows for assortative matching on observed agent characteristics (homophily) as well as unrestricted agent level heterogeneity
Stochastic Blockmodels for Directed Graphs
Abstract Holland and Leinhardt (1981) 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
An Econometric Model of Link Formation with Degree Heterogeneity
I introduce a model of undirected dyadic link formation which allows for assortative matching on observed agent characteristics (homophily) as well as unrestricted agent level heterogeneity in link
An Empirical Model of Dyadic Link Formation in a Network with Unobserved Heterogeneity
I study a dyadic linking model in which agents form directed links that exhibit homophily and reciprocity. A fixed-effect approach accounts for unobserved sources of degree heterogeneity. I consider
Exponential-family Random Network Models
TLDR
This work develops a theory of inference for ERNM when only part of the net- work is observed, as well as specific methodology for missing data, including non- ignorable mechanisms for network-based sampling designs and for latent class models.
Degree-based network models
We derive the sampling properties of random networks based on weights whose pairwise products parameterize independent Bernoulli trials. This enables an understanding of many degree-based network
Assessing Degeneracy in Statistical Models of Social Networks
This paper presents recent advances in the statistical modeling of random graphs that have an impact on the empirical study of social networks. Statistical exponential family models (Wasserman and
...
1
2
3
4
5
...