# 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

#### Figures from this paper

#### 2 Citations

Projective Sparse Latent Space Network Models

- Computer Science
- 2017

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

- Mathematics
- 2017

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 average… Expand

#### References

SHOWING 1-10 OF 34 REFERENCES

The stochastic topic block model for the clustering of vertices in networks with textual edges

- Computer Science
- Stat. Comput.
- 2018

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

- Mathematics
- 2016

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 the… Expand

Stochastic Blockmodels for Directed Graphs

- Mathematics
- 1987

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… Expand

Latent Space Approaches to Social Network Analysis

- Mathematics
- 2002

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 nodes… Expand

Latent space models for dynamic networks with weighted edges

- Computer Science, Mathematics
- Soc. Networks
- 2016

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

- Mathematics
- 2018

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 transitivity… Expand

Probabilistic Matrix Factorization

- Computer Science
- NIPS
- 2007

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

- Computer Science
- ICML '08
- 2008

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

- Computer Science
- Stat. Anal. Data Min.
- 2012

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

- Computer Science
- 2006

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