YEP 2007(Young European Probabilists)
workshops
Workshop on
"Random Graphs and Complex Networks"
March 19-23, 2007
EURANDOM, Eindhoven, The Netherlands
Programme &Abstracts| Participants |Registration | Practical Information | Pictures
SUMMARY
This workshop is the fourth in a successful series of YEP meetings at Eurandom in the years 2004-2006.
The research area of random graph started off with the classical paper by Erdős & Rényi in 1959 and has since then developed into a very active field at the interface between discrete mathematics and probability. Typical results concern distributions of component sizes, distances between vertices and criteria for existence of a giant component; see Bollobás (2001) for a survey. During the last few years there has been a growing interest in the use of random graphs as models for various types of complex networks such as social contact structures, the internet and power grids; see e.g. Newman and the references therein. Many of these networks have turned out to have very similar properties. For instance many of them are small worlds, meaning roughly that there are short paths between vertices at the same time as there is a high local clustering of the edges. Also, their degree sequence typically obeys a power-law, that is, the number of vertices with degree k falls off as an inverse power of k.
Since Erdős-Rényi graphs fail to reflect the above properties of real networks, the use of random graphs in complex network modelling has given rise to a number of new graph models. Initially the focus was on small-world models; see e.g. Watts, while currently most work concern models with power law degree distributions, sometimes referred to as scale-free networks; see e.g. Barabási. To be able to better understand and predict the behavior of a real-life network, it is important to further develop these models and to complete the so far predominantly heuristic results on the graph properties in these models with rigorous mathematical work. Moreover, a major goal of network modelling is to understand the dynamics of various types of processes taking place on the networks. For instance, a proper understanding of how social structure affects the spread of information and of how the topology of the world wide web affects surfing and search engines would be extremely useful. To reach this goal, it is indeed necessary to formulate realistic models and to develop effective tools for analyzing them.
The workshop offers two mini-courses: one on preferential attachment models by Oliver Riordan (Cambridge University) and one on sexual networks by Fredrik Liljeros (Stockholm University). There will also be talks by some of the participants, as well as some talks by more senior people.
MONDAY MARCH 19, 2007
9.00-9.10 Welcome | |
9.10-10.10 Fredrik Liljeros | Sexual networks |
Break | |
10.30-11.30 Fredrik Liljeros | Sexual networks |
11.35-12.35 Gerard Hooghiemstra | Distances and diameter in the configuration model |
Lunch | |
14.30-15.00 Willemien Kets | Network Games |
15.00-15.30 Oscar Sandberg | Double Clustering and Small World Navigation |
Break | |
16.00-16.30 Markus Heydenreich | Critical percolation clusters on high-dimensional boxes |
16.30-17.00 Mikael Huss | Network analysis in biology - current topics and challenges |
TUESDAY MARCH 20, 2007
09.00-10.00 Fredrik Liljeros | Recent Progress in the Study of Large Empirical Contact Networks |
Break | |
10.30-11.30 Tom Britton | Random graphs, epidemics and vaccination |
11.35-12.35 Ronald Meester | Percolation in the signal to interference ratio graph |
Lunch | |
14.30-15.30 Tom Snijders | Statistical methods for social network dynamics |
Break | |
16.00-16.30 Petter Holme | Two models of networking social agents |
16.30-17.00 Andrew Wade | Length of the random on-line nearest-neighbour graph |
WEDNESDAY MARCH 21, 2007
9.00-10.00 Olivier Riordan | The mathematics of the Barabási-Albert scale-free network I |
Break | |
10.30-11.30 Olivier Riordan | The mathematics of the Barabási-Albert scale-free network II |
11.30-12.00 Birgitte de Blasio | The Yule process and frailty |
12.00-12.30 Peter Moerters | Large deviations for empirical measures of coloured random graphs |
Lunch | |
Free afternoon. | |
18.00 h. dinner in restaurant "Listers", Kleine Berg 57h. Eindhoven, 040 - 2961370 |
THURSDAY MARCH 22, 2007
9.00-10.00 Olivier Riordan | The mathematics of the Barabási-Albert scale-free network III |
Break | |
10.30-11.30 Olivier Riordan | The mathematics of the Barabási-Albert scale-free network IV |
11.35-12.35 Tatyana Turowa | Random graphs with local and global connections |
Lunch | |
14.30-15.00 Henri van Esker |
Universality for the distance in finite variance random graphs |
15.00-15.30 Thomas Vallier | Robustness of Preferential Attachment under Deletion of Edges |
Break | |
16.00-16.30 Pierluigi Contucci | Phase Transitions in Social Sciences: Two Populations Mean Field Theory |
16.30-17.00 t.b.a. |
FRIDAY MARCH 23, 2007
9.00-10.00 Olivier Riordan | The mathematics of the Barabási-Albert scale-free network V |
Break | |
10.30-11.30 Olivier Riordan | The mathematics of the Barabási-Albert scale-free network VI |
11.35-12.35 Nelli Litvak | On the relation between PageRank and in-degree in scale-free networks |
Lunch |
There is no registration fee.
PLEASE REGISTER BY FILLING IN THE FORM
Conference Location
the workshop location is EURANDOM, Den Dolech 2, 5612 AZ Eindhoven, Laplace Building, 1st floor, LG 1.105.
EURANDOM is located on the campus of Eindhoven University of Technology, in the 'Laplacegebouw' building' (LG on the map). The university is located at 10 minutes walking distance from Eindhoven railway station (take the exit north side and walk towards the tall building on the right with the sign TU/e).
Travel
For those arriving by plane, there is a convenient train connection between Amsterdam Schiphol airport and Eindhoven, with only one change at Duivendrecht. This trip will take about two hours. For more detailed information, please consult the NS travel information pages or see EURANDOM web page location.
Many low cost carriers also fly to Eindhoven Airport. There is a bus connection to the Eindhoven central railway station from the airport. (Bus route number 401) For details on departure times consult http://www.9292ov.nl
The University can be reached easily by car from the highways leading to Eindhoven (for details, see our route descriptions or consult our map with highway connections
Hotel
For invitees EURANDOM made a preliminary group reservations in
Hotel Benno*, Wilhelminaplein 9, 5611 HE
Eindhoven, Tel. 00 31 40 2366070.
* you can have dinner in Hotel Benno with a discount of
10%.
Indicate the requested nights in the registration page.
Lunches/dinner
March 19-23 lunches are being organised; free of costs for all participants, if ordered on the registration form.
On Wednesday March 21 there will be a workshop dinner. For non-invitees an amount of 30 euro is requested, to be paid at arrival in cash (preferably exact amount in euros).
Contact
For more information please contact Mrs. Lucienne Coolen, workshop officer of EURANDOM, at coolen@eurandom.tue.nl
ORGANISERS
Prof. Dr. Remco van der Hofstad, Technische Universiteit Eindhoven/EURANDOM (NL),
rhofstad@win.tue.nl
Dr. Maria Deijfen, Stockholm University
(SE),
mia@math.su.se
This workshop is sponsored by
YEP (Young European Probabilists) workshops
2004 --
2005 --
2006
Last modified:
26-03-10
Maintained by Lucienne Coolen