Sciweavers

85 search results - page 1 / 17
» Scaling limit of random k-trees
Sort
View
MICS
2010
134views more  MICS 2010»
13 years 3 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 9 days ago
Matched Filtering from Limited Frequency Samples
In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-...
Armin Eftekhari, Justin K. Romberg, Michael B. Wak...
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
13 years 9 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
ICC
2009
IEEE
121views Communications» more  ICC 2009»
13 years 3 months ago
Throughput Scaling of Wireless Networks With Random Connections
This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connec...
Shengshan Cui, Alexander M. Haimovich, Oren Somekh...
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 5 months ago
High-SNR Analysis of Outage-Limited Communications with Bursty and Delay-Limited Information
Abstract-- This work analyzes the high-SNR asymptotic error performance of outage-limited communications with fading, where the number of bits that arrive at the transmitter during...
Somsak Kittipiyakul, Petros Elia, Tara Javidi