-
Article
Agent-Based Computational Epidemiological Modeling
The study of epidemics is useful for not only understanding outbreaks and trying to limit their adverse effects, but also because epidemics are related to social phenomena such as government instability, crime...
-
Article
Parallel Algorithms for Generating Random Networks with Given Degree Sequences
Random networks are widely used for modeling and analyzing complex processes. Many mathematical models have been proposed to capture diverse real-world networks. One of the most important aspects of these mode...
-
Chapter
Algorithms for Finding Motifs in Large Labeled Networks
The goal of this chapter is to introduce the different kinds of subgraph analysis problems and discuss some of the important parallel algorithmic techniques that have been developed for them. This chapter focu...
-
Article
Efficient distributed approximation algorithms via probabilistic tree embeddings
We present a uniform approach to design efficient distributed approximation algorithms for various fundamental network optimization problems. Our approach is randomized and based on a probabilistic tree embedd...
-
Chapter and Conference Paper
Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model
We study the minimum spanning tree (MST) construction problem in wireless networks under the physical interference model based on SINR constraints. We develop the first distributed (randomized) O(μ)-approximation...
-
Reference Work Entry In depth
Social Networks
-
Chapter and Conference Paper
Beyond Degree Distributions: Local to Global Structure of Social Contact Graphs
The structure and dynamical properties of networked systems are often characterized by the degree distribution of the underlying graph. The degree distributions of many real world networks have often been foun...
-
Chapter and Conference Paper
On Minimizing Average End-to-End Delay in P2P Live Streaming Systems
In this paper, we devise a streaming scheme, called iStream, to achieve the minimum average end-to-end P2P streaming delay by optimally allocating the bandwidth resource among peers. We first develop a generic an...
-
Article
A fast distributed approximation algorithm for minimum spanning trees
We present a distributed algorithm that constructs an O(log n)-approximate minimum spanning tree (MST) in any arbitrary network. This algorithm runs in time Õ(D(G) + L(G, w)) where L(G, w) is a parameter called t...
-
Chapter and Conference Paper
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
We give a distributed algorithm that constructs a O(logn)- approximate minimum spanning tree (MST) in arbitrary networks. Our algorithm runs in time ...
-
Chapter and Conference Paper
k-nearest Neighbor Classification on Spatial Data Streams Using P-trees
Classification of spatial data streams is crucial, since the training dataset changes often. Building a new classifier each time can be very costly with most techniques. In this situation, k-nearest neighbor (KNN...
