• Aucun résultat trouvé

Finding Structure in Dynamic Networks (and What It Means for Zebras)

N/A
N/A
Protected

Academic year: 2022

Partager "Finding Structure in Dynamic Networks (and What It Means for Zebras)"

Copied!
1
0
0

Texte intégral

(1)

Finding structure in dynamic networks (and what it means for zebras)

Tanya Berger-Wolf University of Illinois, USA

Abstract

Social creatures interact in diverse ways: forming groups, mating, sending emails, and sharing ideas. Some of the interactions are accidental while others are a consequence of the underlying explicit or implicit social structures. One of the most important questions in sociology is the identification of such structures, which are variously viewed as communities, hierarchies, or “social profiles”.

In analyzing social networks, one property has largely been ignored until re- cently: interactions and their nature change over time. The notion of “structure”

is intricately linked with the dynamics of social interactions. On one hand, it is in longitudinal data that the emergence of structures and the laws governing their development can be observed and inferred. On the other hand, the existence of such structures that constrain social interactions is what allows us to predict the behavior and nature of dynamic networks. The necessity to delve into the dy- namic aspects of networking behavior may be clear, yet it would not be feasible without the data to support such explicitly dynamic analysis. Rapidly grow- ing electronic networks, such as emails, the Web, blogs, and friendship sites, as well as mobile sensor networks on cars, humans, and animals, provide an abun- dance of dynamic social network data that for the first time allow the temporal component to be explicitly addressed in network analysis.

I will present several examples of computational approaches we have de- veloped to infer structure in dynamic networks and show applications of this analysis to population biology, from humans to zebras.

Références

Documents relatifs

On the left and right we plot joint distribution of the number of connected vertices and links in connected components: a model imposing the contact and inter- contact

In order to distribute helpers within the network, we extract social sub-structures present in the contact graph. For this we detect communities using k-clique community

Les répondants ont proposé que la stratégie comprenne le renforcement de mesures existantes (p. ex. corriger ce qu’ils considèrent être des failles dans les politiques et

As a result, our algorithm gave bet- ter performance in terms of the number of clusters when the node density in the net- work is high, because BS-WCA generates a reduced number

Carina, the one dwarf galaxy in their sample which does have a known, recent bout of star formation (∼1–3 Gyr; Hurley-Keller et al. 2003 ), was shown to have an excess of blue

The low temperature phase relations of pyrrhotite have been investigated extensively over the past six decades. Despite these efforts, conflicting reports on the

• Simulation study of IEEE 802.15.4 sensor networks: The performance of IEEE 802.15.4 sensor network is studied by IDEA1, including packet delivery rate, average latency,

The ontology can be seen from four related perspectives: a sensor perspective, with a focus on what senses, how it senses, and what is sensed; an observation, or data, perspective,