Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Frogs on trees?
J Hermon - 2018 - projecteuclid.org
We study a system of simple random walks on T_d,n=(\calV_d,n,\calE_d,n), the d-ary tree of
depth n, known as the frog model. Initially there are Pois (λ) particles at each site …
depth n, known as the frog model. Initially there are Pois (λ) particles at each site …
Frogs and some other interacting random walks models
We review some recent results for a system of simple random walks on graphs, known
as\emphfrog model. Also, we discuss several modifications of this model, and present a few …
as\emphfrog model. Also, we discuss several modifications of this model, and present a few …
Linear and superlinear spread for stochastic combustion growth process
Consider a stochastic growth model on Z d. Start with some active particle at the origin and
slee** particles elsewhere. The initial number of particles at x∈ Z d is η (x), where (η (x)) …
slee** particles elsewhere. The initial number of particles at x∈ Z d is η (x), where (η (x)) …
Cover time for the frog model on trees
COVER TIME FOR THE FROG MODEL ON TREES Page 1 Forum of Mathematics, Sigma (2019),
Vol. 7, e41, 49 pages doi:10.1017/fms.2019.37 1 COVER TIME FOR THE FROG MODEL ON …
Vol. 7, e41, 49 pages doi:10.1017/fms.2019.37 1 COVER TIME FOR THE FROG MODEL ON …
The coverage ratio of the frog model on complete graphs
The frog model is a system of interacting random walks. Initially, there is one particle at each
vertex of a connected graph. All particles are inactive at time zero, except for the one which …
vertex of a connected graph. All particles are inactive at time zero, except for the one which …
Laws of large numbers for the frog model on the complete graph
The frog model is a stochastic model for the spreading of an epidemic on a graph in which a
dormant particle starts to perform a simple random walk on the graph and to awaken other …
dormant particle starts to perform a simple random walk on the graph and to awaken other …
Critical Conditions for the Coverage of Complete Graphs with the Frog Model
We consider a system of interacting random walks known as the frog model. Let $\mathcal
{K} _n=(\mathcal {V} _n,\mathcal {E} _n) $ be the complete graph with $ n $ vertices and …
{K} _n=(\mathcal {V} _n,\mathcal {E} _n) $ be the complete graph with $ n $ vertices and …
Brownian snails with removal: epidemics in diffusing populations
Two stochastic models of susceptible/infected/removed (SIR) type are introduced for the
spread of infection through a spatially-distributed population. Individuals are initially …
spread of infection through a spatially-distributed population. Individuals are initially …
The social network model on infinite graphs
Given an infinite connected regular graph G=(V, E), place at each vertex Poisson (λ) walkers
performing independent lazy simple random walks on G simultaneously. When two walkers …
performing independent lazy simple random walks on G simultaneously. When two walkers …
The end time of SIS epidemics driven by random walks on edge-transitive graphs
Network epidemics is a ubiquitous model that can represent different phenomena and finds
applications in various domains. Among its various characteristics, a fundamental question …
applications in various domains. Among its various characteristics, a fundamental question …