Duncan J. Watts

Last updated

Duncan Watts
Duncan Watts.jpg
Watts presenting at iCitizen 2008
Born (1971-02-20) February 20, 1971 (age 53) [1]
NationalityAustralian - Canadian [1]
Alma mater University of New South Wales
Cornell University (PhD)
Known for Watts and Strogatz model
Six Degrees: The Science of a Connected Age [2]
Awards Fellow of the Network Science Society (NetSci), 2018.
Scientific career
Fields Sociology, network science
Institutions Columbia University
Microsoft Research
Santa Fe Institute
Yahoo! Research
Nuffield College, Oxford [3]
Thesis The structure and dynamics of small-world systems  (1997)
Doctoral advisor Steven Strogatz [4]
Website www.asc.upenn.edu/people/faculty/duncan-j-watts-phd

Duncan James Watts (born February 20, 1971) is a sociologist and a professor at the University of Pennsylvania. [5] He was formerly a principal researcher at Microsoft Research in New York City, and is known for his work on small-world networks. [6] [7] [8] [9] [10] [11] [12] [13] [14]

Contents

Education

Watts received a Bachelor of Science degree in physics from the University of New South Wales and a PhD in Theoretical and Applied Mechanics from Cornell University, [15] where his advisor was Steven Strogatz. [1]

Career

Watts joined the faculty of the University of Pennsylvania in July 2019 as a PIK Professor. He has joint appointments in Engineering, Communications and Business.

Watts was past external faculty member of the Santa Fe Institute and a former professor of sociology at Columbia University, where he headed the Collective Dynamics Group. [16] He is also author of two books. His first, Six Degrees: The Science of a Connected Age [2] is based on the six degrees research in his 1998 paper with Steven Strogatz, in which the two presented a mathematical theory of the small world phenomenon. [17] His second book, Everything is Obvious *Once You Know the Answer: How Common Sense Fails Us, [18] explains common errors people make when making decisions especially for groups or organizations, and suggests alternative methods using research and data. He also presents some of his research from Yahoo and Microsoft, and comments on the work of some popular nonfiction writers like Malcolm Gladwell.

Until April 2012, he was a principal research scientist at Yahoo! Research, where he directed the Human Social Dynamics group. [19] Watts joined Microsoft Research in New York City by its opening on May 3, 2012. [20] [21]

Watts describes his research as exploring the "role that network structure plays in determining or constraining system behavior, focusing on a few broad problem areas in social science such as information contagion, financial risk management, and organizational design." [22] More recently he has attracted attention for his modern-day replication of Stanley Milgram's small world experiment using email messages and for his studies of popularity and fads in on-line and other communities.

In Watts's early career, from 2002 to 2007, he was a frequent collaborator of Peter Sheridan Dodds, now at the University of Vermont's Vermont Complex Systems Center.

Related Research Articles

<span class="mw-page-title-main">Social dynamics</span> Study of behavior of groups

Social dynamics is the study of the behavior of groups and of the interactions of individual group members, aiming to understand the emergence of complex social behaviors among microorganisms, plants and animals, including humans. It is related to sociobiology but also draws from physics and complex system sciences. In the last century, sociodynamics was viewed as part of psychology, as shown in the work: "Sociodynamics: an integrative theorem of power, authority, interfluence and love". In the 1990s, social dynamics began being viewed as a separate scientific discipline[By whom?]. An important paper in this respect is: "The Laws of Sociodynamics". Then, starting in the 2000s, sociodynamics took off as a discipline of its own, many papers were released in the field in this decade.

A complex system is a system composed of many components which may interact with each other. Examples of complex systems are Earth's global climate, organisms, the human brain, infrastructure such as power grid, transportation or communication systems, complex software and electronic systems, social and economic organizations, an ecosystem, a living cell, and ultimately the entire universe.

<span class="mw-page-title-main">Small-world experiment</span> Experiments examining the average path length for social networks

