Dynamic Proximity Networks

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

You can generate a directed graph by giving spatial coordinates to a list of nodes and then connecting each node with its -nearest neighbors, nearest being defined according to some distance measure. This Demonstration lets you create such directed graphs by setting down a list of "Locators" and letting you move them about. It outputs the resulting graph and a user-specified embedding of the resulting graph. The Demonstration permits you to change both the distance measure and the embedding.

Contributed by: Seth J. Chandler (March 2011)
Open content licensed under CC BY-NC-SA



Snapshot 1: high‐dimensional embedding of thumbnail graph but using Euclidean distance function

Snapshot 2: 4-regular network with embedding using Manhattan distance

Snapshot 3: 5-regular network with embedding using Canberra distance

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.