Name
Abstract | ||
|---|---|---|
Current analyses of complex biological networks focus either on their global statistical connectivity properties (e.g. topological path lengths and nodes connectivity ranks) or the statistics of specific local connectivity circuits (motifs). Here we present a different approach --- Functional Topology, to enable identification of hidden topological and geometrical fingerprints of biological computing networks that afford their functioning --- the form-function fingerprints. To do so we represent the network structure in terms of three matrices: 1. Topological connectivity matrix --- each row (i) is the shortest topological path lengths of node i with all other nodes; 2. Topological correlation matrix --- the element (i,j) is the correlation between the topological connectivity of nodes (i) and (j); and 3. Weighted graph matrix --- in this case the links represent the conductance between nodes that can be simply one over the geometrical length, the synaptic strengths in case of neural networks or other quantity that represents the strengths of the connections. Various methods (e.g. clustering algorithms, random matrix theory, eigenvalues spectrum etc.), can be used to analyze these matrices, here we use the newly developed functional holography approach which is based on clustering of the matrices following their collective normalization. We illustrate the approach by analyzing networks of different topological and geometrical properties: 1. Artificial networks, including --- random, regular 4-fold and 5-fold lattice and a tree-like structure; 2. Cultured neural networks: A single network and a network composed of three linked sub-networks; and 3. Model neural network composed of two overlapping sub-networks. Using these special networks, we demonstrate the method's ability to reveal functional topology features of the networks. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s11047-005-3667-6 | Natural Computing |
Keywords | Field | DocType |
hidden topological,functional topology,nodes connectivity rank,topological correlations,different topological,functional topology classification,topological connectivity,biological computing networks,topological correlation matrix,topological connectivity matrix,global statistical connectivity property,fonnectivity networks,information processing,small word networks,graph theory,shortest topological path length,specific local connectivity circuit,scale free networks,topological path length,neural network,correlation function,correlation matrix,computer network,biological network,spectrum,eigenvalues,random matrix theory,scale free network | Matrix (mathematics),Artificial intelligence,Complex network,Artificial neural network,Cluster analysis,Graph theory,Discrete mathematics,Topology,Biological network,Scale-free network,Mathematics,Machine learning,Random matrix | Journal |
Volume | Issue | Citations |
4 | 4 | 4 |
PageRank | References | Authors |
0.89 | 7 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pablo Blinder | 1 | 31 | 3.35 |
| Itay Baruchi | 2 | 18 | 3.66 |
| Vladislav Volman | 3 | 112 | 12.54 |
| Herbert Levine | 4 | 82 | 12.58 |
| Danny Baranes | 5 | 4 | 0.89 |
| Eshel Ben Jacob | 6 | 4 | 1.23 |