Michael Rink
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Michael Rink has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Martin Dietzfelbinger
Technische Universität Ilmenau
4 shared publications - Hendrik Peilke
IBYKUS AG für Informationstechnologie Erfurt Germany
1 shared publication - Michael Mitzenmacher
Harvard University, Cambridge, MA, USA
1 shared publication
Latest Publications
- 4 October 2014
- Published by Springer Nature in Theory of Computing Systems
- Vol. 56 (4) , 593-611
Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs
- 4 October 2014
- Published by Springer Nature in Theory of Computing Systems
- Vol. 56 (4) , 593-611
Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs
- Open Access
Towards Optimal Degree-distributions for Left-perfect Matchings in Random Bipartite Graphs
Consider a random bipartite multigraph $G$ with $n$ left nodes and $m \geq n \geq 2$ right nodes. Each left node $x$ has $d_x \geq 1$ random right neighbors. The average left degree $\Delta$ is fixed, $\Delta \geq 2$. We ask whether for the probability that $G$ has a left-perfect matching it is advantageous not to fix $d_x$ for each left node $x$ but rather choose it at random according to some (cleverly chosen) distribution. We show the following, provided that the degrees of the left nodes are independent: If $\Delta$ is an integer then it is optimal to use a fixed degree of $\Delta$ for all left nodes. If $\Delta$ is non-integral then an optimal degree-distribution has the property that each left node $x$ has two possible degrees, $\floor{\Delta}$ and $\ceil{\Delta}$, with probability $p_x$ and $1-p_x$, respectively, where $p_x$ is from the closed interval $[0,1]$ and the average over all $p_x$ equals $\ceil{\Delta}-\Delta$. Furthermore, if $n=c\cdot m$ and $\Delta>2$ is constant, then each distribution of the left degrees that meets the conditions above determines the same threshold $c^*(\Delta)$ that has the following property as $n$ goes to infinity: If $cc^*(\Delta)$ then there exists no left-perfect matching with high probability. The threshold $c^*(\Delta)$ is the same as the known threshold for offline $k$-ary cuckoo hashing for integral or non-integral $k=\Delta$.Open AccessTowards Optimal Degree-distributions for Left-perfect Matchings in Random Bipartite Graphs
Consider a random bipartite multigraph $G$ with $n$ left nodes and $m \geq n \geq 2$ right nodes. Each left node $x$ has $d_x \geq 1$ random right neighbors. The average left degree $\Delta$ is fixed, $\Delta \geq 2$. We ask whether for the probability that $G$ has a left-perfect matching it is advantageous not to fix $d_x$ for each left node $x$ but rather choose it at random according to some (cleverly chosen) distribution. We show the following, provided that the degrees of the left nodes are independent: If $\Delta$ is an integer then it is optimal to use a fixed degree of $\Delta$ for all left nodes. If $\Delta$ is non-integral then an optimal degree-distribution has the property that each left node $x$ has two possible degrees, $\floor{\Delta}$ and $\ceil{\Delta}$, with probability $p_x$ and $1-p_x$, respectively, where $p_x$ is from the closed interval $[0,1]$ and the average over all $p_x$ equals $\ceil{\Delta}-\Delta$. Furthermore, if $n=c\cdot m$ and $\Delta>2$ is constant, then each distribution of the left degrees that meets the conditions above determines the same threshold $c^*(\Delta)$ that has the following property as $n$ goes to infinity: If $cc^*(\Delta)$ then there exists no left-perfect matching with high probability. The threshold $c^*(\Delta)$ is the same as the known threshold for offline $k$-ary cuckoo hashing for integral or non-integral $k=\Delta$. - Open Access
On Thresholds for the Appearance of 2-cores in Mixed Hypergraphs
We study thresholds for the appearance of a 2-core in random hypergraphs that are a mixture of a constant number of random uniform hypergraphs each with a linear number of edges but with different edge sizes. For the case of two overlapping hypergraphs we give a solution for the optimal (expected) number of edges of each size such that the 2-core threshold for the resulting mixed hypergraph is maximized. We show that for adequate edge sizes this threshold exceeds the maximum 2-core threshold for any random uniform hypergraph, which can be used to improve the space utilization of several data structures that rely on this parameter.
Open AccessOn Thresholds for the Appearance of 2-cores in Mixed Hypergraphs
We study thresholds for the appearance of a 2-core in random hypergraphs that are a mixture of a constant number of random uniform hypergraphs each with a linear number of edges but with different edge sizes. For the case of two overlapping hypergraphs we give a solution for the optimal (expected) number of edges of each size such that the 2-core threshold for the resulting mixed hypergraph is maximized. We show that for adequate edge sizes this threshold exceeds the maximum 2-core threshold for any random uniform hypergraph, which can be used to improve the space utilization of several data structures that rely on this parameter.
- Open Access
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs
We propose a new greedy algorithm for the maximum cardinality matching problem. We give experimental evidence that this algorithm is likely to find a maximum matching in random graphs with constant expected degree c>0, independent of the value of c. This is contrary to the behavior of commonly used greedy matching heuristics which are known to have some range of c where they probably fail to compute a maximum matching.
Open AccessA More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs
We propose a new greedy algorithm for the maximum cardinality matching problem. We give experimental evidence that this algorithm is likely to find a maximum matching in random graphs with constant expected degree c>0, independent of the value of c. This is contrary to the behavior of commonly used greedy matching heuristics which are known to have some range of c where they probably fail to compute a maximum matching.
- Open Access
Cuckoo Hashing with Pages
Although cuckoo hashing has significant applications in both theoretical and practical settings, a relevant downside is that it requires lookups to multiple locations. In many settings, where lookups are expensive, cuckoo hashing becomes a less compelling alternative. One such standard setting is when memory is arranged in large pages, and a major cost is the number of page accesses. We propose the study of cuckoo hashing with pages, advocating approaches where each key has several possible locations, or cells, on a single page, and additional choices on a second backup page. We show experimentally that with k cell choices on one page and a single backup cell choice, one can achieve nearly the same loads as when each key has k+1 random cells to choose from, with most lookups requiring just one page access, even when keys are placed online using a simple algorithm. While our results are currently experimental, they suggest several interesting new open theoretical questions for cuckoo hashing with pages.
Open AccessCuckoo Hashing with Pages
Although cuckoo hashing has significant applications in both theoretical and practical settings, a relevant downside is that it requires lookups to multiple locations. In many settings, where lookups are expensive, cuckoo hashing becomes a less compelling alternative. One such standard setting is when memory is arranged in large pages, and a major cost is the number of page accesses. We propose the study of cuckoo hashing with pages, advocating approaches where each key has several possible locations, or cells, on a single page, and additional choices on a second backup page. We show experimentally that with k cell choices on one page and a single backup cell choice, one can achieve nearly the same loads as when each key has k+1 random cells to choose from, with most lookups requiring just one page access, even when keys are placed online using a simple algorithm. While our results are currently experimental, they suggest several interesting new open theoretical questions for cuckoo hashing with pages.