Results 31 to 40 of about 5,578,868 (115)
Convolutional Random Walk Networks for Semantic Image Segmentation [PDF]
Computer Vision and Pattern Recognition, 2016 Most current semantic segmentation methods rely on fully convolutional networks (FCNs). However, their use of large receptive fields and many pooling layers cause low spatial resolution inside the deep layers.
Gedas Bertasius +3 more
semanticscholar +1 more source
Non-backtracking random walk [PDF]
, 2012 We consider non-backtracking random walk (NBW) in the nearest-neighbor setting on the Zd-lattice and on tori. We evaluate the eigensystem of the m X m-dimensional transition matrix of NBW where m denote the degree of the graph.
Fitzner, Robert, van der Hofstad, Remco
core +2 more sources
RAM. Revista de Administração Mackenzie, 2021 Purpose: This research examines the superiority of analysts over random walk models in forecasting the results of publicly-traded Brazilian companies in the short and long term. Originality/value: The literature indicates the uncontested superiority
Rafael C. Gatsios +3 more
doaj +1 more source
Slowdown estimates for one-dimensional random walks in random environment with holding times [PDF]
, 2018 We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random.
Dembo, Amir +2 more
core +2 more sources
Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk
Entropy, 2023 Quantum walks (QWs) have a property that classical random walks (RWs) do not possess—the coexistence of linear spreading and localization—and this property is utilized to implement various kinds of applications.
Tomoki Yamagami +5 more
doaj +1 more source
Random Walk With Restart on Multiplex and Heterogeneous Biological Networks
bioRxiv, 2017 Recent years have witnessed an exponential growth in the number of identified interactions between biological molecules. These interactions are usually represented as large and complex networks, calling for the development of appropriated tools to ...
Alberto Valdeolivas +8 more
semanticscholar +1 more source
The Spacey Random Walk: A Stochastic Process for Higher-Order Data [PDF]
SIAM Review, 2016 Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic process.
Austin R. Benson +2 more
semanticscholar +1 more source
Random walk on random walks: low densities [PDF]
, 2017 We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on particles ...
Blondel, Oriane +4 more
core +3 more sources
Central limit theorem and related results for the elephant random walk [PDF]
, 2016 We study the so-called elephant random walk (ERW) which is a non-Markovian discrete-time random walk on ℤ with unbounded memory which exhibits a phase transition from a diffusive to superdiffusive behavior.
Cristian F. Coletti, R. Gava, G. Schutz
semanticscholar +1 more source
Self-motile colloidal particles: from directed propulsion to random walk. [PDF]
Physical Review Letters, 2007 The motion of an artificial microscale swimmer that uses a chemical reaction catalyzed on its own surface to achieve autonomous propulsion is fully characterized experimentally.
J. Howse +5 more
semanticscholar +1 more source