Sign Up to like & get
recommendations!
1
Published in 2022 at "Ecology"
DOI: 10.1002/ecy.3771
Abstract: Abstract Over the last decade, spatial capture–recapture (SCR) models have become widespread for estimating demographic parameters in ecological studies. However, the underlying assumptions about animal movement and space use are often not realistic. This is…
read more here.
Keywords:
spatial capture;
movement;
random walk;
animal movement ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2019 at "Communications in Mathematical Physics"
DOI: 10.1007/s00220-019-03644-9
Abstract: We consider a discrete time biased random walk conditioned to avoid Bernoulli obstacles on $${\mathbb {Z}}^d$$ Z d ( $$d\ge 2$$ d ≥ 2 ) up to time N . This model is known to…
read more here.
Keywords:
biased random;
walk;
bernoulli obstacles;
random walk ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2019 at "Computational Geosciences"
DOI: 10.1007/s10596-019-09852-5
Abstract: The time domain-random walk method was developed further for simulating mass transfer in fracture flows together with matrix diffusion in surrounding porous media. Specifically, a time domain-random walk scheme was developed for numerically approximating solutions…
read more here.
Keywords:
domain random;
time domain;
random walk;
Sign Up to like & get
recommendations!
0
Published in 2019 at "Journal of Statistical Physics"
DOI: 10.1007/s10955-019-02319-y
Abstract: We consider random walks on the infinite cluster of a conditional bond percolation model on the infinite ladder graph. In a companion paper, we have shown that if the random walk is pulled to the…
read more here.
Keywords:
random walk;
model;
einstein relation;
percolation model ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2018 at "Quantum Information Processing"
DOI: 10.1007/s11128-018-1820-2
Abstract: In this paper, we introduce an open quantum random walk, which we call the QBN-based open walk, by means of quantum Bernoulli noise, and study its properties from a random walk point of view. We…
read more here.
Keywords:
quantum random;
open quantum;
walk;
random walk ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2024 at "Quantum Information Processing"
DOI: 10.1007/s11128-025-04736-3
Abstract: In our previous works, we have studied quantum random walk search algorithm on hypercube, with traversing coin constructed by using generalized Householder reflection and a phase multiplier. When the same phases are used each iteration,…
read more here.
Keywords:
random walk;
walk search;
phase;
quantum random ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
0
Published in 2020 at "Scientometrics"
DOI: 10.1007/s11192-020-03374-z
Abstract: Multi-source information not only helps to solve the problem of sparse data but also improves recommendation performance in terms of personalization and accuracy. However, how to utilize it for facilitating academic collaboration effectively has been…
read more here.
Keywords:
hnrwalker;
network;
dynamic transition;
random walk ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2019 at "Science China Mathematics"
DOI: 10.1007/s11425-017-9302-9
Abstract: AbstractIn a Galton-Watson tree generated by a supercritical branching process with offspring N and EN:= m > 1, the conductance assigned to the edge between the vertex x and its parent x* is denoted by…
read more here.
Keywords:
random walk;
galton watson;
lamperti random;
Sign Up to like & get
recommendations!
1
Published in 2018 at "Frontiers of Mathematics in China"
DOI: 10.1007/s11464-018-0723-y
Abstract: We construct a sequence of transient random walks in random environments and prove that by proper scaling, it converges to a diffusion process with drifted Brownian potential. To this end, we prove a counterpart of…
read more here.
Keywords:
transient random;
random environment;
scaling limit;
random ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2024 at "Computational and Applied Mathematics"
DOI: 10.1007/s40314-025-03334-4
Abstract: This work presents global random walk approximations of solutions to one-dimensional Stefan-type moving-boundary problems. We are particularly interested in the case when the moving boundary is driven by an explicit representation of its speed. This…
read more here.
Keywords:
global random;
stefan type;
one dimensional;
type moving ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2024 at "Applied Network Science"
DOI: 10.1007/s41109-024-00613-7
Abstract: The Mantel Test, discovered in the 1960s, determines whether two distance metrics on a network are related. More recently, DimeCost, an equivalent test with improved computational complexity, was proposed. It was based on computing a…
read more here.
Keywords:
rst parallel;
walk algorithm;
random spanning;
parallel algorithm ... See more keywords