Weighted, bipartite, or directed stream graphs for the modeling of temporal networks

DOI10.1007/978-3-031-30399-9_3MaRDI QIDQ6536058zbMATH OpenFDO

Authors Matthieu Latapy, Clémence Magnien, Tiphaine Viard

Publication date 22 March 2024

zbMATH Keywords

temporal networksstream graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Deterministic network models in operations research (90B10) Signed and weighted graphs (05C22)

Recommendations

• Weighted temporal event graphs and temporal-network connectivity
• A map of approaches to temporal networks
• An introduction to temporal graphs: an algorithmic perspective
• An introduction to temporal graphs: an algorithmic perspective
• The temporal event graph

Cites work

• A General Framework for Weighted Gene Co-Expression Network Analysis
• A clustering coefficient for weighted networks, with application to gene expression data
• Bipartite structure of all complex networks
• Collective dynamics of `small-world' networks
• Comparison of different generalizations of clustering coefficient and local efficiency for weighted undirected graphs
• On multiaspect graphs
• On the degrees of the vertices of a directed graph
• Small worlds among interlocking directors: network structure and distance in bipartite graphs
• Statistical analysis of weighted networks

Cited in

(1)

• Weighted temporal event graphs and temporal-network connectivity

This page was built for publication: Weighted, bipartite, or directed stream graphs for the modeling of temporal networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536058)