rlogo

European Institute for Statistics, Probability, Stochastic Operations Research
and their Applications

About | Research | Events | People | Reports | Alumni | ContactHome


September 11-15, 2017

 

Workshop
on
 

Randomness and Graphs:

Processes and Structures

   

In the most general formulation, a random geometric graph is what you get if you take a random set of points
 in some metric space and you join pairs of points depending on some rule
 (which may include additional randomness).
A special case is the Gilbert model where we take n points uniformly at random in the square (or d-dimensional hypercube)
and connect two points if the distance is less than r.
The model is named after E.N. Gilbert who defined a very similar model in 1961. Image and caption by Tobias Mller
(http://www.staff.science.uu.nl/~muell001/).

 

    

SUMMARY REGISTRATION SPEAKERS

PROGRAMME

ABSTRACTS

SPONSORED BY:

 

SUMMARY

The aim of this workshop is to bring together researchers to discuss the latest developments in various topics at the interface of probability, combinatorics, and algorithms including amongst others:
- Random graphs and matrices
- Threshold phenomena
- Discrete random processes and algorithms on graphs

 

ORGANIZER

Luca Avena Leiden University
Jop Brit CWI
Remco van der Hofstad TU Eindhoven
Tim Hulshof TU Eindhoven
Jlia Komjthy TU Eindhoven
Viresh Patel University of Amsterdam
Guus Regts University of Amsterdam

 

CONFIRMED SPEAKERS

Dimitris Achlioptas  
Omer Angel  
Graham Brightwell  
Elisabeta Candellero  
Mia Deijffen  
David Gamarnik  
Alexandre Gaudilliere  
Christina Goldschmidt  
Mark Jerrum  
Ross Kang  
Malwina Luczak  
Jason Miller  
Tobias Muller  
Will Perkins  
Sanchayan Sen  
Perla Sousi  
Joel Spencer Courant Institute (New York)
Alexandre Stauffer  

 

PROGRAMME

MONDAY September 11

       
       
       
       
       
       
       
       
       

 

TUESDAY September 12

       
       
       
       
       
       
       
       

 


WEDNESDAY September 13

       
       
       
       
       

 

THURSDAY September 14

       
       
       
       
       

 

FRIDAY September 15

       
       
       
       
       

 


***************************************************************************************************************************************

ABSTRACTS


Mark Jerrum

Random cluster dynamics for the Ising model is rapidly mixing

We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at q = 2 is bounded by a polynomial in the size of the underlying graph. As a consequence, the Swendsen-Wang algorithm for the ferromagnetic Ising model at any temperature has the same polynomial mixing time bound.


Malwina Luczak

Extinction time for the weaker of two competing stochastic SIS logistic epidemics

We consider a simple stochastic model for the spread of a disease caused by two virus strains in a closed homogeneously mixing population of size N. In our model, the spread of each strain is described by the stochastic logistic SIS epidemic process in the absence of the other strain, and we assume that there is perfect cross-immunity between the two virus strains, that is, individuals infected by one strain are temporarily immune to re-infections and infections by the other strain. For the case where one strain has a strictly larger basic reproductive ratio than the other, and the stronger strain on its own is supercritical (that is, its basic reproductive ratio is larger than 1), we derive precise asymptotic results for the distribution of the time when the weaker strain disappears from the population, that is, its extinction time. We further consider what happens when the difference between the two reproductive ratios may tend to 0.
(joint work with Fabio Lopes)


Will Perkins

Phase transitions and the cavity method

Originally developed by statistical physicists to understand the behavior of glassy materials, the powerful but non-rigorous cavity method has subsequently been used to describe in great detail phase transitions in random graphs and random computational problems. Using random graph coloring and the stochastic block model as running examples, I will describe how the cavity method pinpoints the condensation and information theoretic thresholds respectively, and present some of the mathematical tools we can use to make the method rigorous in these cases.
(joint work with Amin Coja-Oghlan, Florent Krzakala, and Lenka Zdeborova)




 

Joel Spencer

Erdos-Renyi Revisited

The "double jump" at np=1 shown by Paul Erdos and Alfred Renyi nearly sixty years ago remains a bedrock of our studies of threshold phenomenon. The perspectives on their discovery, however, have changed over the decades. In this semi-expository talk the speaker will discuss the various approaches to understanding of this "mother of all phase transitions."


 

 

 


 

PRACTICAL INFORMATION

      Venue

Eurandom, Mathematics and Computer Science Dept, TU Eindhoven,

Den Dolech 2, 5612 AZ  EINDHOVEN,  The Netherlands

Eurandom is located on the campus of Eindhoven University of Technology, in the Metaforum building (4th floor) (about the building). The university is located at 10 minutes walking distance from Eindhoven main railway station (take the exit north side and walk towards the tall building on the right with the sign TU/e).
Accessibility TU/e campus and map.

 

 

      Registration

Registration is free, but compulsory for speakers and participants. Registration is now open. Please go to: REGISTRATION

 

 

      Accommodation

For invited speakers and organizers we will take care of accommodation. Other attendees will have to make their own arrangements.

For hotels around the university, please see: Hotels (please note: prices listed are "best available").  Reimbursement available up to 80 euro per night.

More hotel options can be found on the webpages of the Tourist Information Eindhoven, Postbus 7, 5600 AA Eindhoven.

 

      Travel

For those arriving by plane, there is a convenient direct train connection between Amsterdam Schiphol airport and Eindhoven. This trip will take about one and a half hour. For more detailed information, please consult the NS travel information pages.

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.

 

      Conference facilities : Conference room, Metaforum Building  MF11&12

The meeting-room is equipped with a data projector, an overhead projector, a projection screen and a blackboard. Please note that speakers and participants making an oral presentation are kindly requested to bring their own laptop or their presentation on a memory stick.

 

      Conference Secretariat

Upon arrival, participants should register with the workshop officer, and collect their name badges. The workshop officer will be present for the duration of the conference, taking care of the administrative aspects and the day-to-day running of the conference: registration, issuing certificates and receipts, etc.

 

      Cancellation

Should you need to cancel your participation, please contact Patty Koorn, the Workshop Officer.

 

     ●      Contact

Mrs. Patty Koorn, Workshop Officer, Eurandom/TU Eindhoven, koorn"at"eurandom.tue.nl

 

 


         

        

Last updated 17-07-17,
by PK

 P.O. Box 513, 5600 MB Eindhoven, The Netherlands
tel. +31 40 2478100  
  e-mail: info@eurandom.tue.nl