Sciweavers

Share
MMAS
2010
Springer
8 years 5 months ago
Homogenization with Large Spatial Random Potential
We consider the homogenization of parabolic equations with large spatiallydependent potentials modeled as Gaussian random fields. We derive the homogenized equations in the limit ...
Guillaume Bal
TIT
2011
121views more  TIT 2011»
8 years 5 months ago
Strongly Consistent Estimation of the Sample Distribution of Noisy Continuous-Parameter Fields
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...
Shahar Z. Kovalsky, Guy Cohen, Joseph M. Francos
RSA
2011
121views more  RSA 2011»
8 years 5 months ago
Ramsey games with giants
: 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...
Tom Bohman, Alan M. Frieze, Michael Krivelevich, P...
MST
2011
209views Hardware» more  MST 2011»
8 years 5 months ago
Spreading of Messages in Random Graphs
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...
Ching-Lueh Chang, Yuh-Dauh Lyuu
CIE
2010
Springer
8 years 5 months ago
Lower Bounds for Reducibility to the Kolmogorov Random Strings
Abstract. We show the following results for polynomial-time reducibility to RC , the set of Kolmogorov random strings.
John M. Hitchcock
CORR
2011
Springer
184views Education» more  CORR 2011»
8 years 5 months ago
Stationary distribution and cover time of random walks on random digraphs
We study properties of a simple random walk on the random digraph Dn,p when
Colin Cooper, Alan M. Frieze
CORR
2011
Springer
147views Education» more  CORR 2011»
8 years 5 months ago
Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors
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...
Marius Zimand
CORR
2010
Springer
111views Education» more  CORR 2010»
8 years 7 months ago
Error Exponent for Multiple-Access Channels:Lower Bounds
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...
Ali Nazari, Achilleas Anastasopoulos, S. Sandeep P...
INFOCOM
2010
IEEE
8 years 8 months ago
Network Reliability With Geographically Correlated Failures
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...
Sebastian Neumayer, Eytan Modiano
RSA
2010
99views more  RSA 2010»
8 years 8 months ago
Hamiltonicity thresholds in Achlioptas processes
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...
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
books