Title: Communities, Modules, and Large-Scale Structure in Networks
Description: Many networks, including social and technological networks, are found to divide into communities or modules, groups of network nodes with dense connections within groups and sparser connections between groups. The ability to detect and identify communities plays an important role in network visualization, data analysis, and other areas. In this talk I discuss the theory and practice of community detection and demonstrate applications to networks from a range of fields. I also discuss some recent results showing that in certain cases it is impossible to detect communities in networks, even though they are present, implying that there are fundamental limits to our ability to pry understanding from network data. Finally I discuss other forms of large-scale structure in networks, such as hierarchical structure and overlapping communities, and methods for their detection. These studies are in their infancy but may lead us to new understanding of the connection between the structure and function of networked systems.



Mark Newman received a Ph.D. in theoretical physics from the University of Oxford in 1991 and conducted postdoctoral research at Cornell University before joining the staff of the Santa Fe Institute, a think-tank in New Mexico devoted to the study of complex systems. In 2002 he left Santa Fe for the University of Michigan, where he is currently the Paul Dirac Collegiate Professor of Physics and a professor in the university’s Center for the Study of Complex Systems. Professor Newman is a Fellow of the American Physical Society and the author of over a hundred scientific publications and six books, including “Networks: An Introduction”, a textbook on network theory, and “The Atlas of the Real World,” a popular book on cartography. Professor Newman’s research focuses on networked systems, such as social and information networks, and particularly on questions of community structure, network resilience, mixing patterns, and statistical inference for networks.
Date Issued: 2012-05-18
Time: 2:25 PM
Url: http://lecb.physics.lsa.umich.edu/CWIS/browser.php?ResourceId=4313
CreatorInstitution: University of Michigan
Duration: 00:40:52
Creator: Newman, Mark
VenueInstitution: University of Michigan
VenueRoom: Rackham Graduate School Building 4th Floor Amphitheater
VenueCity: Ann Arbor, MI
Contributor: Web Lecture Archive Project at the University of Michigan
Publisher: Web Lecture Archive Project at the University of Michigan
University of Michigan
Classification: University of Michigan -- Rackham Graduate School -- 12th Experimental Chaos and Complexity Conference
Resource Type: Interactive Resource (DCMI Type Vocabulary)
Format: WLAPLectureObject-v0.2
Audience: Undergraduate students
Lifelong learners
Graduate students
General Public
Language: English
Rights: Copyright by the Regents of the University of Michigan
Email Address: carma-service@umich.edu
Date Of Record Creation: 2009-01-30 15:47:12 (W3C-DTF)
Date Of Record Release: 2007-02-21 06:44:03
Date Record Checked: 2012-05-16 (W3C-DTF)
Date Last Modified: 2012-05-22 18:32:36 (W3C-DTF)
WLAPID: 20120519-umwlcd-CARMA-Mobile-142500
TapeLabel: 2012 May 19 CC
WLAPID_AUTO: 5
AggregationLevel: 2
Structure: networked
Directory: carma/2012/Rackham Graduate School/12th Chaos Conference
VenueTGN: 7013304

Report a Problem with this Resource Record