MMAS
2010
Springer
12 years 11 months ago
2010
Springer
We consider the homogenization of parabolic equations with large spatiallydependent potentials modeled as Gaussian random fields. We derive the homogenized equations in the limit ...
TIT
2011
12 years 12 months ago
2011
The general problem of defining and determining the sample distribution in the case of continuousparameter random fields, is addressed. Defining a distribution in the case of d...
RSA
2011
12 years 12 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
MST
2011
12 years 12 months ago
2011
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...
CIE
2010
Springer
13 years 1 days ago
2010
Springer
Abstract. We show the following results for polynomial-time reducibility to RC , the set of Kolmogorov random strings.
CORR
2011
Springer
13 years 1 days ago
2011
Springer
We study properties of a simple random walk on the random digraph Dn,p when
CORR
2011
Springer
13 years 1 days ago
2011
Springer
We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is nec...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryles...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract--Fiber-optic networks are vulnerable to natural disasters, such as tornadoes or earthquakes, as well as to physical failures, such as an anchor cutting underwater fiber ca...
RSA
2010
13 years 3 months ago
2010
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...