[PDF] Top 20 Random walks and the contact process
Has 10000 "Random walks and the contact process" found on our website. Below are the top 20 most common "Random walks and the contact process".
Random walks and the contact process
... speed random walks, where the random walk waits an exponential amount of time before each jump (instead of a fix deterministic ...the random walk (that is, the jump rate) depends on the envi- ... See full document
150
Scaling of a random walk on a supercritical contact process
... simple random walks, the exclusion process, the contact process and the voter ...exclusion process particles are conserved and cannot sit on top of each ...the contact ... See full document
25
Random walks on temporal networks
... The random walk is indeed the simplest diffusion model, and its dynam- ics provides fundamental hints to understand the whole class of diffusive processes on ...the random walk search, in which the source ... See full document
15
Node Sampling Using Centrifugal Random Walks
... Firstly, an algorithm to sample any connected network using RCW is proposed. The algorithm assumes that each node has a weight, so that the sampling process must select a node with a probability proportional to ... See full document
15
The number of ends of critical branching random walks
... In a continuous setting, Lalley and Sellke (1997) investigated similar questions for branching Brownian motion on the hyperbolic disk. Their results have been ex- tended to more general Lobachevsky spaces by Karpelevich, ... See full document
14
A diffusion process associated with Fréchet means
... and random walks leads to the fact that the rescaled sample means converge weakly to Brownian motion, possibly up to a linear transformation asso- ciated with the covariance structure of the random ... See full document
14
On subexponential tails for the maxima of negatively driven compound renewal and Lévy processes
... evy process with regularly varying at infinity L´ evy ...a random walk (a L´ evy process) is quite different to that for regularly varying distributions if the jump tail distribution is of Weibullian ... See full document
25
Random walks on activity-driven networks with attractiveness
... selection process and the possible correlation between activity and attractive- ness introduce non-trivial ...a random tie selection ...the process is substantially altered: The average number of ... See full document
10
Choice and bias in random walks
... A Markov Decision Process (MDP) is a discrete time finite state stochastic process controlled by a sequence of decisions [18]. At each step a controller specifies a probability distribution over a set of ... See full document
21
Node Sampling using Random Centrifugal Walks
... If the algorithm for connected networks is applied to a grid, given its regular structure, the construction of the spanning tree could be done without any communication among nodes, but the weight aggregation ... See full document
26
Convex hulls of random walks and their scaling limits
... a random walk in R 2 , a natural geometrical characteristic of the ...planar random walk goes back to Spitzer and Widom [21] and the continuum analogue, convex hull of planar Brownian motion, to L´evy [15, ... See full document
21
On the Optimization Problem of Stochastic Observations of Random Walks
... (note that formula (14) is similar to that of semimartingale presentation of a Brownian bridge and results from the infinitesimal semimartingale presentation of Poisson process in inverse time). According to (14) ... See full document
5
Biased randomly trapped random walks and applications to random walks on Galton Watson trees
... trapped random walk in the sub- diffusive regime; that is, when the trapping is too strong to obtain a central limit ...the random walk on the subcritical GW-tree because of a so-called lattice effect which ... See full document
201
Random walks and search in time-varying networks
... Random walks on networks lie at the core of many real-world dynamical processes, ranging from the nav- igation and ranking of information networks to the spreading of diseases and the routing of information ... See full document
6
Random Walks and Trees
... Historically, the model of the Galton–Watson process was introduced by Galton and Watson in 1874 to study the survival probability of distinguished or ordinary families. In the supercritical case, the number of ... See full document
39
Towards Random Walks Underlying Neuronal Spikes
... of action. In our framework, the combinatorial properties of the Pascal’s triangle are correlated with the mathermatical operations that lead to brain spikes, through iterated random walk patterns. The occurrence ... See full document
14
Self avoiding random walks on multifractal lattices
... For each disorder configuration, the corresponding renormalisation transformation is used to calculate a critical exponent and a connectivity constant.. These properties are then average[r] ... See full document
9
Pseudorandom Generators from Polarizing Random Walks
... Pseudorandom generators (PRG) are widely studied in complexity theory. There are several general frameworks used to construct PRGs. One is based on basic building blocks, such as small-bias genera- tors [16, 2], k-wise ... See full document
26
The invariant measure of random walks in the quarter plane
... In this chapter, we try to construct a homogeneous random walk for a spec- ified measure m induced by ˆ Γ. First we give necessary conditions on the struc- ture of the Γ for m to be the invariant measure of the ... See full document
52
Answering Opinion Questions with Random Walks on Graphs
... Markov Random Walk have been proposed to solve different kinds of ranking problems, most of which are inspired by the PageRank algorithm (Page et ...Markov Random Walk-based sentence ranking models only ... See full document
9
Related subjects