Person

Pedram Pedarsani

This person is no longer with EPFL

Related publications (6)

Privacy and Dynamics of Social Networks

Pedram Pedarsani

Over the past decade, investigations in different fields have focused on studying and understanding real networks, ranging from biological to social to technological. These networks, called complex networks, exhibit common topological features, such as a h ...
EPFL2013

A Bayesian Method for Matching Two Similar Graphs without Seeds

Matthias Grossglauser, Pedram Pedarsani

Approximate graph matching (AGM) refers to the problem of mapping the vertices of two structurally similar graphs, which has applications in social networks, computer vision, chemistry, and biology. Given its computational cost, AGM has mostly been limited ...
2013

Privacy and Dynamics of Social Networks (PhD Thesis: pre-print)

Pedram Pedarsani

Over the past decade, investigations in different fields have focused on studying and understanding real networks, ranging from biological to social to technological. These networks, called complex networks, exhibit common topological features, such as a h ...
2012

On the Privacy of Anonymized Networks

Matthias Grossglauser, Pedram Pedarsani

The proliferation of online social networks, and the concomitant accumulation of user data, give rise to hotly debated issues of privacy, security, and control. One specific challenge is the sharing or public release of anonymized data without accidentally ...
2011

Preserving Privacy in Collaborative Filtering through Distributed Aggregation of Offline Profiles

Jean-Pierre Hubaux, Reza Shokri, Georgios Theodorakopoulos, Pedram Pedarsani

In recommender systems, usually, a central server needs to have access to users' profiles in order to generate useful recommendations. Having this access, however, undermines the users' privacy. The more information is revealed to the server on the user-it ...
ACM2009

Densification Arising from Sampling Fixed Graphs

Matthias Grossglauser, Pedram Pedarsani

During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer networks. A recently observed feature is known as network densification, which ...
ACM2008

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.