Evidence map›Paper›PMID 22276151›Full record

ArticlePloS one2012

Statistical inference for valued-edge networks: the generalized exponential random graph model.

Bruce A Desmarais, Skyler J Cranmer

Abstract read
In one paragraph

Article in PloS one, 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 18 papers.

0numbers the graph read from it
0cells of the map it votes in
18citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

18 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Model-Based Clustering of Nonparametric Weighted Networks with Application to Water Pollution Analysis.Technometrics : a journal of statistics for the physical, chemical, and engineering sciences · 2020
    Article
  10. Article
  11. Connectivity in fMRI: Blind Spots and Breakthroughs.IEEE transactions on medical imaging · 2018
    Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Reciprocity of weighted networks.Scientific reports · 2013
    Article
  18. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Bruce A DesmaraisDepartment of Political Science, University of Massachusetts Amherst, Amherst, Massachusetts, United States of America. desmarais@polsci.umass.edu
Skyler J Cranmer

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Across the sciences, the statistical analysis of networks is central to the production of knowledge on relational phenomena. Because of their ability to model the structural generation of networks based on both endogenous and exogenous factors, exponential random graph models are a ubiquitous means of analysis. However, they are limited by an inability to model networks with valued edges. We address this problem by introducing a class of generalized exponential random graph models capable of modeling networks whose edges have continuous values (bounded or unbounded), thus greatly expanding the scope of networks applied researchers can subject to statistical analysis.

Indexed as

Models, StatisticalAlgorithms

Identifiers

PMID22276151
PMCPMC3261863

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.