Buscar
Mostrando ítems 21-30 de 10123
A spectral algorithm to simulate nonstationary random fields on spheres and multifractal star-shaped random sets
(Springer, 2020)
An extension of the turning arcs algorithm is proposed for simulating a random field on the two-dimensional sphere with a second-order dependency structure associated with a locally varying Schoenberg sequence. In particular, ...
The integrated density of states in strong magnetic fields
(ACADEMIC PRESS INC ELSEVIER SCIENCE, 2006-08-15)
We consider three-dimensional Schrodinger operators with constant magnetic fields and ergodic electric potentials. We study the strong magnetic field asymptotic behaviour of the integrated density of states, distinguishing ...
TBSIM: A computer program for conditional simulation of three-dimensional Gaussian random fields via the turning bands method
(PERGAMON-ELSEVIER SCIENCE LTD, 2006-12)
The simulation of spatially correlated Gaussian random fields is widespread in geologic, hydrologic and environmental applications for characterizing the uncertainty about the unsampled values of regionalized attributes. ...
Using a Markov Random Field for Image Re-ranking Based on Visual and Textual Features
(Revista Computación y Sistemas; Vol. 14 No. 4, 2011-06-06)
Abstract. We propose a novel method to re-order the list of images returned by an image retrieval system (IRS). The method combines the original order obtained by the IRS, the similarity between images obtained with visual ...
The use of discrete Markov random fields in reservoir characterization
(Elsevier Science BvAmsterdamHolanda, 2001)
Survival time of random walk in random environment among soft obstacles
(UNIV WASHINGTON, DEPT MATHEMATICS, 2009)
We consider a Random Walk in Random Environment (RWRE) moving in an i.i.d. random field of obstacles. When the particle hits an obstacle, it disappears with a positive probability. We obtain quenched and annealed bounds ...
A scaling limit for the cover time of the binary tree
(Academic Press Inc., 2021)
© 2021 Elsevier Inc.We consider a continuous time random walk on the rooted binary tree of depth n with all transition rates equal to one and study its cover time, namely the time until all vertices of the tree have been ...