Corpus ID: 88523329

The Sparse Latent Position Model for nonnegative weighted networks

@article{Rastelli2018TheSL,
  title={The Sparse Latent Position Model for nonnegative weighted networks},
  author={Riccardo Rastelli},
  journal={arXiv: Methodology},
  year={2018}
}
This paper introduces a new methodology to analyse bipartite and unipartite networks with nonnegative edge values. The proposed approach combines and adapts a number of ideas from the literature on latent variable network models. The resulting framework is a new type of latent position model which exhibits great flexibility, and is able to capture important features that are generally exhibited by observed networks, such as sparsity and heavy tailed degree distributions. A crucial advantage of… Expand
Projective Sparse Latent Space Network Models
TLDR
This work proposes an adjustment to latent-space network models which allows the number edges to scale linearly with the number of nodes, to scale quadratically, or at any intermediate rate. Expand
Projective, Sparse, and Learnable Latent Position Network Models
When modeling network data using a latent position model, it is typical to assume that the nodes' positions are independently and identically distributed. However, this assumption implies the averageExpand

References

SHOWING 1-10 OF 34 REFERENCES
The stochastic topic block model for the clustering of vertices in networks with textual edges
TLDR
The stochastic topic block model, a probabilistic model for networks with textual edges, is introduced, to address the problem of discovering meaningful clusters of vertices that are coherent from both the network interactions and the text contents. Expand
Joint Modeling of Multiple Network Views
Latent space models (LSM) for network data rely on the basic assumption that each node of the network has an unknown position in a D-dimensional Euclidean latent space: generally the smaller theExpand
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” andExpand
Latent Space Approaches to Social Network Analysis
Network models are widely used to represent relational information among interacting units. In studies of social networks, recent emphasis has been placed on random graph models where the nodesExpand
Latent space models for dynamic networks with weighted edges
TLDR
This work proposes models for count dyads and for non-negative real dyads, analyzing simulated data and also both mobile phone data and world export/import data. Expand
Additive and Multiplicative Effects Network Models
Network datasets typically exhibit certain types of statistical dependencies, such as within-dyad correlation, row and column heterogeneity, and third-order dependence patterns such as transitivityExpand
Probabilistic Matrix Factorization
TLDR
The Probabilistic Matrix Factorization (PMF) model is presented, which scales linearly with the number of observations and performs well on the large, sparse, and very imbalanced Netflix dataset and is extended to include an adaptive prior on the model parameters. Expand
Bayesian probabilistic matrix factorization using Markov chain Monte Carlo
TLDR
This paper presents a fully Bayesian treatment of the Probabilistic Matrix Factorization (PMF) model in which model capacity is controlled automatically by integrating over all model parameters and hyperparameters and shows that Bayesian PMF models can be efficiently trained using Markov chain Monte Carlo methods by applying them to the Netflix dataset. Expand
Review of statistical network analysis: models, algorithms, and software
TLDR
This review provides a concise summary of methods and models used in the statistical analysis of network data, including the Erdős–Renyi model, the exponential family class of network models, and recently developed latent variable models. Expand
Finite Mixture and Markov Switching Models
TLDR
This book should help newcomers to the field to understand how finite mixture and Markov switching models are formulated, what structures they imply on the data, what they could be used for, and how they are estimated. Expand
...
1
2
3
4
...