Efficient Algorithms for Public-Private Social Networks

@article{Chierichetti2015EfficientAF,
  title={Efficient Algorithms for Public-Private Social Networks},
  author={Flavio Chierichetti and Alessandro Epasto and Ravi Kumar and Silvio Lattanzi and Vahab S. Mirrokni},
  journal={Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},
  year={2015}
}
We introduce the public-private model of graphs. In this model, we have a public graph and each node in the public graph has an associated private graph. The motivation for studying this model stems from social networks, where the nodes are the users, the public graph is visible to everyone, and the private graph at each node is visible only to the user at the node. From each node's viewpoint, the graph is just a union of its private graph and the public graph. We consider the problem of… 

Figures and Tables from this paper

Algorithms in the Public-Private Model to Sub-Additive functions
TLDR
The algorithm for the All Pairs Shortest Path(APSP) problem in the Public-Private model is described and details of the experimental analysis of this algorithm run on real-world social network data are given.
Indexing Public-Private Graphs
TLDR
This paper first formulate the problem as asymmetric k-center with outliers, and then gives an efficient and practical algorithm to identify a set of additional visible seed nodes for each user.
PPKWS: An Efficient Framework for Keyword Search on Public-Private Networks
TLDR
A new keyword search framework, called public-private keyword search (PPKWS), which is verified through experiments that the algorithms implemented on top of PPKWS run 113 times faster than the original algorithms directly running on the public network attached to the private network for retrieving answers that spans through them.
PP-DBLP: Modeling and Generating Attributed Public-Private Networks with DBLP
TLDR
This paper generates four public-private networks from real-world DBLP records, called PP-DBLP, and proposes an advanced model of attributed public- private graphs where vertices have not only private edges but also private attributes, which is motivated by widely existing attributed graphs.
Community Search over Big Graphs: Models, Algorithms, and Opportunities
TLDR
This tutorial surveys the state-of-the-art of community search on various kinds of networks across different application areas such as densely-connected community search, attributedcommunity search, social circle discovery, and querying geosocial groups.
Estimating the Number of Induced Subgraphs from Incomplete Data and Neighborhood Queries
TLDR
This work investigates how to efficiently estimate the number of small subgraphs based on full access to one or two noisy and incomplete samples of a large underlying network and on few queries revealing the neighborhood of carefully selected vertices.
A survey of community search over big graphs
TLDR
This survey conducts a thorough review of existing community search works, analyzes and compares the quality of communities under their models, and the performance of different solutions, and points out new research directions.
Speeding-up node influence computation for huge social networks
TLDR
Main finding includes that different network structures have different epidemic thresholds and the node influence can identify influential nodes that the existing centrality measures cannot and the network structure is systematically changed using synthetically generated networks.
Fast Distributed Submodular Cover: Public-Private Data Summarization
TLDR
A fast distributed algorithm for submodular cover, FASTCOVER, is developed that provides a succinct summary of massive dataset in one shot and for all users and is competitive with that of the centralized algorithm with the number of rounds that is exponentially smaller than state of the art results.
Search engine drives the evolution of social networks
TLDR
A search network model for social network evolution is proposed, it is proved that the degree distribution follows an intensified power-law, and the network diameter shrinks, and it is quantitatively shown that the search engine accelerates the rumor propagation in social networks.
...
1
2
3
...

References

SHOWING 1-10 OF 34 REFERENCES
Estimating Sizes of Social Networks via Biased Sampling
TLDR
This article presents algorithms for estimating the number of users in online social networks by adopting the standard abstraction of social networks as undirected graphs and performing random walk-based node sampling, showing analytically that the estimate error vanishes with high probability for fewer samples than those required by prior-art algorithms.
Analyzing graph structure via linear measurements
TLDR
The study of graph sketching is initiated, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph are studied, including the first dynamic graph semi-streaming algorithms for connectivity, spanning trees, sparsification, and matching problems.
All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis
  • E. Cohen
  • Computer Science
    IEEE Transactions on Knowledge and Data Engineering
  • 2015
TLDR
This work presents the historic inverse probability (HIP) estimators which are applied to the ADS of a node to estimate a large natural class of statistics, and obtains a polynomial improvement for more general statistics and the estimators are simple, flexible, unbiased, and elegant.
A sketch-based distance oracle for web-scale graphs
TLDR
This work studies the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks, and moves the time-consuming shortest-path computation offline, and at query time only looks up precomputed values and performs simple and fast computations on these precomputable values.
Estimating clustering coefficients and size of social networks via random walk
TLDR
The main insight offered by this work is that only a relatively small number of public interface calls are required to allow the algorithms to achieve a high accuracy estimation, and the error of this estimation drops exponentially in the number of random walk steps.
Local Partitioning for Directed Graphs Using PageRank
TLDR
It is proved that by computing a personalized PageRank vector in a directed graph, starting from a single seed vertex within a set S that has conductance at most α, and by performing a sweep over that vector, one can obtain a set of vertices S′ with conductance.
Greedy approximation algorithms for finding dense components in a graph
TLDR
This paper gives simple greedy approximation algorithms for these optimization problems of finding subgraphs maximizing these notions of density for undirected and directed graphs and answers an open question about the complexity of the optimization problem for directed graphs.
HyperANF: approximating the neighbourhood function of very large graphs on a budget
TLDR
The spid (Shortest-Paths Index of Dispersion) of a graph is proposed as a new, informative statistics that is able to discriminate between the above two types of graphs, believed to be the first proposal of a significant new non-local structural index for complex networks whose computation is highly scalable.
How user behavior is related to social affinity
TLDR
A new measure of "affinity" in social networks that takes into account not only the distance between two users, but also the number of edge-disjoint paths between them, i.e. the "robustness" of their connection is introduced.
In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond
  • P. Boldi, S. Vigna
  • Computer Science
    2013 IEEE 13th International Conference on Data Mining Workshops
  • 2013
TLDR
This paper exploitation of HyperLogLog counters reduces exponentially the memory footprint, paving the way for in-core processing of networks with a hundred billion nodes using "just" 2TiB of RAM.
...
1
2
3
4
...