The 16th International Conference on
<br>RANDOM STRUCTURES AND ALGORITHMS, Poznań, August 5-9, 2013

Main page : Invited speakers : Program : Participants : Location and accommodation : Financial support : How to contact us : Random Run : Currency : Travel : Hotel : Registration : Previous Conference


See also Outline

Monday (5.08)

9:00-9:05 Opening ceremony
9:05-10:00 Béla Bollobás
Bootstrap percolation -- critical probability and speed
10:00-10:30 coffee break
10:30-11:10 Alan Frieze
The cover time of random walks on random graphs
11:15-11:55 Svante Janson
An epidemic on a random graph with given vertex degrees
12:00-12:40 Geoffrey Grimmett
Counting self-avoiding walks
12:45 Conference Photo
13:00-14:00 lunch
14:30-15:10 Gyula O. H. Katona
Some recent results
15:15-15:55 Jaroslav Nešetřil
Orderings and orientations of sparse graphs
16:00-16:30 coffee break
16:30-17:10 Vera Sós
Induced subgraphs and Ramsey colorings
17:15-17:55 Joel Spencer
From Erdős to Algorithms
18:15 Welcoming Reception

Tuesday (6.08)

9:05-10:00 Mathias Schacht
Extremal results in random graphs
10:00-10:30 coffee break
10:30-10:55Julia Boettcher
Improved counting relative to pseudorandom graphs
Tobias Müller
Logical limit laws for random graphs from minor closed classes
Oliver Cooley
The Phase Transition for the Giant Component in Random Hypergraphs
Małgorzata Sulkowska
From directed path to linear order - the best choice problem for powers of directed path
Rani Hod
Component games on random graphs
11:00-11:25Peter Allen
A sparse blow-up lemma
Dieter Mitsche
Maximum degree in minor-closed classes of graphs
Christoph Koch
Size of the largest component in a multi-type generalization of Erdős-Rényi random graphs
Małgorzata Kuchta
Monotone case for extended process
Rajko Nenadov
On the threshold for the Maker-Breaker H-game
11:30-11:55Humberto Naves
Discrepancy of random graphs and hypergraphs
Valentas Kurauskas
On graphs containing few disjoint excluded minors
Stephen Young
Connectivity of Stochastic Kronecker Graphs
John Lapinskas
Optimal covers with Hamilton cycles in random graphs
Asaf Ferber
Generating random graphs in biased Maker-Breaker games
12:00-12:25Andrzej Dudek
On generalized Ramsey numbers of Erdős and Rogers
Richard Montgomery
Small minors and topological minors
Tamás Makai
Properties of the Stochastic Kronecker graph
Peter Heinig
When Hamilton circuits generate the cycle space of a random graph
Andrew Beveridge
Maker-Breaker Games on Random Geometric Graphs
12:30-12:55Bartosz Zaleski
Avoiding tight twins in sequences
Rob Morris
The triangle-free process and R(3,k)
Michel Bode
On the component structure of random geometric graphs on the hyperbolic plane
Dan Hefetz
Random directed graphs are robustly Hamiltonian
Gal Kronenberg
Random-Turn Maker-Breaker Games
13:00-14:00 lunch
14:30-15:00 Graham Brightwell
A differential equation method with applications to routing models I
15:00-15:30 Malwina Luczak
A differential equation method with applications to routing models II
15:30-16:00 Nick Wormald
A new model for analysis of the random graph d-process
16:00-16:30 coffee break
16:30-17:00 József Balogh
Phase transitions in Ramsey-Turán Theory
17:00-17:30 Colin Cooper
The height of random $k$-trees and related branching processes
17:30-18:00 Gregory Sorkin
The Satisfiability Threshold for k-XORSAT

Wednesday (7.08)

9:05-10:00 Gil Kalai
Influences, thresholds, and tribes
10:00-10:30 coffee break
10:30-10:55Richard Mycroft
Polynomial-time perfect matchings in dense hypergraphs
Paul Russell
Probably Intersecting Families
Nikolaos Fountoulakis
Discontinuous bootstrap percolation in power-law random graphs
Cecilia Holmgren
Stein Couplings to Show Limit Laws for Fringe Trees
Lale Ozkahya
Anti-Ramsey number of matchings in hypergraphs
11:00-11:25Anand Srivastav
Randomized Approximation of b-Matching in Hypergraphs
Hiệp Hàn
Intersecting families in random uniform hypergraphs
Andrew Uzzell
The time of bootstrap percolation with dense initial sets
Kevin Leckey
The External Path Length in Tries under the Markov Model
Kinga Dąbrowska
Multicolor Ramsey numbers for some sequences of graphs
11:30-11:55Cyril Banderier
Average case analysis of np-complete problems: why so many algorithms have a n^(ln n) complexity?
Wenying Gan
Sperner's Theorem and a Problem of Erdős-Katona-Kleitman
Michał Przykucki
Bootstrap percolation on Galton-Watson trees
Liudmila Ostroumova
Recency-based preferential attachment models
Halina Bielak
Some results on Turán and Ramsey numbers for semi-topological graphs
12:00-12:25Uwe Roesler
On the Quicksort process
Shagnik Das
The minimum number of disjoint pairs in set systems and related problems
Paul Smith
Generalized bootstrap percolation
John Haslegrave
Average subtree density of series-reduced trees
Sebastian Kieliszek
Turán numbers for some linear forests
12:30-12:55Krzysztof Krzywdziński
Distributed algorithms for random graphs
Jan Volec
A problem of Erdős and Sós on 3-graphs
  Julia Ehrenmüller
