School of Mathematics, University of Birmingham
Departmental Seminar
Distances in Ultrasmall Random Networks
Peter Mörters, Department of Mathematical Sciences, University of Bath
Friday 11th February 2011, 2:30-3:30pm
Room no. 222 (MAGIC Room)
Watson Building
School of Mathematics
Edgbaston Campus
University of Birmingham
Abstract:
Scale free networks are ubiquitous in our lives, appearing in the form
of social or communication networks, collaboration networks, or the
world-wide web. One of the central observations in the theory of
scale-free random networks is that in the case of power-law exponent
\tau \in (2,3) networks are ultrasmall, which means that the distance of
two randomly chosen nodes in the giant component of a graph with n
vertices is of asymptotic order log(log(n)). We refine this observation
and show that these networks can be further divided into two
universality classes corresponding to quite different internal
architecture. The talk is based on joint work with Steffen Dereich
(Marburg) and Christian Moench (Bath).
--
Apratim Guha
Lecturer
School of Mathematics
University of Birmingham
Birmingham, U.K.
Phone: 44 121 4146196
Email: [log in to unmask]
You may leave the list at any time by sending the command
SIGNOFF allstat
to [log in to unmask], leaving the subject line blank.
|