RS&A2015

Program

SUNDAY

4:00-6:00PM

Pre-conference reception.
Cohon room of the Cohon University Center.

MONDAY

8:00-9:00	light breakfast
9:10-9:15	Opening Ceremony
Session FF1
9:15-9:55	Martin Dyer The chromatic number of a random hypergraph
10:00-10:40	Ravi Kannan The Planted Gaussian Problem
10:40-11:05	coffee break
Session FF2
11:05-11:45	Michael Krivelevich On some Hamiltonicity problems in random graphs
11:50-12:30	Colin McDiarmid Hamilton cycles in dense graphs
12:30-2:00	lunch break
Session FF3
2:00-2:40	Mike Molloy Freezing in colourings of a random graph
2:45-3:25	Dhruv Mubayi Packing problems in quasirandom hypergraphs
3:30-4:10	Boris Pittel Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs.
4:10-4:35	coffee break
Session FF4
4:35-5:15	Gregory Sorkin VCG auction mechanism cost expectations and variances
5:20-6:00	Santosh Vempala On the Complexity of Detecting Planted Solutions

TUESDAY

8:00-9:00	light breakfast
9:10-10:00	Eyal Lubetzky Random walks on the random graph
10:00-10:30	coffee break
Sessions 1A, 1B, 1C
	A - Rashid Auditorium	B - Gates-Hilman room 4307	C - Gates-Hilman room 4405
10:30-10:55	John Wierman On percolation threshold curves for 3-uniform hypergraphs	Florian Pfender Semidefinite Programming and Ramsey Numbers	Dan Poole On loose connectivity of a random hypergraph
11:00-11:25	Tobias Muller The critical probability for confetti percolation equals 1/2	Po-Shen Loh Directed paths: from Ramsey to Ruzsa and Szemeredi	Oliver Cooley Smoothness for high-order connectivity in random hypergraphs
11:30-11:55	Amites Sarkar Coverage and Percolation in the Secrecy Model	Deepak Bal Monochromatic covers and partitions of (pseudo)random graphs	Christoph Koch Evolution of high-order connected components in random hypergraphs
12:00-12:25	Małgorzata Sulkowska Secretary problem for powers of paths via percolation	Mikhail Pyaderkin/ Andrei Raigorodskii The independence numbers and the chromatic numbers of random subgraphs of Kneser's graphs and their generalizations	Felicia Rassmann A positive temperature Phase Transition in Random Hypergraph 2-coloring
12:30-2:00	lunch break
2:00-2:50	Prasad Tetali Discrete curvature: implications and applications
2:50	Conference Photo
3:00-3:30	coffee
Sessions 2A, 2B, 2C
	A - Rashid Auditorium	B - Gates-Hilman room 4307	C - Gates-Hilman room 4405
3:30-3:55	Hoi Nguyen On eigenvalue repulsion of Erdos-Renyi random matrices	Gal Kronenberg Packing, Counting and Covering Hamilton cycles in random directed graphs	Yuval Peled On the phase transition in random simplicial complexes
4:00-4:25	Richard Darling Rank deficiency in sparse random GF[2] matrices	Michelle Delcourt Intersecting families in random settings	Kathrin Skubch How does the core sit inside the mantle?
4:30-4:55	Sean O'Rourke Singular values and vectors under random perturbation	Roman Glebov Comparable pairs in families of sets	Philipp Sprüssel The phase transition of graphs embeddable on a surface of positive genus
5:00-5:25	Philip Matchett Wood The eigenvalues of a fixed matrix plus small random noise	Ares Méroueh Lubell mass and induced partially ordered sets	Xing Shi Cai The graph structure of a deterministic automaton chosen at random
Random Run

WEDNESDAY

8:00-9:00	light breakfast
9:10-10:00	Amin Coja-Oghlan Belief Propagation
10:00-10:30	coffee break
Sessions 3A, 3B, 3C
	A - Rashid Auditorium	B - Gates-Hilman room 4307	C - Gates-Hilman room 4405
10:30-10:55	Xavier Pérez-Giménez Strong-majority bootstrap percolation on regular graphs with low dissemination threshold	Dániel Korándi Decomposing random graphs into few cycles and edges	Tuan Tran A Density Turan Theorem
11:00-11:25	Michal Przykucki On the maximum running time in graph bootstrap percolation	Caroline Terry Discrete metric spaces: global structure, enumeration, and 0-1 laws	Clara Shikhelman Many T copies in H-free graphs
11:30-11:55	Tamas Makai Bootstrap percolation process on inhomogeneous random graphs	Kevin Costello Integral Graphs are Very Rare	Anton Bernshteyn The Local Action Lemma
12:00-12:25	Nikolaos Fountoulakis A phase transition on the evolution of bootstrap percolation processes on preferential attachment graphs	Tibor Szabo Half-random Maker-Breaker games	Krzysztof Choromanski A tale of two properties of random graphs
12:30-2:00	lunch break
2:00-2:50	Ryan O'Donnell Quantum Spectrum Estimation
3:00-5:00	excursion
5:00-6:00	cocktail
6:00-8:00	banquet

THURSDAY

8:00-9:00	light breakfast
9:10-10:00	Andrew Thomason Containers and list colourings
10:00-10:30	coffee break
Sessions 4A, 4B, 4C
	A - Rashid Auditorium	B - Gates-Hilman room 4307	C - Gates-Hilman room 4405
