scholarly journals A branching process approach to level‐ k phylogenetic networks

2021 ◽  
Author(s):  
Benedikt Stufler
Keyword(s):  
Branching Process ◽  
Process Approach ◽  
Phylogenetic Networks

scholarly journals Branching Process Approach for 2-Sat Thresholds

2010 ◽  
Vol 47 (03) ◽  
pp. 796-810
Author(s):  
Elchanan Mossel ◽  
Arnab Sen
Keyword(s):  
Branching Process ◽  
Process Approach ◽  
Maximum Eigenvalue ◽  
Sharp Threshold

It is well known that, as n tends to ∞, the probability of satisfiability for a random 2-SAT formula on n variables, where each clause occurs independently with probability α / 2n, exhibits a sharp threshold at α = 1. We study a more general 2-SAT model in which each clause occurs independently but with probability α i / 2n, where i ∈ {0, 1, 2} is the number of positive literals in that clause. We generalize the branching process arguments used by Verhoeven (1999) to determine the satisfiability threshold for this model in terms of the maximum eigenvalue of the branching matrix.

scholarly journals Branching process approach for Boolean bipartite networks of metabolic reactions

2012 ◽  
Vol 86 (2) ◽  
Author(s):  
Deokjae Lee ◽  
K.-I. Goh ◽  
B. Kahng
Keyword(s):  
Branching Process ◽  
Process Approach ◽  
Bipartite Networks ◽  
Metabolic Reactions

scholarly journals Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph

2012 ◽  
Vol 49 (3) ◽  
pp. 601-611 ◽  
Author(s):  
Mindaugas Bloznelis ◽  
Friedrich Götze ◽  
Jerzy Jaworski
Keyword(s):  
Critical Point ◽  
General Model ◽  
Branching Process ◽  
Process Approach ◽  
Giant Component ◽  
Strongly Connected ◽  
Random Digraphs

We present and investigate a general model for inhomogeneous random digraphs with labeled vertices, where the arcs are generated independently, and the probability of inserting an arc depends on the labels of its endpoints and on its orientation. For this model, the critical point for the emergence of a giant component is determined via a branching process approach.

scholarly journals A branching process approach to power markets

2019 ◽  
Vol 79 ◽  
pp. 144-156 ◽  
Author(s):  
Ying Jiao ◽  
Chunhua Ma ◽  
Simone Scotti ◽  
Carlo Sgarra
Keyword(s):  
Branching Process ◽  
Process Approach ◽  
Power Markets

A branching process approach to a problem connected with a t..v. game show

1986 ◽  
Vol 15 (3) ◽  
pp. 919-933
Author(s):  
Prem S Puri
Keyword(s):  
Branching Process ◽  
Process Approach ◽  
Game Show

A branching process approach to compute the delay and energy efficiency of tree algorithms with free access

2014 ◽  
Vol 58 ◽  
pp. 13-28
Author(s):  
R. Block ◽  
G.T. Peeters ◽  
B. Van Houdt
Keyword(s):  
Energy Efficiency ◽  
Branching Process ◽  
Process Approach ◽  
Free Access ◽  
Tree Algorithms

scholarly journals Branching Process Approach to Avalanche Dynamics on Complex Networks

2004 ◽  
Vol 44 (3) ◽  
pp. 633 ◽  
Author(s):  
Lee D.-S. ◽  
Goh K.-I. ◽  
Kahng B. ◽  
Kim D.
Keyword(s):  
Complex Networks ◽  
Branching Process ◽  
Process Approach ◽  
Avalanche Dynamics

scholarly journals Branching process approach for epidemics in dynamic partnership network

2017 ◽  
Vol 76 (1-2) ◽  
pp. 265-294 ◽  
Author(s):  
Abid Ali Lashari ◽  
Pieter Trapman
Keyword(s):  
Branching Process ◽  
Process Approach ◽  
Partnership Network ◽  
Dynamic Partnership

scholarly journals A Simple Branching Process Approach to the Phase Transition in $G_{n,p}$

10.37236/2588 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Béla Bollobás ◽  
Oliver Riordan
Keyword(s):  
Phase Transition ◽  
Random Graph ◽  
Branching Process ◽  
Process Approach ◽  
Giant Component ◽  
Asymptotic Size ◽  
The Way

It is well known that the branching process approach to the study of the random graph $G_{n,p}$ gives a very simple way of understanding the size of the giant component when it is fairly large (of order $\Theta(n)$). Here we show that a variant of this approach works all the way down to the phase transition: we use branching process arguments to give a simple new derivation of the asymptotic size of the largest component whenever $(np-1)^3n\to\infty$.

Sign in / Sign up

Export Citation Format

Share Document