DC Field | Value | Language |
---|---|---|
dc.contributor.author | Park, Juyong | ko |
dc.date.accessioned | 2013-03-12T10:04:01Z | - |
dc.date.available | 2013-03-12T10:04:01Z | - |
dc.date.created | 2012-10-18 | - |
dc.date.created | 2012-10-18 | - |
dc.date.created | 2012-10-18 | - |
dc.date.issued | 2010-04 | - |
dc.identifier.citation | JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT | - |
dc.identifier.issn | 1742-5468 | - |
dc.identifier.uri | http://hdl.handle.net/10203/101980 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.publisher | IOP PUBLISHING LTD | - |
dc.title | Diagrammatic perturbation methods in networks and sports ranking combinatorics | - |
dc.type | Article | - |
dc.identifier.wosid | 000277180700023 | - |
dc.identifier.scopusid | 2-s2.0-77951682594 | - |
dc.type.rims | ART | - |
dc.citation.publicationname | JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT | - |
dc.identifier.doi | 10.1088/1742-5468/2010/04/P04006 | - |
dc.contributor.localauthor | Park, Juyong | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | exact results | - |
dc.subject.keywordAuthor | heuristics | - |
dc.subject.keywordAuthor | random graphs | - |
dc.subject.keywordAuthor | networks | - |
dc.subject.keywordPlus | NUMBER PARTITIONING PROBLEM | - |
dc.subject.keywordPlus | COLLEGE FOOTBALL RANKINGS | - |
dc.subject.keywordPlus | VIOLATIONS | - |
dc.subject.keywordPlus | TEAMS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.