Visualizing Dense Dynamic Networks with Matrix Cubes
نویسندگان
چکیده
Visualizing static networks is already difficult, but exploring dynamic networks is even more challenging due to the complexity of the tasks involved. Some require aggregation over time; others require observing the topology at one given time or tracking the evolution of edge weights. Due to this wide spectrum of tasks, one visual encoding will hardly fit all tasks effectively; multiple complementary views are needed. We introduce the Matrix Cube, a visualization and navigation model for dynamic networks that results from stacking adjacency matrices, one for each time step in the network. It builds on our familiarity with cubes in the physical world and offers intuitive ways to look at, manipulate and decompose them. We describe a set of direct manipulation operations to decompose the Matrix Cube and interact with the resulting views.
منابع مشابه
Alignment Cubes: Towards Interactive Visual Exploration and Evaluation of Multiple Ontology Alignments
Ontology alignment is an area of active research where many algorithms and approaches are being developed. Their performance is usually evaluated by comparing the produced alignments to a reference alignment in terms of precision, recall and F-measure. These measures, however, only provide an overall assessment of the quality of the alignments, but do not reveal differences and commonalities be...
متن کاملMatLink: Enhanced Matrix Visualization for Analyzing Social Networks
Visualizing social networks presents challeges for both nodelink and adjacency matrix representations. Social networks are locally dense, which makes node-link displays unreadable. Yet, main analysis tasks require following paths, which is difficult on matrices. This article presents MatLink, a hybrid representation with links overlaid on the borders of a matrix and dynamic topological feedback...
متن کاملSynchronization for Complex Dynamic Networks with State and Coupling Time-Delays
This paper is concerned with the problem of synchronization for complex dynamic networks with state and coupling time-delays. Therefore, larger class and more complicated complex dynamic networks can be considered for the synchronization problem. Based on the Lyapunov-Krasovskii functional, a delay-independent criterion is obtained and formulated in the form of linear matrix inequalities (LMIs)...
متن کاملبررسی پایداری حالت همگام در شبکهای از نگاشتهای آشوبناک با روش سنجه ماتریسی
Stability of synchronous state is a fundamental problem in synchronization. We study Matrix Measure as an approach for investigating of stability of synchronous states of chaotic maps on complex networks. Matrix Measure is a measure which depends on network structure. Using this measure and comparing with synchronization threshold which depends on the function of the map, show us how the synchr...
متن کاملEfficient Evaluation of Sparse Data Cubes
Computing data cubes requires the aggregation of measures over arbitrary combinations of dimensions in a data set. Efficient data cube evaluation remains challenging because of the potentially very large sizes of input datasets (e.g., in the data warehousing context), the wellknown curse of dimensionality, and the complexity of queries that need to be supported. This paper proposes a new dynami...
متن کامل