Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Ruling out static latent homophily in citation networks
University of Borås, Faculty of Librarianship, Information, Education and IT.ORCID iD: 0000-0002-1539-8256
University of Borås, Faculty of Librarianship, Information, Education and IT.
University of Borås, Faculty of Librarianship, Information, Education and IT.ORCID iD: 0000-0001-5196-7148
2016 (English)In: Scientometrics, ISSN 0138-9130, E-ISSN 1588-2861, Vol. 110, no 2, 765-777 p.Article in journal (Refereed) Published
Abstract [en]

Citation and coauthor networks offer an insight into the dynamics of scientific progress. We can also view them as representations of a causal structure, a logical process captured in a graph. From a causal perspective, we can ask questions such as whether authors form groups primarily due to their prior shared interest, or if their favourite topics are ‘contagious’ and spread through co-authorship. Such networks have been widely studied by the artificial intelligence community, and recently a connection has been made to nonlocal correlations produced by entangled particles in quantum physics—the impact of latent hidden variables can be analyzed by the same algebraic geometric methodology that relies on a sequence of semidefinite programming (SDP) relaxations. Following this trail, we treat our sample coauthor network as a causal graph and, using SDP relaxations, rule out latent homophily as a manifestation of prior shared interest only, leading to the observed patternedness. By introducing algebraic geometry to citation studies, we add a new tool to existing methods for the analysis of content-related social influences.

Place, publisher, year, edition, pages
2016. Vol. 110, no 2, 765-777 p.
Keyword [en]
Causal network, Citation network, Hidden variables, Semidefinite programming, Sum-of-squares decomposition
National Category
Other Computer and Information Science
Identifiers
URN: urn:nbn:se:hb:diva-11645DOI: 10.1007/s11192-016-2194-9Scopus ID: 85001053538OAI: oai:DiVA.org:hb-11645DiVA: diva2:1062333
Available from: 2017-01-05 Created: 2017-01-05 Last updated: 2017-11-29Bibliographically approved

Open Access in DiVA

fulltext(483 kB)304 downloads
File information
File name FULLTEXT01.pdfFile size 483 kBChecksum SHA-512
18687f64b3fdc79c2fd35b7862bfa0bfa8e5d3baa1f315428343a443045449995bd4120ecb945101a2d99ce77344940bcc03a99c1e58cd23091e8e04f32cc17d
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records BETA

Wittek, PeterDarányi, SándorNelhans, Gustaf

Search in DiVA

By author/editor
Wittek, PeterDarányi, SándorNelhans, Gustaf
By organisation
Faculty of Librarianship, Information, Education and IT
In the same journal
Scientometrics
Other Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 304 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 208 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf