Pith. sign in

REVIEW 3 major objections 6 minor 42 references

HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs

T0 review · 3 major / 6 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper presents HOTVis, a force-directed layout algorithm that adds attractive forces along causal paths in time-stamped networks, producing static visualisations in which temporal clusters and temporally central vertices become…

desk verdict HOTVis is a genuine, modest step forward for temporal network visualization, but its central empirical claim is only partly established because the quality metrics largely reward exactly what the algorithm optimizes. read the letter →

arxiv 1908.05976 v2 pith:CGQSVR25 submitted 2019-08-16 cs.SI cs.GRcs.LGphysics.data-an

Vincenzo Perri , Ingo Scholtes This is my paper · ORCID
classification cs.SIcs.GRcs.LGphysics.data-an MSC 68R1005C8268U05
keywords dynamicgraphvisualisationtemporalnetworkscausalpathshigher-ordermodelsforce-directedlayoutclustersclosenesscentralitystatictime-aware
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper sets out to fix a blind spot in dynamic graph drawing: standard static visualisations collapse time-stamped edges into an aggregated graph and discard the ordering information that determines causal paths. It presents HOTVis, a layout algorithm that generalises force-directed drawing by adding attractive forces between the endpoints of causal paths, extracted from higher-order De Bruijn graph models of the temporal data. The intended payoff is a single static picture that reveals temporal clusters and temporally central vertices, structures that exist only because of edge ordering and are invisible in time-aggregated layouts. The paper reports experiments on a synthetic temporal network with known clusters and on five empirical data sets (flight itineraries, London Underground trips, and three face-to-face contact networks), finding lower causal-path dispersion and stronger central placement of temporally close vertices for higher orders.

What carries the argument

The load-bearing object is the higher-order De Bruijn graph $G^{(k)}$ of causal paths: its vertices are sequences of $k$ vertices that occur as time-respecting paths in the dynamic graph, and its edges connect overlapping sequences, so an edge $(\overrightarrow{v_0\ldots v_{k-1}},\overrightarrow{v_1\ldots v_k})$ encodes a causal path $v_0\to\cdots\to v_k$ that actually occurs in the data. HOTVis superimposes on the standard force-directed many-body simulation an attractive force between $v_0$ and $v_k$ for each such higher-order edge, with strength proportional to the path frequency and normalised across orders by $\alpha_k = 1/m_k$, where $m_k$ is the number of unique paths of length $k$. The first-order case $\alpha_k=0$ for $k>1$ reproduces the time-aggregated force-directed layout, so the higher-order attractive forces are the mechanism that carries the temporal information into the drawing.

What would settle it

On a synthetic temporal network with known ground-truth temporal clusters, apply a standard spatial clustering algorithm to the 2D positions produced by HOTVis and compare cluster recovery for $K=1$ versus $K>1$, for example with the adjusted Rand index between recovered and true clusters. If recovery does not improve for $K>1$, the claim that HOTVis makes temporal clusters visible in static layouts is not supported.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central claim is that the causal topology of a dynamic graph—which nodes can influence which other nodes through time-respecting paths—can be rendered visible in a static layout if the attractive forces are computed from causal paths rather than from static edges. HOTVis builds $k$-th order De Bruijn graph models of causal paths up to a maximum order $K$; for every higher-order edge $(\overrightarrow{v_0\ldots v_{k-1}},\overrightarrow{v_1\ldots v_k})$ it adds an attractive force between $v_0$ and $v_k$, scaled by path frequency and by an order weight $\alpha_k$. With $\alpha_k=0$ for all $k>1$ the algorithm reduces to the standard force-directed layout, so the time-aware drawing is a strict generalisation of the first-order baseline. In the reported experiments, increasing $K$ reduces the causal-path dispersion $\sigma$ and the closeness eccentricity $\Delta$ across all data sets, and a simple rule that ranks nodes by distance to the barycentre predicts top-10% temporal closeness with higher area-under-the-curve scores for $K>1$ than for $K=1$. The paper reads these results as evidence that HOTVis highlights temporal clusters and places temporally central vertices near the centre of the drawing.

Load-bearing premise

The evaluation assumes that the two custom quality measures—how tightly causal paths are packed and how central the temporally close nodes sit—are the right criteria for a good visualisation, and both measures reward exactly the proximity that HOTVis is built to create.

Editorial extensions

If this is right

  • Temporal clusters that exist only in the ordering of edges, not in the aggregated topology, can be read directly from a single static image.
  • High-resolution dynamic data can be visualised without time slicing or animation, because the method uses exact time stamps to define causal paths.
  • The maximum order $K$ can be selected by statistical model selection rather than manual tuning, giving a principled trade-off between causal-topology fidelity and layout clutter.
  • Vertices with high temporal closeness become visually identifiable by their central position, so exploratory ranking of important nodes no longer requires a separate computation.
  • The same layout principle applies across data types that produce causal paths, from passenger itineraries to face-to-face contact sequences, and stays practical for graphs with millions of time-stamped edges.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The two quality measures $\sigma$ and $\Delta$ reward exactly the proximity HOTVis creates, so a stronger test would be to cluster the 2D positions and compare the recovered clusters with ground-truth temporal clusters; the paper does not run that test.
  • The same superposition idea could be ported to other layout families, such as spectral or multidimensional-scaling layouts, to test whether causal topology can be encoded without the many-body force simulation.
  • The choice of $K$ could be driven by visual readability as well as statistical model selection, which would turn HOTVis into an interactive tool that adapts the drawing to the user's task.
  • The area-under-the-curve result suggests a practical shortcut for monitoring: use distance to the barycentre as a real-time proxy for temporal closeness centrality, at least for data whose causal structure resembles the tested networks.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper proposes HOTVis, a static layout algorithm for dynamic graphs. It builds higher-order De Bruijn graph models of causal paths up to a maximum order K, and generalises the Fruchterman-Reingold force-directed layout by adding attractive forces between the endpoints of each causal path in addition to first-order edges (Algorithm 1). The authors claim that the resulting layouts highlight temporal clusters that are not visible in time-aggregated layouts and place vertices with high temporal closeness centrality near the centre. They evaluate on one synthetic model and five empirical data sets (flights, tube, hospital, workplace, school) using edge crossings, a custom causal-path dispersion σ, and a custom closeness eccentricity Δ, with 100-fold held-out cross-validation and statistical model selection for K. The paper is accompanied by open-source code and data.

Significance. If the evaluation is accepted, the contribution fills a real gap in temporal-network visualisation: static layouts that encode causal topology rather than only aggregated topology. The algorithmic idea is simple and plausible, the implementation is public, and the cross-validation protocol (100 runs, held-out paths) is a strength. The timestamp-shuffle demonstration in Figure 2, although qualitative, gives some evidence that the effect is due to temporal ordering. However, the paper's quantitative quality measures are defined over exactly the causal paths whose endpoints the algorithm is designed to pull together, and the only baseline is a first-order layout. Independent evaluation is needed before the central claim can be considered established.

major comments (3)
  1. [Section 4 (definitions of σ and Δ)] The causal path dispersion σ and closeness eccentricity Δ are aligned with the objective of Algorithm 1 (lines 7–10), which adds attractive forces between the endpoints of every causal path. A lower σ or Δ for K > 1 therefore partly reflects the algorithm's own optimisation target rather than an independent property of visual quality. The held-out split does not resolve this, since the validation paths share the same temporal structure as the training paths. Please add an independent criterion, e.g., a task-based user study, a readability metric from the graph-drawing literature, a quantitative timestamp-shuffle control in which σ and Δ are compared on original versus shuffled timestamps, or a comparison against existing dynamic-graph drawing methods.
  2. [Section 4 (baselines)] The only baseline in the experimental evaluation is K = 1, i.e., the Fruchterman-Reingold layout. The paper does not compare against existing static representations of dynamic graphs, such as time-unfolded directed acyclic graphs, time-sliced layouts, space-time cubes, or the higher-order visualisation of [35]. As a result, the claim that HOTVis provides better visual representations of causal topology is not supported relative to the state of the art. The authors should state which existing methods are applicable to high-resolution time-stamped data and, if possible, compare quantitatively on the same data sets.
  3. [Section 4 (Figure 4, school data)] The claim that HOTVis reveals ground-truth class structure in the school data is based on visual inspection only. The left and right panels are not accompanied by a quantitative comparison, such as a clustering metric between spatial positions and class labels or an inter-class versus intra-class causal-path dispersion measure. Without such a measure, the temporal-cluster demonstration on empirical data remains anecdotal rather than established.
