Relevant bibliographies by topics / Random walkers

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Random walkers'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Random walkers.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Random walkers"

1

XU, BAOMIN, TINGLIN XIN, YUNFENG WANG, and YANPIN ZHAO. "LOCAL RANDOM WALK WITH DISTANCE MEASURE." Modern Physics Letters B 27, no. 08 (2013): 1350055. http://dx.doi.org/10.1142/s0217984913500553.

Full text
Abstract:
Link prediction based on random walks has been widely used. The existing random walk algorithms ignore the probability of a walker visit from the initial node to the destination node for the first time, which makes a major contribution to establish links in some networks. To deal with the problem, we develop a link prediction method named Local Random Walk with Distance (LRWD) based on local random walk and the shortest distance of node pairs. In LRWD, walkers walk with their own steps rather than uniform steps. To evaluate the performance of the LRWD algorithm, we present the concept of distance distribution. The experimental results show that LRWD can improve the prediction accuracy when the distance distribution of the network is relatively concentrated.
APA, Harvard, Vancouver, ISO, and other styles
2

Ross, Robert J. H., and Walter Fontana. "Modeling random walkers on growing random networks." Physica A: Statistical Mechanics and its Applications 526 (July 2019): 121117. http://dx.doi.org/10.1016/j.physa.2019.121117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zheng, Zhongtuan, Hanxing Wang, Shengguo Gao, and Guoqiang Wang. "Comparison of Multiple Random Walks Strategies for Searching Networks." Mathematical Problems in Engineering 2013 (2013): 1–12. http://dx.doi.org/10.1155/2013/734630.

Full text
Abstract:
We investigate diverse random-walk strategies for searching networks, especially multiple random walks (MRW). We use random walks on weighted networks to establish various models of single random walks and take the order statistics approach to study corresponding MRW, which can be a general framework for understanding random walks on networks. Multiple preferential random walks (MPRW) and multiple simple random walks (MSRW) are two special types of MRW. As search strategies, MPRW prefers high-degree nodes while MSRW searches for low-degree nodes more efficiently. We analyze the first passage time (FPT) of wandering walkers of MRW and give the corresponding formulas of probability distributions and moments, and the mean first passage time (MFPT) is included. We show the convergence of the MFPT of the first arriving walker and find the MFPT of the last arriving walker closely related with the mean cover time. Simulations confirm analytical predictions and deepen discussions. We use a small random network to test the FPT properties from different aspects. We also explore some practical search-related issues by MRW, such as detecting unknown shortest paths and avoiding poor routings on networks. Our results are of practical significance for realizing optimal routing and performing efficient search on complex networks.
APA, Harvard, Vancouver, ISO, and other styles
4

Shlesinger, Michael F. "New paths for random walkers." Nature 355, no. 6359 (1992): 396–97. http://dx.doi.org/10.1038/355396a0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Grassberger, P., and R. Leuverink. "Equilibrium distributions for random walkers in random media." Journal of Physics A: Mathematical and General 23, no. 5 (1990): 773–80. http://dx.doi.org/10.1088/0305-4470/23/5/020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Agliari, E., R. Burioni, D. Cassi, and F. M. Neri. "Random walk on a population of random walkers." Journal of Physics A: Mathematical and Theoretical 41, no. 1 (2007): 015001. http://dx.doi.org/10.1088/1751-8113/41/1/015001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Baldi, Alberto, and Franco Bagnoli. "Intransitiveness: From Games to Random Walks." Future Internet 12, no. 9 (2020): 151. http://dx.doi.org/10.3390/fi12090151.

