Does graph disclosure bias reduce the cost of equity?

Research on disclosure and capital markets focuses primarily on the amount of information provided but pays little attention to the presentation format of this information. This paper examines the impact of graph utilization and graph quality (distortion) on the cost of equity capital, controlling for the interaction between disclosure and graph distortion. Despite the advantages of graphs in communicating information, our results show that graph utilization does not have a significant impact on users’ decisions. However we observe a significant (negative) association between graph distortion and the exante cost of equity. This effect though, disappears if we use realised returns as a measure of expost cost of equity. Moreover, we find that disclosure and graph distortion interact so that the impact of disclosure on the cost of capital depends on graph integrity. For low level of overall disclosure, graph distortion reduces the exante cost of equity. However for high level of disclosure graph distortion increases the exante cost of equity

A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs and its application to the detection of alternative splicing in RNA-seq data

We present a new algorithm for enumerating bubbles with length constraints in directed graphs. This problem arises in transcriptomics, where the question is to identify all alternative splicing events present in a sample of mRNAs sequenced by RNA-seq. This is the first polynomial-delay algorithm for this problem and we show that in practice, it is faster than previous approaches. This enables us to deal with larger instances and therefore to discover novel alternative splicing events, especially long ones, that were previously overseen using existing methods.Comment: Peer-reviewed and presented as part of the 13th Workshop on Algorithms in Bioinformatics (WABI2013

Node-balancing by edge-increments

Suppose you are given a graph $G=(V,E)$ with a weight assignment $w:V\rightarrow\mathbb{Z}$ and that your objective is to modify $w$ using legal steps such that all vertices will have the same weight, where in each legal step you are allowed to choose an edge and increment the weights of its end points by $1$. In this paper we study several variants of this problem for graphs and hypergraphs. On the combinatorial side we show connections with fundamental results from matching theory such as Hall's Theorem and Tutte's Theorem. On the algorithmic side we study the computational complexity of associated decision problems. Our main results are a characterization of the graphs for which any initial assignment can be balanced by edge-increments and a strongly polynomial-time algorithm that computes a balancing sequence of increments if one exists.Comment: 10 page