Network visualization tool utilizing iterative rearrangement of nodes on a grid lattice using gradient method

A visualization tool for converting network data, which represent a plurality of elements and links between elements, into a data structure, which represents a grid arrangement of the plurality of elements where each element of the plurality of elements is placed on an individual grid position of a lattice, such that the data structure is suited for use by a graphics display, comprising:

• a storage device for storing the network data;
• a storage device for storing the data structure;
• and
• a processing unit for processing a gradient method;
• wherein the processing unit generates an initial data structure, which represents an initial grid arrangement of the plurality of elements, assigns a global value to this initial grid arrangement, employs the gradient method for converting the initial grid arrangement into another grid arrangement which has a decreased or an increased global value, the plurality of elements of the another grid arrangement each being placed on an individual position of the lattice,
• wherein an initial element is selected from among the plurality of elements using the gradient method and a local energy of the initial element, the another grid arrangement is generated by transposing the initial element and another element, and the global value is determined based on a local energy of each of the plurality of elements.

A visualization tool for converting network data, which represents a network with a plurality of elements and links between elements, into a data structure, which represents a grid arrangement of the plurality of elements, where each element of the plurality of elements is placed on an individual grid position of a lattice, such that the data structure is suitable for use by a graphics display, comprising:

• a storage device for storing the network data;
• a storage device for storing the data structure;
• and
• a processing unit for processing a gradient method;
• wherein the processing unit converts the network data into an initial data structure with an initial degree of entanglement of links, which in turn is transformed into another data structure by using the gradient method such that the degree of entanglement of the links is reduced using a series of element transpositions which transpose an initial element and another element from among the plurality of elements, the initial element being determined during each transposition using a global value and a local value of the initial element and the plurality of elements of the another grid arrangement each being placed on an individual position of the lattice.

A computer system for network visualization, said network visualization comprising:

• at least one computer-readable memory including:
• code for receiving network data representing a network with a plurality of elements and links between elements;
• and
• code for converting the network data into a data structure representing a grid arrangement of the plurality of elements where each element of the plurality of elements is placed on an individual grid position of a lattice, by
• assigning a global value to an initial grid arrangement of the plurality of elements which depends on the arrangement of one element of the plurality of elements with respect to the grid positions of said one element's neighbors, and
• modifying the initial grid arrangement to generate another grid arrangement of the plurality of elements with a gradient method on the global value of the grid arrangement of the plurality of elements, the plurality of elements of the another grid arrangement each being placed on an individual position of the lattice,
• wherein an initial element is selected from among the plurality of elements using the gradient method and a local energy of the initial element, the another grid arrangement is generated by transposing the initial element and another element, and the global value is determined based on a local energy of each of the plurality of elements.