The small-world experiment comprised several experiments conducted by Stanley Milgram and other researchers examining the average path length for social networks of people in the United States. The research was groundbreaking in that it suggested that human society is a small-world-type network characterized by short path-lengths. The experiments are often associated with the phrase "six degrees of separation", although Milgram did not use this term himself.

<span class="mw-page-title-main">Network theory</span> Study of graphs as a representation of relations between discrete objects

In mathematics, computer science and network science, network theory is a part of graph theory. It defines networks as graphs where the nodes or edges possess attributes. Network theory analyses these networks over the symmetric relations or asymmetric relations between their (discrete) components.

<span class="mw-page-title-main">Small-world network</span> Graph where most nodes are reachable in a small number of steps

A small-world network is a graph characterized by a high clustering coefficient and low distances. On an example of social network, high clustering implies the high probability that two friends of one person are friends themselves. The low distances, on the other hand, mean that there is a short chain of social connections between any two people. Specifically, a small-world network is defined to be a network where the typical distance L between two randomly chosen nodes grows proportionally to the logarithm of the number of nodes N in the network, that is:

In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in most real-world networks, and in particular social networks, nodes tend to create tightly knit groups characterised by a relatively high density of ties; this likelihood tends to be greater than the average probability of a tie randomly established between two nodes.

<span class="mw-page-title-main">Complex network</span> Network with non-trivial topological features

In the context of network theory, a complex network is a graph (network) with non-trivial topological features—features that do not occur in simple networks such as lattices or random graphs but often occur in networks representing real systems. The study of complex networks is a young and active area of scientific research inspired largely by empirical findings of real-world networks such as computer networks, biological networks, technological networks, brain networks, climate networks and social networks.

<span class="mw-page-title-main">Steven Strogatz</span> American mathematician

Steven Henry Strogatz, born August 13, 1959, is an American mathematician and author, and the Susan and Barton Winokur Distinguished Professor for the Public Understanding of Science and Mathematics at Cornell University. He is known for his work on nonlinear systems, including contributions to the study of synchronization in dynamical systems, and for his research in a variety of areas of applied mathematics, including mathematical biology and complex network theory.

<span class="mw-page-title-main">Watts–Strogatz model</span> Method of generating random small-world graphs

The Watts–Strogatz model is a random graph generation model that produces graphs with small-world properties, including short average path lengths and high clustering. It was proposed by Duncan J. Watts and Steven Strogatz in their article published in 1998 in the Nature scientific journal. The model also became known as the (Watts) beta model after Watts used to formulate it in his popular science book Six Degrees.

<span class="mw-page-title-main">Network science</span> Academic field

Network science is an academic field which studies complex networks such as telecommunication networks, computer networks, biological networks, cognitive and semantic networks, and social networks, considering distinct elements or actors represented by nodes and the connections between the elements or actors as links. The field draws on theories and methods including graph theory from mathematics, statistical mechanics from physics, data mining and information visualization from computer science, inferential modeling from statistics, and social structure from sociology. The United States National Research Council defines network science as "the study of network representations of physical, biological, and social phenomena leading to predictive models of these phenomena."

Mark Newman is an English–American physicist and Anatol Rapoport Distinguished University Professor of Physics at the University of Michigan, as well as an external faculty member of the Santa Fe Institute. He is known for his fundamental contributions to the fields of complex networks and complex systems, for which he was awarded the 2014 Lagrange Prize.

<span class="mw-page-title-main">Weighted network</span> Network where the ties among nodes have weights assigned to them

A weighted network is a network where the ties among nodes have weights assigned to them. A network is a system whose elements are somehow connected. The elements of a system are represented as nodes and the connections among interacting elements are known as ties, edges, arcs, or links. The nodes might be neurons, individuals, groups, organisations, airports, or even countries, whereas ties can take the form of friendship, communication, collaboration, alliance, flow, or trade, to name a few.

