Pith. sign in

REVIEW

Fingerprint for Network Topologies

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0804.0499 v3 pith:7QYD37X6 submitted 2008-04-03 physics.soc-ph

Fingerprint for Network Topologies

classification physics.soc-ph
keywords bosamnetworkenvelopeadjacencyfingerprintinformationleavesmatrix
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original 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 allows us to use a single envelope to predict all other envelopes and therefore reconstruct the outline of a network's BOSAM picture. We analogise the BOSAM envelope to human's fingerprint as they share a number of common features, e.g. both are simple, easy to obtain, and strongly characteristic encoding essential information for identification.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.