Sciweavers

1806 search results - page 116 / 362
» Randomness and halting probabilities
Sort
View
FOCS
2008
IEEE
14 years 4 months ago
k-Wise Independent Random Graphs
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
Noga Alon, Asaf Nussboim
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 4 months ago
On the Simulation of Tikhonov Random Processes
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
Giuseppe Thadeu Freitas de Abreu
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
14 years 1 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
INFOCOM
2010
IEEE
13 years 8 months ago
Optimal SINR-based Random Access
— Random access protocols, such as Aloha, are commonly modeled in wireless ad-hoc networks by using the protocol model. However, it is well-known that the protocol model is not a...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong, Robe...
JSAC
2010
138views more  JSAC 2010»
13 years 8 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar