Graph explorer

Expected Crossing Numbers

The expected value for the weighted crossing number of a randomly weighted graph is studied. A variation of the Crossing Lemma for expectations is proved. We focus on the case where the edge-weights are independent random variables that are uniformly distributed on [0,1].

4 nodes3 linksoverview previewExpected Crossing Numbers
4 nodes3 links
Expected Crossing Numbers4 visible / 4 total nodes / 4 links
Co-authorshipAuthorshipAuthorshipTopic signalWExpected Crossing Numberspreprint / 2010ABojan MoharResearcherATamon StephenResearcherTmath.CO8936 works
PaperSignal 103 links

Expected Crossing Numbers

preprint / 2010

Open