Networks, Crowds, and Markets. Reasoning About a Highly Connected World. Easley, D. & Kleinberg, J. CUP, 2010. Paper abstract bibtex A unique probabilistic approach to studying pattern matching problems in computer science, telecommunications, molecular biology and more.
@book{easley_networks_2010,
title = {Networks, {Crowds}, and {Markets}. {Reasoning} {About} a {Highly} {Connected} {World}},
isbn = {978-0-521-19533-1},
url = {http://www.cambridge.org/us/academic/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/networks-crowds-and-markets-reasoning-about-highly-connected-world},
abstract = {A unique probabilistic approach to studying pattern matching problems in computer science, telecommunications, molecular biology and more.},
language = {en},
urldate = {2014-09-05},
publisher = {CUP},
author = {Easley, David and Kleinberg, Jon},
year = {2010},
keywords = {*****, act\_RelationalAnalysis, goal\_Analysis, t\_NetworkAnalysis},
}
Downloads: 0
{"_id":{"_str":"534279620e946d920a0015ec"},"__v":1,"authorIDs":[],"author_short":["Easley, D.","Kleinberg, J."],"bibbaseid":"easley-kleinberg-networkscrowdsandmarketsreasoningaboutahighlyconnectedworld-2010","bibdata":{"bibtype":"book","type":"book","title":"Networks, Crowds, and Markets. Reasoning About a Highly Connected World","isbn":"978-0-521-19533-1","url":"http://www.cambridge.org/us/academic/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/networks-crowds-and-markets-reasoning-about-highly-connected-world","abstract":"A unique probabilistic approach to studying pattern matching problems in computer science, telecommunications, molecular biology and more.","language":"en","urldate":"2014-09-05","publisher":"CUP","author":[{"propositions":[],"lastnames":["Easley"],"firstnames":["David"],"suffixes":[]},{"propositions":[],"lastnames":["Kleinberg"],"firstnames":["Jon"],"suffixes":[]}],"year":"2010","keywords":"*****, act_RelationalAnalysis, goal_Analysis, t_NetworkAnalysis","bibtex":"@book{easley_networks_2010,\n\ttitle = {Networks, {Crowds}, and {Markets}. {Reasoning} {About} a {Highly} {Connected} {World}},\n\tisbn = {978-0-521-19533-1},\n\turl = {http://www.cambridge.org/us/academic/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/networks-crowds-and-markets-reasoning-about-highly-connected-world},\n\tabstract = {A unique probabilistic approach to studying pattern matching problems in computer science, telecommunications, molecular biology and more.},\n\tlanguage = {en},\n\turldate = {2014-09-05},\n\tpublisher = {CUP},\n\tauthor = {Easley, David and Kleinberg, Jon},\n\tyear = {2010},\n\tkeywords = {*****, act\\_RelationalAnalysis, goal\\_Analysis, t\\_NetworkAnalysis},\n}\n\n","author_short":["Easley, D.","Kleinberg, J."],"key":"easley_networks_2010","id":"easley_networks_2010","bibbaseid":"easley-kleinberg-networkscrowdsandmarketsreasoningaboutahighlyconnectedworld-2010","role":"author","urls":{"Paper":"http://www.cambridge.org/us/academic/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/networks-crowds-and-markets-reasoning-about-highly-connected-world"},"keyword":["*****","act_RelationalAnalysis","goal_Analysis","t_NetworkAnalysis"],"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"book","biburl":"https://api.zotero.org/groups/2386895/collections/L5DPTH6D/items?format=bibtex&limit=100","downloads":0,"keywords":["*****","act_relationalanalysis","goal_analysis","t_networkanalysis"],"search_terms":["networks","crowds","markets","reasoning","highly","connected","world","easley","kleinberg"],"title":"Networks, Crowds, and Markets. Reasoning About a Highly Connected World","year":2010,"dataSources":["hEoKh4ygEAWbAZ5iy","YXnKxykgewaZSWfRw"]}