Results 271 to 280 of about 38,313 (309)
Adaptive Tip Selection for DAG-Shard-Based Federated Learning with High Concurrency and Fairness. [PDF]
Sensors (Basel)Xiao R, Cao Y, Xia B.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Simplicial branching random walks
Journal of Applied and Computational Topology, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2015
I Introduction.- II Galton-Watson trees.- III Branching random walks and martingales.- IV The spinal decomposition theorem.- V Applications of the spinal decomposition theorem.- VI Branching random walks with selection.- VII Biased random walks on Galton-Watson trees.- A Sums of i.i.d. random variables.- References.
openaire +3 more sources
I Introduction.- II Galton-Watson trees.- III Branching random walks and martingales.- IV The spinal decomposition theorem.- V Applications of the spinal decomposition theorem.- VI Branching random walks with selection.- VII Biased random walks on Galton-Watson trees.- A Sums of i.i.d. random variables.- References.
openaire +3 more sources
Stochasticity, invasions, and branching random walks
Theoretical Population Biology, 2004We link deterministic integrodifference equations to stochastic, individual-based simulations by means of branching random walks. Using standard methods, we determine speeds of invasion for both average densities and furthest-forward individuals.
Mark, Kot +3 more
openaire +2 more sources
Branching random walk with a critical branching part
Journal of Theoretical Probability, 1995Let \(M_n\) be the maximal displacement of a branching random walk, where the offspring distribution has finite variance and mean 1 and the increments of the random walk have \((4 + \varepsilon)\)-th finite moment and mean zero. Let \(\beta>0\). The main result is that \(n^{-1/2}M_n\) conditioned on nonextinction till time \(n \beta\) of the branching ...
openaire +1 more source
2010
A branching random walk is a branching tree such that with each line of descent a random walk is associated. This paper provides some results on the asymptotics of the point processes generated by the positions of the nth generation individuals. An application to the photon–electron energy cascade is also given.
openaire +1 more source
A branching random walk is a branching tree such that with each line of descent a random walk is associated. This paper provides some results on the asymptotics of the point processes generated by the positions of the nth generation individuals. An application to the photon–electron energy cascade is also given.
openaire +1 more source
Discounted branching random walks
Advances in Applied Probability, 1985Let F(·) be a c.d.f. on [0,∞), f(s) = ∑∞0pjsi a p.g.f. with p0 = 0, < 1 < m = Σjpj < ∞ and 1 < ρ <∞. For the functional equation for a c.d.f. H(·) on [0,∞] we establish that if 1 – F(x) = O(x–θ) for some θ > α =(log m)/(log p) there exists a unique solution H(·) to (∗) in the class C of c.d.f.’s satisfying 1 – H(x) = o(x–α).We give a
openaire +1 more source
Branching random walks in random environment
2021We consider branching particle processes on discrete structures like the hypercube in a random fitness landscape (i.e. random branching/killing rates). The main question is about the location where the main part of the population sits at a late time, if the state space is large. For answering this, we take the expectation with respect to the migration (
openaire +2 more sources