Results 51 to 60 of about 5,578,868 (115)
Recurrence of the plane Elephant random walk
We give a short proof of the recurrence of the two-dimensional elephant random walk in the diffusive regime. This was recently established by Qin (2023), but our proof mainly uses very rough comparison with the standard plane random walk.
Curien, Nicolas, Laulin, Lucile
doaj +1 more source
A Random Walk with Heavy Flavours
We focus on evaluating transport coefficients like drag and diffusion of heavy quarks (HQ) passing through quark-gluon plasma using perturbative QCD (pQCD).
Surasree Mazumder +2 more
doaj +1 more source
On the Height of One-Dimensional Random Walk
Consider the one-dimensional random walk Xn: as it evolves (at each unit of time), it either increases by one with probability p or resets to 0 with probability 1−p.
Mohamed Abdelkader
doaj +1 more source
Random walk on sparse random digraphs [PDF]
A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale.
C. Bordenave, P. Caputo, Justin Salez
semanticscholar +1 more source
On the Speed of an Excited Asymmetric Random Walk [PDF]
An excited random walk is a non-Markovian extension of the simple random walk, in which the walk's behavior at time $n$ is impacted by the path it has taken up to time $n$.
Cinkoske, Mike +2 more
core +2 more sources
Maximal-entropy random walk unifies centrality measures
In this paper analogies between different (dis)similarity matrices are derived. These matrices, which are connected to path enumeration and random walks, are used in community detection methods or in computation of centrality measures for complex ...
C. M. Grinstead +7 more
core +1 more source
RANDOM WALK HYPOTHESIS IN FINANCIAL MARKETS [PDF]
Random walk hypothesis states that the stock market prices do not follow a predictable trajectory, but are simply random. If you are trying to predict a random set of data, one should test for randomness, because, despite the power and complexity of the ...
Nicolae-Marius JULA, Nicoleta JULA
doaj
Discriminative Deep Random Walk for Network Classification
Deep Random Walk (DeepWalk) can learn a latent space representation for describing the topological structure of a network. However, for relational network classification, DeepWalk can be suboptimal as it lacks a mechanism to optimize the objective of the
Juzheng Li, Jun Zhu, Bo Zhang
semanticscholar +1 more source
Non symmetric random walk on infinite graph [PDF]
We investigate properties of a non symmetric Markov's chain on an infinite graph. We show the connection with matrix valued random walk polynomials which satisfy the orthogonality formula with respect to non a symmetric matrix valued measure.
Marcin J. Zygmunt
doaj +1 more source
Elastic Energy and Phase Structure in a Continuous Spin Ising Chain with Applications to the Protein Folding Problem [PDF]
We present a numerical Monte Carlo analysis of a continuos spin Ising chain that can describe the statistical proterties of folded proteins. We find that depending on the value of the Metropolis temperature, the model displays the three known nontrivial ...
Antti J. Niemi +4 more
core +5 more sources

