1591 search results - page 89 / 319 » Random lifts of graphs |
148
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
173
click to vote
FCT
2009
Springer
16 years 27 days ago
2009
Springer
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially diï...
145
click to vote
IM
2007
15 years 6 months ago
2007
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
159
click to vote
IJON
2007
15 years 6 months ago
2007
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
152
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...