63 search results - page 3 / 13 » Random Graph Coverings I: General Theory and Graph Connectiv... |
120
click to vote
RSA
2010
14 years 10 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
113
click to vote
CN
2010
14 years 8 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
100
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
COCO
2007
Springer
15 years 5 months ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
107
click to vote
KDD
2008
ACM
16 years 1 days ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...