Modeling graphs using dot product representations
Edward R. Scheinerman () and
Kimberly Tucker ()
Additional contact information
Edward R. Scheinerman: Johns Hopkins University
Kimberly Tucker: Harvey Mudd College
Computational Statistics, 2010, vol. 25, issue 1, No 1, 16 pages
Abstract:
Abstract Given a simple (weighted) graph, or a collection of graphs on a common vertex set, we seek an assignment of vectors to the vertices such that the dot products of these vectors approximate the weight/frequency of the edges. By transforming vertices into (low dimensional) vectors, one can bring geometric methods to bear in the analysis of the graph(s). We illustrate our approach on the Mathematicians Collaboration Graph [Grossman (1996) The Erdős number project, http://www.oakland.edu/enp ] and the times series of Interstate Alliance Graphs (Gibler and Sarkees in J Peace Res 41(2):211–222, 2004).
Keywords: Social networks; Dimension reduction; Vector representations of graphs (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
http://link.springer.com/10.1007/s00180-009-0158-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:compst:v:25:y:2010:i:1:d:10.1007_s00180-009-0158-8
Ordering information: This journal article can be ordered from
http://www.springer.com/statistics/journal/180/PS2
DOI: 10.1007/s00180-009-0158-8
Access Statistics for this article
Computational Statistics is currently edited by Wataru Sakamoto, Ricardo Cao and Jürgen Symanzik
More articles in Computational Statistics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().