A vertex of a randomly growing graph is called a persistent hub if at all but finitely many
moments of time it has the maximal degree in the graph. We establish the existence of a …

Broadcasting algorithms have a various range of applications in different fields of computer
science. In this paper we analyze the number of message transmissions generated by …

We introduce a random graph model for clustering graphs with a given degree sequence.
Unlike previous random graph models, we incorporate clustering effects into the model …

In this paper, we asymptotically enumerate graphs with a given degree sequence d=(d 1,…,
dn) satisfying restrictions designed to permit heavy-tailed sequences in the sparse case (ie …

Attacks against Internet routing are increasing in number and severity. Contributing greatly
to these attacks is the absence of origin authentication; there is no way to validate claims of …

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 …

A power law degree distribution is established for a graph evolution model based on the
graph class of k-trees. This k-tree-based graph process can be viewed as an idealized …

Many social, technological, biological and economical systems are best described by
weighted networks, whose properties and dynamics depend not only on their structures but …

We consider a simple model of an agent (which we call a spider) moving between the nodes
of a randomly growing web graph. It is presumed that the agent examines the page content …

The small world phenomenon, that consistently occurs in numerous existing networks, refers
to two similar but different properties—small average distance and the clustering effect. We …