Michael Anastos

collaborators

2 papers

math.CO2020

A scaling limit for the length of the longest cycle in a sparse random digraph

Michael Anastos, Alan Frieze

We discuss the length $L_{c, n}$ of the longest directed cycle in the sparse random digraph $D_{n, p}, p = c / n$ , $c$ constant. We show that for large $c$ there exists a function $…

cs.DS2016

Purchasing a C_4 online

Michael Anastos

Let $G$ be a graph with edge set $(e_{1}, e_{2}, ... e_{N})$ . We independently associate to each edge $e_{i}$ of $G$ a cost $x_{i}$ that is drawn from a Uniform [0, 1] distribution. Suppose $…