Topic
Spectral layout
About: Spectral layout is a research topic. Over the lifetime, 8 publications have been published within this topic receiving 99 citations.
Papers
TL;DR: This paper proposes a framework for dynamic network visualization in the on-line setting where only present and past graph snapshots are available to create the present layout, and introduces two dynamic layout algorithms, namely dynamic multidimensional scaling and dynamic graph Laplacian layout.
Abstract: Many real-world networks, including social and information networks, are dynamic structures that evolve over time. Such dynamic networks are typically visualized using a sequence of static graph layouts. In addition to providing a visual representation of the network structure at each time step, the sequence should preserve the mental map between layouts of consecutive time steps to allow a human to interpret the temporal evolution of the network. In this paper, we propose a framework for dynamic network visualization in the on-line setting where only present and past graph snapshots are available to create the present layout. The proposed framework creates regularized graph layouts by augmenting the cost function of a static graph layout algorithm with a grouping penalty, which discourages nodes from deviating too far from other nodes belonging to the same group, and a temporal penalty, which discourages large node movements between consecutive time steps. The penalties increase the stability of the layout sequence, thus preserving the mental map. We introduce two dynamic layout algorithms within the proposed framework, namely dynamic multidimensional scaling and dynamic graph Laplacian layout. We apply these algorithms on several data sets to illustrate the importance of both grouping and temporal regularization for producing interpretable visualizations of dynamic networks.
31 citations
Journal Article•
TL;DR: This work derives a dynamic spectral layout approach for the animation of small-world models using spectral methods and discusses some general principles for dynamic graph layout.
Abstract: Spectral methods are naturally suited for dynamic graph layout, because moderate changes of a graph yield moderate changes of the layout under weak assumptions. We discuss some general principles for dynamic graph layout and derive a dynamic spectral layout approach for the animation of small-world models.
10 citations
1 Jan 2004
TL;DR: This paper proposes a method for drawing AS graph data using 2.5D graph visualization that illustrates the entire AS graph structure and is generic with regard to the hierarchy displayed by the third dimension.
Abstract: We propose a method for drawing AS graph data using 2.5D graph
visualization. In order to bring out the pure graph structure
of the AS graph we consider its core hierarchy. The k-cores are
represented by 2D layouts whose interdependence for increasing
k is displayed by the third dimension. For the core with
maximum value a spectral layout is chosen thus emphasizing on
the most important part of the AS graph. The lower cores are
added iteratively by force-based methods. In contrast to
alternative approaches to visualize AS graph data, our method
illustrates the entire AS graph structure. Moreover, it is
generic with regard to the hierarchy displayed by the third
dimension.
3 citations
Journal Article•
TL;DR: In this paper, an integrated layout optimization is formulated to simultaneously account for both member sizing and bracings' topology in a planar braced frame, and the problem is solved for minimal structural weight under codified stress, deformation and also user-defined weak-storey and architectural constraints.
Abstract: For most practical purposes, true topology optimization of a braced frame should be synchronized with its sizing. An integrated layout optimization is formulated here to simultaneously account for both member sizing and bracings’ topology in such a problem. Code-specific seismic design spectrum is applied to unify the earthquake excitation. The problem is solved for minimal structural weight under codified stress, deformation and also user-defined weak-storey and architectural constraints. Particle swarm optimization is hybridized with an extra memory consideration strategy to solve this problem. As another issue, Baldwin effect of memetic algorithm is utilized in the proposed method to enhance its search capability regarding the geometrical and topological constraints. Treating a number of planar braced frames revealed superior performance of the proposed hybrid method partiqularly in avoiding premature convergence over the common particle swarm optimiztion for such a discrete problem. Received: 12 October 2014; Accepted: 26 December 2014
2 citations
28 Jul 2018
TL;DR: In this paper, a general graph model with multiple weighted directed edges, undirected edges, and weighted vertices simultaneously was considered and some relevant results for its quasi-Laplacian spectrum were derived.
Abstract: Many practical problems can be described as a kind graph model having multiple weighted directed edges, undirected edges and weighted vertices simultaneously however, which are lack of sufficient considerations in previous literatures. We discuss some basic definitions for this more general graph and derive some relevant results for its quasi-Laplacian spectrum. Basic non negative results of its eigenvalues are proposed. Furthermore, we argue some dynamic properties between graph spectral layout and its structural variation. Here two types networks evolutionary manner involving insert of new edge or new vertex are considered. The strictness of related conclusions is guaranteed by theoretical analysis. These initial investigation of weighted mixed pseudograph maybe conduct potential theoretical or applied values for a numerous of practical problems.
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 1 |
| 2018 | 1 |
| 2015 | 1 |
| 2013 | 1 |
| 2008 | 1 |
| 2006 | 1 |