Full text
Abstract:
Many games in which chance plays a role can be simulated as a random walk over a graph of possible configurations of board pieces, cards, dice or coins. The end of the game generally consists of the appearance of a predefined winning pattern; for random walks, this corresponds to an absorbing trap. The strategy of a player consist of betting on a given sequence, i.e., in placing a trap on the graph. In two-players games, the competition between strategies corresponds to the capabilities of the corresponding traps in capturing the random walks originated by the aleatory components of the game. The concept of dominance transitivity of strategies implies an advantage for the first player, who can choose the strategy that, at least statistically, wins. However, in some games, the second player is statistically advantaged, so these games are denoted “intransitive”. In an intransitive game, the second player can choose a location for his/her trap which captures more random walks than that of the first one. The transitivity concept can, therefore, be extended to generic random walks and in general to Markov chains. We analyze random walks on several kinds of networks (rings, scale-free, hierarchical and city-inspired) with many variations: traps can be partially absorbing, the walkers can be biased and the initial distribution can be arbitrary. We found that the transitivity concept can be quite useful for characterizing the combined properties of a graph and that of the walkers.
APA, Harvard, Vancouver, ISO, and other styles
8

Dankel, T. G., and J. L. Brown. "A long game – Racing random walkers." Mathematical Gazette 88, no. 511 (2004): 57–67. http://dx.doi.org/10.1017/s0025557200174236.

Full text
Abstract:
In this paper we analyse a game that was published in the 1996 Burger King Kid’s Club calendar. This calendar included an activity for each month, and for the month of September the activity was called the Mountain Bike Rally. To begin the game, each player places a marker on day 1. A turn consists of each player flipping a fair coin. Each player whose coin comes up heads moves his marker forward one day. If a player’s coin shows tails, then he moves his marker back one day, unless his marker is on day 1, in which case it stays there. The object is to be the first player to reach square 31. We never played the game because it was clear that it would take a long time to complete.
APA, Harvard, Vancouver, ISO, and other styles
9

Boffetta, G., V. Rago, and A. Celani. "Transient anomalous dispersion in random walkers." Physics Letters A 235, no. 1 (1997): 15–18. http://dx.doi.org/10.1016/s0375-9601(97)00532-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nagao, Taro, Makoto Katori, and Hideki Tanemura. "Dynamical correlations among vicious random walkers." Physics Letters A 307, no. 1 (2003): 29–35. http://dx.doi.org/10.1016/s0375-9601(02)01661-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Random walkers"

1

Slowman, Alexander Barrett. "Nonequilibrium emergent interactions between run-and-tumble random walkers." Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/28989.

Full text
Abstract:
Nonequilibrium statistical physics involves the study of many-particle systems that break time reversibility|also known as detailed balance|at some scale. For states in thermal equilibrium, which must respect detailed balance, the comprehensive theory of statistical mechanics was developed to explain how their macroscopic properties arise from interactions between their microscopic constituent particles; for nonequilibrium states no such theory exists. The study of active matter, made up of particles that individually transduce free energy to produce systematic movement, provides a paradigm in which to develop an understanding of nonequilibrium behaviours. In this thesis, we are interested in particular in the microscopic interactions that generate the clustering of active particles that has been widely observed in simulations, and may have biological relevance to the formation of bacterial assemblages known as biofilms, which are an important source of human infection. The focus of this thesis is a microscopic lattice-based model of two random walkers interacting under mutual exclusion and undergoing the run-and-tumble dynamics that characterise the motion of certain species of bacteria, notably Escherichia coli. I apply perturbative and exact analytic approaches from statistical physics to three variants of the model in order to find the probability distributions of their nonequilibrium steady states and elucidate the emergent interactions that manifest. I first apply a generating function approach to the model on a one-dimensional periodic lattice where the particles perform straight line runs randomly interspersed by instantaneous velocity reversals or tumbles, and find an exact solution to the stationary probability distribution. The distribution can be interpreted as an effective non-equilibrium pair potential that leads to a finite-range attraction in addition to jamming between the random walkers. The finite-range attraction collapses to a delta function in the limit of continuous space and time, but the combination of this jamming and attraction is suffciently strong that even in this continuum limit the particles spend a finite fraction of time next to each other. Thus, although the particles only interact directly through repulsive hard-core exclusion, the activity of the particles causes the emergence of attractive interactions, which do not arise between passive particles with repulsive interactions and dynamics respecting detailed balance. I then relax the unphysical assumption of instantaneous tumbling and extend the interacting run-and-tumble model to incorporate a finite tumbling duration, where a tumbling particle remains stationary on its site. Here the exact solution for the nonequilibrium stationary state is derived using a generalisation of the previous generating function approach. This steady state is characterised by two lengthscales, one arising from the jamming of approaching particles, familiar from the instant tumbling model, and the other from one particle moving when the other is tumbling. The first of these lengthscales vanishes in a scaling limit where continuum dynamics is recovered. However, the second, entirely new, lengthscale remains finite. These results show that the feature of a finite tumbling duration is relevant to the physics of run-and-tumble interactions. Finally, I explore the effect of walls on the interacting run-and-tumble model by applying a perturbative graph-theoretic approach to the model with reflecting boundaries. Confining the particles in this way leads to a probability distribution in the low tumble limit with a much richer structure than the corresponding limit for the model on a periodic lattice. This limiting probability distribution indicates that an interaction over a finite distance emerges not just between the particles, but also between the particles and the reflecting boundaries. Together, these works provide a potential pathway towards understanding the clustering of self-propelled particles widely observed in active matter from a microscopic perspective.
APA, Harvard, Vancouver, ISO, and other styles
2

Nedrebø, Per Mathias. "A Parallel Implementation of Mortal Random Walkers in the Pore Network of a Sandstone." Thesis, Norwegian University of Science and Technology, Department of Mathematical Sciences, 2008. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9806.

Full text
Abstract:
<p>Simulations of the nuclear magnetic resonance relaxation method is an important part of a digital laboratory developed by Numerical Rocks. The laboratory is used to model petrophysical properties and simulating fluid flow in the pore scale of reservoir rocks. The nuclear magnetic resonance relaxation method can be simulated on a computer using a method involving random walkers. This computer simulation can be parallelized to reduce computational time. The aim of this study has been to examine how overlapping boundaries affects speed-up and communication in a parallel simulation of random walkers. Several parallel algorithms have been proposed and implemented. It was found that an overlapping partitioning of the problem is recommended, and that communication decreases exponentially with increasing overlap. However, increased overlap resulted only in a small negative impact on memory usage and speed-up.</p>
APA, Harvard, Vancouver, ISO, and other styles
3

Bowditch, Adam. "Biased randomly trapped random walks and applications to random walks on Galton-Watson trees." Thesis, University of Warwick, 2017. http://wrap.warwick.ac.uk/97359/.

Full text
Abstract:
In this thesis we study biased randomly trapped random walks. As our main motivation, we apply these results to biased walks on subcritical Galton-Watson trees conditioned to survive. This application was initially considered model in its own right. We prove conditions under which the biased randomly trapped random walk is ballistic, satisfies an annealed invariance principle and a quenched central limit theorem with environment dependent centring. We also study the regime in which the walk is sub-ballistic; in this case we prove convergence to a stable subordinator. Furthermore, we study the fluctuations of the walk in the ballistic but sub-diffusive regime. In this setting we show that the walk can be properly centred and rescaled so that it converges to a stable process. The biased random walk on the subcritical GW-tree conditioned to survive fits suitably into the randomly trapped random walk model; however, due to a lattice effect, we cannot obtain such strong limiting results. We prove conditions under which the walk is ballistic, satisfies an annealed invariance principle and a quenched central limit theorem with environment dependent centring. In these cases the trapping is weak enough that the lattice effect does not have an influence; however, in the sub-ballistic regime it is only possible to obtain converge along specific subsequences. We also study biased random walks on infinite supercritical GW-trees with leaves. In this setting we determine critical upper and lower bounds on the bias such that the walk satisfies a quenched invariance principle.
APA, Harvard, Vancouver, ISO, and other styles
4

