Sciweavers

1949 search results - page 59 / 390
» Random graphs on surfaces
Sort
View
MST
2011
209views Hardware» more  MST 2011»
14 years 6 months ago
Spreading of Messages in Random Graphs
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...
Ching-Lueh Chang, Yuh-Dauh Lyuu
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 5 days ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
SIGMETRICS
2012
ACM
253views Hardware» more  SIGMETRICS 2012»
13 years 2 months ago
Characterizing continuous time random walks on time varying graphs
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...
Daniel R. Figueiredo, Philippe Nain, Bruno F. Ribe...
BIOINFORMATICS
2007
83views more  BIOINFORMATICS 2007»
14 years 12 months ago
Exploring biological network structure using exponential random graph models
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
Zachary M. Saul, Vladimir Filkov
INFOCOM
2012
IEEE
13 years 2 months ago
On superposition of heterogeneous edge processes in dynamic random graphs
—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...
Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov