Suppose I have a random directed acyclic graph (DAG). By random I mean that edges are drawn uniformly at random so that the adjacency matrix is lower triangular with i.i.d. entries.
Is there any result on the average path length between two nodes of this DAG (e.g. between source and sink)? I know there are results of this kind for random graphs, but I can't seem to find anything for DAGs.