minor comments (6)
  1. [Section 2 (causal path dispersion definition)] The statement that σ ≈ 1 corresponds to the same dispersion as 'random paths' is not exact: the numerator averages distances to each path's own barycentre, while the denominator averages distances to the global barycentre, so for random paths of length l the expected ratio is approximately 1 − 1/l. The normalization should be clarified or replaced by an explicit random-path baseline.
  2. [Section 2 (higher-order graph weights)] The definition of the weight w in Section 2 uses the notation `{|...|}`; this should be written as a cardinality, and the indexing of the timestamps in the causal-path definition should be stated more precisely.
  3. [Appendix G] In the synthetic model, steps 3–4 introduce t1 and t2 without defining their ranges; clarify that the time stamps are chosen so that the swap preserves the multiset of time-stamped edges.
  4. [Algorithm 1] The parameter δ is passed to HigherOrderGraph but is not defined in the pseudocode; state in the caption or text that it is the maximum time difference from Section 2.
  5. [Section 4.1] There are minor typos, e.g., 'we now tests whether' and inconsistent subject-verb agreement in the discussion of σ. A careful proofread would improve clarity.
  6. [Related Work] The related-work section mentions HonVis [35] but does not explain how HOTVis differs in output representation from that system; a sentence describing the difference would help position the contribution.

Circularity Check

2 steps flagged · score 4.0 of 10

The evaluation of HOTVis is partially circular: the headline quality measure σ is the algorithm's own endpoint-proximity objective, and the temporal-closeness prediction shares the same causal-path input as the layout; held-out splits reduce but do not remove the dependence.

  1. self definitional [Section 3, Algorithm 1 (lines 4-10); Section 4, 'Causal path dispersion (σ)']
    "an attractive force is added between vertices v0 and vk that can influence each other via causal path ... The causal path dispersion σ captures whether the sets of vertices traversed by causal paths are less spatially dispersed than expected based on the spatial distribution of vertices. It intuitively captures whether vertices that can influence each other directly and indirectly are positioned in close proximity."

    The only new mechanism of HOTVis is to add attractive forces between the endpoints of causal paths, and σ is defined as measuring exactly whether such endpoints are positioned close together. Hence a decrease in σ for orders K>1 is the algorithm's own objective being reported as a quality gain, rather than an independent criterion of readability or of correct causal topology. Evaluating on held-out test paths shows that the placement generalises, but it does not break the circularity: the metric and the layout loss are the same function of causal-path geometry, so the reported improvement is partly built into the definition.

  2. fitted input called prediction [Section 4, 'Closeness eccentricity (Δ)' and 'Temporal closeness']
    "For a set S of causal paths p, we define this as CC(v) := ... With Tγ being the set of n nodes whose temporal closeness centrality is in the γ upper percentile, we define closeness eccentricity Δ(γ) := ... We additionally ran a prediction experiment: We use the proximity of vertices to the barycentre of the visualisation to identify vertices whose temporal closeness is in the top 10% percentile."

    Temporal closeness is defined over the same multi-set S of causal paths whose endpoint forces determine the vertex positions in Algorithm 1. Both the spatial feature (distance to barycentre) and the label (top-10% temporal closeness) are therefore computed from the same temporal-path input, so the improved Δ and ROC AUC for K>1 partly measure a same-source correlation rather than validation against an external ground truth. The train/test split only separates which paths are used for layout versus labelling; the definition of the target and the force-generating paths remain one and the same causal-path input.

full rationale

The algorithmic construction of HOTVis is self-contained: it takes time-stamped edges, builds higher-order causal-path graphs, and superimposes endpoint forces, and no fitted parameter is renamed as a derived result. The circularity is in the evaluation, not in the algorithm. The causal-path dispersion σ is the algorithm's own objective: Algorithm 1 adds attractive forces between the endpoints of causal paths, and σ measures whether causal-path endpoints are spatially close, so the reported decrease of σ with K is partly a restatement of the optimisation target. The closeness-eccentricity and ROC experiments are less directly tautological, but temporal closeness is computed from the same causal paths that generate the layout forces, making the prediction task partially self-referential. The paper does include partial safeguards: evaluation on held-out causal paths, a qualitative timestamp-shuffle control in the synthetic example, and a barycentre-based ROC prediction task, so the result is not an identity or a pure fit. The school-data cluster demonstration is visual inspection only, which increases dependence on the custom metrics. Self-citations to the authors' earlier model-selection and complexity work ([31,28,27]) are present but are not load-bearing circularity, since those methods optimise likelihood or counting complexity rather than the visual quality metric. Overall score reflects partial circularity in the empirical support while acknowledging independent algorithmic content.

