• The clique percolation method is a popular approach for analyzing the overlapping community structure of networks. The term network community (also called...
    18 KB (2,191 words) - 19:54, 12 October 2024
  • Thumbnail for Community structure
    communities. For instance the clique percolation method defines communities as percolation clusters of k {\displaystyle k} -cliques. To do this it finds all...
    37 KB (4,591 words) - 20:57, 1 November 2024
  • conference) for algorithms Clique percolation method, a clustering algorithm for networks Continuous phase modulation, a data modulation method commonly used in...
    4 KB (465 words) - 10:59, 12 February 2025
  • Thumbnail for Erdős–Rényi model
    Erdős–Rényi process is in fact unweighted link percolation on the complete graph. (One refers to percolation in which nodes and/or links are removed with...
    19 KB (2,784 words) - 05:56, 9 April 2025
  • Thumbnail for Centrality
    to the percolation paths depend on the percolation levels assigned to the source nodes, based on the premise that the higher the percolation level of...
    47 KB (6,738 words) - 13:09, 11 March 2025
  • Thumbnail for Percolation theory
    applications of percolation theory to materials science and in many other disciplines are discussed here and in the articles Network theory and Percolation (cognitive...
    26 KB (3,133 words) - 06:05, 15 July 2025
  • Thumbnail for Percolation threshold
    The percolation threshold is a mathematical concept in percolation theory that describes the formation of long-range connectivity in random systems. Below...
    239 KB (15,635 words) - 18:38, 23 June 2025
  • Thumbnail for Louvain method
    The Louvain method for community detection is a greedy optimization method intended to extract non-overlapping communities from large networks created...
    21 KB (2,753 words) - 13:12, 2 July 2025
  • clustered networks a percolation approach is developed. Directed graph Graph theory Network theory Network science Percolation theory Scale free network...
    18 KB (2,377 words) - 23:47, 19 June 2025
  • Thumbnail for Hierarchical navigable small world
    nearest neighbors benchmark. A related technique is IVFFlat. HNSW is a key method for approximate nearest neighbor search in high-dimensional vector databases...
    7 KB (648 words) - 11:00, 5 August 2025
  • Thumbnail for Leiden algorithm
    University. It was developed as a modification of the Louvain method. Like the Louvain method, the Leiden algorithm attempts to optimize modularity in extracting...
    21 KB (3,162 words) - 21:21, 19 June 2025
  • Thumbnail for Social network
    Anna Levina; Marc Timme (2011). "Impact of single links in competitive percolation". Nature Physics. 7 (3): 265–270. arXiv:1103.0922. Bibcode:2011NatPh...
    66 KB (7,365 words) - 21:46, 4 August 2025
  • Thumbnail for Semantic network
    and word-sense disambiguation. Semantic networks can also be used as a method to analyze large texts and identify the main themes and topics (e.g., of...
    22 KB (2,563 words) - 20:53, 10 July 2025
  • Thumbnail for Random graph
    grows very large. Percolation theory characterizes the connectedness of random graphs, especially infinitely large ones. Percolation is related to the...
    15 KB (2,307 words) - 11:46, 21 March 2025
  • Thumbnail for Network topology
    Logical topologies are often closely associated with media access control methods and protocols. Some networks are able to dynamically change their logical...
    40 KB (5,238 words) - 09:07, 24 March 2025
  • Thumbnail for Network theory
    Strogatz SH, Watts DJ (December 2000). "Network robustness and fragility: percolation on random graphs". Physical Review Letters. 85 (25): 5468–5471. arXiv:cond-mat/0007300...
    35 KB (3,959 words) - 04:41, 15 June 2025
  • Thumbnail for Broadcast, unknown-unicast and multicast traffic
    traffic (BUM traffic) is network traffic transmitted using one of three methods of sending data link layer network traffic to a destination of which the...
    11 KB (1,161 words) - 23:20, 6 January 2024
  • Thumbnail for Degeneracy (graph theory)
    lattices has been studied under the name of bootstrap percolation. Graph theory Network science Percolation Theory Core–periphery structure Cereceda's conjecture...
    31 KB (3,769 words) - 02:53, 17 March 2025
  • Thumbnail for Fractal dimension on networks
    fractal dimension can be calculated using methods such as the box counting method or the cluster growing method. Let N B {\displaystyle N_{B}} be the number...
    9 KB (1,317 words) - 02:44, 30 December 2024
  • Thumbnail for Lancichinetti–Fortunato–Radicchi benchmark
    Lancichinetti–Fortunato–Radicchi benchmark (category Statistical methods)
    used to compare different community detection methods. The advantage of the benchmark over other methods is that it accounts for the heterogeneity in the...
    5 KB (808 words) - 16:05, 4 February 2023
  • Thumbnail for Biological network
    A biological network is a method of representing systems as complex sets of binary interactions or relations between various biological entities. In general...
    50 KB (5,777 words) - 07:42, 7 April 2025
  • Thumbnail for Transport network analysis
    network Heuristic routing Interplanetary Transport Network Network science Percolation theory Street network Rail network Highway dimension Multimodal transport...
    13 KB (1,503 words) - 12:37, 27 June 2024
  • Thumbnail for Small-world network
    Barmpoutis and Murray, 2010). Small-world networks tend to contain cliques, and near-cliques, meaning sub-networks which have connections between almost any...
    38 KB (4,646 words) - 17:51, 18 July 2025
  • Thumbnail for Degree distribution
    Complex network Contagion Small-world Scale-free Community structure Percolation Evolution Controllability Graph drawing Social capital Link analysis...
    15 KB (2,542 words) - 03:13, 27 December 2024
  • Thumbnail for Computer network
    authorization, access rights, and others. Another distinct classification method is that of the physical extent or geographic scale. A nanoscale network...
    102 KB (11,999 words) - 04:54, 8 August 2025
  • Thumbnail for Modularity (networks)
    parallel memetic algorithm. Complex network Community structure Null model Percolation theory Newman, M. E. J. (2006). "Modularity and community structure in...
    21 KB (2,969 words) - 21:22, 19 June 2025
  • Thumbnail for Watts–Strogatz model
    Complex network Contagion Small-world Scale-free Community structure Percolation Evolution Controllability Graph drawing Social capital Link analysis...
    11 KB (1,613 words) - 17:30, 19 June 2025
  • Thumbnail for Social network analysis
    Social network analysis (category Methods in sociology)
    while weak ties are associated with bridges. Groups are identified as 'cliques' if every individual is directly tied to every other individual, 'social...
    58 KB (6,286 words) - 02:36, 2 August 2025
  • Thumbnail for Network science
    Networks in labor economics Non-linear preferential attachment Percolation Percolation theory Policy network analysis Polytely Quantum complex network...
    68 KB (9,863 words) - 21:52, 13 July 2025
  • Thumbnail for Scale-free network
    from the important heavy-tail of the power law degree distribution, this method can yield a large bias and a variance. It has been recently proposed to...
    47 KB (5,995 words) - 00:15, 6 June 2025