Social network graph inference and aggregation with portability, protected shared content, and application programs spanning multiple social networks

Abstract

An application program spans a plurality of digital social networks. The application program includes an inferred digital social network. Consent is obtained from a plurality of users of the digital social networks to participation in the inferred. digital social network. Information is automatically obtained from the digital social networks for the users, through a plurality of respective communication channels, which can be application program interfaces or covert or subliminal channels, The information includes link information between each of the users and other individuals in the digital social networks. The information is aggregated for the users to form the inferred digital social network, corresponding to a graph having nodes representing the users and the other individuals and having links between the nodes representing social relationships. Each of the users is enabled to send and receive message information with other users, to view profile information of other users, and to view social contact information of other users, through the inferred digital social network. In response to inputs from the users, the application program provides state information to the digital social networks spanned by the application program that the digital social networks cause to be communicated to users of the digital social networks.

What is claimed is: 
     
       1. A method of operating computer-based digital social networks, comprising the steps of:
 obtaining knowing consent, from a plurality of users of a first digital social network, to participation in an operational second digital social network, the first digital social network being an operational network that enables digital social networking within the first digital social network by allowing users to join the first digital social network, without joining the second digital social network, and to send messages within the first digital social network to other users of the first digital social network, and the second digital social network being an operational network distinct from the first digital social network and enabling digital social networking within the second digital social network, distinct and apart from the first digital social network, by allowing users to join the second digital social network, without joining the first digital social network, and to send messages within the second digital social network to other users of the second digital social network, 
 automatically obtaining information from the first digital social network for the plurality of users of the first digital social network, including inferring link information between each of the plurality of users of the first digital social network and other individuals in the first digital social network that are not directly connected in the first digital social network to the respective ones of the plurality of users of the first digital social network, 
 storing the second digital social network, and enabling access thereto, on at least one computerized digital data processing system, the second digital social network corresponding to a graph having nodes at least some of which represent the plurality of users, and having links between the nodes representing social relationships, 
 wherein the second digital social network uses the automatically obtained information, including at least the link information, to identify, for ones of the plurality of users, friends of a friend from the first digital social network, and 
 enabling digital social networking between the plurality of users, using a respective plurality of computerized digital data processing systems, within the second digital social network, apart from the first digital social network, by enabling shared content within the second digital social network between the plurality of users, and by enabling links within the second digital social network to be formed between nodes of the graph of the second social network that represent ones of the users for whom content sharing is enabled within the second digital social network with other ones of the users, such that the graph has a structure that changes state when the links are formed. 
 
     
     
       2. The method of  claim 1 , wherein the operational second digital social network is an inferred digital social network. 
     
     
       3. The method of  claim 1 , wherein the step of automatically obtaining information from the first digital social network for the plurality of users of the first digital social network is performed by computerized data mining logic implemented by a processor. 
     
     
       4. The method of  claim 1 , wherein the automatically obtained link information corresponds to individual views, for each of the plurality of users, of an overall graph structure of at least a neighborhood of the first digital social network, the graph structure having nodes representing individuals in the first digital social network and links representing connections between the individuals. 
     
     
       5. The method of  claim 1 , further comprising aggregating the information for the plurality of users to form the second digital social network corresponding to a graph having nodes representing the plurality of users and the other individuals and having links between the nodes representing social relationships. 
     
     
       6. The method of  claim 1 , wherein the users are enabled to identify friends of a friend from the first digital social network in the second digital social network by the users setting a level of inference for the information to be obtained from the first digital social network. 
     
     
       7. The method of  claim 6 , wherein the users are further enabled to identify friends of a friend from the first digital social network in the second digital social network by enabling the users to opt in to the second digital social network obtaining information from the first digital social network. 
     
     
       8. The method of  claim 6 , wherein the users are further enabled to identify friends of a friend from the first digital social network in the second digital social network by enabling the users to access an inference network display representing social network connections for the inferred second digital social network. 
     
     
       9. The method of  claim 1 , further comprising enabling the users to set privacy settings for the information to be obtained from the first social network. 
     
     
       10. The method of  claim 1 , wherein the automatically obtained information further comprises edge weightings designating link quality information. 
     
     
       11. At least one non-transitory computer-readable medium having computer-executable instructions embodied thereon, which, when executed by at least one processor, cause the at least one processor to:
 obtain knowing consent, from a plurality of users of a first digital social network, to participation in an operational second digital social network, the first digital social network being an operational network that enables digital social networking within the first digital social network by allowing users to join the first digital social network, without joining the second digital social network, and to send messages within the first digital social network to other users of the first digital social network, and the second digital social network being an operational network distinct from the first digital social network and enabling digital social networking within the second digital social network, distinct and apart from the first digital social network, by allowing users to join the second digital social network, without joining the first digital social network, and to send messages within the second digital social network to other users of the second digital social network, 
 automatically obtain information from the first digital social network for the plurality of users of the first digital social network, including inferring link information between each of the plurality of users of the first digital social network and other individuals in the first digital social network that are not directly connected in the first digital social network to the respective ones of the plurality of users of the first digital social network, 
 store the second digital social network, and enable access thereto, on at least one computerized digital data processing system, the second digital social network corresponding to a graph having nodes at least some of which represent the plurality of users, and having links between the nodes representing social relationships, 
 wherein the second digital social network uses the automatically obtained information, including at least the link information, to identify, for ones of the plurality of users, friends of a friend from the first digital social network, and 
 enable digital social networking between the plurality of users, using a respective plurality of computerized digital data processing systems, within the second digital social network, apart from the first digital social network, by enabling shared content within the second digital social network between the plurality of users, and by enabling links within the second digital social network to be formed between nodes of the graph of the second social network that represent ones of the users for whom content sharing is enabled within the second digital social network with other ones of the users, such that the graph has a structure that changes state when the links are formed. 
 
     
     
       12. The at least one non-transitory computer-readable medium of  claim 11 , wherein the operational second digital social network is an inferred digital social network. 
     
     
       13. The at least one non-transitory computer-readable medium of  claim 11 , wherein the step of automatically obtaining information from the first digital social network for the plurality of users of the first digital social network is performed by computerized data mining logic implemented by a processor. 
     
     
       14. The at least one non-transitory computer-readable medium of  claim 11 , wherein the automatically obtained link information corresponds to individual views, for each of the plurality of users, of an overall graph structure of at least a neighborhood of the first digital social network, the graph structure having nodes representing individuals in the at least one-first digital social network and links representing connections between the individuals. 
     
     
       15. The at least one non-transitory computer-readable medium of  claim 11 , wherein the at least one processor further aggregates the information for the plurality of users to form the second digital social network corresponding to a graph having nodes representing the plurality of users and the other individuals and having links between the nodes representing social relationships. 
     
     
       16. The at least one non-transitory computer-readable medium of  claim 11 , wherein the users are enabled to identify friends of a friend from the first digital social network in the second digital social network by the users setting a level of inference for the information to be obtained from the first digital social network. 
     
     
       17. The at least one non-transitory computer-readable medium of  claim 16 , wherein the users are further enabled to identify friends of a friend from the first digital social network in the second digital social network by enabling the users to opt in to the second digital social network obtaining information from the first digital social network. 
     
     
       18. The at least one non-transitory computer-readable medium of  claim 16 , wherein the users are further enabled to identify friends of a friend from the first digital social network in the second digital social network by enabling the users to access an inference network display representing social network connections for the inferred second digital social network. 
     
     
       19. The at least one non-transitory computer-readable medium of  claim 11 , wherein the at least one processor further enables the users to set privacy settings for the information to be obtained from the first social network. 
     
     
       20. The at least one non-transitory computer-readable medium of  claim 11 , wherein the automatically obtained information further comprises edge weightings designating link quality information.