Assumptions & free parameters 3 free parameters · 5 assumptions · 0 invented entities

No new physical or conceptual entities are postulated. HOTVis is an algorithm built from existing higher-order graph models and force-directed layout principles. The free parameters are algorithmic choices, and the axioms are the modelling assumptions behind causal paths and the custom quality measures.

free parameters (3)
  • Maximum order K = Kopt = 5 for tube, 2 for the other datasets
    The algorithm requires choosing the highest order of causal paths included in layout forces. The paper selects Kopt using the model selection method of Scholtes [31], which is cited prior work, not a fit performed in this paper, but K is still a key input parameter.
  • alpha_k = 1/m_k, where m_k is the number of unique paths of length k
    Weights for attractive forces from k-th order graphs are set to the inverse number of unique paths; this is a hand-chosen normalization motivated by simplicity, not fitted to optimize the visualisation.
  • delta (maximum time difference) = not reported per dataset
    Defines which sequences of time-stamped edges count as causal paths. It is a standard temporal-network parameter, but its value affects all higher-order graphs and therefore the layout.
assumptions (5)
  • domain assumption Causal paths with parameter delta capture the relevant influence structure in dynamic graphs.
    HOTVis builds all forces from causal paths as defined in Section 2. If temporal influence is better captured by other path notions, the layout optimises the wrong structure.
  • standard math The De Bruijn graph construction correctly encodes causal paths of length k.
    The construction follows the line graph of De Bruijn graphs [5]; this is a standard combinatorial construction used as a modelling device.
  • ad hoc to paper The custom quality measures sigma and Delta are valid proxies for visualisation quality.
    Section 4 defines these measures specifically for this evaluation; they are not established graph drawing quality metrics, and they reward the same proximity behaviour the algorithm is designed to create.
  • domain assumption Force-directed layouts convey topological proximity.
    HOTVis inherits this standard assumption from Fruchterman-Reingold [12]: spatial proximity in a force-directed layout is taken to indicate structural or causal closeness.
  • domain assumption The model selection method in [31] yields a statistically optimal order K.
    The paper uses the cited method to choose Kopt without re-deriving or re-validating it in this work.

how reviews work

0 comments
Cite this review

Pith. "Pith review of HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs." pith.science (2026). https://pith.science/paper/CGQSVR25

@misc{pith2026190805976,
  author       = {Pith},
  title        = {Pith review of: HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CGQSVR25}},
  note         = {Machine review of arXiv:1908.05976}
}
read the original abstract

Network visualisation techniques are important tools for the exploratory analysis of complex systems. While these methods are regularly applied to visualise data on complex networks, we increasingly have access to time series data that can be modelled as temporal networks or dynamic graphs. In dynamic graphs, the temporal ordering of time-stamped edges determines the causal topology of a system, i.e., which nodes can, directly and indirectly, influence each other via a so-called causal path. This causal topology is crucial to understand dynamical processes, assess the role of nodes, or detect clusters. However, we lack graph drawing techniques that incorporate this information into static visualisations. Addressing this gap, we present a novel dynamic graph visualisation algorithm that utilises higher-order graphical models of causal paths in time series data to compute time-aware static graph visualisations. These visualisations combine the simplicity and interpretability of static graphs with a time-aware layout algorithm that highlights patterns in the causal topology that result from the temporal dynamics of edges.

Figures

Figures reproduced from arXiv: 1908.05976 by the authors.

