http://www.bibsonomy.org/burst/user/bertil.hattBibSonomy BuRST Feed for /user/bertil.hatt2008-10-16T09:03:19+02:00March 2008http://www.bibsonomy.org/bibtex/2705bde4e1c22d0566dc3ba602d2147d5/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;"> </span><em>Jun2004. </em>Thu Mar 13 16:33:57 CET 2008Jun20Callon Latour - Tu ne calculeras pas2004imported March 2008http://www.bibsonomy.org/bibtex/2e963cc70b0472ef464a11363fc0abf17/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">Adalbert <a href="http://www.bibsonomy.org/author/Mayer">Mayer</a> und Steven L. <a href="http://www.bibsonomy.org/author/Puller">Puller</a> </span><em>JPE</em><em>Sep2007. </em>Thu Mar 13 16:33:57 CET 2008JPESepThe Old Boy (and Girl) Network: Social Network Formation on University Campusesdoi: 10.1016/j.jpubeco.2007.09.0012007imported This paper documents the structure and composition of social networks on university campuses and investigates the processes that lead to their formation. Using administrative data and information from Facebook.com, we document the factors that are the strongest predictors of whether two students are friends. Race is strongly related to social ties, even after controlling for a variety of measures of socioeconomic background, ability, and college activities. We develop a model of the formation of social networks that decomposes the formation of social links into effects based upon the exogenous school environment and effects of endogenous choice arising from preferences for certain characteristics in one's friends. We use student-level data from an actual social network to calibrate the model. We simulate the social network under alternative university policies aimed at reducing social segmentation. We find that changes in the school environment that affect the likelihood that two students interact have only a limited potential to reduce the racial segmentation of the social network. March 2008http://www.bibsonomy.org/bibtex/28b27ef7c0b5a2aa29fc89faee2366f91/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;"> </span><em>Apr2007. </em>Thu Mar 13 16:33:57 CET 2008Apr173.12.07_seminar_Diermeier_noisy_environments2007imported March 2008http://www.bibsonomy.org/bibtex/2d9ec92b55ded5272d3b3a00a47408eb4/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">D <a href="http://www.bibsonomy.org/author/Garlaschelli">Garlaschelli</a> und M <a href="http://www.bibsonomy.org/author/Loffredo">Loffredo</a> </span><em>Physica A: Statistical Mechanics and its Applications</em><em>Jan2004. </em><em>arXiv.org . </em>Thu Mar 13 16:33:57 CET 2008Physica A: Statistical Mechanics and its ApplicationsJanarXiv.orgWealth dynamics on complex networks2004imported We study a model of wealth dynamics (Physica A 282 (2000) 536) which mimics transactions among economic agents. The outcomes of the model are shown to depend strongly on the topological properties of the underlying transaction March 2008http://www.bibsonomy.org/bibtex/27bc815676e35f2decbaa8136ac31e95e/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00H.2.8; cs.CY G.2.2; H.3, physics.soc-ph, <span style="color:#555555;">Ken <a href="http://www.bibsonomy.org/author/Wakita">Wakita</a> und Toshiyuki <a href="http://www.bibsonomy.org/author/Tsurumi">Tsurumi</a> </span><em>arXiv</em><em>Feb2007. </em><em>9 pages, 15 figures . </em>Thu Mar 13 16:33:57 CET 2008arXivFeb9 pages, 15 figuresFinding Community Structure in Mega-scale Social Networkscs.CY2007H.2.8; cs.CY G.2.2; H.3, physics.soc-ph, Community analysis algorithm proposed by Clauset, Newman, and Moore (CNM algorithm) finds community structure in social networks. Unfortunately, CNM algorithm does not scale well and its use is practically limited to networks whose sizes are up to 500,000 nodes. The paper identifies that this inefficiency is caused from merging communities in unbalanced manner. The paper introduces three kinds of metrics (consolidation ratio) to control the process of community analysis trying to balance the sizes of the communities being merged. Three flavors of CNM algorithms are built incorporating those metrics. The proposed techniques are tested using data sets obtained from existing social networking service that hosts 5.5 million users. All the methods exhibit dramatic improvement of execution efficiency in comparison with the original CNM algorithm and shows high scalability. The fastest method processes a network with 1 million nodes in 5 minutes and a network with 4 million nodes in 35 minutes, respectively. Another one processes a network with 500,000 nodes in 50 minutes (7 times faster than the original algorithm), finds community structures that has improved modularity, and scales to a network with 5.5 million. March 2008http://www.bibsonomy.org/bibtex/26c817baabfdf2844c71e46b207dfba3f/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">K <a href="http://www.bibsonomy.org/author/Tchernov">Tchernov</a> </span><em>Auckland University Draft</em>(<em>2007</em>)Thu Mar 13 16:33:57 CET 2008Auckland University DraftPrivacy issues with blogging2007imported March 2008http://www.bibsonomy.org/bibtex/27e44102c13212eccdef39bf285a63d0b/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">Robert <a href="http://www.bibsonomy.org/author/Briscoe">Briscoe</a> und Andrew <a href="http://www.bibsonomy.org/author/Odlyzko">Odlyzko</a> und Benjamin <a href="http://www.bibsonomy.org/author/Tilly">Tilly</a> </span><em>IEEE Sp</em>(<em>2006</em>)Thu Mar 13 16:33:57 CET 2008IEEE SpCommunications networks increase in value as they add members---but by how much? The devil is in the details2006imported March 2008http://www.bibsonomy.org/bibtex/24d7d46acd08bb8312c19a8623b22d362/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">Mark E. <a href="http://www.bibsonomy.org/author/J Newman">J Newman</a> und Albert-Laszlo <a href="http://www.bibsonomy.org/author/Barab{\&#039;a}si">Barab'asi</a> und Duncan J <a href="http://www.bibsonomy.org/author/Watts">Watts</a> </span>(<em>2006</em>)Thu Mar 13 16:33:57 CET 2008The Structure and Dynamics of Complex Networks2006imported March 2008http://www.bibsonomy.org/bibtex/275778da8a0c5c9957bfb055633c06adc/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">Arnaud Le <a href="http://www.bibsonomy.org/author/Marchand">Marchand</a> </span><em>S\'em. Conventions</em><em>Jan2008. </em>Thu Mar 13 16:33:57 CET 2008S{\'e}m. ConventionsJan21La foire : un dispositif innovant et pr{\'e}caire. L'exemple du cin{\'e}ma forain2008imported March 2008http://www.bibsonomy.org/bibtex/291ae434e4ab2b939032e805261eb95f8/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">Stuart JH <a href="http://www.bibsonomy.org/author/Graham">Graham</a> und D <a href="http://www.bibsonomy.org/author/Harhoff">Harhoff</a> </span><em>Uni Mannheim work. p.</em><em>Jan2006. </em>Thu Mar 13 16:33:57 CET 2008Uni Mannheim work. p.JanCan Post-grant Reviews Improve a Patent System Design?: A Twin Study of US and European Patents2006imported March 2008http://www.bibsonomy.org/bibtex/2936c22680fce4a95aaa582bb5bd0e81b/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">Agata <a href="http://www.bibsonomy.org/author/Fronczak">Fronczak</a> und Piotr <a href="http://www.bibsonomy.org/author/Fronczak">Fronczak</a> und Janusz <a href="http://www.bibsonomy.org/author/Ho\lyst">Holyst</a> </span><em>Phys Rev E</em><em>68(4):046126</em>(<em>2003</em>)Thu Mar 13 16:33:57 CET 2008Phys Rev E4046126Mean-field theory for clustering coefficients in Barab{\'a}si-Albert networks682003imported March 2008http://www.bibsonomy.org/bibtex/21f522207d0b41c5eab4d88d3443ac492/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">Halbert <a href="http://www.bibsonomy.org/author/White">White</a> </span><em>Internat. Eco. R.</em><em>21(1):149--170</em><em>Feb1980. </em>Thu Mar 13 16:33:57 CET 2008Internat. Eco. R.Feb1149--170Using Least Squares to Approximate Unknown Regression Functions211980imported March 2008http://www.bibsonomy.org/bibtex/2c84582d306434c2126eab85df1a718d6/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">Alex <a href="http://www.bibsonomy.org/author/Gaudel">Gaudel</a> </span><em>R. Network Eco</em>(<em>2007</em>)Thu Mar 13 16:33:57 CET 2008R. Network Eco2Do Open Source Developers Respond to Competition? The \LaTeX Case Study62007imported This paper traces the history of \LaTeX, the open source typesetting program. \TeX was an early and very successful open source project that imposed its standards in a particularly competitive environment and inspired many advances in the typesetting industry. Developed over three decades, \TeX came into competition with a variety of open source and proprietary alternatives. I argue from this case study that open source developers derive direct and indirect network externalities from the use of their software by others and must therefore consider non-developers' needs to make their software more attractive to a broader audience and more competitive with proprietary alternatives.March 2008http://www.bibsonomy.org/bibtex/240ab0af187a6bb6e6443c22665f59667/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">Qiming <a href="http://www.bibsonomy.org/author/Lu">Lu</a> und G. <a href="http://www.bibsonomy.org/author/Korniss">Korniss</a> und Boleslaw K. <a href="http://www.bibsonomy.org/author/Szymanski">Szymanski</a> </span>(<em>2007</em>) <em>arXiv.org . </em>Thu Mar 13 16:33:57 CET 2008arXiv.orgNaming Games in Spatially-Embedded Random Networks2007imported We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the Naming Games on random geometric graphs, local communications being local broadcasts, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially-embedded autonomous agents. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a ``small-world''-like network and yielding a significantly reduced time to reach global agreement.March 2008http://www.bibsonomy.org/bibtex/287d1899702ffbec7a426d3ba3bd4b51e/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">Daniel <a href="http://www.bibsonomy.org/author/Friedman">Friedman</a> und Bernardo A <a href="http://www.bibsonomy.org/author/Huberman">Huberman</a> </span><em>Proc. SigComm'04</em>(<em>2004</em>)Thu Mar 13 16:33:57 CET 2008Proc. SigComm'04Internet Congestion: A Laboratory Experiment2004imported Human players and automated players (bots) interact in real time in a congested network. A player's revenue is proportional to the number of successful ``downloads'' and his cost is proportional to his total waiting time. Congestion arises because waiting time is an increasing random function of the number of uncompleted download attempts by all players. Surprisingly, some human players earn considerably higher profits than bots. Bots are better able to exploit periods of excess capacity, but they create endogenous trends in congestion that human players are better able to exploit. Nash equilibrium does a good job of predicting the impact of network capacity and noise amplitude. Overall efficiency is quite low, however, and players overdissipate potential rents, i.e., earn lower profits than in Nash equilibrium.March 2008http://www.bibsonomy.org/bibtex/29e9c3bca85521ee7bcf15e4166818bdf/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">A <a href="http://www.bibsonomy.org/author/Hewitt">Hewitt</a> und A <a href="http://www.bibsonomy.org/author/Forte">Forte</a> </span><em>Proc 2006 CSCW</em><em>Jan2006. </em>Thu Mar 13 16:33:57 CET 2008Proc 2006 CSCWJanCrossing boundaries: Identity management and student/faculty relationships on the Facebook2006imported March 2008http://www.bibsonomy.org/bibtex/2381b8e8f0b0037225581362f1189964f/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">Lars <a href="http://www.bibsonomy.org/author/Perner">Perner</a> </span><em>Jan1904. </em>Thu Mar 13 16:33:57 CET 2008JanDiffusion--outline1904imported BMGT 808CMarch 2008http://www.bibsonomy.org/bibtex/2b577c32ce151f90a78ffdb21cf40bb43/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;"> </span><em>Dec2006. </em>Thu Mar 13 16:33:57 CET 2008Dec12OFCOM,Net_neutrality_debate,11-12-06,12p2006imported March 2008http://www.bibsonomy.org/bibtex/238b93d6e8a668491cf03a84ae08fc3cd/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">David <a href="http://www.bibsonomy.org/author/Beer">Beer</a> und Roger <a href="http://www.bibsonomy.org/author/Burrows">Burrows</a> </span><em>Sociological Research Online</em>(<em>2007</em>)Thu Mar 13 16:33:57 CET 2008Sociological Research OnlineSociology And, of and in Web 2.0: Some Initial Considerations2007imported This paper introduces the idea of Web 2.0 to a sociological audience as a key example of a process of cultural digitization that is moving faster than our ability to analyse it. It offers a definition, a schematic overview and a typology of the notion as part of a commitment to a renewal of description in sociology. It provides examples of wikis, folksonomies, mashups and social networking sites and, where possible and by way of illustration, examines instances where sociology and sociologists are featured. The paper then identifies three possible agendas for the development of a viable sociology of Web 2.0: the changing relations between the production and consumption of internet content; the mainstreaming of private information posted to the public domain; and, the emergence of a new rhetoric of 'democratisation'. The paper concludes by discussing some of the ways in which we can engage with these new web applications and go about developing sociological understandings of the new online cultures as they become increasingly significant in the mundane routines of everyday life. March 2008http://www.bibsonomy.org/bibtex/2424f66181c44ab7bfc9efb6902e79236/bertil.hattbertil.hatt2008-03-13T16:33:57+01:00imported <span style="color:#555555;">J <a href="http://www.bibsonomy.org/author/Grimmelmann">Grimmelmann</a> </span><em>New York Law School Law Review</em><em>Jan2004. </em>Thu Mar 13 16:33:57 CET 2008New York Law School Law ReviewJanVirtual Worlds as Comparative Law2004imported * JD candidate, Yale Law School, 2005. The author would like to thank Amy Chua, Jack Balkin, Beth Noveck, the attendees at the State of Play conference, and those who provided comments on earlier versions of this paper. 1. Following