[NRG] Fwd: [WING] Reminder: NRG Meeting: Online Myopic Network Covering (Bruno Ribeiro) @ Mon Mar 25, 2013 11am - 12pm (NRG Calendar)

Larissa Spinelli lspinell at bu.edu
Sun Mar 24 20:04:40 EDT 2013

Just a reminder that in the tomorrow NGR meeting Bruno Ribeiro (guest) will
be presenting the work "Online Myopic Network Covering".



---------- Forwarded message ----------
From: Google Calendar <calendar-notification at google.com>
Date: Wed, Mar 20, 2013 at 10:59 AM
Subject: [WING] [NRG] Reminder: NRG Meeting: Online Myopic Network Covering
(Bruno Ribeiro) @ Mon Mar 25, 2013 11am - 12pm (NRG Calendar)
To: "Network Reading Group @ BUCS" <nrg-l at cs.bu.edu>

more details »<https://www.google.com/calendar/event?action=VIEW&eid=cGw5amgzOTYwOTczYTFybzNncjBsZWd1bnMgNTYwam42bnQ1aGo0b2YzcnNyaWNoZnB0aW9AZw>
NRG Meeting: Online Myopic Network Covering (Bruno Ribeiro)
NRG Meeting: Online Myopic Network Covering (Bruno Ribeiro)

Presenter: Bruno Ribeiro


In the recent 2012 U.S. presidential election a candidate’s Facebook app
asked its subscribers to send get-out-to-vote reminders to their
like-minded friends in swing states. Thus, the effectiveness of a
subscriber was measured by the size of the intersection between her or his
friends and like-minded voters in swing states. Moreover, these messages
also raise awareness of the app itself, allowing it to spread through
Facebook users in swing states.
In this talk I will cover the topic of efficient marketing or
awareness-raising campaigns that seek to recruit $n$ influential
individuals that are able to cover a large target audience through their
social connections. So far most of the related literature on maximizing
this network cover assumes that the social network topology and node
identities are known. Even then the optimal solution is NP-hard. In
practice, however, the network topology and node identities are often
unknown and need to be discovered on-the-fly. I will then explore the
problem of network cover through crawling (link-tracing) in a network with
unknown topology where recruited individuals disclose their social
connections (a feature known as one-hop lookahead). I will show the
performance of a variety of online algorithms (breadth-first search,
depth-first search, epidemic-based algorithms, among others) and provide
theoretical insights that shed light into their performance. Finally, I
will present an efficient greedy online algorithm that recruits individuals
as to maximize the size of the cover and show conditions that allow it to
perform optimally.

Short Bio:

Bruno Ribeiro is a Postdoctoral Researcher at the University of
Massachusetts Amherst. Bruno received his B.Sc. and M.Sc. degrees in
Computer Science from UFRJ/COPPE (Brazil) and his Ph.D. degree in Computer
Science from University of Massachusetts Amherst in 2010 (supervised by
prof. Don Towsley). He is a member of the Advanced Computer Networks
Research Group, led by professors Jim Kurose and Don Towsley. He is
currently a Post-Doctoral Researcher located at the Network Science
Collaborative Technology Alliance funded by the U.S. Army Research
Laboratory. He is also a former research associate of LAND - Laboratory for
Modeling, Analysis and Development of Networks and Computer System at UFRJ
- led by professor Edmundo de Souza e Silva. During his undergraduate
studies he worked on commutative algebraic fields under the supervision of
professor S. C. Coutinho.

********Mon Mar 25, 2013 11am – 12pm Eastern Time
MCS-148, 111 Cummington Mall, Boston, MA 02215
NRG Calendar
larissaspinelli at gmail.com - creator

Invitation from Google Calendar <https://www.google.com/calendar/>

You are receiving this email at the account nrg-l at cs.bu.edu because you are
subscribed for reminders on calendar NRG Calendar.

To stop receiving these notifications, please log in to
https://www.google.com/calendar/ and change your notification settings for
this calendar.

NRG-L mailing list
NRG-L at cs.bu.edu

WING mailing list
WING at cs.bu.edu
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs-mailman.bu.edu/pipermail/nrg-l/attachments/20130324/42ef1b78/attachment.html>

More information about the NRG-L mailing list