Quantum Gravity 1427: Retyping: Nearest Neighbor Graphs and Matrices in Computers, Cryptography, Computational Complexity



 Science > Physics > Quantum Gravity 1427: Retyping: Nearest Neighbor Graphs and Matrices in Computers, Cryptography, Computational Complexity

LINK TO THIS PAGE  


rating :  0   |  0


  Page 1 of 1

1

 
Topic: Science > Physics
User: "OsherD"
Date: 20 May 2007 10:12:50 AM
Object: Quantum Gravity 1427: Retyping: Nearest Neighbor Graphs and Matrices in Computers, Cryptography, Computational Complexity

From Osher Doctorow

This post didn't appear right after I typed it, so I'm retyping it:

From Osher Doctorow

The "Nearest Neighbor" idea has many applications to:
1) Computer theory and practice
2) Cryptography
3) Computational Complexity
See:
4) Wolfram: "Adjacency matrix"
5) Wolfram: "Incidence matrix"
6) Wikipedia "Adjacency matrix"
7) Wikipedia "Spectral graph theory"
8) Wikipedia "Spectral gap"
9) Wikipedia "Expander graph"
10) Wikipedia "Regular graph"
It turns out that a graph is regular iff the all 1 vector is an
eigenvector of its adjacency matrix and a graph is both connected and
regular iff the all 1 matrix is a linear combination of powers of the
adjacency matrix.
Osher Doctorow
.

User: "kunzmilan"

Title: Re: Quantum Gravity 1427: Retyping: Nearest Neighbor Graphs and Matrices in Computers, Cryptography, Computational Complexity 21 May 2007 02:52:48 AM
On May 20, 5:12 pm, OsherD <mdocto...@ca.rr.com> wrote:

From Osher Doctorow


This post didn't appear right after I typed it, so I'm retyping it:

From Osher Doctorow


The "Nearest Neighbor" idea has many applications to:

1) Computer theory and practice
2) Cryptography
3) Computational Complexity

See:

4) Wolfram: "Adjacency matrix"
5) Wolfram: "Incidence matrix"
6) Wikipedia "Adjacency matrix"
7) Wikipedia "Spectral graph theory"
8) Wikipedia "Spectral gap"
9) Wikipedia "Expander graph"
10) Wikipedia "Regular graph"

It turns out that a graph is regular iff the all 1 vector is an
eigenvector of its adjacency matrix and a graph is both connected and
regular iff the all 1 matrix is a linear combination of powers of the
adjacency matrix.

Osher Doctorow

Adjacency matrices, and distance matrices are connected with physical
properties of chemical compounds, as boiling points or spectras are.
There exist a branch of computational chemistry studying them.
kunzmilan
.


  Page 1 of 1

1

 


Related Articles
Quantum Gravity 1427: Nearest Neighbor Graphs and Matrices in Computers, Cryptography, Computational Complexity
question about diagonalizable but non-symmetric matrices
x- and p-matrices
Is sum of 2 positive-definite square matrices positive definite?
Hilbert spaces, other than Hermitian matrices, to represent quantum systems?
Quantum Gravity 180.2: New Dimensional Analysis With Matrices
Quantum Gravity 171.3: Dirac and Pauli Matrices As Generalized Alternating Sign Matrices
Dirac Matrices Derived From "Generalized PI"
Thanks To Baez on Cartan Matrices
Quantum Gravity 180.4: PI Matrices From Optimal to "Worst" Relate to Band/Banded Matrices
Infinitesimal generators of the 6x6 symmetric matrices Lie algebra
Quantum Gravity 178.0: More Re Hessian Determinants and Matrices
Dirac Matrices Derived From "Generalized PI" 2
Modular Invariant Mass Matrices
Quantum Gravity 25: From Unit Balls/Spheres to Tensors and Matrices and Spinors
 

NEWER

pg.1612     pg.1232     pg.940     pg.716     pg.544     pg.412     pg.311     pg.234     pg.175     pg.130     pg.96     pg.70     pg.50     pg.35     pg.24     pg.16     pg.10     pg.6     pg.3     pg.1

OLDER