A connectivity look up structure is maintained for a network that comprises a plurality of nodes, each node is connectable to one or more other nodes, and nodes that are connected tend to be local to one another in the network, and the number of node connections in the network tends to be sparse in relation to the number of potential node connections in the network. The connectivity look up structure stores, for a given node, an address of each other node that is connected to the given node, wherein the stored address for the other node is represented as a run-length encoded difference between a full network address of the given node and a full network address of the other node.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method comprising: maintaining a connectivity look up structure for a network that comprises a plurality of nodes, each node is connectable to one or more other nodes, and nodes that are connected tend to be local to one another in the network, and the number of node connections in the network tends to be sparse in relation to the number of potential node connections in the network; wherein the connectivity look up structure stores, for a given node, an address of each other node that is connected to the given node, and wherein the stored address for the other node is represented as a run-length encoded difference between a full network address of the given node and a full network address of the other node. 2. The method of claim 1, wherein a full network address for a node comprises one or more fields that represent a logical sub-area of the network in which the node is located, and one or more fields that represent the location of the node within the logical sub-area. 3. The method of claim 1, wherein the stored address comprises a first address part that represents sign bits, a second address part that represents the number of zero difference bits, and a third address part that comprises the difference bits from the first non-zero difference bit to the end of the difference bits. 4. The method of claim 3, wherein the second and third address parts further represent bits positioned as bit sets of differences between at least two of the fields that represent the location of the node within the logical sub-area. 5. The method of claim 2, wherein the network is divided into a plurality of logical sub-areas. 6. The method of claim 5, wherein one or more of the plurality of logical sub-areas are three-dimensional logical sub-areas. 7. A method comprising: maintaining a connectivity look up structure for a neuromorphic computing network that comprises a plurality of neuron cells, each neuron cell is connectable to one or more other cells via one or more synapses, and neuron cells that are connected tend to be local to one another in the neuromorphic computing network, and the number of neuron cell connections in the neuromorphic computing network tends to be sparse in relation to the number of potential neuron cell connections in the neuromorphic computing network; wherein the connectivity look up structure stores, for a given neuron cell, an address of each other neuron cell that is connected to the given neuron cell, and wherein the stored address for the other neuron cell is represented as a local difference between a full network address of the given neuron cell and a full network address of the other neuron cell. 8. The method of claim 7, wherein the local difference between the full network address of the given neuron cell and the full network address of the other neuron cell comprises a run-length encoded difference. 9. The method of claim 7, further comprising accessing the connectivity look up structure to obtain address information for one or more neuron cells in the neuromorphic computing network. 10. The method of claim 9, further comprising executing a neuromorphic application program in accordance with the obtained address information for the one or more neuron cells in the neuromorphic computing network. 11. The method of claim 7, wherein the stored address comprises a first address part that represents sign bits, a second address part that represents the number of zero difference bits, and a third address part that comprises the difference bits from the first non-zero difference bit to the end of the difference bits. 12. The method of claim 11, wherein the second and third address parts further represent bits positioned as bit sets of differences between at least two fields that represent the location of the node within a logical sub-area. 13. The method of claim 12, wherein the logical sub-areas is a three-dimensional logical sub-area. 14. An apparatus comprising: a processor; and a memory operatively coupled to the processor and configured to maintain a connectivity look up structure for a network that comprises a plurality of nodes, each node is connectable to one or more other nodes, and nodes that are connected tend to be local to one another in the network, and the number of node connections in the network tends to be sparse in relation to the number of potential node connections in the network; wherein the connectivity look up structure stores, for a given node, an address of each other node that is connected to the given node, and wherein the stored address for the other node is represented as a run-length encoded difference between a full network address of the given node and a full network address of the other node. 15. The apparatus of claim 14, wherein a full network address for a node comprises one or more fields that represent a logical sub-area of the network in which the node is located, and one or more fields that represent the location of the node within the logical sub-area. 16. The apparatus of claim 15, wherein the stored address comprises a first address part that represents sign bits, a second address part that represents the number of zero difference bits, and a third address part that comprises the difference bits from the first non-zero difference bit to the end of the difference bits. 17. The apparatus of claim 16, wherein the second and third address parts further represent bits positioned as bit sets of differences between at least two of the fields that represent the location of the node within the logical sub-area. 18. The apparatus of claim 15, wherein the network is divided into a plurality of logical sub-areas. 19. The apparatus of claim 18, wherein one or more of the plurality of logical sub-areas are three-dimensional logical sub-areas 20. The apparatus of claim 14, wherein the network comprises a neuromorphic computing network and the plurality of nodes comprises a plurality of neuron cells.