Sciweavers

1806 search results - page 20 / 362
» Randomness and halting probabilities
Sort
View
RSA
2006
66views more  RSA 2006»
13 years 7 months ago
Regular graphs whose subgraphs tend to be acyclic
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
Noga Alon, Eitan Bachmat
SIGMETRICS
2012
ACM
253views Hardware» more  SIGMETRICS 2012»
11 years 10 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...
CORR
2006
Springer
89views Education» more  CORR 2006»
13 years 7 months ago
Anomalous heat-kernel decay for random walk among bounded random conductances
We consider the nearest-neighbor simple random walk on Zd, d 2, driven by a field of bounded random conductances xy [0, 1]. The conductance law is i.i.d. subject to the condition...
Noam Berger, Marek Biskup, Christopher E. Hoffman,...
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 7 months ago
Relations between random coding exponents and the statistical physics of random codes
The partition function pertaining to finite–temperature decoding of a (typical) randomly chosen code is known to have three types of behavior, corresponding to three phases in ...
Neri Merhav
ICST
2010
IEEE
13 years 6 months ago
Generating Transition Probabilities for Automatic Model-Based Test Generation
—Markov chains with Labelled Transitions can be used to generate test cases in a model-based approach. These test cases are generated by random walks on the model according to pr...
Abderrahmane Feliachi, Hélène Le Gue...