Skip to main content

graphs and networks - Question about TransitiveReductionGraph


Bug introduced in 10.0 and persisting through 12.0
TransitiveReductionGraph is new in 10.0.




In Mathematica 10.0 and 10.1, according to the documentation of TransitiveReductionGraph:



The transitive reduction h of a graph g is a graph that has the same transitive closure as g, with a minimal number of edges.



But please look at the following example:


g = Graph[

{1 -> 4, 1 -> 2, 2 -> 3, 3 -> 4},
VertexLabels -> "Name", EdgeStyle -> Arrowheads[.2],
GraphLayout -> "LayeredDigraphEmbedding"
]

original graph g


The transitive reduction of g given by TransitiveReductionGraph is g itself:


mmaTRG =
TransitiveReductionGraph[g,
VertexLabels -> "Name", EdgeStyle -> Arrowheads[.2],

GraphLayout -> "LayeredDigraphEmbedding"
]

transitive reduction of g given by MMA


But apparently there is a graph with less number of edges which has the same transitive closure as g:


betterTRG =
Graph[Range[4], {1 -> 2, 2 -> 3, 3 -> 4},
VertexLabels -> "Name", EdgeStyle -> Arrowheads[6],
GraphLayout -> "LayeredDigraphEmbedding"
]


the true transitive reduction of g


FindGraphIsomorphism @@ (
TransitiveClosureGraph /@ {mmaTRG, betterTRG}
) // Column


<| 1 -> 1, 4 -> 4, 2 -> 2, 3 -> 3 |>

So why does Mathematica gives mmaTRG while betterTRG seems to be the true solution?



Or maybe I misunderstand the documentation and/or the concept of transitive reduction?


Update:


As more than one user suspect this to be a bug of TransitiveReductionGraph, I have reported it to WRI. The case ID is 3345230.


Update 2:


The Wolfram Technical Support has confirmed it as "a known issue", but no workaround is given.



Answer



It seems that this bug has been known to Wolfram for nearly 3 years, yet very disappointingly it is still unfixed in M11.2.




Introduction


Here I give a re-implementation of transitive reduction. The single function IGVertexContract is used from IGraph/M for convenience (to contract multiple vertex sets simultaneaously). This can be re-implemented with builtins, of course.



This implementation treats these cases separately:



  • If the graph is undirected, it uses the minimum spanning tree.

  • If the graph is directed and acyclic, it will remove an edge $i \rightarrow j$ if there is any path longer than 1 also connecting $i$ and $j$. Since the graph is acyclic, any such longer path cannot include $i \rightarrow j$ itself, therefore the removal of $i \rightarrow j$ won't affect it, or the transitivity structure of the graph.

  • If the graph is directed and has cycles, then it will first break it into connected components, and contract these components into single vertices, thus obtaining an acyclic graph. The transitive reduction of this acyclic graph is computed. Finally, the vertices of each component are re-added as simple cycle graphs.


g = Graph[{1 -> 4, 1 -> 2, 2 -> 3, 3 -> 4}, VertexLabels -> "Name"]

enter image description here


transitiveReductionGraph[g, VertexLabels -> "Name"]


enter image description here




Testing


Here's a small test to show that the results are reasonable:


Table[
With[{g = DirectedGraph[RandomGraph[{10, 20}], "Acyclic"]},
IsomorphicGraphQ[
TransitiveClosureGraph@transitiveReductionGraph[g],
TransitiveClosureGraph[g]

]
], {10}]
(* {True, True, True, True, True, True, True, True, True, True} *)

Table[
With[{g = RandomGraph[{10, 20}, DirectedEdges -> True]},
IsomorphicGraphQ[
TransitiveClosureGraph@transitiveReductionGraph[g],
TransitiveClosureGraph[g]
]

], {10}]
(* {True, True, True, True, True, True, True, True, True, True} *)

Here's another test to show that TransitiveReductionGraph will frequently return wrong results and is not to be trusted.


Table[
With[{g = DirectedGraph[RandomGraph[{10, 20}], "Acyclic"]},
EdgeCount /@ {transitiveReductionGraph[g], TransitiveReductionGraph[g]}
],
{10}
]

(* {{11, 12}, {9, 12}, {10, 11}, {10, 10}, {13, 13}, {14, 14}, {11, 13}, {10, 12}, {10, 12}, {9, 12}} *)



The code


ClearAll[transitiveReductionGraph]

(* undirected *)

