• Corpus ID: 240419962

Measuring and utilizing temporal network dissimilarity

@article{Zhan2021MeasuringAU,
  title={Measuring and utilizing temporal network dissimilarity},
  author={Xiuxiu Zhan and Chuang Liu and Zhipeng Wang and Huijuan Wang and Petter Holme and Zi-Ke Zhang},
  journal={ArXiv},
  year={2021},
  volume={abs/2111.01334}
}
Quantifying the structural and functional differences of temporal networks is a fundamental and challenging problem in the era of big data. This work proposes a temporal dissimilarity measure for temporal network comparison based on the fastest arrival distance distribution and spectral entropy based Jensen-Shannon divergence. Experimental results on both synthetic and empirical temporal networks show that the proposed measure could discriminate diverse temporal networks with different… 
1 Citations

Figures and Tables from this paper

Characterization of interactions’ persistence in time-varying networks

A study on the persistence of the interactions based on a descriptor named temporality, to assess how “special” is a given time-varying network within the configuration space of ordered sequences of snapshots, and finds that empirical sequences are much more similar than their randomized counterparts.

References

SHOWING 1-10 OF 53 REFERENCES

Quantification of network structural dissimilarities

The measure proposed here can identify and quantify structural topological differences that have a practical impact on the information flow through the network, such as the presence or absence of critical links that connect or disconnect connected components.

Predictability of real temporal networks

An entropy-rate-based framework, based on combined topological–temporal regularities, for quantifying the predictability of any temporal network, is proposed and it is found that, for most real temporal networks, despite the greater complexity of predictability brought by the increase in dimension, the combinedTopological-temporal predictability is higher than the temporal predictability.

Complex network comparison based on communicability sequence entropy.

By the extensive experiments, the measure can accurately quantify the structural dissimilarities between synthetic networks and can be able to identify the critical percolation probability of the random network in the evolution process.

An information-theoretic, all-scales approach to comparing networks

A new measure to compare networks, the Network Portrait Divergence, is introduced that is mathematically principled, incorporates the topological characteristics of networks at all structural scales, and is general-purpose and applicable to all types of networks.

Identifying network structure similarity using spectral graph theory

A test for similarity between the inferred and the true network is developed and tested on the consecutive snapshots of a network, and against the ground truth.

Comparing complex networks: in defence of the simple

The operational use of complicated methods can be justified only by showing that they outperform well-understood traditional statistics, such as Euclidean metrics, as the efficiency of distinguish two network’s groups and the computing time is studied.

Classification of weighted networks through mesoscale homological features

This work describes an alternative approach to studying structure in networks that relies on an algebraic-topological metric called persistent homology, which studies intrinsically mesoscale structures called cycles, constructed from cliques in the network.

Motifs in Temporal Networks

A notion of a temporal network motif as an elementary unit of temporal networks is developed and a general methodology for counting such motifs is provided and it is found that measuring motif counts at various time scales reveals different behavior.

The fundamental advantages of temporal networks

It is demonstrated that temporal networks can be controlled more efficiently and require less energy than their static counterparts, and have control trajectories that are considerably more compact than those characterizing static networks.
...