2009
DOI: 10.1007/978-3-642-02469-6_45
|View full text |Cite
|
Sign up to set email alerts
|

Fingerprint for Network Topologies

Abstract: Abstract. A network's topology information can be given as an adjacency matrix. The bitmap of sorted adjacency matrix (BOSAM) is a network visualisation tool which can emphasise different network structures by just looking at reordered adjacent matrixes. A BOSAM picture resembles the shape of a flower and is characterised by a series of 'leaves'. Here we show and mathematically prove that for most networks, there is a self-similar relation between the envelope of the BOSAM leaves. This self-similar property al… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…By mapping each data value onto one single pixel in theory the amount of data displayed is equal to the number of pixels. Pixel-oriented visualization has been applied by Guo et al [21] for the visualization of very large scale network matrices (BOSAM 7 ), but to the best of our knowledge it has not been tried on temporal and weighted networks yet.…”
Section: Pixel-oriented Visualizationmentioning
confidence: 99%
“…By mapping each data value onto one single pixel in theory the amount of data displayed is equal to the number of pixels. Pixel-oriented visualization has been applied by Guo et al [21] for the visualization of very large scale network matrices (BOSAM 7 ), but to the best of our knowledge it has not been tried on temporal and weighted networks yet.…”
Section: Pixel-oriented Visualizationmentioning
confidence: 99%
“…In NWRank, relative weights are assigned to links based on the degree of the adjacent neighbors and their Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank[30]. Simpler metrics, such as the degree centrality, give the highest score of importance to the node with the largest number of neighbors[31,34]. The betweenness centrality is an indicator of a node's (or link's) centrality in a network from an approximate flow perspective.…”
mentioning
confidence: 99%