Sciweavers

151 search results - page 9 / 31
» Edge Anonymity in Social Network Graphs
Sort
View
INFOCOM
2012
IEEE
11 years 11 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
14 years 9 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
CSE
2009
IEEE
14 years 3 months ago
Structure of Neighborhoods in a Large Social Network
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
Alina Stoica, Christophe Prieur
RECSYS
2010
ACM
13 years 9 months ago
Interactive recommendations in social endorsement networks
An increasing number of social networking platforms are giving users the option to endorse entities that they find appealing, such as videos, photos, or even other users. We defin...
Theodoros Lappas, Dimitrios Gunopulos
ISPAN
2008
IEEE
14 years 3 months ago
Product Line Sigraphs
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...
Daniela Ferrero