Diagrammatic perturbation methods in networks and sports ranking combinatorics

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 417
  • Download : 0
Analytic and computational tools developed in statistical physics are being increasingly applied to the study of complex networks. Here we present recent developments in the diagrammatic perturbation methods for the exponential random graph models, and apply them to the combinatoric problem of determining the ranking of nodes in directed networks that represent pairwise competitions.
Publisher
IOP PUBLISHING LTD
Issue Date
2010-04
Language
English
Article Type
Article
Keywords

NUMBER PARTITIONING PROBLEM; COLLEGE FOOTBALL RANKINGS; VIOLATIONS; TEAMS

Citation

JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT

ISSN
1742-5468
DOI
10.1088/1742-5468/2010/04/P04006
URI
http://hdl.handle.net/10203/101980
Appears in Collection
GCT-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0