Huang, Tsongjy. "Random walks on randomly partitioned lattices with applications toward protein fluctuations." Diss., The University of Arizona, 1995. http://hdl.handle.net/10150/187406.

Full text
Abstract:
Random walks on state space partitions provide an abstract generic picture for the description of macroscopic fluctuations in complex systems like proteins. We first determine the average residence probability and the average distribution of residence times in a particular macroscopic state for the ensemble of random partitions of a one-dimensional state space. We then extend our study to the Bethe lattice and also the 2-, 3- and higher dimensional lattices. Our treatment involves both extensive analytical and numerical analyses. Finally, we compare the solution of our model on the Bethe lattice with the experimental data and find excellent agreement.
APA, Harvard, Vancouver, ISO, and other styles
5

Windisch, David. "Random walks, disconnection and random interlacements /." [S.l.] : [s.n.], 2009. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=18343.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gnacik, Michal. "Quantum random walks." Thesis, Lancaster University, 2014. http://eprints.lancs.ac.uk/69946/.

Full text
Abstract:
In this thesis we investigate the convergence of various quantum random walks to quantum stochastic cocycles defined on a Bosonic Fock space. We prove a quantum analogue of the Donsker invariance principle by invoking the so-called semigroup representation of quantum stochastic cocycles. In contrast to similar results by other authors our proof is relatively elementary. We also show convergence of products of ampliated random walks with different system algebras; in particular, we give a sufficient condition to obtain a cocycle via products of cocycles. The CCR algebra, its quasifree representations and the corresponding quasifree stochastic calculus are also described. In particular, we study in detail gauge-invariant and squeezed quasifree states. We describe repeated quantum interactions between a `small' quantum system and an environment consisting of an infinite chain of particles. We study different cases of interaction, in particular those which occur in weak coupling limits and low density limits. Under different choices of scaling of the interaction part we show that random walks, which are generated by the associated unitary evolutions of a repeated interaction system, strongly converge to unitary quantum stochastic cocycles. We provide necessary and sufficient conditions for such convergence. Furthermore, under repeated quantum interactions, we consider the situation of an infinite chain of identical particles where each particle is in an arbitrary faithful normal state. This includes the case of thermal Gibbs states. We show that the corresponding random walks converge strongly to unitary cocycles for which the driving noises depend on the state of the incoming particles. We also use conditional expectations to obtain a simple condition, at the level of generators, which suffices for the convergence of the associated random walks. Limit cocycles, for which noises depend on the state of the incoming particles, are also obtained by investigating what we refer to as `compressed' random walks. Lastly, we show that the cocycles obtained via the procedure of repeated quantum interactions are quasifree, thus the driving noises form a representation of the relevant CCR algebra. Both gauge-invariant and squeezed representations are shown to occur.
APA, Harvard, Vancouver, ISO, and other styles
7

Forghani, Behrang. "Transformed Random Walks." Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/32538.

Full text
Abstract:
We consider transformations of a given random walk on a countable group determined by Markov stopping times. We prove that these transformations preserve the Poisson boundary. Moreover, under some mild conditions, the asymptotic entropy (resp., rate of escape) of the transformed random walks is equal to the asymptotic entropy (resp., rate of escape) of the original random walk multiplied by the expectation of the corresponding stopping time. This is an analogue of the well-known Abramov's formula from ergodic theory.
APA, Harvard, Vancouver, ISO, and other styles
8

Buckley, Stephen Philip. "Problems in random walks in random environments." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:06a12be2-b831-4c2a-87b1-f0abccfb9b8b.