transitiveReductionGraph[g_?UndirectedGraphQ, opt : OptionsPattern[]] :=
FindSpanningTree[IGUnweighted[g], opt]


(* directed acyclic *)

transitiveReductionGraph[g_?AcyclicGraphQ, opt : OptionsPattern[]] :=
AdjacencyGraph[
VertexList[g],
With[{a = Unitize@AdjacencyMatrix[g], b = AdjacencyMatrix@TransitiveClosureGraph[g]},
(1 - Unitize[a.b]) a
],
opt

]

(* directed non-acyclic *)

ClearAll[namedCycle]
namedCycle[{v_}] := Graph[{v}, {}]
namedCycle[verts_] := Graph[verts, DirectedEdge @@@ Partition[verts, 2, 1, {1, 1}]]

transitiveReductionGraph[g_?DirectedGraphQ, opt : OptionsPattern[]] :=
Module[{comps = ConnectedComponents[g], gt},

gt = transitiveReductionGraph@IGVertexContract[g, comps];
Graph[GraphUnion @@ Prepend[namedCycle /@ comps, gt], opt]
]

(* other cases, e.g. mixed graphs *)
transitiveReductionGraph[g_, OptionsPattern[]] := $Failed

Comments

Popular posts from this blog

plotting - How to draw lines between specified dots on ListPlot?

I would like to create a plot where I have unconnected dots and some connected. So far, I have figured out how to draw the dots. My code is the following: ListPlot[{{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4,13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full] I have thought using ListLinePlot command, but I don't know how to specify to the command to draw only selected lines between the dots. Do have any suggestions/hints on how to do that? Thank you. Answer One possibility would be to use Epilog with Line : ListPlot[ {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4, 13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full, Epilog -> { Line[ ...

calculus and analysis - Integral of the Sinc product

Let us consider the following integral $$ B_n = \int_0^\infty \prod_{k=1,3,5,\dots}^n\frac{\sin (x/k)}{x/k}dx $$ By definition, Sinc[x] == Sin[x]/x , therefore B[n_?OddQ] := Integrate[Product[Sinc[x/k], {k, 1, n, 2}], {x, 0, Infinity}] B /@ Range[1, 13, 2] {Pi/2, Pi/2, Pi/2, Pi/2, Pi/2, Pi/2, Pi/2} OK, everything is fine. But... B[15] 467807924713440738696537864469 Pi/935615849440640907310521750000 What's going on? Answer As Eckhard wrote in comments B[n] is the n-th Borwein integral . (The letter B was not accidental :) ) This funny properties of Borwein integrals is related to the Fourier transform of Sinc function FourierTransform[Sinc[x], x, k] 1/2 Sqrt[Pi/2] (Sign[1 - k] + Sign[1 + k]) Plot[%, {k, -2, 2}, Filling -> 0] which is the box function. The result is $\pi/2$ while the sum $$ 1/3+1/5+\dots+1/n $$ B_n = \frac{\pi}{2} - \pi \bigg(\sum_{k=3,5,\ldots}^n\frac{1}{k} -1\biggr)^\frac{n-1}{2}\prod_{k=3,5,\dots}^n\frac{k}{k-1}. $$ For $n=15$ it is equal to $$ \frac{46780...

list manipulation - Selecting multiple columns from a matrix?

Sample data: data = { {{2013, 1, 1}, 24.13, 167.67, 231.82}, {{2013, 1, 2}, 32.15, 170.92, 225.99}, {{2013, 1, 3}, 35.43, 172.68, 221.67}, {{2013, 1, 4}, 36.73, 173.05, 218.32}, {{2013, 1, 5}, 58.19, 165.96, 197.05}, {{2013, 1, 6}, 69.99, 163.50, 187.52}, {{2013, 1, 7}, 71.37, 154.21, 175.58}, {{2013, 1, 8}, 72.51, 149.66, 163.25}}; I want a DateListPlot with three graphs, so for a matrix formed by columns 1 and 2, one for columns 1 and 3, and 1 for columns 1 and 4. At the moment I'm using this code: data2 = Transpose[{data[[All, 1]], data[[All, 2]]}]; data3 = Transpose[{data[[All, 1]], data[[All, 3]]}]; data4 = Transpose[{data[[All, 1]], data[[All, 4]]}]; DateListPlot[{data2, data3, data4}, Joined -> True, Filling -> {3 -> {1}}] but I have a hunch that this can be done more efficiently. I don't like the Transpose s in particular. Any ideas? edit (for extra credit) What if I need to multiply the second column by 2, which in my solution is simp...