# Patent

## Title
Method and apparatus for distributed community finding

## Abstract

Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph.

## Background
FIELD OF THE INVENTION
The present invention relates in general to methods for analyzing relational systems where nodes have local interactions or links, and in particular to methods for analyzing linked databases.
BACKGROUND
Most information databases and knowledge repositories may be viewed as comprising classes of objects that interact with each other, as qualified by different relationships. These classes of objects and their interactions may also change with time, providing a dynamic view of the interaction patterns. Thus, based on available meta-information about the objects and their relationships, one may capture a body of knowledge in terms of a dynamic complex network, where nodes represent entities or objects belonging to the different object classes, and links represent the fact that the associated nodes are related via a particular type of relationship. For example, in a friendship information database, the nodes correspond to individuals, and links correspond to the fact that two individuals know each other. To capture the complex nature of, and nuances inherent in, almost all information repositories, a linked database or the network representation has to be suitably annotated. For example, in the case of friendship information, each node would have relevant information about the individual it represents (e.g., age, sex, race, location, hobbies, profession etc.) and each link has to be qualified with attributes, such as the nature of relationship (e.g., romantic, work related, hobby related, family, went to school together etc.) and the strength of the relationship (e.g., frequency of contacts etc.).
The above-mentioned linked database or information network may easily become very large-scale, comprising millions of nodes and links. For example, the world wide web (www) comprises a network of this type with potentially billions of nodes and links and complex relationships that qualify the links connecting the nodes or URLs. The large-scale and time-varying nature of such networks make them dynamic complex networks, and their size has prevented a direct and comprehensive mining and querying of such networks. The most common strategy has been to build structured databases, derived from the underlying network, and then to query these structured databases efficiently using existing tools. However, these indexed databases only capture particular slices or projections of the underlying network and do not provide answers to queries that do not directly fit the slice that was extracted to create the database. A good example is the service provided by Google: Given key words, it provides one with web pages that have the specified key words, and ranked according to their relevance or importance; the relevance or importance of a page is determined by its location in the global www, i.e., how many other “important” pages point to it etc. However, if one were to ask, for example, what is a company's web presence, in the sense of what types of individuals and news organizations are reporting on the company and who they represent and if they are relevant or important to the company, then there are no easy key words to get this information; and one may have to perform an exhaustive search with different key words followed by much post-processing in order to infer such information. Even then, one might get only those individuals or organizations who have directly reported on the company and it will be hard to get other individuals and organizations that are closely related to these direct reporters. Clearly, such information is embedded in the underlying network but not accessible via key words based searches. It has not been clear how one might address this issue and extract such information efficiently.
Recently, some progress has been made in this direction and people have started exploring so-called “communities” in complex networks or graphs. The underlying motivation comes from the fact that often we know a lot about an individual by studying the communities that the individual belongs in. The concepts of such “communities” have been solely structural so far, and different researchers have used different concepts of communities in the literature. However, a common thread is the understanding that a structural community is a set of nodes that are much more interconnected amongst themselves than with the rest of the nodes in the network.
Until recently the problem of finding communities in complex networks has been only studied in context of graph partitioning. Recent approaches [9, 12, 15, 21] provide new insight into how the communities may be identified and explored by optimizing the modularity partitioning of the network. These methods, inspired by diffusion theory, prune the edges with high betweenness to partition the graph from top to bottom to get cohesive communities.
Finding community structure of networks and identifying sets of closely related vertices have a large number of applications in various fields. Different methods have been used in the context of parallel computing, VLSI CAD, regulatory networks, digital library and social networks of friendship. The problem of finding partitioning of a graph has been of interest for a long time. The K-L (Kernighnan-Lin) algorithm was first proposed in 1970 for bisection of graphs for VLSI layouts to achieve load balancing. Spectral Partitioning [14] has been used to partition sparse matrices. Hierarchical clustering [18] has also been proposed to find cohesive social communities. While these algorithms perform well for certain partitioned graphs, they fail to explore and identify the community structure of general complex networks. In particular they usually require the number of communities and their size as input.
A number of divisive and agglomerative clustering algorithms are proposed. These algorithms, mostly inspired by diffusion theory concepts, identify boundaries of communities as edges or nodes with high betweenness. While there is no standard definition for a community or group in a network, they use a proposed definition based on social formation and interaction of groups [19]. Radicchi et. al. [15] similar to [9] define communities in strong and weak sense. A subgraph is a community in a strong sense if each node has more connections within the community than with the rest of the graph. In a similar fashion, a subgraph is a community in a weak sense if the sum of all degrees within the subgraph is larger than sum of all degrees toward the rest of the network. A similar definition is used in [7] to define web communities as a collection of web pages such that each member page has more hyper-links (in either direction) within the community than outside of the community. Inspired by the social definition of groups, Girvan and Newman [9] propose a divisive algorithm using several edge betweenness definitions to prune the network edges and partition the network into several communities. This algorithm has a heavy computational complexity of O(m2n) on an arbitrary network with m edges and n vertices. Faster algorithms are based on betweenness and similar ideas [12, 15, 21] and a modularity measure is proposed [12] to measure quality of communities. A faster implementation of [12] is reported [4] to run more quickly: O(md log n) where d is the depth of the dendrogram describing the community structure of the network.
Fast community finding algorithms using local algorithms may help in analyzing very large scale networks and may prove useful in complex network identification and analysis applications. These methods are applied to a number of different applications including social networks [13], biological networks [3, 17] and software networks [11]
However, the proposed methods fail to identify overlapping communities and how strong a node belongs to a community. They also require global knowledge of the network to generate communities of a particular subset of the network. Hueberman et. al. [21] note that a GN algorithm may be highly sensitive to network structure and may result in different solutions with small perturbation in network structure. As a solution they propose a randomized version of these algorithms to achieve robustness and confidence in community structure. But the algorithm is still centralized and requires global knowledge of the network. A number decentralized algorithms are based on random walks [10], or l-shell spreading [1]. These algorithms propose local methods to identify community structure of complex networks.
The proposed approaches have shortcomings, including the following.
Requirement for Global Knowledge. Proposed approaches require a global knowledge of network structure. i.e. they need to know global structure of the network in order to discover community structure of a particular subset of nodes and their surroundings. This is especially important for large scale networks where one is usually interested in communities of a particular node or set of nodes.
Inability to Deal with Overlapping Communities. Proposed community finding algorithms still find only cohesive subgroups. [19], i.e. they partition the network into communities and provide a dendrogram of community structure. It is noted that cohesive subgroups like LS and λ sets may not overlap by sharing some but not all members [19][23]. The fact that these sets are related by containment means that within a graph there is a hierarchy of a series of sets. Often, real-world networks do not have cohesive and independent clusters, but rather have overlapping communities like affliation networks. Such networks are two-mode networks that focus on the affliation of a set of actors with a set of events or communities, where each event consists of a subset of possibly overlapping communities. New algorithms are then needed to capture overlapping of communities.
Complexity. An implementation of Newman fast community finding [4] is reported to run in O(md log n) where d is the depth of the dendrogram describing the community structure. For many applications it is only required to find a community of a certain size related to a subset of nodes. Proposed diffusion-based algorithms do not scale in the sense that they require processing of the whole network to get local structures. A down to top local algorithm may provide flexibility of search constraints.
Lack of Confidence. One GN method does not provide any confidence for nodes in a community. This issue is revisited in [21] but still there is no complete framework defined to measure confidence of a node belonging to a community.
Structural vs. Informational Communities: The existing community finding algorithms find communities comprising nodes that are clustered or more linked among themselves than with the rest of the nodes in the network. However, in a linked database, there are different types of edges and nodes, and one might be interested in communities with respect to different relationships. For example, in the friendship network, we might be interested only in the communities that are based on romantic and family relationships. In such a case, we are dealing with a sub-network of interest where only the edges representing such relationships are kept and others are deleted. Similarly, one might ask about the community structure specific only to a time period or those restricted to a set of geographical locations. Such communities may be referred to as informational communities. It is clear that if one were to pre-compute such informational communities and their various combinations, unions, and intersections, for each node, then one will hit the wall of combinatorial explosion very soon. This further underscores the need for finding query-based informational communities. Moreover, as noted earlier one might be interested in informational communities of a particular node or a set of nodes.
SUMMARY OF THE INVENTION
The present invention takes advantage of the local nature of how communities form in networks, and that percolation provides a means to explore and identify overlapping communities in a local and distributed fashion. To be more precise, defined herein is a local structural community of a node or a set of nodes that (i) may be reached via percolation of messages from the given node a “high” percentage of time (the exact threshold to define “high” is a parameter that may be tuned) under repeated trials at a fixed percolation probability, and (ii) the size of the set remains fixed for a range of percolation probabilities. The strength of a node in such a structural community is a measure of how often the percolation message reaches it and the percolation probability used to obtain the community. For example, if the percolation probability is set to 1 then one would reach the whole network, assuming it forms a single connected component; so the higher the probability needed to reach a node, the lower should the strength of the node be in the community. By performing percolation from a set of nodes at various probabilities and determining their intersections and overlaps, one may determine the local structural communities of a set of nodes according to the present invention.
The relevance of the above definition of local communities is supported by the theory of percolation and percolation thresholds, as described below; moreover, as shown in our results, this definition subsumes the commonly-used criteria for defining communities in the literature. A particular topic of interest is the relationship of the communities defined herein with the concept of the k-hop neighborhood of a given node. In the latter, all nodes that may be reached within k hops of a node are determined. A potential problem with such a definition of a local community is that, in most complex networks, one would reach almost all the nodes in a few hops and the number of nodes reached in for example 2 or 3 hops is very large. Not all of these nodes are relevant to the node of interest. The method of defining communities in terms of percolation of messages is shown later on to be a robust one, and may be related to the concept of communities in various branches of science, engineering, and social sciences.
This concept of local structural community may now be generalized to include the construction of local informational community. In an informational community one wants to include or emphasize only those relationships that are of interest. This is incorporated in a framework according to the present invention by performing weighted percolation: When a message is percolated, the probability of it being sent on an edge is modified according to the weights associated with the node that the message sits in, as well as the weights assigned to the links. This allows one to extract communities to which a node, or a set of nodes, belongs with respect to specific attributes. For example, if one is interested in getting the community of a node in terms of its interactions with other nodes based on a specific time period, then one way would be to assign zero weights to all nodes and edges that do not belong to the time period, i.e., they were not created or did not exist during the period of interest. Also it may be noted that the concept of a local structural community is a special case of the local informational community, i.e., when all nodes and edges are treated with equal weights. Thus, in the claims and in the rest of this invention, we use the term local communities to denote local informational communities, as described above.
Starting with a database, a network may be created by identifying meta-information, for example characteristics of the data used to define nodes in the resulting network and relationships and weighting of the relationships that define the links (edges) connecting the nodes (vertices).
According to the present invention, a linked database is processed by queries identifying one or more seed nodes and giving one or more weights to types of edges and nodes and possibly different weights to each edge and node. By applying a percolation-based algorithm, and, in particular, a bond percolation algorithm such as those described in the Detailed Description below, the structural neighborhood of vertices in the network may be explored and the communities that make up their structural neighborhood identified. In addition, the strength of the relationship of a node to a community may be determined.
Further according to the present invention, the results of processing according to the present invention may be cut along various planes. Communities may be examined, for example with a text parser, to define characteristics of nodes or links in a community or a concept or set of concepts, to determine commonality among community members. This analysis may be further refined by giving higher weight to key words coming from high strength nodes recognized by their positions being central to the community. Thus both links and nodes may have their weights adjusted. Further processing according to the present invention yields subcommunities relevant to the concepts used to weight assigned to nodes and links. Such further processing may be repeated in as many iterations as desired to further refine the community structure or to cut through the communities in as many different planes as desired.
Apparatus according to the present invention include firmware encoding a percolation-based algorithm according to the present invention and hardware loaded with software encoding a percolation-based algorithm according to the present invention.
Apparatus according to the present invention also include computer readable media encoding a percolation-based algorithm according to the present invention.
Among the advantages of the present invention is the ability to employ user queries, including weighting of nodes and links, to tailor the result of the process to the objectives of the user.
Among advantages of the present invention is the ability to identify links and strengths between communities and explore strategic relationship between communities. (This is the GAP part).
A further advantage of the present invention is the ability to provide prespecified concepts and weights in packages tailored to specific applications.
Yet another advantage of the present invention is that it may be implemented with a watchdog function to monitor a database for updates relevant to user-selected parameters and to alert the user to relevant new information.



