𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recognizing linear structure in noisy matrices

✍ Scribed by Marianna Bolla

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
263 KB
Volume
402
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

Behaviour of the eigenvalues of random matrices with an underlying linear structure is investigated, when the structure is exposed to random noise. The question, how a deterministic skeleton behind a random matrix can be recognized, is also discussed. Such random matrices, as weight matrices of random graphs, adequately describe some large biological and communication networks. A range for the power of random power law graphs-for which the structure is robust enough-is established.

πŸ“œ SIMILAR VOLUMES

Recognizing Hamming graphs in linear tim
Recognizing Hamming graphs in linear time and space
✍ Wilfried Imrich; Sandi KlavΕΎar πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 417 KB

Hamming graphs are, by definition, the Cartesian product of complete graphs. In the bipartite case these graphs are hypercubes. We present an algorithm recognizing Hamming graphs in linear time and space. This improves a previous algorithm which was linear in time but not in space. This also favorab

Linear equations in infinite matrices
Linear equations in infinite matrices
✍ P.N. Shivakumar; R. Wong πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 408 KB