Figure 1
Figure 1. Information on causal paths (coloured arrows) contained in dynamic graphs (a) is discarded by standard time-aggregated visualisations (b). HOTVis uses higher-order graph models of causal paths (c) to produce time-aware, static visualisations (d) that highlight the causal topology of dynamic graphs. dynamic graph G(t) iff (v, w) ∈ E ↔ ∃t ∈ N : (v, w;t) ∈ E(t) . We further assume that the edge weights w : E → N of suc… view at source ↗
Figure 2
Figure 2. Application of HOTVis to synthetic temporal network with three temporal clusters (coloured nodes). A second-order time-aware layout (middle) highlights clusters not visible in a static visualisation (left). A time-aware visualisation of the data with randomised time stamps (right) confirms that clusters are due to the ordering of edges. causal paths of length two that (indirectly) connect pairs of vertices in three … view at source ↗
Figure 3
Figure 3. Edge crossing ξ (top) and causal path dispersion σ (bottom) for a synthetic dy￾namic graph with three clusters (column synthetic), empirical data on flight itineraries (column flights), metro trips (tube), and time-stamped interactions between work￾ers in an office environment (workplace), patients and hospital staff (hospital), and children and teachers in a primary school (school). All values are averages of 100 c… view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Comparison between a time-neglecting (left) and time-aware (right) layout for the school data set. Node colours represent the class each student belongs to, while square markers identify teachers. The time-aware visualisation generated by HOTVis (right) positions nodes…
Figure 5
Figure 5. Figure 5: Closeness eccentricity ∆ (y-axis) for a varying top percentage n of vertices with highest temporal closeness (x-axis). Results are presented for K=1 (blue dots) K=Kopt (green triangles), K=Kopt+2 (black pluses). Hulls indicate the 2σ interval. periments). The results i…
Figure 6
Figure 6. Figure 6: ROC curves illustrate the ability to predict nodes with top 10% closeness centrality for K = 1 (blue dashed), K=Kopt (green solid), K=Kopt+2 (black dotted). 5 Conclusion and Outlook Despite advances in dynamic graph drawing, the visualisation of high-resolution time-st…
Figure 7
Figure 7. Figure 7: Comparison between time-neglecting (left) and time-aware (right) layout for flights. Vertices whose temporal closeness centrality is among top 10 % of values are highlighted in red. Black circles delineate the area containing 10% of vertices closest to the barycentre. …

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

42 extracted references · 42 canonical work pages

  1. [35]

    In: 2017 IEEE Pacific Visualization Symposium (PacificVis)

    Tao, J., Xu, J., Wang, C., Chawla, N.V.: Honvis: Visualizing and exploring higher- order networks. In: 2017 IEEE Pacific Visualization Symposium (PacificVis). pp. 1–10. IEEE (2017)

    work page 2017

  2. [1]

    In: International Symposium on Graph Drawing

    Archambault, D., Purchase, H.C.: Mental map preservation helps user orientation in dynamic graphs. In: International Symposium on Graph Drawing. pp. 475–486. Springer (2012)

    work page 2012

  3. [2]

    Beck, F., Burch, M., Diehl, S., Weiskopf, D.: A taxonomy and survey of dynamic graph visualization 36(1), 133–159 (2017)

    work page 2017

  4. [3]

    IEEE transactions on visualization and computer graphics9(2), 241–253 (2003)

    Brandes, U., Kenis, P., Wagner, D.: Communicating centrality in policy network drawings. IEEE transactions on visualization and computer graphics9(2), 241–253 (2003)

    work page 2003

  5. [4]

    Burch, M., et al.: Radial edge splatting for visualizing dynamic directed graphs. pp. 603–612 (2012)

    work page 2012

  6. [5]

    Koninklijke Nederlandse Akademie v

    De Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Akademie v. Wetenschappen 49(49), 758–764 (1946)

    work page 1946

  7. [6]

    pathpy developers: pathpy software package.https://github.com/pathpy/pathpy (2020), [Online]

    work page 2020

  8. [7]

    Computational Geometry4(5), 235–282 (1994)

    Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: an annotated bibliography. Computational Geometry4(5), 235–282 (1994)

    work page 1994