10:30-10:55	Chaim Even Zohar Random knots	Tim Garoni The worm process for the Ising model is rapidly mixing	Louis DeBiasio Arbitrarily oriented Hamilton cycles: an extension of Dirac's theorem to digraphs
11:00-11:25	Ke Wang Random weighted projections, random quadratic forms and random eigenvectors	Andrew Beveridge A Hitting Time formula for the Discrete Green's Function	Richard Mycroft Tight cycles and regular slices in dense hypergraphs
11:30-11:55	Yen Do Real roots of random polynomials	Antonio Blanca Dynamics for the mean-field random-cluster model	Theodore Molla Triangle factors in graphs with large minimum degree and no large independent sets
12:00-12:25	Mihyun Kang The Minimum Bisection in the Planted Bisection Model	Thomas Hayes Codes, Lower Bounds and Phase Transitions in the Symmetric Rendezvous Problem	Matthew Kwan Bounded-degree spanning trees in randomly perturbed graphs
12:30-2:00	lunch break
2:00-2:50	Jozsef Balogh On some applications of the container method
3:00-3:20	coffee
Sessions 5A, 5B, 5C
	A - Rashid Auditorium	B - Gates-Hilman room 4307	C - Gates-Hilman room 4405
3:20-3:45	Mindaugas Bloznelis Modeling evolving affiliation networks via random intersection graph processes	Anshui Li Treewidth of random geometric graphs	Will Perkins Birthday Inequalities, Hard Spheres, and Independent Sets
3:50-4:15	Sang June Lee CANCELLED On a phase transition of the random intersection graph: Supercritical region	Milan Bradonjic Scaling Laws for Maximum Coloring of Sparse Random Geometric Graphs	Zilin Jiang Topological Method for the Colored Bárány’s Theorem
4:20-4:45	Katarzyna Rybarczyk Distributed MST algorithms and min-degree graph processes.	Zizhen Chen Bipartite Subgraphs of Random Geometric Graphs	Nor Jaafari Random graph colorings
4:45-5:00	fresh air break
Sessions 6A, 6B, 6C
	A - Rashid Auditorium	B - Gates-Hilman room 4307	C - Gates-Hilman room 4405
5:00-5:25	Joel Spencer The First Order World of Galton-Watson Trees -- Preliminary Report	Charles Burnette Representing Random Permutations as a Product of Two Involutions	Abram N Magner Combinatorics of a Sequence to Self-Avoiding Walk Channel
5:30-5:55	Aleksandr Matushkin Universal Zero-One k-Law	Pawel Hitczenko Random trees obtained from permutation graphs	Jan Volec Properly colored and rainbow copies of graphs with few cherries
6:00-6:25	Maksim Zhukovskii On infinite spectra of first-order properties	Anant Godbole A Variety of Threshold Progressions Related to Coverings and Packings	Alexey Pokrovskiy Rainbow matchings and rainbow connectedness

FRIDAY

8:00-9:00	light breakfast
9:10-10:00	Venkatesan Guruswami Polar codes: Reliable communication with complexity polynomial in the gap to Shannon capacity
10:00-10:30	coffee break
Sessions 7A, 7B, 7C
	A - Rashid Auditorium	B - Gates-Hilman room 4307	C - Gates-Hilman room 4405
10:30-10:55	Guillem Perarnau Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture	Matas Sileikis Embedding the binomial random graph in the regular random graph	Mariana Olvera-Cravioto Ranking algorithms on directed random networks
11:00-11:25	Amanda Redlich Power laws and the power of two choices	Andrzej Dudek On Hamilton Cycles in Random Hypergraphs	Aarti Singh Column subset selection from partially observed data
11:30-11:55	Sergey Tilga On distribution of small subgraphs in the Buckley--Osthus random graph model	Nemanja Skoric Robust Hamiltonicity of random directed graphs	Pedro Vieira Finding structures in random graphs economically
12:00-12:25	Laura Eslava High degrees in random recursive trees	Adam Wagner Applications of the Container Method	Charalampos Tsourakakis Scalable Dense Subgraph Discovery
12:30-2:00	lunch break
Sessions 8A, 8B, 8C
	A - Rashid Auditorium	B - Gates-Hilman room 4307	C - Gates-Hilman room 4405
2:00-2:25	Olaf Parczyk Spanning structures and universality in sparse random hypergraphs	Pawel Pralat Almost all 5-regular graphs have a 3-flow	L.N. Iskhakov/M. S. Mironov Diameter of a random distance graph
2:30-2:55	Rajko Nenadov Almost-spanning universality in random graphs	Samuel Hetterich On the chromatic number of random regular graphs	Kyle Luh Random Matrices: l1 Concentration and Dictionary Learning with Few Samples
3:00-3:30	coffee
Sessions 9A, 9B, 9C
	A - Rashid Auditorium	B - Gates-Hilman room 4307	C - Gates-Hilman room 4405
3:30-3:55	Laura Florescu Spectral thresholds in the stochastic block model	Lutz Warnke The phase transition in Achlioptas processes	Daniel Freund Contagious Sets in Dense Graphs
4:00-4:25	Oanh Nguyen Anti-concentration inequalities for polynomials	Frank Mousset Connectivity Thresholds for Bounded Size Rules	Hong Liu The number of maximal sum-free subsets of integers
4:30-4:55	Daniel Kral Finitely forcible limits of graphs	Sarka Petrickova Number of maximal triangle-free graphs	Amanda Lohss The Asymptotic distribution of Parameters in Random Weighted Staircase Tableaux

THE END