WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

Finding Cliques in Networks

​
controlling the type of clique
maximum distance, N-clique
missing edges, K-plex
minimum size of clique
controlling the network
nodes
10
density
FE`p$$5906068452322778159636836389630086692306
A clique is a set of three or more nodes in a network that are all connected to one another. An
N
-clique is defined by indirect connections of length
N
or less. In a
k
-plex, every node is allowed
k
missing links to other clique members. Sliders control characteristics of a random network. Click the diagram to cycle through the cliques.
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.