Full text
Abstract:
Recent years have seen progress in the analysis of the heat kernel for certain reversible random walks in random environments. In particular the work of Barlow(2004) showed that the heat kernel for the random walk on the infinite component of supercritical bond percolation behaves in a Gaussian fashion. This heat kernel control was then used to prove a quenched functional central limit theorem. Following this work several examples have been analysed with anomalous heat kernel behaviour and, in some cases, anomalous scaling limits. We begin by generalizing the first result - looking for sufficient conditions on the geometry of the environment that ensure standard heat kernel upper bounds hold. We prove that these conditions are satisfied with probability one in the case of the random walk on continuum percolation and use the heat kernel bounds to prove an invariance principle. The random walk on dynamic environment is then considered. It is proven that if the environment evolves ergodically and is, in a certain sense, geometrically d-dimensional then standard on diagonal heat kernel bounds hold. Anomalous lower bounds on the heat kernel are also proven - in particular the random conductance model is shown to be "more anomalous" in the dynamic case than the static. Finally, the reflected random walk amongst random conductances is considered. It is shown in one dimension that under the usual scaling, this walk converges to reflected Brownian motion.
APA, Harvard, Vancouver, ISO, and other styles
9

Nadal, Céline. "Matrices aléatoires et leurs applications à la physique statistique et quantique." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00633266.

Full text
Abstract:
Cette thèse est consacrée à l'étude des matrices aléatoires et à quelques unes de leurs applications en physique, en particulier en physique statistique et en physique quantique.C'est un travail essentiellement analytique complété par quelques simulations numériques Monte Carlo. Dans un premier temps j'introduis la théorie des matrices aléatoires de façon assez générale : je définis les principaux ensembles de matrices aléatoires (en particulier gaussiens) et décris leurs propriétés fondamentales (distribution des valeurs propres, densité, etc). Dans un second temps je m'intéresse à des systèmes physiques d'interfaces à l'équilibre qui peuvent être modélisés par des marcheurs ''vicieux'', c'est-à-dire des marcheurs aléatoires conditionnés à ne pas se croiser. On peut montrer que la distribution des positions des marcheurs à un temps donné est exactement celle des valeurs propres d'une matrice aléatoire. J'étudie ensuite un problème physique qui relève d'un domaine très différent, celui de l'information quantique, mais qui est également étroitement relié aux matrices aléatoires: celui de l'intrication pour des états aléatoires dans un système quantique bipartite (fait de deux sous-parties) de grande taille. Enfin je m'intéresse à certaines propriétés des matrices aléatoires comme la distribution du nombre de valeurs propres positives ou encore la distribution de la valeur propre maximale (loi de Tracy-Widom près de la moyenne et grandes déviations loin de la moyenne).
APA, Harvard, Vancouver, ISO, and other styles
10

Oosthuizen, Joubert. "Random walks on graphs." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86244.

Full text
Abstract:
Thesis (MSc)--Stellenbosch University, 2014.<br>ENGLISH ABSTRACT: We study random walks on nite graphs. The reader is introduced to general Markov chains before we move on more specifically to random walks on graphs. A random walk on a graph is just a Markov chain that is time-reversible. The main parameters we study are the hitting time, commute time and cover time. We nd novel formulas for the cover time of the subdivided star graph and broom graph before looking at the trees with extremal cover times. Lastly we look at a connection between random walks on graphs and electrical networks, where the hitting time between two vertices of a graph is expressed in terms of a weighted sum of e ective resistances. This expression in turn proves useful when we study the cover cost, a parameter related to the cover time.<br>AFRIKAANSE OPSOMMING: Ons bestudeer toevallige wandelings op eindige gra eke in hierdie tesis. Eers word algemene Markov kettings beskou voordat ons meer spesi ek aanbeweeg na toevallige wandelings op gra eke. 'n Toevallige wandeling is net 'n Markov ketting wat tyd herleibaar is. Die hoof paramaters wat ons bestudeer is die treftyd, pendeltyd en dektyd. Ons vind oorspronklike formules vir die dektyd van die verdeelde stergra ek sowel as die besemgra ek en kyk daarna na die twee bome met uiterste dektye. Laastens kyk ons na 'n verband tussen toevallige wandelings op gra eke en elektriese netwerke, waar die treftyd tussen twee punte op 'n gra ek uitgedruk word in terme van 'n geweegde som van e ektiewe weerstande. Hierdie uitdrukking is op sy beurt weer nuttig wanneer ons die dekkoste bestudeer, waar die dekkoste 'n paramater is wat verwant is aan die dektyd.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Random walkers"

