Results 271 to 280 of about 124,658 (311)

The Growth of a Random Walk

open access: yesThe Annals of Mathematical Statistics, 1969
openaire   +3 more sources

Self‐Assembled Monolayers in p–i–n Perovskite Solar Cells: Molecular Design, Interfacial Engineering, and Machine Learning–Accelerated Material Discovery

open access: yesAdvanced Materials, EarlyView.
This review highlights the role of self‐assembled monolayers (SAMs) in perovskite solar cells, covering molecular engineering, multifunctional interface regulation, machine learning (ML) accelerated discovery, advanced device architectures, and pathways toward scalable fabrication and commercialization for high‐efficiency and stable single‐junction and
Asmat Ullah, Ying Luo, Stefaan De Wolf
wiley   +1 more source

Random walk in random groups

Geometric and Functional Analysis, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M Gromov, Gromov M
exaly   +2 more sources

Random walk on a random walk

Physica A: Statistical Mechanics and its Applications, 1982
The authors investigate the random walk of a particle on a one-dimensional chain which has been constructed by a random-walk procedure. Exact expressions are given for the mean-square displacement and the fourth moment after n steps. The probability density after n steps is derived in the saddle-point approximation, for large n.
K.W. Kehr, R. Kutner
openaire   +1 more source

Biased random walks

Combinatorica, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yossi Azar   +4 more
openaire   +1 more source

Anomalous conformation of polymer chains: random walk of a random walk on a random walk

Journal of Physics A: Mathematical and General, 1986
Summary: Conformation of polymer chains is analysed in the light of the results from the classical diffusion in random systems including fractals; the possibility of an anomalous conformation is conjectured.
openaire   +2 more sources

CASCADING RANDOM WALKS

International Journal of Foundations of Computer Science, 2005
In this paper, we discuss a simple, Monte Carlo algorithm for the problem of checking whether a Quantified Boolean Formula (QBF) in Conjunctive Normal Form (CNF), with at most two literals per clause has a model. The term k-CNF is used to describe boolean formulas in CNF, with at most k literals per clause and the problem of checking whether a given k ...
openaire   +2 more sources

Differencing of random walks and near random walks

Journal of Econometrics, 1977
Abstract The traditional rationale for differencing time series data is to attain stationarity. For a nearly non-stationary first-order autoregressive process—AR (1) with positive slope parameter near unity—we were led to a complementary rationale. If one suspects near non-stationarity of the AR (1) process, if the sample size is ‘small’ or ‘moderate’
Gonedes, Nicholas J., Roberts, Harry V.
openaire   +1 more source

Home - About - Disclaimer - Privacy