Fast calculation of the variance of edge crossings in random linear arrangements

03/06/2020
by   Lluís Alemany-Puig, et al.
0

The interest in spatial networks where vertices are embedded in a one-dimensional space is growing. Remarkable examples of these networks are syntactic dependency trees and RNA structures. In this setup, the vertices of the network are arranged linearly and then edges may cross when drawn above the sequence of vertices. Recently, two aspects of the distribution of the number of crossings in uniformly random linear arrangements have been investigated: the expectation and the variance. While the computation of the expectation is straightforward, that of the variance is not. Here we present fast algorithms to calculate that variance in arbitrary graphs and forests. As for the latter, the algorithm calculates variance in linear time with respect to the number of vertices. This paves the way for many applications that rely on an exact but fast calculation of that variance. These algorithms are based on novel arithmetic expressions for the calculation of the variance that we develop from previous theoretical work.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/09/2019

Edge crossings in random linear arrangements

In spatial networks, vertices are arranged in some space and edges may c...
research
03/06/2020

Reappraising the distribution of the number of edge crossings of graphs on a sphere

Many real transportation and mobility networks have their vertices place...
research
05/09/2023

Random processes for generating task-dependency graphs

We investigate random processes for generating task-dependency graphs of...
research
07/12/2022

Linear-time calculation of the expected sum of edge lengths in planar linearizations of trees

Dependency graphs have proven to be a very successful model to represent...
research
08/04/2017

Convergence of Variance-Reduced Stochastic Learning under Random Reshuffling

Several useful variance-reduced stochastic gradient algorithms, such as ...
research
11/19/2019

Probabilistic Properties of GIG Digraphs

We study the probabilistic properties of the Greatest Increase Grid (GIG...

Please sign up or login with your details

Forgot password? Click here to reset