88 search results - page 18 / 18 » Counting connected graphs asymptotically |
SIAMAM
2010
13 years 3 months ago
2010
This paper concerns the dynamical behavior of weakly reversible, deterministically modeled population processes near the facets (codimension-one faces) of their invariant manifolds...
TSP
2010
13 years 2 days ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
MOBIHOC
2008
ACM
14 years 5 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...