Related papers: Behavior analysis of virtual item gambling
We study exploration properties of a random walk on a network. For a fully connected network we find that the problem can be mapped to the well known coupon collector problem, thus allowing us to estimate form of $P(S,t)$: the distribution…
We present a random walk model that exhibits asymptotic subdiffusive, diffusive, and superdiffusive behavior in different parameter regimes. This appears to be the first instance of a single random walk model leading to all three forms of…
We conjecture that the random walk and the corresponding diffusion in the relativistic velocity space is an adequate method for describing the acceleration process in relativistic jets. Considering a simple toy model, the main features of…
It is recognised now that a variety of real-life phenomena ranging from diffuson of cold atoms to motion of humans exhibit dispersal faster than normal diffusion. L\'evy walks is a model that excelled in describing such superdiffusive…
Random walks as well as diffusions in random media are considered. Methods are developed that allow one to establish large deviation results for both the `quenched' and the `averaged' case.
The random walk problem is studied in two and three dimensions in the presence of a random distribution of static traps. An efficient Monte Carlo method, based on a mapping onto a polymer model, is used to measure the survival probability…
Deterministic walks over a random set of points in one and two dimensions (d=1,2) are considered. Points (``cities'') are randomly scattered in R^d following a uniform distribution. A walker (a ``tourist''), at each time step, goes to the…
Many-body dynamical models in which Boltzmann statistics can be derived directly from the underlying dynamical laws without invoking the fundamental postulates of statistical mechanics are scarce. Interestingly, one such model is found in…
We derive an expression for the mean square displacement of a particle whose motion is governed by a uniform, periodic, quantum multi-baker map. The expression is a function of both time, $t$, and Planck's constant, $\hbar$, and allows a…
Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…
We give elementary examples within a framework for studying decisions under uncertainty where probabilities are only roughly known. The framework, in gambling terms, is that the size of a bet is proportional to the gambler's perceived…
We investigate transitions of portals users between different subpages. A weighted network of portals subpages is reconstructed where edge weights are numbers of corresponding transitions. Distributions of link weights and node strengths…
We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…
We study the equilibrium distribution of relative strategy scores of agents in the asymmetric phase ($\alpha\equiv P/N\gtrsim 1$) of the basic Minority Game using sign-payoff, with $N$ agents holding two strategies over $P$ histories. We…
Using Trades and Quotes data from the Paris stock market, we show that the random walk nature of traded prices results from a very delicate interplay between two opposite tendencies: long-range correlated market orders that lead to…
The behavior of the maximal displacement of a supercritical branching random walk has been a subject of intense studies for a long time. But only recently the case of time-inhomogeneous branching has gained focus. The contribution of this…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
Using Monte Carlo simulations we examine the diffusive properties of the greedy algorithm in the d-dimensional traveling salesman problem. Our results show that for d=3 and 4 the average squared distance from the origin <r^2> is…
We study the persistent random walk of photons on a one-dimensional lattice of random transmittances. Transmittances at different sites are assumed independent, distributed according to a given probability density $f(t)$. Depending on the…
The volatility characterizes the amplitude of price return fluctuations. It is a central magnitude in finance closely related to the risk of holding a certain asset. Despite its popularity on trading floors, the volatility is unobservable…