1

Sperl, Dieter. Random walker: Filmtagebuch. Ritter, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Random walk in random and non-random environments. Teaneck, N.J., 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Random walk in random and non-random environments. 2nd ed. World Scientific, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Random walk in random and non-random environments. World Scientific, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hughes, B. D. Random walks and random environments. Clarendon Press, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gut, Allan. Stopped Random Walks. Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-87835-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Shi, Zhan. Branching Random Walks. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25372-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gut, Allan. Stopped Random Walks. Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4757-1992-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lenz, Daniel, Florian Sobieczky, and Wolfgang Woess. Random walks, boundaries and spectra. Birkhäuser Verlag, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bovier, Anton, David Brydges, Amin Coja-Oghlan, Dmitry Ioffe, and Gregory F. Lawler. Random Walks, Random Fields, and Disordered Systems. Edited by Marek Biskup, Jiří Černý, and Roman Kotecký. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-19339-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Random walkers"

1

Chapela, Victor, Regino Criado, Santiago Moral, and Miguel Romance. "Random Walkers." In SpringerBriefs in Optimization. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26423-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gaylord, Richard J., and Kazume Nishidate. "Interacting Random Walkers." In Modeling Nature. Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4684-9405-1_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Olah, Mark J., and Darko Stefanovic. "Multivalent Random Walkers — A Model for Deoxyribozyme Walkers." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23638-9_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Guo, Wenshuo, Juntao Wang, and Kwok Yip Szeto. "Spin Model of Two Random Walkers in Complex Networks." In Studies in Computational Intelligence. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-72150-7_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Li, You, Jie Wang, Benyuan Liu, and Qilian Liang. "Finding Network Communities Using Random Walkers with Improved Accuracy." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38768-5_73.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yip, Chun Yin, and Kwok Yip Szeto. "Cover Time on a Square Lattice by Two Colored Random Walkers." In Recent Advances in Soft Computing and Cybernetics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61659-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Miller, James R., Christopher G. Adams, Paul A. Weston, and Jeffrey H. Schenker. "Experimental Method for Indirect Estimation of c.s.d. for Random Walkers via a Trapping Grid." In Trapping of Small Organisms Moving Randomly. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-12994-5_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Balevicius, M. L., A. Tamulis, J. Tamuliene, and J. M. Nunzi. "Study of Stilbene Molecule Trans↔CIS Isomerization in First Excited State and Design of Molecular Random-Walkers." In Multiphoton and Light Driven Multielectron Processes in Organics: New Phenomena, Materials and Applications. Springer Netherlands, 2000. http://dx.doi.org/10.1007/978-94-011-4056-0_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gordon, Hugh. "Random Walks." In Discrete Probability. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1966-8_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Khoshnevisan, Davar. "Random Walks." In Springer Monographs in Mathematics. Springer New York, 2002. http://dx.doi.org/10.1007/0-387-21631-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Random walkers"

1

Andrade, Matheus Guedes de, Franklin De Lima Marquezino, and Daniel Ratton Figueiredo. "Characterizing the Relationship Between Unitary Quantum Walks and Non-Homogeneous Random Walks." In Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação, 2021. http://dx.doi.org/10.5753/ctd.2021.15756.

