The Power of Local Information in Social Networks

@inproceedings{Borgs2012ThePO,
  title={The Power of Local Information in Social Networks},
  author={Christian Borgs and Mickey Brautbar and Jennifer T. Chayes and Sanjeev Khanna and Brendan Lucier},
  booktitle={WINE},
  year={2012}
}
We study the power of local information algorithms for optimization problems on social and technological networks. We focus on sequential algorithms where the network topology is initially unknown and is revealed only within a local neighborhood of vertices that have been irrevocably added to the output set. This framework models the behavior of an external agent that does not have direct access to the network data, such as a user interacting with an online social network. We study a range… 
The power of locality in network algorithms
TLDR
This dissertation presents a natural algorithmic framework designed to model the behaviour of an external agent trying to solve a network optimization problem with limited access to the network data and designs highly time efficient local algorithms for central mining problems on complex networks.
Local Structure and Inference in Large Random Graphs
TLDR
This work presents a framework for working with small edge-induced samples of graphons, and proposes a procedure for undoing the sampling bias that allows for estimation of whole-network structure from only an ego network.
Local View Based Connectivity Search in Online Social Networks
  • Na Li, Sajal K. Das
  • Computer Science
    IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
  • 2019
TLDR
This paper developed effective and efficient detection techniques which demand only a small number of queries to discover people's connections in the OSN, and found that the proposed techniques perform as well as the centralized detection algorithm, which assumes the availability of the global information in theOSN.
Information Gathering in Networks via Active Exploration
TLDR
This work proposes a novel model where new nodes become visible and available for selection only once one of their neighbors has been chosen, and presents a general algorithm NETEXP for this problem, and provides theoretical bounds on its performance dependent on structural properties of the underlying network.
Maximizing Influence in an Unknown Social Network
TLDR
This work introduces exploratory influence maximization, in which an algorithm queries individual network nodes (agents) to learn their links to locate a seed set nearly as influential as the global optimum using very few queries.
Influence Maximization with an Unknown Network by Exploiting Community Structure
TLDR
This work presents the ARISEN algorithm, which leverages community structure to find an influential seed set by querying only a fraction of the network, and demonstrates its performance on real world networks of homeless youth, village populations in India, and others.
Recovery of vertex orderings in dynamic graphs
TLDR
This work gives a rigorous formulation of the problem of recovering the arrival order of nodes in a statistical learning framework and ties its feasibility to several sets of permutations associated with the symmetries of the random graph model and graphs generated by it.
Degree centrality and root finding in growing random networks
TLDR
This article develops root finding algorithms using the empirical degree structure and local network information based on a snapshot of such a network at some large time using the persistent and non-persistent regimes.
Quick Detection of High-Degree Entities in Large Directed Networks
TLDR
This paper proposes a simple, efficient, and easy to implement two-stage randomized algorithm that provides highly accurate solutions to the problem of quick detection of high-degree entities in large online social networks and formally shows that the high variability of the entities, expressed through heavy-tailed distributions, is the reason for the algorithm's efficiency.
...
...

References

SHOWING 1-10 OF 33 REFERENCES
Local Algorithms for Finding Interesting Individuals in Large Networks
We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties — such as high degree or clustering coefficient — in large social or other networks.
Social networks spread rumors in sublogarithmic time
TLDR
This work studies the performance of randomized rumor spreading protocols on graphs in the preferential attachment model and proves the first time that a sublogarithmic broadcast time is proven for a natural setting.
A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
TLDR
This work presents a local clustering algorithm, a useful primitive for handling massive graphs, such as social networks and web-graphs, that finds a good cluster---a subset of vertices whose internal connections are significantly richer than its external connections---near a given vertex.
Fast discovery of connection subgraphs
TLDR
This work defines a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes, and presents a formal definition of this problem, and an ideal solution based on electricity analogues.
Optimal path search in small worlds: dimension matters
TLDR
Kleinberg's celebrated small-world model is considered, based on a d-dimensional grid graph of n nodes, augmented by a constant number of "long-range links" per node, and it is shown that any decentralized algorithm that visits a poly-logarithmic number of nodes constructs paths of expected length O(log n loglog n).
Local Graph Partitioning using PageRank Vectors
TLDR
An improved algorithm for computing approximate PageRank vectors, which allows us to find a cut with conductance at most oslash and approximately optimal balance in time O(m log4 m/oslash) in time proportional to its size.
Networks, Crowds, and Markets: Reasoning about a Highly Connected World
Over the past decade there has been a growing public fascination with the complex connectedness of modern society. This connectedness is found in many incarnations: in the rapid growth of the
Approximation Algorithms for Connected Dominating Sets
TLDR
This work considers the more general problem of finding a connected dominating set of a specified subset of vertices and provides a polynomial time algorithm with a (c+1) H(Δ) +c-1 approximation factor, where c is the Steiner approximation ratio for graphs.
Rumor spreading and vertex expansion
TLDR
This work considers the standard rumor spreading protocol, and shows that this protocol spreads a rumor from a single node to all other nodes in [EQUATION] rounds with high probability, resolving one of the most natural questions on the connection between rumor spreading and expansion.
Approximation Algorithms for Connected Dominating Sets
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex in
...
...