The Matthew effect of accumulated advantage, sometimes called the Matthew principle, is the tendency of individuals to accrue social or economic success in proportion to their initial level of popularity, friends, and wealth. It is sometimes summarized by the adage or platitude "the rich get richer and the poor get poorer". The term was coined by sociologists Robert K. Merton and Harriet Zuckerman in 1968 and takes its name from a loose interpretation of the Parable of the Talents in the biblical Gospel of Matthew.

<span class="mw-page-title-main">Evolving network</span>

Evolving networks are networks that change as a function of time. They are a natural extension of network science since almost all real world networks evolve over time, either by adding or removing nodes or links over time. Often all of these processes occur simultaneously, such as in social networks where people make and lose friends over time, thereby creating and destroying edges, and some people become part of new social networks or leave their networks, changing the nodes in the network. Evolving network concepts build on established network theory and are now being introduced into studying networks in many diverse fields.

In social network analysis, the co-stardom network represents the collaboration graph of film actors i.e. movie stars. The co-stardom network can be represented by an undirected graph of nodes and links. Nodes correspond to the movie star actors and two nodes are linked if they co-starred (performed) in the same movie. The links are un-directed, and can be weighted or not depending on the goals of study. If the number of times two actors appeared in a movie is needed, links are assigned weights. The co-stardom network can also be represented by a bipartite graph where nodes are of two types: actors and movies. And edges connect different types of nodes if they have a relationship. Initially the network was found to have a small-world property. Afterwards, it was discovered that it exhibits a scale-free (power-law) behavior.

<span class="mw-page-title-main">Social network</span> Social structure made up of a set of social actors

A social network is a social structure made up of a set of social actors, sets of dyadic ties, and other social interactions between actors. The social network perspective provides a set of methods for analyzing the structure of whole social entities as well as a variety of theories explaining the patterns observed in these structures. The study of these structures uses social network analysis to identify local and global patterns, locate influential entities, and examine network dynamics.

<span class="mw-page-title-main">Six degrees of separation</span> Concept of social inter-connectedness of all people

Six degrees of separation is the idea that all people are six or fewer social connections away from each other. As a result, a chain of "friend of a friend" statements can be made to connect any two people in a maximum of six steps. It is also known as the six handshakes rule.

<span class="mw-page-title-main">Global cascades model</span>

Global cascades models are a class of models aiming to model large and rare cascades that are triggered by exogenous perturbations which are relatively small compared with the size of the system. The phenomenon occurs ubiquitously in various systems, like information cascades in social systems, stock market crashes in economic systems, and cascading failure in physics infrastructure networks. The models capture some essential properties of such phenomenon.

The initial attractiveness is a possible extension of the Barabási–Albert model. The Barabási–Albert model generates scale-free networks where the degree distribution can be described by a pure power law. However, the degree distribution of most real life networks cannot be described by a power law solely. The most common discrepancies regarding the degree distribution found in real networks are the high degree cut-off and the low degree saturation. The inclusion of initial attractiveness in the Barabási–Albert model addresses the low-degree saturation phenomenon.

<span class="mw-page-title-main">Matthew J. Salganik</span>

Matthew Jeffrey Salganik is an American sociologist and professor of sociology at Princeton University with a special interest on social networks and computational social science.