BRIEF DESCRIPTION OF THE DRAWINGS
FIGS. 1A-1F: illustrate diffusion versus percolation comparing edge betweenness for a particular source or between all pair of vertices and percolation starting from a certain vertex. The network consists of two overlapping communities of 1, . . . , 9 and 7 . . . , 15 FIG. 1A shows an original network of two overlapping communities. FIG. 1B through FIG. 1D depict edge betweenness starting from vertices 1 and 15 and for all vertex pairs. The thickness of overlapping communities. of edges are proportional to their betweenness. Edges to overlapping vertices are shown to have higher betweenness. FIG. 1E and FIG. 1F show percolation from vertex 1 and 15. Vertices within the community of source vertex have higher fraction of returned messages.
FIGS. 2A-2B illustrate the size of the connected components. In FIG. 2A the size will be relatively constant when identifying community structures. The size of the connected component is measured for different percolation probability. Percolation is started from vertex 1 and 15 respectively as depicted in FIG. 2A and FIG. 2B.
FIG. 3 depicts a basic network model. Graph G is a random ER graph where any pair of vertices are connected with probability p0. Subgraph Γ constitutes vertices in a community where they share a common interest or topic and thus have higher connection probability of pΓ.
FIGS. 4A-4B depict community network models. In FIG. 4A Graph G is again random ER graph where any pair of vertices are connected with probability p0. Subgraphs Γ1, and Γ2 constitute vertices with a common interest or topic and thus have higher connection probability of PΓ1 and pΓ2 respectively. In FIG. 4B the communities may overlap, i.e. have vertices in common or be disjoint.
FIGS. 5A-5B show synthetic random graph models. FIG. 5A illustrates the percentage of correctly classified vertices using an algorithm according to the present invention and a GN fast community finding algorithm [9] versus number of edges across communities. FIG. 5B shows the GN algorithm fails to detect communities when the number of intercommunity edges is close to number of edges inside community while the algorithm according to the present invention detects the communities.
FIGS. 6A-6C: illustrate use of a local community finding algorithm on randomly generated overlapping communities. Traditional partitioning algorithms including GN algorithm fail to identify the overlap and partition the common vertices to one of the communities. Percolation community finding identifies both communities and nodes in overlap. In FIG. 6A, original randomly generated communities are shown, Vertices only in one community are in blue and light blue respectively. Vertices belonging two both communities are in yellow. The rest of the vertices are in gray. FIG. 6B depicts the community finding result of a GN algorithm. The overlapping nodes are partitioned to one of the communities. Misclassified vertices are circled in red. FIG. 6C illustrates a percolation community finding result. Nodes in overlap of two communities belong to both communities. Size of vertices is proportional to their strength in community. By construction, the community is very homogenous. Misclassified vertices are circled in red.
FIGS. 7A-7D illustrate operation of a local community finding algorithm on administrator (1) and instructor (33) and high degree node (34). The detected nodes are in blue and the node sizes are proportional to how strong they belong to the community. In FIG. 7A, for the original Zachary karate club network, the nodes in blue have finally split to the administrator community while the nodes in yellow followed the administrator. FIG. 7B depicts community finding for node 1. FIG. 7C depicts community finding for node 33. FIG. 7D depicts community finding for node 34.
FIG. 8: depicts a community finding algorithm finding two major communities and 5 other smaller overlapping communities.
FIGS. 9A-9G show communities. FIG. 9A shows top level communities found using the algorithm according to the present invention and five smaller communities are shown. Nodes with strength greater than 0.20 are in blue. The blue node sizes are proportional to how strongly they belong to the community. The communities have several overlaps as described in the Detailed Description below. FIG. 9A shows community 1 with the instructor community found by the algorithm according to the present invention. FIG. 9B shows community 4 with the administrator community found by the algorithm according to the present invention. In incorporates some overlap nodes including node 34 because of their connections to both communities. It also excludes node 12 because it has only a single connection to node 1 and is not really a part of the community. This is an important difference between the definition of community included herein and other definitions. FIG. 9C, FIG. 9D, FIG. 9E, FIG. 9F, and FIG. 9G respectively depict communities 2, 3, 5, 6, and 7.
FIGS. 10A-10C depict flow charts. FIG. 10A depicts a generalized system flowchart according to the present invention, while FIG. 10B depicts a generalized system architecture according to the present invention. FIG. 10C depicts a core architectural model according to the present invention.
FIGS. 11A-11C illustrate system flowcharts for application to a patent database. FIG. 11A depicts the general system flowchart. FIG. 11B shows transaction flows prior to application of an algorithm according to the present invention. FIG. 11C shows transaction flow with application of an algorithm according to the present invention.



