A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1803.00306v3.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Fast Algorithms for Indices of Nested Split Graphs Approximating Real Complex Networks
[article]
<span title="2018-04-12">2018</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
Other Versions
<span title="2018-03-01">2018</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1803.00306v1">arXiv:1803.00306v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jcy2didbxjbphcjiez2jb5bwbe">fatcat:jcy2didbxjbphcjiez2jb5bwbe</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1803.00306v1">arXiv:1803.00306v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jcy2didbxjbphcjiez2jb5bwbe">fatcat:jcy2didbxjbphcjiez2jb5bwbe</a> </span>
<span title="2018-03-12">2018</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1803.00306v2">arXiv:1803.00306v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eatlg7i2avbq3jjbq2tj3eaibu">fatcat:eatlg7i2avbq3jjbq2tj3eaibu</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1803.00306v2">arXiv:1803.00306v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eatlg7i2avbq3jjbq2tj3eaibu">fatcat:eatlg7i2avbq3jjbq2tj3eaibu</a> </span>
We present a method based on simulated annealing to obtain a nested split graph that approximates a real complex graph. This is used to compute a number of graph indices using very efficient algorithms that we develop, leveraging the geometrical properties of nested split graphs. Practical results are given for six graphs from such diverse areas as social networks, communication networks, word associations, and molecular chemistry. We present a critical analysis of the appropriate perturbation
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1803.00306v3">arXiv:1803.00306v3</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bktcebr2zfhrdozqn2neob5p3u">fatcat:bktcebr2zfhrdozqn2neob5p3u</a>
</span>
more »
... chemes that search the whole space of nested split graphs and the distance functions that gauge the dissimilarity between two graphs.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191027173241/https://arxiv.org/pdf/1803.00306v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/c0/97/c09755459c316f355cac858cfb9451bd1be06695.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1803.00306v3" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>