Finding Cliques in Networks
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
A clique is a set of three or more nodes in a network that are all connected to one another. An 
-clique is defined by indirect connections of length 
or less. In a 
-plex, every node is allowed 
missing links to other clique members. Sliders control characteristics of a random network. Click the diagram to cycle through the cliques.
Contributed by: Phillip Bonacich (March 2011)
Open content licensed under CC BY-NC-SA
Snapshots
Details
S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications, New York: Cambridge University Press, 1994.
Permanent Citation
"Finding Cliques in Networks"
http://demonstrations.wolfram.com/FindingCliquesInNetworks/
Wolfram Demonstrations Project
Published: March 7 2011
Find Bridging Edges in Networks
Phillip Bonacich
Boolean NK Networks
Garrett Neske
Nearest Neighbor Networks
Yifan Hu and Stephen Wolfram
Random 3D Nearest Neighbor Networks
Yifan Hu and Stephen Wolfram
Random 2D Nearest Neighbor Networks
Yifan Hu and Stephen Wolfram
Networks for Basic Number Theoretic Functions
George Beck
The Power-Dependence Solution to Five Exchange Networks
Phillip Bonacich
Measures of Network Centrality
Phillip Bonacich
Contagion in a Grid and a Random Network
Phillip Bonacich
Complex Networks
Hector Zenil
-
Contagion in Random and Scale-Free Networks
Phillip Bonacich -
Find Bridging Edges in Networks
Phillip Bonacich -
Finding Cliques in Networks
Phillip Bonacich -
Exchange Networks
Phillip Bonacich -
Contagion in a Grid and a Random Network
Phillip Bonacich -
Measures of Network Centrality
Phillip Bonacich -
N-Step Transition Matrices for Markov Chains
Phillip Bonacich -
The Power-Dependence Solution to Five Exchange Networks
Phillip Bonacich -
Simulated Epidemics in Random Networks of Varying Density and Size
Phillip Bonacich