Show all 42 references
  1. [8]

    In: Data Visualization 2001, pp

    Diehl,S., Görg,C., Kerren, A.:Preserving thementalmap usingforesightedlayout. In: Data Visualization 2001, pp. 175–184. Springer (2001)

    2001

  2. [9]

    IEEE transactions on visualization and computer graphics20(8), 1087–1099 (2013)

    van den Elzen, S., Holten, D., Blaas, J., van Wijk, J.J.: Dynamic network visual- ization withextended massive sequence views. IEEE transactions on visualization and computer graphics20(8), 1087–1099 (2013)

    2013

  3. [10]

    In: International Symposium on Graph Drawing

    Erten, C., Kobourov, S.G., Le, V., Navabi, A.: Simultaneous graph drawing: Lay- out algorithms and visualization schemes. In: International Symposium on Graph Drawing. pp. 437–449. Springer (2003)

    2003

  4. [11]

    In: International Symposium on Graph Drawing

    Friedrich, C., Eades, P.: The marey graph animation tool demo. In: International Symposium on Graph Drawing. pp. 396–406. Springer (2000)

    2000

  5. [12]

    Software: Practice and experience21(11), 1129–1164 (1991)

    Fruchterman, T.M., Reingold, E.M.: Graph drawing by force-directed placement. Software: Practice and experience21(11), 1129–1164 (1991)

    1991

  6. [13]

    Network Science3(3), 326–347 (2015)

    Génois, M., et al.: Data on face-to-face contacts in an office building suggest a low-cost vaccination strategy based on community linkers. Network Science3(3), 326–347 (2015)

    2015

  7. [14]

    In: International Symposium on Graph Drawing

    Görg, C., Birke, P., Pohl, M., Diehl, S.: Dynamic graph drawing of sequences of or- thogonal and hierarchical graphs. In: International Symposium on Graph Drawing. pp. 228–238. Springer (2004)

    2004

  8. [15]

    In: Computer Graphics Forum

    Greilich, M., Burch, M., Diehl, S.: Visualizing the evolution of compound digraphs with timearctrees. In: Computer Graphics Forum. vol. 28, pp. 975–982. Wiley Online Library (2009)

    2009

  9. [16]

    The European Physical Journal B 88(9), 234 (2015)

    Holme, P.: Modern temporal network theory: a colloquium. The European Physical Journal B 88(9), 234 (2015)

    2015

  10. [17]

    PloS one9(6), e98679 (2014)

    Jacomy, M., Venturini, T., Heymann, S., Bastian, M.: Forceatlas2, a continuous graph layout algorithm for handy network visualization designed for the gephi software. PloS one9(6), e98679 (2014)

    2014

  11. [18]

    Kaufmann, M., Wagner, D.: Drawing graphs: methods and models, vol. 2025. Springer (2003)

    2003

  12. [19]

    Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. vol. 64, pp. 820–842. Elsevier (2002)

    2002

  13. [20]

    IEEE transactions on visualization and computer graphics12(5), 805–812 (2006)

    Kumar, G., Garland, M.: Visual exploration of complex time-varying graphs. IEEE transactions on visualization and computer graphics12(5), 805–812 (2006)

    2006

  14. [21]

    Nature physics15(4), 313–320 (2019)

    Lambiotte, R., Rosvall, M., Scholtes, I.: From networks to optimal higher-order models of complex systems. Nature physics15(4), 313–320 (2019)

    2019

  15. [22]

    for London, T.: Rolling Origin and Destination Survey (RODS) database (2014), http://www.tfl.gov.uk/info-for/open-data-users/our-feeds

    2014

  16. [23]

    Safety and Reliability for managing Risk (ESREL 2008), Hammamet 14(02), 2008–16 (2008)

    Loubier, E., Dousset, B.: Temporal and relational data representation by graph morphing. Safety and Reliability for managing Risk (ESREL 2008), Hammamet 14(02), 2008–16 (2008)

    2008

  17. [24]

    In: Proceedings Sixth International Conference on Information Visualisation

    Nesbitt, K.V., Friedrich, C.: Applying gestalt principles to animated visualizations of network data. In: Proceedings Sixth International Conference on Information Visualisation. pp. 737–743. IEEE (2002)

    2002

  18. [25]

    arXiv e-prints arXiv:1906.00699 (Jun 2019)

    Noguchi, C., Kawamoto, T.: Evaluating network partitions through visualization. arXiv e-prints arXiv:1906.00699 (Jun 2019)

    1906 arXiv

  19. [26]

    Perri, V., Scholtes, I.: Hotvis: Higher-order time-aware visualisation of dy- namic graphs (supplementary code and data) (2020),https://doi.org/10.5281/ zenodo.3994152

    2020

  20. [27]

    arXiv preprint arXiv:1905.11287 (2019)

    Petrovic, L.V., Scholtes, I.: Counting causal paths in big times series data on networks. arXiv preprint arXiv:1905.11287 (2019)

    2019 arXiv

  21. [28]

    arXiv preprint arXiv:2007.02861 (2020)

    Petrović, L.V., Scholtes, I.: Learning the markov order of paths in a network. arXiv preprint arXiv:2007.02861 (2020)

    2020 arXiv

  22. [29]

    Pfitzner, R., Scholtes, I., Garas, A., Tessone, C.J., Schweitzer, F.: Betweenness preference: Quantifying correlations in the topological dynamics of temporal net- works. Phys. Rev. Lett.110, 198701 (May 2013)

    2013

  23. [30]

    mental map

    Purchase, H.C., Hoggan, E., Görg, C.: How important is the “mental map”?–an em- pirical investigation of a dynamic graph layout algorithm. In: International Sym- posium on Graph Drawing. pp. 184–195. Springer (2006)

    2006

  24. [31]

    Scholtes, I.: When is a network a network?: Multi-order graphical model selection in pathways and temporal networks. pp. 1037–1046. ACM (2017)

    2017

  25. [32]

    Discrete & Computational Geometry18(3), 305–363 (1997)

    Shewchuk, J.R.: Adaptive precision floating-point arithmetic and fast robust geo- metric predicates. Discrete & Computational Geometry18(3), 305–363 (1997)

    1997

  26. [33]

    In: International Symposium on Graph Drawing and Network Visual- ization

    Simonetto, P., Archambault, D., Kobourov, S.: Drawing dynamic graphs without timeslices. In: International Symposium on Graph Drawing and Network Visual- ization. pp. 394–409. Springer (2017)

    2017

  27. [34]

    PloS one6(8), e23176 (2011)

    Stehlé, J., Voirin, N., Barrat, A., Cattuto, C., Isella, L., Pinton, J.F., Quaggiotto, M., Van den Broeck, W., Régis, C., Lina, B., et al.: High-resolution measurements of face-to-face contact patterns in a primary school. PloS one6(8), e23176 (2011)

    2011

  28. [36]

    transtats.bts.gov/Tables.asp?DB_ID=125

    TransStat, R.: Origin and Destination Survey database (2014), http://www. transtats.bts.gov/Tables.asp?DB_ID=125

    2014

  29. [37]

    PloS one8(9), e73970 (2013)

    Vanhems, P., Barrat, A., Cattuto, C., Pinton, J.F., Khanafer, N., Régis, C., Kim, B.a., Comte, B., Voirin, N.: Estimating potential infection transmission routes in hospital wards using wearable proximity sensors. PloS one8(9), e73970 (2013)

    2013

  30. [38]

    In: 2013 17th International Conference on Information Visualisation

    Vehlow, C., Burch, M., Schmauder, H., Weiskopf, D.: Radial layered matrix visual- ization of dynamic graphs. In: 2013 17th International Conference on Information Visualisation. pp. 51–58. IEEE (2013) Supplementary Information In this appendix, we provide supplementary informa...

    2013

  31. [39]

    Randomly assign then vertices to three equally-sized, non-overlapping clusters, whereC(v) denotes the cluster of vertexv

    Generate a static randomk-regular graph withn vertices, where each ver- tex is connected to a random set ofk neighbours. Randomly assign then vertices to three equally-sized, non-overlapping clusters, whereC(v) denotes the cluster of vertexv

  32. [40]

    GenerateN sequences of two randomly chosen time-stamped edges(v0,v 1;t) and (v1,v 2;t + 1) that contribute to a causal path of length two in the resulting dynamic graph

  33. [41]

    For each vertexv1 of such a causal path of length two randomly pick: –two time-stamped edges(u,v 1;t1) and (v1,w,t 1 + 1) such thatC(u) = C(v1)⁄=C(w) –two time-stamped edges(x,v 1;t2)and (v1,z ;t2+1) withC(v1) = C(z)⁄= C(x)

  34. [42]

    This simple procedure exclusively changes the temporal ordering of time- stamped edges, affecting neither the topology nor the frequency of time-stamped edges

    Swap the time stamps of the four time-stamped edges to (u,v 1;t1) and (v1,z ;t1 + 1), (x,v 1,t 2), and (v1,w,t 2 + 1). This simple procedure exclusively changes the temporal ordering of time- stamped edges, affecting neither the topology nor the frequency of time-stamped edges....

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.