The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The digitization of social networks has enabled the passive collection of large scale data, which in turn have fostered social studies that have been traditionally dependent on small scale, interview-based data. During the last years, a new class of digital social networks has emerged, namely, location-based social networks (LBSNs). The main interaction between users of an LBSN is location sharing,...
The most basic function of an Internet router is to decide, for a given packet, which of its interfaces it will use to forward it to its next hop. To do so, routers maintain a routing table, in which they look up for a prefix of the destination address. The routing table associates an interface of the router to this prefix, and this interface is used to forward the packet. We explore here a new measurement...
Captures of IP traffic contain much information on very different kinds of activities like file transfers, users interacting with remote systems, automatic backups, or distributed computations. Identifying such activities is crucial for an appropriate analysis, modeling and monitoring of the traffic. We propose here a notion of density that captures both temporal and structural features of interactions,...
Efficient marketing or awareness-raising campaigns seek to recruit a small number, w, of influential individuals — where w is the campaign budget — that are able to cover the largest possible target audience through their social connections. In this paper we assume that the topology is gradually discovered thanks to recruited individuals disclosing their social connections. We analyze the performance...
In this paper, we consider how to maximize users' influence in Online Social Networks (OSNs) by exploiting social relationships only. Our first contribution is to extend to OSNs the model of Kempe et al. [1] on the propagation of information in a social network and to show that a greedy algorithm is a good approximation of the optimal algorithm that is NP-hard. However, the greedy algorithm requires...
Viral marketing campaigns seek to recruit the most influential individuals to cover the largest target audience. This can be modeled as the well-studied maximum coverage problem. Another related problem, called the maximum connected cover, is when recruited nodes have to be connected. This problem ensures a strong coordination among the influential nodes which are the backbone of the marketing campaign...
The critical infrastructures of a nation including the power grid and the communication network are highly interdependent. Recognizing the need for a deeper understanding of the interdependency in a multi-layered network, significant efforts have been made by the research community in the last few years to achieve this goal. Accordingly a number of models have been proposed and analyzed. Unfortunately,...
Cliques are defined as complete graphs or subgraphs; they are the strongest form of cohesive subgroup, and are of interest in both social science and engineering contexts. In this paper we show how to efficiently estimate the distribution of clique sizes from a probability sample of nodes obtained from a graph (e.g., by independence or link-trace sampling). We introduce two types of unbiased estimators,...
We present an analytical framework to investigate the interplay between a communication graph and an overlay of social relationships. Particularly, we focus on geographical distance as the key element that interrelates the concept of routing in a communication network with interaction patterns on the social graph. Through this regime, we attempt to identify classes of social relationships that let...
We study the nature of missed collaboration opportunities in evolving collaboration networks. We define a k-way missed collaboration as one in which every (k-1)-subset of the k persons has collaborated but the set of k has not. Representing a collaboration network as a simplicial complex, we model a missed collaboration as a Minimal Non Face (MNF). Focusing on 2-dimensional and 3-dimensional MNFs,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.