Condition numbers and scale free graphs
From MaRDI portal
Abstract: In this work we study the condition number of the least square matrix corresponding to scale free networks. We compute a theoretical lower bound of the condition number which proves that they are ill conditioned. Also, we analyze several matrices from networks generated with the linear preferential attachment model showing that it is very difficult to compute the power law exponent by the least square method due to the severe lost of accuracy expected from the corresponding condition numbers.
Recommendations
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems
- Local degree distribution in scale free random graphs
- Structural properties of the scale-free Barabasi-Albert graph
- Scaling and structural condition numbers
Cites work
- Collinearity and least squares regression
- Finiteness and fluctuations in growing networks
- scientific article; zbMATH DE number 49700 (Why is no real title available?)
- scientific article; zbMATH DE number 1393138 (Why is no real title available?)
- On the bias of traceroute sampling
- Statistical mechanics of complex networks
Cited in
(2)
This page was built for publication: Condition numbers and scale free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q978894)