DETAILED DESCRIPTION
In the Detailed Description, a local algorithm according to the present invention based on percolation theory is described. Then the local community finding is generalized to an algorithm to detect and explore community structure of a complex network. Thereafter benchmarking is disclosed for the algorithm using different randomly generated networks and real world networks employed in the literature to estimate the performance of community finding algorithms.
Example 1
Percolation Community Finding Approach
In this section a social definition of communities is adopted, showing that percolation identifies communities of a given vertex compared to previous diffusion based algorithms. Next, essentials and performance of the algorithm on ER random graphs are illustrated.
A. Social Communities Revisited
While other definitions provide important insight into partitioning of the graph, a more local approach is chosen herein. Unlike cohesive community definitions, Garton et. al. [8] define communities as follows. In social network analysis context, a group is an empirically-discovered structure. By examining the pattern of relationships among members of a population, groups emerge as highly interconnected sets of actors known as cliques and clusters. In network analytic language, they are densely-knit (most possibilties exist) and tightly-bounded, i.e., most relevant ties stay within the defined network [18-20]. Social network analysts then want to know who belongs to a group, as well as the types and patterns of relations that define and sustain such a group. Note that this definition differs from pervious cohesive definitions used by Newman and others that not only most relevant ties should stay within the community but also nodes should be highly interconnected. [19]. It also allows overlap between communities.
This definition arises naturally in many biological, social or web networks that vertices with close functionality or interest form highly clustered communities. A vertex is connected to many other vertices within the community.
B. Percolation: Background
In an embodiment of the present invention, bond percolation is used as a tool for vertices to explore and identify their structural neighborhood. Percolation theory was first used to study the flow of fluids in porous media and introduced a new approach to problems usually dominated by diffusion theory. Percolation theory has been used to describe randomness and disorder in the structure of the medium while diffusion processes ascribe random movements of agents in a deterministic structure. Similar concepts have been used extensively in complex networks literature to model and analyze different phenomena in the network such as random walk and network robustness to node and edge failures. Many of these nonlinear dynamic properties of complex networks undergo phase transition when subject to different factors that affect interactions of structure and movement of agents in the system.
Other community finding algorithms have extensively used diffusion processes and random walks to define betweenness and identify partitioning of a network into different communities. According to the present invention, a different approach, percolation theory, is used to identify a highly clustered group of vertices that have close ties to each other. Diffusion based algorithms are based on the observation that edge betweenness [24] of edges at community boundaries are high since they enable communication between nodes in different communities. FIG. 1 illustrates this concept where thickness of edges are proportional to shortest-path betweenness between all vertices in the network. It may be easily seen that while boundaries of cohesive communities are easily identified, it does not perform well in overlapping communities. Instead of performing random walks, a percolation message is started from a node, constitutes the set of connected components and looks at the components when their size does not increase as percolation probability is increased, as shown in FIG. 2. FIG. 1D and FIG. 1E show how a distributed percolation search may return highly clustered nodes to a vertex where size of the nodes are proportional to the fraction of percolation messages returned. The random walk based algorithms may be viewed as randomized versions of breadth-first search while percolation method is a randomized version of depth-first search.
C. Performance on Random Graphs
Review of a simple community model in random graphs shows the relationship between empirical social definitions and complex network analysis. A collection of highly clustered ER graphs have been extensively used in the literature to analyze simple performance of community finding algorithms [9, 12, 15]. A random graph is a graph in which properties such as the number of graph vertices, graph edges, and connections between them are determined in some random way [2]. For many monotone-increasing properties of random graphs, graphs of a size slightly less than a certain threshold are very unlikely to have the property, whereas graphs with a few more graph edges are almost certain to have it. This is known as a phase transition or threshold phenomena. Of particular interest is the size of the largest connected component of the graph. An ER graph G(N; p) is a random graph with n vertices where each pair of vertices has an edge between them with probability p, [5, 6]. the existence of any two edges are independent events.
Consider a random ER graph of size N, where each pair of vertices are connected with probability p0(N). This may be viewed as (bond) percolation on a complete graph with percolation probability of p0(N). Erdos and Reneyi [5, 6] show that the connected components have interesting properties when p0(N) scale as p0(N)∝c/N. Depending on c, following behaviors happen with probability one for large N:
I. For c<1 size of the largest connected component is Θ(log(N)).
II. At phase transition and for c=1 size of the largest connected component is Θ(N2/3).
III. For c>1 a giant component appears and has size Θ(N).
Remark 1: Bond percolation on an ER graph of G(N; p0) with probability pp will result in an ER graph of G(N; p0.pp)
Thus the critical percolation probability for a randomly generated graph with p0 is given by pc=c/(p0N) where c>1. below this probability, vertex i will belong to a connected component of maximum size Θ(log(N)) and above the threshold the probability of almost all vertices belonging to a giant connected component is a constant, i.e. there is a path between any two randomly chosen pair of vertices with non vanishing constant probability for large N.
For a vertex i define set Sip as the connected component i including vertex i when (bond) percolating with probability p. Define the community with strength p of vertex i, Cip, as pair of (j, m) where jεSip for m iterations out of k iterations where m>kth.
The question remaining is how a vertex i identifies its communities distinctively, i.e. what values of percolation strength p corresponds to distinguishable communities. Returning to the definition of communities as sets of vertices with similar interest or topic and thus higher probability of connection, one may observe that communities will emerge as connected components when varying percolation probability. To illustrate this more consider a simple example of an ER graph, G(N, p0) of size N with probability p0. A subset Γ of nodes form a local community of size M, i.e. each pair of vertices are connected with probability pΓ>>p0, as illustrated in FIG. 3. Then,
Remark 2: For large M and N and percolation threshold of c/(p0N)>>pc>>c/(pΓM), probability of any two vertices i and j belonging to a connected component is one if they belong to Γ and is vanishingly small otherwise.
Proof The proof follows directly from property II since the percolation threshold is above the threshold for an ER graph of Γ and below the percolation threshold of a global ER graph.
This means that for any vertex i in Γ, Cip is approximately Γ for c/(p0N)>p>c/(pΓM) and will include almost all vertices of G for p>c/(p0N).
The definition is now generalized to multiple overlapping and non overlapping communities and investigate the behavior of Cip in different cases. Consider an ER graph of size N with probability p0 and two subgraphs, Γ1 and Γ2 of size M1 and M2 and connection probabilities of p1>>p0 and p2>>p0 respectively. Define critical percolation probabilities pci=c/(piMi), i=1, 2. Looking at the connected components as the percolation probability is swept for both overlapping and non overlapping cases, is illustrated in FIG. 4A and FIG. 4B.
For c/(p0N)>pp>max(pc1, pc2) the percolation probability is above subgraph percolation probabilities so using remark 2 almost all the vertices in each community are connected. Now consider two cases:
If Γ1 and Γ2 have overlaps then any two vertices within same subgraph are almost surely connected. So any two vertices in both the communities are connected almost surely. If starting percolation from a node in Γk, it will get back fraction qk of iterations from nodes in Γk, and naively fraction q1q2 of iterations from nodes in other community.
2. If Γ1 and Γ2 are non-overlapping, the probability of getting from any node in Γk to any other node when percolating is a non vanishing constant qk. Then the probability of getting from a node i in one community to a node j in another community is then 1−(1−q1q2)α where α is the expected number of edges between two community and in this model is approximately α=M1M2P0. So any two communities that have strong ties will also connect weakly were the strength depends roughly on number of edges between communities.
The above analysis predicts that Cip will have phase transitions at critical probabilities corresponding to communities, which analysis provides a local way of distinguishing communities without any global information.
Local Community Finding
A. Algorithm
The algorithm to find communities for each vertex involves sending a percolation message with percolation probability pp, forming Cipp for a range of pp and finding the abrupt change in the community size.
1. Vertex i sends a message with percolating probability pp with a unique ID identifying iteration;
2. It records the responses and constitutes the set Si ppof the vertices responded;
3. The above task is performed k times and constitutes set Ci pp of all the vertices responding more than kth.; and
4. Ci pp is computed for a range of pp and the abrupt changes in Cipp are found at percolation probabilities of ppl defining community layer l with strength ppl as Cippl.
The above algorithm basically finds nodes with high clustering and strong ties with the source node, while diffusion algorithms try to identify edges with high betweenness and high flow of random walks to find boundaries of communities. FIG. 1 compares diffusion-based algorithms and percolation-based algorithms.
B. Advantages
Using percolation-based algorithms has many advantages over divisive and agglomerative algorithms introduced in the literature. The distributed and parallel nature of percolation search provides a means to locally explore communities for a particular node, called their structure neighborhood [16]. Often in real-world networks communities are not cohesive and have overlaps, in which case diffusion-based approaches fail since there are no separate boundaries for communities to find. The algorithm according to the present invention explores communities and identifies vertices in overlap of communities. Another property of interest in community structure is how strong a vertex belongs to a community and the level of confidence in community structure [21]. A percolation search may be shown to easily provide these statistics by observing fraction of returned messages from a particular vertex. FIG. 1 illustrates the fundamental differences between diffusion- and percolation-based approaches. For a network with n vertices and m edges, other types of community finding algorithms may find community structure in O(md log(n)) [4] where d is the depth of community dendrogram. However, one needs to process the whole graph to capture community structure of a particular node.
Community Finding
In the previous section we discussed a local and distributed algorithm to find communities of a single vertex. In this section we generalize this method to find the community structure of the graph, usually called community dendrogram. In this case the dendrogram is not a simple tree since communities may overlap.
The first approach to create community structure is to define the non-symmetric distance d(i,j) between vertices as:




  
    d
    ⁡
    
      (
      
        i
        ,
        j
      
      )
    
  
  =
  
    {
    
      
        
          
            0
            ,
          
        
        
          
            
              j
              ∉
              
                
                  C
                  i
                  
                    p
                    pl
                  
                
                ⁢
                
                  ∀
                  l
                
              
            
            ;
          
        
      
      
        
          
            
              
                max
                m
              
              ⁢
              
                (
                
                  p
                  pm
                
                )
              
            
            ,
          
        
        
          
            
              m
              :
              
                j
                ∈
                
                  C
                  i
                  
                    p
                    pm
                  
                
              
            
            ;
          
        
      
    
  




Then classical clustering approaches may be used on this distance matrix to find the partitioning of nodes into communities. [25].
Since the local community finding algorithm finds major communities, taking advantage of this the present invention includes a global community finding algorithm that merges the individual vertex community finding results. This algorithm has several advantages over previously proposed algorithms. It is more robust since it merges the communities over several vertices. It allows overlap of communities and purge weak and insignificant communities automatically.
Community Finding Algorithm
For each community pair (C1, C2). We then have:



  
    
      n
      
        1
        ,
        2
      
    
    =
    
      
      
        {
        
          
            
              (
              
                i
                ,
                m
              
              )
            
            |
            
              
                (
                
                  i
                  ,
                  m
                
                )
              
              ∈
              
                C
                1
              
            
          
          ,
          
            
              (
              
                i
                ,
                
                  m
                  ′
                
              
              )
            
            ∈
            
              C
              2
            
          
          ,
          
            m
            >
            
              0.25
              ⁢
              
                m
                1
              
            
          
          ,
          
            
              m
              ′
            
            >
            
              0.25
              ⁢
              
                m
                2
              
            
          
        
        }
      
      
    
  




  
    
      n
      1
    
    =
    
      
        
        
          {
          
            
              
                (
                
                  i
                  ,
                  m
                
                )
              
              |
              
                
                  (
                  
                    i
                    ,
                    m
                  
                  )
                
                ∈
                
                  C
                  1
                
              
            
            ,
            
              
                (
                
                  i
                  ,
                  
                    m
                    ′
                  
                
                )
              
              ∉
              
                C
                2
              
            
            ,
            
              m
              >
              
                0.25
                ⁢
                
                  m
                  1
                
              
            
          
          }
        
        
      
      +
      
        
        
          {
          
            
              
                (
                
                  i
                  ,
                  m
                
                )
              
              |
              
                
                  (
                  
                    i
                    ,
                    m
                  
                  )
                
                ∈
                
                  C
                  1
                
              
            
            ,
            
              
                (
                
                  i
                  ,
                  
                    m
                    ′
                  
                
                )
              
              ∈
              
                C
                2
              
            
            ,
            
              m
              >
              
                0.25
                ⁢
                
                  m
                  1
                
              
            
            ,
            
              
                m
                ′
              
              ≤
              
                0.25
                ⁢
                
                  m
                  2
                
              
            
          
          }
        
        
      
    
  




  
    
      n
      2
    
    =
    
      
        
        
          {
          
            
              
                (
                
                  i
                  ,
                  m
                
                )
              
              |
              
                
                  (
                  
                    i
                    ,
                    m
                  
                  )
                
                ∉
                
                  C
                  1
                
              
            
            ,
            
              
                (
                
                  i
                  ,
                  
                    m
                    ′
                  
                
                )
              
              ∈
              
                C
                2
              
            
            ,
            
              
                m
                ′
              
              >
              
                0.25
                ⁢
                
                  m
                  2
                
              
            
          
          }
        
        
      
      +
      
        
        
          {
          
            
              
                (
                
                  i
                  ,
                  m
                
                )
              
              |
              
                
                  (
                  
                    i
                    ,
                    m
                  
                  )
                
                ∈
                
                  C
                  1
                
              
            
            ,
            
              
                (
                
                  i
                  ,
                  
                    m
                    ′
                  
                
                )
              
              ∈
              
                C
                2
              
            
            ,
            
              m
              ≤
              
                0.25
                ⁢
                
                  m
                  1
                
              
            
            ,
            
              
                m
                ′
              
              >
              
                0.25
                ⁢
                
                  m
                  2
                
              
            
          
          }
        
        
      
    
  



Where mi is the number of times community i has been merged. The similarity measure, ψ1,2, is then defined as (n1,2-(n1+n2))/(n1,2+(n1+n2)).

    1. For each vertex i in the network perform the local community finding algorithm to get different levels of communities Cippl corresponding to percolation probabilities ppl. Normalize it by M=max(m)∀(j,m)εCippl,j≠i. Set (i,m)=(i,1).
    2. Find the community pair Cl and Ck that have maximum similarity ψmax=maxi,jψi,j. if ψmax<1⁄3go to 3.
    3. Merge community Cl, into Ck and set mk=mk+ml 
    4. Normalize each remaining community Ck by






  
    (
    
      i
      ,
      m
    
    )
  
  =
  
    
      
        (
        
          i
          ,
          m
        
        )
      
      
        max
        
          
            (
            
              k
              ,
              n
            
            )
          
          ∈
          
            C
            k
          
        
      
    
    ⁢
    
      
        (
        n
        )
      
      .
    
  




To further benchmark an algorithm according to the present invention, the results with a number of randomly generated graphs and social and biological networks used to measure performance of previous community finding algorithms [9, 12, 15] are compared.
A. Randomly Generated Network
An algorithm according to the present invention is applied to two sets of randomly generated graphs. To benchmark the algorithm a traditional synthetic ER graph proposed in [9] is used. Then an overlap model of randomly generated graphs is used to demonstrate the advantages of proposed algorithm compared to partitioning algorithms and in particular to the fast community finding algorithm proposed in [9].
1. Random Non-Overlapping Communities.
A large number of graphs of size N=128. were generated and divided into 4 equal-sized communities of 32 vertices each. Any two vertices within the same community is connected with probability p1 and between different communities with probability p0. So that expected degree of vertices is 16. The performance of the community finding algorithm to find the communities, for different values of intra-community edges was examined. FIG. 5 shows the percentage of the vertices classified correctly for a range of intercommunity edges. The results are bench-marked with similar experiments with other algorithms. FIG. 5 shows that proposed algorithm works as well as a GN algorithm for small number of average inter-community edges per vertex and works considerably better for large values of inter-community edges inasmuch as the GN algorithm fails to detect communities because the number of edges inside a community and the number of edges to outside of the community is close. The algorithm according to the present invention detects communities with less precision since edges to outside of the community are randomly distributed over the network while inside edges form a clustered set of vertices that are more interconnected.
2. Random Overlapping Communities
While the previous example benchmarks performance of a community finding algorithms on random graphs, often in practical networks communities are not well separated as modeled in the previous model, but rather real life communities have overlaps, i.e. some of the nodes have strong ties to more than one community. One of the advantages of proposed algorithm due to its localized approach is that it may correctly identify overlapping communities, while traditional partitioning algorithms partition overlap vertices into one of the communities. Further enhancements of the GN algorithm propose to capture such behaviors by randomizing the partitioning steps [21].
Considering a randomly-generated graph with 128 vertices, each random vertex has 2 random edges on average. Two communities of size 37 exist where each node has on average 14 random edges inside the community. The two communities also have 5 nodes in common, as shown in FIG. 6A. Both a GN fast community finding algorithm and percolation community finding algorithm were applied. The GN method partitions the common vertices into one of the communities , as shown in FIG. 6B, while the method according to the present invention identifies communities and includes overlapping vertices in both communities, as shown in FIG. 6C. Using the method according to the present invention, seven nodes, {44, 60, 61, 77, 88, 90, 102}, are misclassified, while using the GN method 28 nodes are misclassified.
B. Zachary Karate Club
The local community finding algorithm according to the present invention has been applied to the Zachary karate club network [22]. This undirected graph has been used extensively in previous literature [9, 12, 15] for algorithm benchmark. Zachary recorded the contacts between members of a karate club over a period of time. During the study, after a fight between owner and trainer, the club eventually split in half. The original network and the partitioning after split is depicted in FIG. 7A. The local community finding algorithm according to the present invention was applied for three important nodes in the network. Nodes 1 and 33 represent the administrator and instructor respectively, and node 34 represents a high degree node with close relations with node 33, see FIG. 7. Note that the notion of community used herein is different from that of [9] and hence the outcome is different. The algorithm according to the resent invention looks for closely connected nodes in a cluster. Identified communities clearly have overlaps. The sizes of the nodes are proportional to their strength in the community. FIG. 7B shows the local community finding for node 1. As expected, node 17 is singled out since it does not have strong ties to the community. FIG. 7C shows the local community finding result for the instructor. Node 27 has been singled out of the community since it does not have strong social connections with the community. Also, nodes 10, 25, 26, 28, 29 were singled out. FIG. 7D shows the community for node 34 and it shows that it also includes the administrator. Note that although percolation probability is symmetrical, i.e. the probability of node i and j being in the same connected component, the inclusion in the community is not symmetrical and node 34 is not included in community of node 1. The reason is that the community threshold is different for the two depending on network neighborhood. The community structure finding algorithm was also applied. Seven overlapping communities were identified. FIG. 8 shows the schematic of the relationship between detected communities. Two major communities are represented in FIG. 9. Again the sizes of the nodes represent their strengths in the community. The algorithm is able to identify the communities correctly and further identify the role and strength of each node in the community. Several nodes are clearly in the overlap between the communities as they have weak ties with both communities. As expected, nodes 1 and 34 are in the both the communities because of their close social connections with both communities, and node 12 has been excluded from the administrator community because it only has a single connection to node 1.
In the present description, a new distributed algorithm for finding communities of a vertex in a localized fashion is disclosed. It exploits social definition of a community has highly interconnected set of vertices. The algorithm according to the present invention is generalized to achieve a list of the communities for a network. It is shown how this algorithm has superior performance over previous algorithms by allowing overlap between communities and robustness to network perturbations. The algorithm may be further optimized by taking advantage of the fact that strong nodes in a community have similar local communities, and so complexity of the algorithm may be reduced by removing this computational redundancy.
Variations in the basic algorithm include:
1. Starting from a set of seed nodes instead of a single node
2. Instead of defining a global and uniform percolation probability, each node i is assigned a weight between 0 and 1 as Wi. Each edge between nodes i and j may also be assigned a weight between 0 to 1 as Wij. Then each node instead of passing the message with Percolation probability Pperc it passes the message with a probability as a function of ƒ(Pperc,Wi,Wi,j) for example it may be PPerc*Wi*Wi,j
3. Nodes and links may have different types and each type may have a predefined weights.
4. Weights of different links may be trained and adjusted for a particular user depending on the usage pattern or concept. For example, for a user searching for biotechnology, weight of the nodes in other concepts like food industry could be reduced
5. Sweeping over percolation probability may be optimized by doing a quick search over this metric.
6. Result of the community findings may be used to adjust link and node weights
The present invention has a broad scope of applicability to almost any collection of data. FIG. 10A depicts a generalized system flowchart of a generalized process according to the present invention. The flowchart includes forming the network, assigning different weights, and performing local community finding on the network. This process is refined by feedback to adjust weights and modify nodes based on query, community results and/or user feedback. FIG. 10B illustrates a system architecture reference model; The system includes different layers. Meta-data is imported from various operational information databases and is organized and processed into a meta-data repository. Different information retrieval components are used to analyze the data for particular applications. Customer and web services access an enterprise portal network with general interfaces to make queries and receive results processed by an information retrieval framework and refined information presentation framework. FIG. 10C illustrates a core architectural model according to the present invention wherein a meta-data repository consists of analyzed linked storage of different types of data as discussed with respect to the system architecture. Different plug-ins may be used to interact with structural analysis engines to answer queries. A standard command/report API is used to access the system through web services.
It may be applied to documents, such as papers, patents, FDA clinical trials documents, product descriptions, news reports, market analyses, analyst reports, business reporting information, and any combination or permutation thereof. It may also be employed in applications for analysis of the World Wide Web, Email and spam filtering. The present invention may also be applied to pattern detection in biological networks, such as transcription regulatory networks, social networks and communities, for example for military and homeland security applications.
In a patent: finding landscape, the present invention may be used to analyze competitors and to monitor those competitors with a watchdog capability by flagging results of ongoing analyses of companies, concepts, and technologies. FIG. 11A illustrates a system flowchart for application to patent information. The results are refined by feeding back the user adjustments of results to a meta-data repository. FIG. 11B shows transaction flows prior to application of an algorithm according to the present invention. FIG. 11C shows transaction flow with application to landscape analysis of patents using an algorithm according to the present invention.
The present invention also enables a user to browse through communities and fine-tune the results with a simple binary filter. In application to market analysis, the present invention may be used to provide a portfolio for different sections of the market in terms of competitors, technologies, latest news and technical papers and publications. Gaps between communities, and hence opportunities not covered by competitors, may be discovered by examining inter-community relations.
The present invention may be used to find the web neighborhood of a website, its impact and links and communities on the web. It may also be used to monitor the neighborhood change over time. The present invention also provides an email and spam filter. by providing a method to reduce spam and deliver messages only from the people relevant to an address.
Recently the problem of unsolicited commercial email or spam has been identified as an ubiquitous problem with email. The present invention provides a more general framework of cybertrust which not only provides a solution to the spam problem, but also restricts email access to trusted individuals. A new distributed method may be based on percolation theory for identifying individual users local network trust in cyberspace using simple local interactions. Recommendation and social connections are used in daily activities to identify trust and reliability. Adopting the same social approach, percolative communication of email messages and limiting interactions to social contacts restricts communication to locally trusted overlapping of communities. The method according to the present invention further exploits the properties of social networks to construct a distributed web of trust based on a user's personal email network to simultaneously prevent spam emails and emails from unwanted sources. The algorithm represents a new paradigm for email communication that proves superior to simple white-list/black-list approaches.
The problem is not just spam, the problem is the user receiving email from the people the user doesn't know. Many people simply discard an email if it is not from their contact list or unless somebody introduces them through an email (CC). This notion of online recommendation may be generalized according to the present invention and made invisible and intuitive. The method according to the present invention may be combined with Bayesian and text based filters.
Behind the implementing algorithm is the present invention of applying percolation to overlapping communities for a user. The header of the email is changed so that it includes current receiver (To) and final destination (Final-To). Then upon receiving an email, if the final destination is the user, it is delivered to the user's inbox else if Current destination is me and time to live of email is less than some threshold I forward it to people in my contact list with forwarding probability P. This probability is chosen by user and can define how the limited a user wants to define its email community.










Algorithm 1 PROCESS-MAIL(Email E)
















1:
if E.F ROM is not in Contact list then


2:
 Put E in (High-Probability-Spam)


3:
else


4:
 if E.FinalTO = MyAddress then


5:
  Put E in INBOX


6:
 else


7:
  if TTL<Threshold then


8:
   for all ContactAddress in ContactList do


9:
    RandomVal = RANDOM-GEN01( );


10:
    if RandomVal < ForwardingProbability then


11:
     SENDMAIL(FinalTo:E.FinalTo,



     From:MyAddress,



     To:ContactAddress)


12:
    end if


13:
   end for


14:
  end if


15:
 end if


16:
end if



contacts.









Where SENDMAIL(FinalTo, From,To) sends an email with a proper header for TO, FROM and FinalTo.
The algorithm according to the present invention may be implemented in a distributed fashion, or in a centralized fashion by emulating it in the mail server for large email providers. In one variation according to the present invention, the forwarding probability may be weighted as a function of the email traffic between a sender and the user.
For social networks, including dating and recreational activities, the present invention may be used to identify communities and relationship between communities using social interactions data and to find the best social connection with a group of people.
With respect to biological networks like transcription regulatory networks, the present invention may be used to discover functional blueprints of a cellular system from large-scale and high-throughput sequence and experimental data and allowing complex intracellular processes. to be revealed. See http://arxiv.org/abs/q-bio.MN/0501039). The present invention may be used to mine genomic data and other data to correlate functional and structural with sequence data, for example. Also according to the present invention, literature, patent, patient history, drug trial and other data may be mined to assist in providing diagnosis or prognosis for a disease in a patient.
Patterns and communities may be revealed by applying the present invention to homeland security data: Finding certain patterns of groups and behaviors related to homeland security, communities with certain relevant characteristics may be identified.
The present invention may be implemented with databases including relational databases, relational mappings, graph databases. For example, a wide variety of database products may be used with the present invention, such as:—MySQL by MySQL AB, Bangårdsgatan 8S-753 20 UppsalaSweden: SQL from Microsoft, Richmond, Wash.; and Oracle, Oracle Corp. 500 Oracle Parkway, Redwood Shores, Calif. 94065;
Natural language processing tools may be used in conjunction with the present invention to provide, for example, text parsing. Such tools include: WebFountain: International Business Machines Corporation New Orchard Road, Armonk, N. Y.; 10504914-499-1900; Engenium,: Engenium, Dallas, Tex.; Telcordia Latent Semantic Indexing Software,: Telcordia Technologies, Inc., Piscataway, N.J.; General Text Parser: University of Tennessee Knoxville Tenn.
Also, according to the present invention, graph visualization and layout tools may be employed for improving the quality of analysis, including: aiSee: AbslntAngewandte Informatik GmbH, Stuhlsatzenhausweg 69, 66123 Saarbruecken, Germany; Prefuse: http://prefuse.sourceforge.net/(open source—GNU written at the Univeristy of California, Berkeley and Palo Alto Research Center by Jeffrey Heer); and Jgraph,: JGraph, Ltd., http://www.igraph.com/.
REFERENCES


    [1] Bagrow, J., and Bollt, E. A Local Method for Detecting Communities. ArXiv Condensed Matter e-prints (Dec. 2004).
    [2] Bollobas, B. Random Graphs Second Edition. Cambridge University Press, United Kingdom, 2001.
    [3] Boscolo, R., Rezaei, B. A., Boykin, P. O., and Roychowdhury, V. P. Functionality Encoded In Topology? Discovering Macroscopic Regulatory Modules from Large-Scale Protein-DNA Interaction Networks. Reprint arXiv:q-bio/0501039 (Jan. 2005).
    [4] Clauset, A., Newman, M. E., and Moore, C. Finding community structure in very large networks. Phys. Rev. E 70, 6 (Dec. 2004), 06611-+.
    [5] Erdos, P., and Renyi, A. On the evolution of random graphs. Publications of the Math. Inst. of the Hungarian Academy of Sc. (1960).
    [6] Erdos, P., and Renyi, A. On the strength of connectedness of a random graph. Acta Mathematica Scientia Hungary 12 (1961), 261-267.
    [7] Flake, G. W., Lawrence, S., Giles, C. L., and Coetzee, F. M. Self-organization and identification of web communities. Computer 35, 3 (2002), 66-71.
    [8] Garton, L., Haythomthwaite, C., and Wellman, B. Studying online social networks. In Doing Internet Research, S. Jones, Ed. Sage, Thousand Oaks, Calif., 1999, pp. 75-105.
    [9] Girvan, M., and Newman, M. E. J. Community structure in social and biological networks. PNAS 99, 12 (2002), 7821-7826.
    [10] Latapy, M., and Pons, P. Computing communities in large networks using random walks. ArXiv Condensed Matter e-prints (Dec. 2004).
    [11] Luis, J. G.-B. Community structure of modules in the apache project.
    [12] Newman, M. E. Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 6 (June 2004), 066133-+.
    [13] Newman, M. E. J. Coauthorship networks and patterns of scientific collaboration. PNAS 101 (2004), 5200-5205.
    [14] Pothen, A., Simon, H. D., and Liou, K.-P. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11, 3 (1990), 430-452.
    [15] Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., and Parisi, D. Defining and identifying communities in networks. PNAS 101, 9 (2004), 2658-2663.
    [16] Rezaei, B. A., and Roychowdhury, V. P. Percolation Crawlers: Finding webneighborhoods. preprint (2004).
    [17] Rives, A. W., and Galitski, T. Modular organization of cellular networks. PNAS 100, 3 (2003), 1128-1133.
    [18] Scott, J. Social Network Analysis: A Handbook, 2nd ed. Sage Publications, London, 2000.
    [19] Wasserman, S., and Faust., K. Cambridge University Press. Acta Mathematica Scientia Hungary (1994).
    [20] Wellman, B., Salaff, J., Dimitrova, D., Garton, L., Gulia, M., and Haythornthwaite, C. Computer networks as a social networks: collaborative work, tele work, and virtual community. Annual Reviews Sociology 22 (1996), 213-238.
    [21] Wu, F., and Huberman, B. A. Finding communities in linear time: a physics approach. European Physical Journal B 38 (2004), 331-338.
    [22] Zachary, W. W. San information flow model for conflict and fission in small groups. Journal of Anthropological Research 33 (1977), 452473.
    [23] Let H be a set of nodes in graph G(V,E) and let K be a proper subset of H. Let α(K) denote the number of edges linking members of K to V_K (the set of nodes not in K). Then H is an LS set of G if for every proper subset K of H, α(K)>α(H). A key property of LS sets is high edge connectivity. Specifically, every node in an LS set has higher edge connectivity with other members of the LS set than with any non-member. Specifically, every node in an LS set has higher edge connectivity (λ) with other members of the LS set than with any non-member. Taking this as the sole criterion for defining a cohesive subset, a lambda set is defined as a maximal subset of nodes S such that for all a,b,c□S and d□V-S, λ(a,b)>λ(c,d). To the extent that λ is high, members of the same lambda set are difficult to disconnect from one another because λ defines the number of edges that must be removed from the graph in order to disconnect the nodes within the lambda set.
    [24] There are several ways of defining betweennesss as described in [9] based on shortest-path or random-walks
    [25] B. W. Kemighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell System Technical Journal 49, 291-307 (1970).


Although the present invention has been described in terms of embodiments, it is not intended that the invention be limited thereto. It is expected that further variations and improvements will occur to those skilled in the art upon consideration of the present invention, and it is intended that all such variations come within the scope of the claims.

## Claims

1. A computer-implemented method comprising:
initiating a percolation message from a source node of a linked network, the linked network comprising a plurality of nodes and a plurality of edges, each edge connecting at least two of the plurality of nodes, wherein a node is a neighbor if the node is connected to another node in the plurality of nodes by an edge, wherein the percolation message comprises a percolation probability and an identifier of the source node, and wherein initiating a percolation message from the source node comprises transmitting the percolation message to each neighbor of the source node with the percolation probability;
propagating the percolation message through the linked network, wherein propagating the percolation message through the linked network comprises:
transmitting the percolation message from each node that receives the percolation message to each neighbor of each node that receives the percolation message; and
transmitting a response to the source node from each node that receives the percolation message;

collecting each response to the percolation message at the source node; and
storing a list of nodes that transmitted the response at the source node.

2. The method of claim 1, further comprising repeating a plurality of times the initiating the percolation message from the source node, propagating the percolation message through the network, collecting responses to the percolation message at the source node and storing the list of nodes.

3. The method of claim 2, wherein the repeating the plurality of times is predetermined.

4. The method of claim 2, wherein the repeating the plurality of times occurs until the list of nodes stabilizes.

5. The method of claim 2, further comprising aggregating the list of nodes to generate a local neighborhood of the source node at the percolation probability, wherein the list of nodes is weighted based on the number of times each node was reached.

6. The method of claim 5, further comprising generating a local neighborhood of the source node at a plurality of percolation probabilities.

7. The method of claim 6, wherein the plurality of percolation probabilities are a set of values selected between 0 and 1.

8. The method of claim 7, wherein the set of values are selected between 0 and 1 and have a step size of p0.

9. The method of claim 6, further comprising:
plotting the size of the local neighborhood at each of the plurality of percolation probabilities versus the percolation probability;
determining sharp transitions in the plot, wherein a sharp transition at a percolation probability pn of the plurality of percolation probabilities is p_n, wherein p_n is a phase transition probability, and wherein a phase transition occurs at the first percolation pn if the slope is greater than a first threshold s0 and the total change in size of the local neighborhood at the percolation probability pn is greater than a second threshold h0, wherein n is any value between 1 and L; and
ordering the determined phase transition probabilities in an increasing order from 1 to L.

10. The method of claim 9, further comprising:
labeling a local neighborhood at a percolation probability between a first phase transition probability p_1 and a second phase transition probability p_2 as a closest local community of the source node;
labeling a union of the closest local community and a local neighborhood at a percolation probability between a second phase transition probability p_2 and a third phase transition probability p_3 as a second closest local community.

11. The method of claim 1, wherein each edge is assigned a weight, and the probability that a percolation message is transmitted to a neighbor of a node is determined as a function of the percolation probability and the weight of the edge connecting the node to the neighbor.

12. The method of claim 1, wherein each edge is assigned a weight, and the probability that a percolation message is transmitted to a neighbor of a node is determined as a function of the percolation probability, the weight of the edge connecting the node to the neighbor and a property of the neighbor.

13. The method of claim 12, wherein the property of the neighbor is a degree of connection.

14. The method of claim 1, wherein each edge is at least one of an in-bound edge and an out-bound edge, and wherein the percolation message is transmitted only to out-bound edges of a node.

15. A computer-implemented method comprising:
assigning a set of nodes as source nodes;
initiating a plurality of percolation messages from each of source nodes at a plurality of percolation probabilities, wherein the plurality of percolation probabilities are selected from a set of values between 0 and 1;
determining a list of nodes that received the plurality of percolation messages for each of the plurality of source nodes;
aggregating the list of nodes for each of the plurality of source nodes to determine a local neighborhood for each of the plurality of source nodes, wherein each node is weighted based on a number of times each node received the plurality of percolation messages;
plotting the local neighborhood size versus percolation probabilities for each of the local neighborhoods;
locating phase transition points in the plot; and
determining nested local communities for the plurality of source nodes by combining the local neighborhoods at the phase transition points.

16. The method of claim 15, wherein the plurality of nodes are connected by a plurality of edges, wherein each edge is assigned a weight, and the probability that a percolation message is transmitted to a neighbor of a node is determined as a function of the percolation probability and the weight of the edge connecting the node to the neighbor.

17. The method of claim 15, wherein the plurality of nodes are connected by a plurality of edges, wherein each edge is assigned a weight, and the probability that a percolation message is transmitted to a neighbor of a node is determined as a function of the percolation probability, the weight of the edge connecting the node to the neighbor and a property of the neighbor.

18. The method of claim 15, wherein the plurality of nodes are connected by a plurality of edges, wherein each edge is at least one of an in-bound edge and an out-bound edge, and wherein the percolation message is transmitted only to out-bound edges of a node.

19. A computer-implemented method comprising:
selecting a node in a network as a source node;
computing a set of local communities for the source node;
identifying a set of nodes in the set of local communities having a weight greater than a threshold;
generating a strong local community for the source node including only the set of nodes that have a weight greater than the threshold;
storing the strong local community as one of a plurality of communities of the network;
removing the set of nodes in the strong local community and edges connected to the set of nodes from the network to generate a reduced network;
selecting a node in the reduced network as a second source node;
generating a second strong local community for the second source node, the second strong local community comprising a second set of nodes;
storing the second strong local community as one of the plurality of communities of the network;
removing the second set of nodes in the second strong local community from the network to generate a second reduced network;
repeating the selecting, generating, storing and removing until a reduced network is generated that comprises only nodes with a degree less than a threshold value; and
labeling the set of stored strong local communities as one of a disjoint community structure of the network or an overlapping community structure of the network.

20. The method of claim 19, wherein each edge is assigned a weight, and the probability that a percolation message is transmitted to a neighbor of a node is determined as a function of the percolation probability and the weight of the edge connecting the node to the neighbor.

21. The method of claim 19, wherein each edge is assigned a weight, and the probability that a percolation message is transmitted to a neighbor of a node is determined as a function of the percolation probability, the weight of the edge connecting the node to the neighbor and a property of the neighbor.

22. The method of claim 19, wherein each edge is at least one of an in-bound edge and an out-bound edge, and wherein the percolation message is transmitted only to out-bound edges of a node.

23. The method of claim 19, wherein a plurality of additional nodes are added to the network to form an augmented network, the plurality of additional nodes connected to the plurality of nodes in the network by edges, and further comprising determining a local strong neighborhood for at least one of the plurality of additional nodes and adding the determined local strong neighborhood to community structure of the network to determine a community structure of the augmented network.

24. The method of claim 19, wherein the edges and nodes comprise time stamps, and wherein a time evolution of the community structure of the network is determined based on the time stamps.