Full text
Abstract:
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The first result establishes procedure for a stochastic matrix sequence to induce a random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. The second result establishes a similar procedure in the opposite direction. Given any random walk, a time-dependent quantum walk with the exact same vertex probability distribution is constructed. Interestingly, the matrices constructed by the first procedure allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial-time) sampling of quantum graph trajectories. Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.
APA, Harvard, Vancouver, ISO, and other styles
2

Xudong Kang, Shutao Li, Meixiu Li, and Jon Atli Benediktsson. "Extended random walkers for hyperspectral image classification." In IGARSS 2014 - 2014 IEEE International Geoscience and Remote Sensing Symposium. IEEE, 2014. http://dx.doi.org/10.1109/igarss.2014.6946727.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Drakopoulos, Georgios, Andreas Kanavos, and Athanasios Tsakalidis. "A Neo4j Implementation of Fuzzy Random Walkers." In SETN '16: 9th Hellenic Conference on Artificial Intelligence. ACM, 2016. http://dx.doi.org/10.1145/2903220.2903256.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

NOVAK, J. I. "VICIOUS RANDOM WALKERS AND TRUNCATED HAAR UNITARIES." In Proceedings of the 28th Conference. WORLD SCIENTIFIC, 2008. http://dx.doi.org/10.1142/9789812835277_0015.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Moghbel, Mehrdad, Hajjah Rozi Mahmud, Syamsiah Mashohor, and M. Iqbal Bin Saripan. "Random walkers based segmentation method for breast thermography." In 2012 IEEE EMBS Conference on Biomedical Engineering and Sciences (IECBES 2012). IEEE, 2012. http://dx.doi.org/10.1109/iecbes.2012.6498046.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dai, Wen, Tao Luo, and Jianbing Shen. "Automatic image vectorization using superpixels and random walkers." In 2013 6th International Congress on Image and Signal Processing (CISP). IEEE, 2013. http://dx.doi.org/10.1109/cisp.2013.6745296.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, Chulwoo, Won-Dong Jang, Jae-Young Sim, and Chang-Su Kim. "Multiple random walkers and their application to image cosegmentation." In 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2015. http://dx.doi.org/10.1109/cvpr.2015.7299008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jang, Won-Dong, and Chang-Su Kim. "Semi-supervised Video Object Segmentation Using Multiple Random Walkers." In British Machine Vision Conference 2016. British Machine Vision Association, 2016. http://dx.doi.org/10.5244/c.30.57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lee, Se-Ho, Won-Dong Jang, Byung Kwan Park, and Chang-Su Kim. "RGB-D image segmentation based on multiple random walkers." In 2016 IEEE International Conference on Image Processing (ICIP). IEEE, 2016. http://dx.doi.org/10.1109/icip.2016.7532819.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nguyen, Quynh, and Bhaskar Krishnamachari. "Computing inter-encounter time distributions for multiple random walkers on graphs." In 2017 Information Theory and Applications Workshop (ITA). IEEE, 2017. http://dx.doi.org/10.1109/ita.2017.8023456.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Random walkers"

1

Reeder, Leah, Aaron Jamison Hill, James Bradley Aimone, and William Mark Severa. Exploring Applications of Random Walks on Spiking Neural Algorithms. Office of Scientific and Technical Information (OSTI), 2018. http://dx.doi.org/10.2172/1471656.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Baggerly, K., D. Cox, and R. Picard. Adaptive importance sampling of random walks on continuous state spaces. Office of Scientific and Technical Information (OSTI), 1998. http://dx.doi.org/10.2172/677157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Metcalf, Gilbert, and Kevin Hassett. Investment Under Alternative Return Assumptions: Comparing Random Walks and Mean Reversion. National Bureau of Economic Research, 1995. http://dx.doi.org/10.3386/t0175.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lo, Andrew, and A. Craig MacKinlay. Stock Market Prices Do Not Follow Random Walks: Evidence From a Simple Specification Test. National Bureau of Economic Research, 1987. http://dx.doi.org/10.3386/w2168.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Random walkers' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography