[Nrg-l] FW: Talk: Thursday May 11, Networks and dynamics, Prof. M. Newman

Mark Crovella crovella at cs.bu.edu
Tue May 9 11:30:34 EDT 2006


Looks good!
Mark 

-----Original Message-----
From: seminars-bounces at lists.csail.mit.edu
[mailto:seminars-bounces at lists.csail.mit.edu] On Behalf Of Vincent
Blondel
Sent: Tuesday, May 09, 2006 11:19 AM
To: vdb at mit.edu
Subject: Talk: Thursday May 11, Networks and dynamics, Prof. M. Newman


Thursday, May 11, Room 35-225, 2:30-3:30pm Prof. Mark Newman, University
of Michigan http://www-personal.umich.edu/~mejn/
Modularity and community structure in networks

Abstract. Many networks of interest in the sciences are found to divide
naturally into communities or modules.  The problem of detecting and
characterizing community structure has been the subject of a
considerable volume of recent research.  One effective approach is the
optimization of the quality function known as ``modularity'' over the
possible divisions of a network. The modularity can be expressed in
terms of the eigenvectors of a particular characteristic matrix for the
network, which we call the modularity matrix, and this expression leads
to a new spectral method for community detection that returns results as
good or better than competing methods in shorter running times. This and
related developments will be discussed, along with examples of community
structure in real-world networks and some implications for the
understanding of networked systems.

Biography. Mark Newman received his Ph.D. in theoretical physics from
the University of Oxford in 1991. After doing postdoctoral work at
Cornell University, he joined the faculty of the Santa Fe Institute in
New Mexico, where he was a research professor until moving to the
University of Michigan in 2002. He is currently Associate Professor of
Physics and Complex Systems at Michigan, holding a joint appointment in
the Physics Department and the Center for the Study of Complex Systems.
His research in statistical physics focuses particularly on social
networks, network epidemiology, and computer algorithms for network
analysis.

The seminar will be preceded by an introductory student presentation.
Those not taking the class are also welcome to attend.

Thursday, May 11, Room 35-225, 2:00-2:30pm Erez Lieberman, MIT and
Harvard Evolutionary Graph Theory

Abstract: Evolutionary processes may be dramatically amplified or
completely suppressed by the effects of spatiotemporal structure. In
this talk, we will discuss the Isothermal Theorem and the Structure
Theorems of Evolutionary Graph Theory, and introduce the notion of
selection amplifiers and suppressors. Using the methods of statistical
mechanics, we will derive a first-order theory of neutral strategies in
the case of frequency dependent evolution on graphs. Evolution on
cascade graphs and "magnetization" results will be introduced as time
allows.

Networks and Dynamics seminars: http://mit.edu/vdb/www/6.977/


_______________________________________________
Seminars mailing list
Seminars at lists.csail.mit.edu
https://lists.csail.mit.edu/mailman/listinfo/seminars




More information about the Nrg-l mailing list