Results 71 to 80 of about 587 (192)
Reduced multitype critical branching processes in random environment
We consider a multitype critical branching process Z n , n = 0, 1,…, in an i.i.d. random environment.
Elena E. Dyakonova
core +1 more source
Based on the goal of a low‐carbon economy, this study proposes a short‐term electric power and energy balance optimization scheduling model for low‐carbon bilateral demand response. The improved algorithm is used to predict load behaviour and optimize system scheduling to reduce carbon emissions under the condition of electric power and energy balance.
Juan Li, Yonggang Li, Huazhi Liu
wiley +1 more source
Deep learning methods for protein structure prediction
This review provides an overview of traditional and modern methods for protein structure prediction and their characteristics and introduces the groundbreaking network features of the AlphaFold family model. We summarize the applications of different bioinformatics databases and various models based on deep learning architectures (convolutional neural ...
Yiming Qin +5 more
wiley +1 more source
Extremes of multitype branching random walks: Heaviest tail wins [PDF]
We consider a branching random walk on a multitype (with Q types of particles), supercritical Galton-Watson tree which satisfies the Kesten-Stigum condition.
Palmowski, Z. (Zbigniew) +3 more
core +1 more source
Multitype PCR branching processes
To model amplification Polymerase Chain Reaction (PCR) techniques targeting DNA sequences of several types, we introduce a multitype PCR branching process as a generalized version of the Michaelis-Menten-based branching process model introduced in Jagers-Klebaner, 2003. We establish two limit theorems extending the results of Chigansky-Jagers-Klebaner,
Chigansky, P. +3 more
openaire +2 more sources
Markov limit of line of decent types in a multitype supercritical branching process
In a multitype (d types) supercritical positively regular Galton–Watson branching process, let {Xn,Xn−1,…,X0} denote the types of a randomly chosen (i.e., uniform distribution) individual from the nth generation and this individual’s n ancestors.
Hong, Jyy-I, Athreya, K.B.
core +1 more source
Coalescence on critical and subcritical multitype branching processes
AbstractConsider a d-type (d<∞) Galton–Watson branching process, conditioned on the event that there are at least k≥2 individuals in the nth generation, pick k individuals at random from the nth generation and trace their lines of descent backward in time till they meet.
openaire +4 more sources
Central limit theorems for multicolor urns with dominated colors [PDF]
An urn contains balls of d≥2 colors. At each time n≥1, a ball is drawn and then replaced together with a random number of balls of the same color. Let A n = diag (An,1,…,An,d) be the n-th reinforce matrix. Assuming that EAn,j=EAn,1 for all n and j, a few
L. Pratelli +7 more
core +1 more source
Long-term behavior of a critical multitype spatially homogeneous branching particle process and a related reaction-diffusion system [PDF]
A dichotomy concerning extinction and survival (even persistence) at late times is established for critical multitype spatially homogeneous branching particle systems in continuous time under natural conditions on the branching mechanism known from the ...
Weierstrass-Institut fuer Angewandte Analysis und Stochastik (WIAS) im Forschungsverbund Berlin e.V. (Germany) +2 more
core +2 more sources
Random laminations and multitype branching processes, Elect
We consider multitype branching processes arising in the study of random laminations of the disk. We classify these processes according to their subcritical or supercritical behavior and provide Kolmogorov-type estimates in the critical case ...
Yuval Peres, Nicolas Curien
core

