1591 search results - page 49 / 319 » Random lifts of graphs |
177
click to vote
INFOCOM
2012
IEEE
13 years 7 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...
164
click to vote
APPROX
2010
Springer
15 years 7 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...
163
click to vote
ACSC
2005
IEEE
15 years 11 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)...
161
click to vote
SIAMDM
2010
15 years 5 days ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
158
Voted
CDC
2008
IEEE
15 years 12 months ago
2008
IEEE
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...