2079 search results - page 62 / 416 » Universality of random graphs |
174
click to vote
SIGMETRICS
2012
ACM
13 years 6 months ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
138
click to vote
BIOINFORMATICS
2007
15 years 4 months ago
2007
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
163
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
143
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
155
click to vote
ACSC
2005
IEEE
15 years 9 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...