Longest Paths in Series-Parallel Graphs
Kamil Powroźnik
The Turán Problem for some unicyclic graphs
13:00-14:00 lunch
  excursion + Random Run

Thursday (8.08)

9:05-10:00 Michael Krivelevich
Random subgraphs of large minimum degree graphs
10:00-10:30 coffee break
10:30-10:55Po-Shen Loh
Judicious partitions of directed graphs
Pawel Prałat
Chasing robbers on random geometric graphs
Roman Glebov
On bounded degree spanning trees in the random graph
Thomas Vallier
Bootstrap percolation on a graph with random and local connections
Andreas Noever
Online Ramsey Games for Triangles in Random Graphs
11:00-11:25Paweł Hitczenko
Weighted random staircase tableaux
Dominik Vu
Cops and Robber on the n-dimensional torus
Xavier Pérez-Giménez
Arboricity and spanning-tree packing in random graphs with an application to load balancing
Daniel Štefankovič
Inapproximability for Antiferromagnetic Spin Systems in the Tree Non-Uniqueness Region
Mikhail Lavrov
The game chromatic number of sparse random graphs
11:30-11:55Ljuben Mutafchiev
The size of the largest part in weighted partitions of integers into powers of primes
Will Perkins
Thresholds for Random Geometric k-SAT
Alon Naor
Counting bounded degree spanning trees in random graphs
Ivona Bezáková
Minimum cuts in planar graphs: sampling, counting, and connectivity
Andrei Raigorodskii
The chromatic numbers of random subgraphs of distance graphs
12:00-12:25Eugenijus Manstavičius
An analytic comparative method for decomposable structures
Maksim Zhukovskii
When does zero-one k-law hold?
Andrew McDowell
Non-vertex balanced factors in random graphs
Charilaos Efthymiou
MCMC sampling colourings and independent sets of G(n,d/n) near the uniqueness threshold
Ross Kang
Decreasing the Chromatic Number of a Random Graph
12:30-12:55Piotr Śniady
Asymptotic determinism of Robinson-Schensted algorithm
Svetlana Popova
Zero-one laws for random distance graphs with vertices in {-1;0;1}^n
Jie Ma
The maximum number of q-colorings in graphs
Mario Ullrich
Rapid mixing for the non-critical random-cluster model on the square lattice
13:00-14:00 lunch
14:30-15:00 Aravind Srinivasan
Extensions and New Constructive Versions of the Lovász Local Lemma
15:00-15:30 Daniel Král
Finitely forcible graphons and permutons
15:30-16:00 Jacob Fox
A relative Szemerédi theorem
16:00-16:30 coffee
16:30-17:00 Benny Sudakov
Cores of random graphs are born Hamiltonian
17:00-17:30 Stefanie Gerke
Controllability and matchings in random bipartite graphs with a fixed degree distribution
17:30-18:00 David Conlon
Almost-spanning universality in random graphs
19:30 Banquet

Friday (9.08)

9:05-10:00 Oleg Pikhurko
Flag Algebra Method in Extremal Combinatorics
10:00-10:30 coffee break
10:30-10:55Wojciech Samotij
The typical structure of sparse K_{r+1}-free graphs
Mark Walters
Optimal Resistor Networks
Dmitry Shabanov
Equitable two-colorings of uniform hypergraphs
Daniel Reichman
Contagious Sets in Expanders
Mindaugas Bloznelis
Clustering properties of intersection graphs and affiliation networks
11:00-11:25Angelica Pachon Pinzon
Evolution of a modified binomial random graph
Lutz Warnke
The evolution of subcritical Achlioptas processes
Andrey Kupavskii
Unit distance graphs with no large cliques or short cycles and high chromatic number
Urszula Romańczuk
The explicit construction of a new family of expander graphs of large girth and their cryptographic applications
Katarzyna Rybarczyk
Coupling, random intersection graphs and Hamilton cycles
11:30-11:55Guillem Perarnau
Random subgraphs make identification affordable
Ali Pourmiri
Faster Rumor Spreading with Multiple Calls
Jakub Przybyło
Asymptotically optimal neighbour sum distinguishing colourings of graphs
Monika Polak
On a new family of expander graphs and their applications
Victor Falgas-Ravry
Random subcube intersection graphs
12:00-12:25Abbas Mehrabian
Estimating the Diameters of Two Random Graph Models using a Theorem of Broutin and Devroye
Lajos Vágó
Projections of fractal percolations in higher dimensions
Pu Gao
Inside the clustering threshold for random linear equations
Katherine Staden
The robust component structure of dense regular graphs
David Penman
Fixed-point polynomials of permutation groups
12:30-12:55István Kolossváry
Distances in random Apollonian networks
  Cristiane Sato
Counting sparse connected 3-uniform hypergraphs
Fiona Skerman
Modularity in random regular graphs and lattices
13:00-14:00 lunch
14:00-14:30 Mihyun Kang
Chasing the Giant Component in Random Graph Processes
14:30-15:30 Noga Alon
The cover number of a matrix and its applications