November 20th, 4.10pm,
Olds-Upton 207
This talk is motivated in general by the renewed interest in
network formation and in particular by possible application of mathematical
theories and computer science in the study of social structures such as
co-authorship or friendship networks "old-boy" networks, etc.
In the first part of this talk we will introduce the world of networks. We
will show that the concept of interconnected entities appear in several
context both in our everyday life and in different aspects of science from
physics through chemistry, biology, economy to social sciences and
humanities.
The second part contains an introduction to a possible mathematical
description of networks: a brief overview of real-world graphs. As we are
specifically interested in the evolution of social systems we will
concentrate on graphs related to them and measures useful to numerically
characterize such graphs with special attention paid to the (recently
so-called) scale-free graphs.
In the third part of the talk models of network development relevant for
studying the formation of different social systems will be examined. We will
touch on the Erdős-Rényi (the random graph), Watts-Strogatz (the small-world
graph) and Barabási-Albert (graph with growth and preferential attachment)
models describing their algorithms and the properties of networks they
generate. Finally we will discuss the model we developed to simulate
friendship formation and show results calculated analytically or generated
by computer simulations.
Intended audience of this talk are mainly math, computer science, physics,
sociology and psychology students and faculty interested in network
formation, the description of social networks and applications of
graph-theoretical tools and numerical simulations.
|