We study a dynamically evolving random graph which adds vertices and edges using
preferential attachment and is 'attacked by an adversary'. At time t, we add a new vertex xt …

We study random graphs with an iid degree sequence of which the tail of the distribution
function F is regularly varying with exponent τ ∈ 1, 2. In particular, the degrees have infinite …

Broadcasting is an information dissemination problem in a connected network, in which one
node, called the originator, disseminates a message to all other nodes by placing a series of …

We study how differences in interpersonal skills lead to inequality among workers when
social connections are endogenously formed and workers find jobs through their contacts …

A known approach of detecting dense subgraphs (communities) in large sparse graphs
involves first computing the probability vectors for short random walks on the graph, and …

We consider the problem of searching a randomly growing graph by a random walk. In
particular we consider two simple models of" web-graphs." Thus at each time step a new …

We study the behavior of algorithms for buffering packets weighted by different levels of
Quality of Service (QoS) guarantees in a single queue. Buffer space is limited, and packet …

In this paper, we present a measure associated with detection and inference of statistically
anomalous clusters of a graph based on the likelihood test of observed and expected edges …

Abstract Models based on preferential attachment have had much success in reproducing
the power law degree distributions which seem ubiquitous in both natural and engineered …