Zobrazeno 1 - 10
of 158
pro vyhledávání: '"Cristopher Moore"'
Publikováno v:
PLoS Computational Biology, Vol 18, Iss 11, p e1010650 (2022)
Network science has increasingly become central to the field of epidemiology and our ability to respond to infectious disease threats. However, many networks derived from modern datasets are not just large, but dense, with a high ratio of edges to no
Externí odkaz:
https://doaj.org/article/0e51aced78b24c8c8d71bb0964535345
Publikováno v:
Physical Review X, Vol 6, Iss 3, p 031005 (2016)
The detection of communities within a dynamic network is a common means for obtaining a coarse-grained view of a complex system and for investigating its underlying processes. While a number of methods have been proposed in the machine learning and p
Externí odkaz:
https://doaj.org/article/405aac9bb3a04e448eb92a40a30c0d8f
Publikováno v:
PLoS ONE, Vol 5, Iss 1, p e8118 (2010)
Biological networks change dynamically as protein components are synthesized and degraded. Understanding the time-dependence and, in a multicellular organism, tissue-dependence of a network leads to insight beyond a view that collapses time-varying i
Externí odkaz:
https://doaj.org/article/af430100c2f346278c7cd7c8251fd2f2
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AA,..., Iss Proceedings (2001)
Several classic tilings, including rhombuses and dominoes, possess height functions which allow us to 1) prove ergodicity and polynomial mixing times for Markov chains based on local moves, 2) use coupling from the past to sample perfectly random til
Externí odkaz:
https://doaj.org/article/f55e1358da1742e282ee5438f5c632a0
Computer science and physics have been closely linked since the birth of modern computing. In recent years, an interdisciplinary area has blossomed at the junction of these fields, connecting insights from statistical physics with basic computational
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70b959abaea4475a2e898e1aa1f4105e
https://doi.org/10.2139/ssrn.4352036
https://doi.org/10.2139/ssrn.4352036
Publikováno v:
Coretti, S, Kiayias, A, Russell, A & Moore, C 2022, The Generals’ Scuttlebutt: Byzantine-Resilient Gossip Protocols . in Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security . Association for Computing Machinery (ACM), pp. 595-608, The 29th ACM Conference on Computer and Communications Security, Los Angeles, California, United States, 7/11/22 . https://doi.org/10.1145/3548606.3560638
One of the most successful applications of peer-to-peer communication networks is in the context of blockchain protocols, which—in Satoshi Nakamoto’s own words—rely on the “nature of information being easy to spread and hard to stifle.” Sig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7f63235b0f240d3499e9893b0bfb19f
https://www.pure.ed.ac.uk/ws/files/307597802/The_General_CORETTI_DOA25082022_VOR_CC_BY.pdf
https://www.pure.ed.ac.uk/ws/files/307597802/The_General_CORETTI_DOA25082022_VOR_CC_BY.pdf
Autor:
George T. Cantwell, Cristopher Moore
Publikováno v:
Physical Review E. 105
Many datasets give partial information about an ordering or ranking by indicating which team won a game, which item a user prefers, or who infected whom. We define a continuous spin system whose Gibbs distribution is the posterior distribution on per
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3428b0e1d02e77a2fec5f9a7cd3e49a
https://doi.org/10.1103/physreve.105.l052303
https://doi.org/10.1103/physreve.105.l052303
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa133401ee5539799232abb91624c7bd
https://doi.org/10.2139/ssrn.4143886
https://doi.org/10.2139/ssrn.4143886
Publikováno v:
SIAM Journal on Computing. 48:1098-1119
We derive upper and lower bounds on the degree d for which the Lovasz theta function, or equivalently sum-of-squares proofs with degree two, can refute the existence of a k-coloring in random regular graphs G(n,d). We show that this type of refutatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3b2200432d997e0a6fa8703186abe9e
https://doi.org/10.1137/18m1180396
https://doi.org/10.1137/18m1180396