References

  1. 1 2 3 4 Watts, Duncan James (1997). The structure and dynamics of small-world systems (PhD thesis). Cornell University. ProQuest   304342043.
  2. 1 2 Watts, Duncan (2003). Six Degrees: The Science of a Connected Age. W. W. Norton & Company. ISBN   978-0-393-04142-2.
  3. "Everything is Obvious". Everything is Obvious. 23 April 2018. Archived from the original on 24 August 2013. Retrieved 8 July 2018.
  4. Duncan J. Watts at the Mathematics Genealogy Project
  5. "Duncan Watts, Ph.D. | Annenberg School for Communication". www.asc.upenn.edu. Retrieved 30 November 2019.
  6. Watts, D. J. (1999). "Networks, Dynamics, and the Small‐World Phenomenon". American Journal of Sociology. 105 (2): 493–527. CiteSeerX   10.1.1.78.4413 . doi:10.1086/210318. S2CID   16479399.
  7. Watts, D. J.; Dodds, P. S.; Newman, M. E. (2002). "Identity and Search in Social Networks". Science. 296 (5571): 1302–1305. arXiv: cond-mat/0205383 . Bibcode:2002Sci...296.1302W. doi:10.1126/science.1070120. PMID   12016312. S2CID   466762.
  8. Watts, D. J. (2002). "A simple model of global cascades on random networks". Proceedings of the National Academy of Sciences. 99 (9): 5766–5771. Bibcode:2002PNAS...99.5766W. doi: 10.1073/pnas.082090499 . PMC   122850 . PMID   16578874.
  9. Dodds, P. S.; Muhamad, R.; Watts, D. J. (2003). "An Experimental Study of Search in Global Social Networks" (PDF). Science. 301 (5634): 827–829. Bibcode:2003Sci...301..827D. CiteSeerX   10.1.1.222.4643 . doi:10.1126/science.1081058. PMID   12907800. S2CID   11504171.
  10. Watts, D. J. (2004). "The "New" Science of Networks". Annual Review of Sociology. 30: 243–270. doi:10.1146/annurev.soc.30.020404.104342.
  11. Dodds, P.; Watts, D. (2004). "Universal Behavior in a Generalized Model of Contagion". Physical Review Letters. 92 (21): 218701. arXiv: cond-mat/0403699 . Bibcode:2004PhRvL..92u8701D. doi:10.1103/PhysRevLett.92.218701. PMID   15245323. S2CID   2450776.
  12. Watts, D. J. (2005). "Multiscale, resurgent epidemics in a hierarchical metapopulation model". Proceedings of the National Academy of Sciences. 102 (32): 11157–11162. Bibcode:2005PNAS..10211157W. doi: 10.1073/pnas.0501226102 . PMC   1183543 . PMID   16055564.
  13. Duncan J. Watts's publications indexed by the Scopus bibliographic database. (subscription required)
  14. Clive Thompson (February 2008). "Is the Tipping Point Toast?". Fast Company . Retrieved 25 February 2008.
  15. Watts, Duncan (1999). "Duncan Watts". In Loudis, Jessica; Blagojevic, Rosko; Peetz, John Arthur; Rodman, Allison (eds.). Should I go to grad school?: 41 answers to an impossible question. American Mathematical Society. pp. 46–51. ISBN   978-1-62040-598-7.
  16. CDG Collective Dynamics Group Archived 2005-04-02 at the Wayback Machine
  17. Watts, D. J.; Strogatz, S. H. (1998). "Collective dynamics of 'small-world' networks" (PDF). Nature. 393 (6684): 440–442. Bibcode:1998Natur.393..440W. doi:10.1038/30918. PMID   9623998. S2CID   4429113.[ permanent dead link ]
  18. Watts, Duncan (2011). Everything Is Obvious: *Once You Know the Answer: How Common Sense Fails Us. New York: Crown Business. ISBN   978-0-385-53168-9.
  19. AllThingsDigital (29 April 2012). "Aussie social-network researcher exits Yahoo". Herald Sun . Archived from the original on 11 January 2020. Retrieved 8 July 2018.
  20. Floridia, Richard. "Why Microsoft Chose New York City" Archived 24 February 2014 at the Wayback Machine , The Atlantic: Cities, 2 May 2012. Retrieved on 8 May 2012.
  21. Knies, Rob. "Microsoft Research Microsoft Research Debuts N.Y.C. Lab", Microsoft Research , 7 May 2012. Retrieved on 8 May 2012.
  22. Home page of Duncan Watts at Yahoo Research Archived 2009-11-28 at the Wayback Machine