# Angelika Steger - Institute of Theoretical Computer Science, ETH Zurich

## Contact Details

NameAngelika Steger |
||

AffiliationInstitute of Theoretical Computer Science, ETH Zurich |
||

Location |
||

## Pubs By Year |
||

## Pub CategoriesMathematics - Combinatorics (13) Mathematics - Probability (4) Computer Science - Discrete Mathematics (3) Computer Science - Data Structures and Algorithms (2) Computer Science - Distributed; Parallel; and Cluster Computing (1) Computer Science - Neural and Evolutionary Computing (1) |

## Publications Authored By Angelika Steger

We consider collaborative graph exploration with a set of $k$ agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other vertices. We assume agents are deterministic, vertices are distinguishable, moves are simultaneous, and we allow agents to communicate globally. Read More

A celebrated result of R\"odl and Ruci\'nski states that for every graph $F$, which is not a forest of stars and paths of length $3$, and fixed number of colours $r\ge 2$ there exist positive constants $c, C$ such that for $p \leq cn^{-1/m_2(F)}$ the probability that every colouring of the edges of the random graph $G(n,p)$ contains a monochromatic copy of $F$ is $o(1)$ (the "0-statement"), while for $p \geq Cn^{-1/m_2(F)}$ it is $1-o(1)$ (the "1-statement"). Here $m_2(F)$ denotes the $2$-density of $F$. On the other hand, the case where $F$ is a forest of stars has a coarse threshold which is determined by the appearance of a certain small subgraph in $G(n, p)$. Read More

One of the easiest randomized greedy optimization algorithms is the following evolutionary algorithm which aims at maximizing a boolean function $f:\{0,1\}^n \to {\mathbb R}$. The algorithm starts with a random search point $\xi \in \{0,1\}^n$, and in each round it flips each bit of $\xi$ with probability $c/n$ independently at random, where $c>0$ is a fixed constant. The thus created offspring $\xi'$ replaces $\xi$ if and only if $f(\xi') > f(\xi)$. Read More

We show an $\Omega\big(\Delta^{\frac{1}{3}-\frac{\eta}{3}}\big)$ lower bound on the runtime of any deterministic distributed $\mathcal{O}\big(\Delta^{1+\eta}\big)$-graph coloring algorithm in a weak variant of the \LOCAL\ model. In particular, given a network graph \mbox{$G=(V,E)$}, in the weak \LOCAL\ model nodes communicate in synchronous rounds and they can use unbounded local computation. We assume that the nodes have no identifiers, but that instead, the computation starts with an initial valid vertex coloring. Read More

In 1962, P\'osa conjectured that a graph $G=(V, E)$ contains a square of a Hamiltonian cycle if $\delta(G)\ge 2n/3$. Only more than thirty years later Koml\'os, S\'ark\H{o}zy, and Szemer\'edi proved this conjecture using the so-called Blow-Up Lemma. Here we extend their result to a random graph setting. Read More

A random jigsaw puzzle is constructed by arranging $n^2$ square pieces into an $n \times n$ grid and assigning to each edge of a piece one of $q$ available colours uniformly at random, with the restriction that touching edges receive the same colour. We show that if $q = o(n)$ then with high probability such a puzzle does not have a unique solution, while if $q \ge n^{1 + \varepsilon}$ for any constant $\varepsilon > 0$ then the solution is unique. This solves a conjecture of Mossel and Ross (Shotgun assembly of labeled graphs, arXiv:1504. Read More

In an Achlioptas process, starting with a graph that has n vertices and no edge, in each round $d \geq 1$ edges are drawn uniformly at random, and using some rule exactly one of them is chosen and added to the evolving graph. For the class of Achlioptas processes we investigate how much impact the rule has on one of the most basic properties of a graph: connectivity. Our main results are twofold. Read More

Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have a certain number of active neighbors. Read More

In this paper we introduce a general framework for proving lower bounds for various Ramsey type problems within random settings. The main idea is to view the problem from an algorithmic perspective: we aim at providing an algorithm that finds the desired colouring with high probability. Our framework allows to reduce the probabilistic problem of whether the Ramsey property at hand holds for random (hyper)graphs with edge probability $p$ to a deterministic question of whether there exists a finite graph that forms an obstruction. Read More

**Affiliations:**

^{1}Institute of Theoretical Computer Science, ETH Zurich,

^{2}Institute of Theoretical Computer Science, ETH Zurich

**Category:**Mathematics - Combinatorics

Suppose that two players take turns coloring the vertices of a given graph G with k colors. In each move the current player colors a vertex such that neighboring vertices get different colors. The first player wins this game if and only if at the end, all the vertices are colored. Read More

A classical theorem of Ghouila-Houri from 1960 asserts that every directed graph on $n$ vertices with minimum out-degree and in-degree at least $n/2$ contains a directed Hamilton cycle. In this paper we extend this theorem to a random directed graph ${\mathcal D}(n,p)$, that is, a directed graph in which every ordered pair $(u,v)$ becomes an arc with probability $p$ independently of all other pairs. Motivated by the study of resilience of properties of random graphs, we prove that if $p \gg \log n/\sqrt{n}$, then a. Read More

We study the Maker-Breaker $H$-game played on the edge set of the random graph $G_{n,p}$. In this game two players, Maker and Breaker, alternately claim unclaimed edges of $G_{n,p}$, until all the edges are claimed. Maker wins if he claims all the edges of a copy of a fixed graph $H$; Breaker wins otherwise. Read More

In 1976 Erdos, Kleitman and Rothschild determined the number of graphs without a clique of size $\ell$. In this note we extend their result to the case of forbidden cliques of increasing size. More precisely we prove that for $\ell_n \le \frac12(\log n)^{1/4}$ there are $$2^{(1-1/(\ell_n-1))n^2/2+o(n^2/\ell_n)}$$ $K_{\ell_n}$-free graphs of order $n$. Read More

The evolution of the largest component has been studied intensely in a variety of random graph processes, starting in 1960 with the Erd\"os-R\'enyi process. It is well known that this process undergoes a phase transition at n/2 edges when, asymptotically almost surely, a linear-sized component appears. Moreover, this phase transition is continuous, i. Read More

Cuckoo hashing is an efficient technique for creating large hash tables with high space utilization and guaranteed constant access times. There, each item can be placed in a location given by any one out of k different hash functions. In this paper we investigate further the random walk heuristic for inserting in an online fashion new items into the hash table. Read More

We prove that there is a constant $c >0$, such that whenever $p \ge n^{-c}$, with probability tending to 1 when $n$ goes to infinity, every maximum triangle-free subgraph of the random graph $G_{n,p}$ is bipartite. This answers a question of Babai, Simonovits and Spencer (Journal of Graph Theory, 1990). The proof is based on a tool of independent interest: we show, for instance, that the maximum cut of almost all graphs with $M$ edges, where $M >> n$, is ``nearly unique''. Read More

Let $G=(V,E)$ be a complete $n$-vertex graph with distinct positive edge weights. We prove that for $k\in\{1,2,.. Read More