Wolfram Demonstrations Project

12,000+ Open Interactive Demonstrations
Powered by Notebook Technology »

Random Key Graph

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.

The random (geometric) key graph model is presented here. Each node randomly selects keys from a pool of keys and those keys form the key ring of each node. Two nodes within the given range (the radius of the yellow disk) are connected if they share a common key in their key ring.

[more]

For example, suppose node has the keys 1 and 2, node has the keys 2 and 3, and node has the keys 3 and 4. If , and are connected because they share the key 2. If , they are not connected. If , and are not connected because they do not share a key.

[less]

Contributed by: Jaebum Jung (March 2014)
Open content licensed under CC BY-NC-SA

Snapshots

Details

Embed Code

Take advantage of the Wolfram Notebook Emebedder for the recommended user experience.

Related Demonstrations More by Author
Browse all topics
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.
Send