3 ms·
> If you need arbitrary precision because of the pathological features of a particular family of graph (expander graphs, say), and the scaling of the needed pre
by eru 6y ago
> If you need arbitrary precision because of the pathological features of a particular family of graph (expander graphs, say), and the scaling of the needed precision links directly to aspects of that graph pathology, this is really telling you that the eigenvector computation is not the most natural “computation basis” to approach this phenomenon — and some explicitly discrete algorithm would make this latent complexity relationship manifest.
Or perhaps you just need to perform your eigenvector computation in a more hospitable ring or field?
To give an example of the flavour: many graph computations are more natural when performed on their adjacency matrix over tropical semi-rings. First and foremost shortest path computations.
See eg http://r6.ca/blog/20110808T035622Z.html http://r6.ca/blog/20110808T035622Z.html or http://stedolan.net/research/semirings.pdf http://stedolan.net/research/semirings.pdf