Persistence of Activity in Random Boolean Networks
|
|
- Alfred Daniels
- 6 years ago
- Views:
Transcription
1 Persistence of Activity in Random Boolean Networks Shirshendu Chatterjee and Rick Durrett Cornell University December 20, 2008 Abstract We consider a model for gene regulatory networks that is a modification of Kauffmann s 969 random Boolean networks. There are three parameters: n = the number of nodes, r = the number of inputs to each node, and p = the expected fraction of s in the Boolean functions at each site. Following a standard practice in the physics literature, we use a threshold contact process on a random graph in which each node has in degree r to approximate its dynamics. We show that if r 3 and r 2p p >, then the threshold contact process persists for a long time, which corresponds to chaotic behavior of the Boolean network. Unfortunately, we are only able to prove the persistence time is expcn bp with bp > 0 when r 2p p > and bp = when r 2p p >. Keywords: random graphs, threshold contact process, phase transition, random Boolean networks, gene regulatory networks Both authors were partially supported by NSF grant from the probability program at NSF.
2 Introduction Random Boolean networks were originally developed by Kauffman 969 as an abstraction of genetic regulatory networks. The idea is to identify generic properties and patterns of behavior for the model, then compare them with the behavior of real systems. Protein and RNA concentrations in networks are often modeled by systems of differential equations. However, in large networks the number of parameters such as decay rates, production rates and interaction strengths can become huge. Recent work by Albert and Othmer 2003 on the segment polarity network in Drosophila melanogaster, see also Chaves, Albert and Sontag 2005, has shown that Boolean networks can in some cases outperform differential equation models. Kauffman et al used random Boolean networks to model the yeast transcriptional network, and Li et al 2004 have used this approach to model the yeast cell-cycle network. In our random Boolean network model, the state of each node x V n = {, 2,..., n} at time t = 0,, 2,... is η t x {0, }. Each node x has r input nodes y x,..., y r x chosen randomly from the set of all nodes, and we draw oriented edges to each node from its input nodes. So the edge set is E n = {y i x, x : x V n, i r}. Thus the underlying graph G n is a random element chosen from the set of all directed graphs in which the in-degree of any vertex is equal to r. Once chosen the network remains fixed through time. The updating for node x is η t+ x = f x η t y x,..., η t y r x, where the values f x v, x V n, v {0, } r, chosen at the beginning and then fixed for all time, are independent and = with probability p. A number of simulation studies have investigated the behavior of this model. See Kadanoff, Coppersmith, and Aldana 2002 for survey. Flyvberg and Kjaer 988 have studied the degenerate case of r = in detail. Derrida and Pommeau 986 have shown that for r 3 there is a phase transition in the behavior of these networks between rapid convergence to a fixed point and exponentially long persistence of changes, and identified the phase transition curve to be given by the equation r 2p p =. The networks with parameters below the curve have behavior that is ordered and those with parameters above the curve have chaotic behavior. Since chaos is not healthy for a biological network, it should not be surprising that real biological networks avoid this phase. See Kauffman 993, Shmulevich, Kauffman, and Aldana 2005, and Nykter et al To explain the intuition behind the result of Derrida and Pomeau 986, we define another process ζ t x for t. The idea is that ζ t x = if and only if η t x η t x. Now if the state of at least one of the inputs y x,..., y r x into node x has changed at time t, then the state of node x at time t + will be computed by looking at a different value of f x. If we ignore the fact that we may have used this entry before, we get the dynamics of the threshold contact process P ζ t+ x = = 2p p if ζ t y x + + ζ t y r x > 0 2
3 and ζ t+ x = 0 otherwise. Conditional on the state at time t, the decisions on the values of ζ t+ x, x V n are made independently. We content ourselves to work with the threshold contact process since it gives an approximate sense of the original model and we can prove rigorous results about its behavior. To simplify notation and explore the full range of threshold contact processes we let q = 2p p and suppose 0 q. As mentioned above, it is widely accepted that the condition for prolonged persistence of the threshold contact process is qr >. To explain this, we note that vertices in the graph have average out-degree r, so a value of at a vertex will, on the average, produce qr s in the next generation. To state our first result, we will rewrite the threshold contact process as a set valued process ξ t = {x : ζ t x = }. We will refer to the vertices x ξ t as occupied. Let {ξ t } t 0 be the threshold contact process starting from all occupied sites, and ρ be the survival probability of a branching process with offspring distribution p r = q and p 0 = q. By branching process theory ρ = θ, where θ 0, satisfies θ = q + qθ r.. Theorem. Suppose qr > and let δ > 0. There is a positive constant Cδ so that as n ξ inf P t t expcδn n ρ 2δ. To prove this result, we will consider the dual coalescing branching process ˆξ t. In this process if x is occupied at time t, then with probability q all of the sites y x,..., y r x will be occupied at time t+, and birth events from different sites are independent. Writing A and B for the initial sets of occupied sites in the two processes we have the duality relationship: P ξ A t B = P ˆξ B t A, t = 0,, 2, Taking A = {, 2,..., n} and B = {x} this says P x ξ t = P ˆξ {x} t, or the density of occupied sites in ξt is equal to the probability that ˆξ {x} s survives until time t. Since over small distances our graph looks like a tree in which each vertex has r descendants, the last quantity ρ. From.2 it should be clear that we can prove Theorem by studying the coalescing branching process. The key to this is an isoperimetric inequality. Let Ĝn be the graph obtained from our original graph G n = V n, E n by reversing the edges. That is, Ĝ n = V n, Ên, where Ên = {x, y : y, x E n }. Given a set U V n, let U = {y : x y for some x U},.3 where x y means x, y Ên. Note that U can contain vertices of U. The idea behind this definition is that if U is occupied at time t in the coalescing branching process, then the vertices in U may be occupied at time t +. 3
4 Theorem 2. Let P m, k be the probability that there is a subset U V n with size U = m so that U k. Given η > 0 there is an ɛ 0 η so that for m ɛ 0 n P m, r ηm exp ηm logn/m/2. In words, the isoperimetric constant for small sets is r. It is this result that forces us to assume qr > in Theorem. To see that Theorem 2 is sharp, define an undirected graph H n on the vertex set V n so that x and y are adjacent if and only if there is a z so that x z and y z in Ĝn. The mean number of neighbors of a vertex in H n is r 2 9, so standard arguments show that there is a c > 0 so that with probability tending to as n there is a connected component K n of H n with K n cn. If U is a connected subset of K n with U = m then by building up U one vertex at a time we see that U + r m. Since the isoperimetric constant is r, it follows that when qr <, there are bad sets A with A nɛ so that E ˆξ A A. Computations from the proof of Theorem 2 suggest that there are a large number of bad sets. We have no idea how to bound the amount of time spent in bad sets, so we have to take a different approach to show persistence when /r < q /r. Theorem 3. Suppose qr >. If δ 0 is small enough, then for any 0 < δ < δ 0, there are constants Cδ > 0 and Bδ = /4 2δ logqr δ/ log r so that as n ξ inf P t t expcδ n Bδ n ρ 3δ. To prove this, we will again investigate persistence of the dual. Let d 0 x, y be the length of the shortest oriented path from x to y in Ĝn, let and for any subset A of vertices let dx, y = min z V n [d 0 x, z + d 0 y, z], ma, K = max{ S : dx, y K for x, y S}..4 S A Let R = log n/ log r be the average value of d, y, let a = /4 δ and B = a δ logqr δ/ log r. We will show that if mˆξ s A, 2aR < ρ 2δn B, then with high probability, we will later have mˆξ t A, 2aR ρ 2δn B. To do this we first argue that when we first have mˆξ s A, 2aR < ρ 2δn B, there are at least q δρ 2δn B occupied sites so that the d distance between any two vertices is at least 2aR 2. We run the dual process starting from these vertices until time ar 2, so they are independent. With high probability at least one of these vertices, call it w, has n B descendants. We run the dual processes starting from these n B vertices for another ar units of time, and then pick one offspring from each of the duals which have survived till time ar to have a set that is suitably spread out and has size at least ρ 2δn B. It seems foolish to pick only one vertex w after the first step, but we do not know how to guarantee that the vertices are suitably separated after the second step if we pick more. 4
5 2 Proof of Theorem We begin with the proof of the isoperimetric inequality, Theorem 2. Proof of Theorem 2. Let P m, k be the probability that there is a set U of vertices in Ĝn of size m with U k. Let pm, k be the probability that there is a set U with U = m and U = k. First we will estimate pm, l where l = r ηm. pm, l = P U = U P U U. {U,U : U =m, U =l} {U,U : U =m, U =l} According to the construction of G n, the other end of each of the r U edges coming out of U is chosen at random from V n so U P U U r U =, n and hence pm, l n m n l l n rm. 2. To bound the right-hand side, we use the trivial bound n nm ne m m m!, 2.2 m where the second inequality follows from e m > m m /m!. Using 2.2 in 2. pm, l ne/m m ne/l l l n rm. Recalling l = r ηm, the last expression becomes = e mr η m/n m[ r η+r] r η r ηm+rm. Letting cη = r η + + η logr η C for η 0, r, we have pm, r ηm exp ηm logn/m + Cm. Summing over integers k = r η m with η η, and noting that there are fewer than rm terms in the sum, we have P m, r ηm exp ηm logn/m + C m. To clean up the result to the one given in Theorem 2, choose ɛ 0 such that η log/ɛ 0 /2 > C. Hence for any m ɛ 0 n, which gives the desired result. η logn/m/2 η log/ɛ 0 /2 > C, 5
6 To grow the cluster starting at a vertex x in Ĝn, we add the neighbors in a breadth-first search. That is, we add all vertices y for which d 0 x, y = j one at a time, before proceeding to the vertices at distance j +. Lemma 2.. Suppose 0 < δ < /2. Let A x be the event that the cluster starting at x in Ĝn does not intersect itself before reaching size n /2 δ, and let A x,y be the event that the clusters starting from x and y do not intersect before reaching size n /2 δ. Then for all x, y V n P A c x, P A c x,y n 2δ. 2.3 Proof. Let δ = /2 δ. While growing the cluster starting from x up to size n δ, the probability of a self-intersection at any step is n δ /n, so P A x n δ n δ n 2δ = n 2δ. The exact same reasoning applied to the cluster containing x intersecting the cluster of y grown to size n /2 δ. Lemma 2. shows that Ĝn is locally tree-like. In the next lemma, we will use this to get a bound on the survival of the dual process for small times. Let ρ be the branching process survival probability defined in.. Lemma 2.2. If q > /r, δ 0, qr, γ = 20 log r, and b = γ logqr δ then for large n P ˆξ{x} n b ρ δ. 2γ log n Proof. Let A x be the event that the cluster starting at x in Ĝn does not intersect itself before reaching size n /4. On the event A x, for t 2γ log n, ˆξ {x} t = Z t, is a branching process with Z 0 = and offspring distribution p 0 = q and p r = q. Since q > /r, this is a supercritical branching process. Let B x be the event that the branching process survives. If we condition on B x, then, using a large deviation results for branching processes from Athreya 994, Z t+ P qr > δ B x e cδt 2.4 Z t for large enough t. So if F x = {Z t+ qr δz t for γ log n t < 2γ log n}, then P F c x B x 2γ log n t=γ log n e cδt C δ n cδγ 2.5 for large enough n. On the event B x F x, Z 2γ log n qr δ γ log n = n γ logqr δ, since Zγ log n. Combining the error probabilities of 2.3 and 2.5 P ˆξ{x} n γ logqr δ P B x P A c x P Fx B c x P B x δ 2γ log n for large enough n, as P A x n /2 by Lemma 2.. 6
7 Lemma 2.2 shows that the dual process starting from one vertex will with probability ρ δ survive until there are n b particles. The next lemma will show that if the dual starts with n b particles, then it can reach ɛn particle with high probability. Lemma 2.3. If qr >, then there exists ɛ 0 = ɛ 0 q > 0 such that for any A with A = n b the dual process {ˆξ t A } t 0 satisfies P max ˆξ A t ɛ 0 n n b t < ɛ 0 n exp n b/4. Proof. Choose η > 0 such that q ηr η > and let ɛ 0 η be the constant in Theorem 2. Let τ = min{t : ˆξ A t ɛ 0 n}. For t < τ, let F t = { ˆξ A t ˆξ A t + }. Then for t 0 P F t+ P B t C t, where B t = {at least q η ˆξ A t particles of ˆξ A t give birth}, C t = { U t r η U t }, where U t = {x ˆξ A t : x gives birth}. Using the binomial large deviations, see Lemma on page 40 in Durrett 2007 P B t exp γq η/qq ˆξ A t, 2.6 where γx = x log x x + > 0 for x. On G t = t s=f s, ˆξ A t n b and so P B t G t exp γq η/qqn b. Since for t < τ, we have ˆξ t A < ɛ 0 n, we can use Theorem 2 and the fact, that U t q ηn b n b /r on G t B t, to get P C t G t B t exp η n b nr log. 2 r n b Combining these two bounds we get P B t C t G t exp n b/2 for large n. Since τ ɛ 0 n n b on G ɛ0 n n b, P τ > ɛ 0 n n b P ɛn nb t= F c t ɛ 0 n n b exp n b/2 exp n b/4 for large n and we get the result. The next result shows that if there are ɛn particles at some time, then the dual survives for time expcn. Lemma 2.4. If qr >, then there exists constants c, ɛ 0 > 0 such that for T = expcn and any A with A ɛ 0 n, P inf ˆξ t A < ɛ 0 n 2 exp cn. t T 7
8 Proof. Choose η > 0 so that q ηr η >, and then choose ɛ 0 η > 0 as in Theorem 2. For any A with A ɛ 0 n, let U t = {x ˆξ A t : x gives birth}. If U t ɛ 0 n, then take U t = U t. If U t > ɛ 0 n, we have too many vertices to use Theorem 2, so we let U t be the subset of U t consisting of the ɛ 0 n vertices with smallest indices. Let F t = { ˆξ t A ɛ 0 n} G t = t s=0f s B t = {at least q η ˆξ t A particles of ˆξ t A C t = { Ut r η U t }. give birth} Now for t 0, F t+ G t B t C t G t. Using our binomial large deviations result 2.6 again, P B t exp γq η/qq ˆξ t A. On the event F t, ˆξ t A ɛ 0 n, and so P B t G t exp γq η/qqɛ 0 n. Since U t ɛ 0 n, and on the event G t B t U t q ηɛ 0 n ɛ 0 n/r, using Theorem 2 we have P C t G t B t exp η ɛ 0 n 2 r log r. ɛ 0 Combining these two bounds P F t+ G t 2 exp 2cηn, where cη = q η {γ 2 min qɛ 0, η ɛ 0 q 2 r log r }. ɛ 0 Hence for T = expcηn P inf t T ˆξ A t T < ɛ 0 n P T t=ft c t=0 P F c t+ G t 2 exp cηn. Lemma 2.4 confirms prolonged persistence for the dual. We will now give the Proof of Theorem. Choose δ 0, qr and γ = 20 log r. Define the random variables Y x, x n, as Y x = if the dual process {ˆξ {x} t } t 0 starting at x satisfies ˆξ {x} 2γ log n nb for b = γ logqr δ and Y x = 0 otherwise. By Lemma 2.2, if n is large then EY x ρ δ for any x. If we grow the cluster starting from x in a breadth-first search then all the vertices at distance 2γ log n from x are in the cluster of size n 2γ log r n /0. So if A x,z is the event that the clusters of size n /0 starting from x and z do not intersect, then P Y x =, Y z = P Y x = P Y z = P A c x,z n 4/5 by Lemma 2.. Using this bound, n var Y x n + nn n 4/5, 8
9 and Chebyshev s inequality shows that as n n P Y x EY x nδ n + nn n 4/5 0. n 2 δ 2 Since EY x ρ δ, this implies lim P n n Y x nρ 2δ =. 2.7 Choose η > 0 so that q ηr η > 0. Let ɛ 0 and cη be the constants in Lemma 2.4. Now if Y x =, Lemma 2.2 shows that ˆξ {x} T n b for T = 2γ log n. Combining the error probabilities of Lemmas 2.3 and 2.4, shows that within the next T 2 = expcηn + ɛ 0 n n b units of time the dual process contains at least ɛ 0 n many particles with probability 2 exp n b/4 for large n. Using the duality property of the threshold contact process we see that for any subset B of vertices ˆξ{x} P ξt +T 2 B = P T +T 2 x B P ˆξ {x} T +T 2 ɛ 0 n x B P Y x = x B 2 B exp n b/4 P Y x = x B 2 exp n b/8, as B n. Hence for T = T + T 2 using the attractiveness property of the threshold contact process and combining the last calculation with 2.7 we conclude that as n ξ inf P t ξ t T n > ρ 2δ = P T n > ρ 2δ n P ξt {x : Y x = }, Y x nρ 2δ. This completes the proof of Theorem. 3 Proof of Theorem 3 Recall the definition of ma, K given in.4. Let R = log n/ log r, a = /4 δ and let ρ be the branching process survival probability defined in.. Lemma 3.. If qr > and δ 0 is small enough, then for any 0 < δ < δ 0 there are constants Cδ > 0, Bδ = /4 2δ logqr δ/ log r and a stopping time T satisfying P T < 2 exp Cδn Bδ 3 exp Cδn Bδ such that for any A with ma, 2aR ρ 2δn Bδ, ˆξ T A ρ 2δn Bδ. 9
10 Proof. Let m t = mˆξ A t, 2aR. We define the stopping times σ i and τ i as follows. σ 0 = 0, and for i 0 τ i+ = min{t > σ i : m t < ρ 2δn B }, σ i+ = min{t > τ i+ : m t ρ 2δn B }. First we estimate the probability of the event E i = {mˆξ A τ i, 2aR 2 q δρ 2δn B }. Since τ i > σ i for i, m τi ρ 2δn B, and hence there is a set S of size ρ 2δn B such that any two vertices in S are 2aR apart. Using the binomial large deviation estimate 2.6, at least q δρ 2δn B vertices of S will give birth at time τ i with probability exp γq δ/qqρ 2δn B. If we choose one offspring from the vertices of S which give birth, then we have at least q δρ 2δn B vertices at time τ i so that they are separated by distance 2aR 2 from each other. So P E c i exp c δn B, 3. where c δ = γq δ/qqρ 2δ. On the event E i, ˆξ τ A i ζ i where ζ i q δρ 2δn B and all vertices of ζ i are distance 2aR 2 apart from each other. Let A x be the event that the cluster starting at x in Ĝn does not intersect itself before reaching size n 2a.On the event A x, as shown in Lemma 2.2, ˆξ {x} t = Zt x for t 2aR, where Zt x is a supercritical branching process with mean offspring number qr. Let B x be the event of survival for Zt x, P B x = ρ > 0 and F x = ar 3 t=δr 2 {Zx t+ qr δzt x }. Using the error probability of 2.4 P F c x B x ar 3 t=δr 2 e c δt C δ e c δδ log n/log r = C δ n c δδ/log r. On the event B x F x Z x ar 2 qr δa δr = n a δ logqr δ/ log r = n B. Hence for G x = A x { ˆξ {x} ar 2 nb }, P G x P A x B x F x P B x P A c x P F c x B x P B x δ = ρ δ 3.2 for large enough n, as P A x n 4δ using Lemma 2.. Since each vertex of ζ i is 2aR 2 apart from the other vertices of ζ i, ˆξ ζ i t is a disjoint {x} union of ˆξ t over x ζ i for t ar 2. Let H i be the event that there is at least one x ζ i for which G x occurs. Then P H c i E i ρ + δ ζ i ρ + δ q δρ 2δnB = exp c 2 δn B, 3.3 where c 2 δ = q δρ 2δ log/ ρ + δ. If H i E i occurs, choose any vertex w i ζ i such that G wi occurs and let S i = ˆξ {w i} ar 2 = S i. By the choice of w i, S i n B and the clusters of size n a starting from any two vertices of 0
11 ˆξ {x} S i do not intersect. So ˆξ S i t is a disjoint union of P ˆξ {x} {x} ar ρ δ. We choose one vertex from ˆξ ar have a set W i ˆξ S i ar. t over x S i for t ar. Using 3.2 for each x S i for which to Let J i be the event that there are at least ρ 2δn B {x} vertices in S i such that ˆξ ar. Using our binomial large deviation estimate 2.6 ρ 2δ P Ji c exp γ ρ δn B = exp c 3 δn B. 3.4 ρ δ So on the intersection E i H i J i there is a set W i ˆξ {w i} 2aR 2 with W i ρ 2δn B, and each vertex of W i is separated by a distance 2aR from other vertices of W i. Hence using monotonicity of the threshold contact process σ i τ i + 2aR on this intersection. So P σ i > τ i + 2aR P E c i + P H c i E i + P J c i 3 exp 2Cδn B, where Cδ = min{c δ, c 2 δ, c 3 δ}/2. Let K = inf{i : σ i > τ i + 2aR}. Then P K > expcδn B [ 3 exp 2Cδn B ] expcδn B 3 exp Cδn B. Since σ i > τ i > σ i, σ K 2K. As ˆξ A σ K ρ 2δn B, we get our result if we take T = σ K. As in the proof of Theorem, survival of the dual process gives persistence of the threshold contact process. Proof of Theorem 3. Let 0 < δ < δ 0, ρ, a = /4 δ and B = /4 2δ logqr δ/ log r be the constants from the previous proof. Define the random variables Y x, x n, as {x} Y x = if the dual process ˆξ t starting at x satisfies mˆξ {x} 2aR 2, 2aR ρ 2δnB and Y x = 0 otherwise. Consider the event G x as defined in Lemma 3.. For large n, P G x P B x δ = ρ δ. If G x occurs, then ˆξ {x} ar 2 nb {x} and clusters starting from any two vertices of ˆξ ar do not intersect until their size become n a. Using arguments that led to 3.4 P mˆξ {x} 2aR 2, 2aR < ρ 2δnB G x exp cn B, ˆξ {x} ar which implies that if n is large P Y x = ρ 2δ. If we grow the cluster starting from x using a breadth-first search, then all the vertices at distance 2aR from x are within the cluster of size n 2a. So if A x,z be the event that the clusters of size n 2a starting from x and z do not intersect, then P Y x =, Y z = P Y x = P Y z = P A c x,z n 4a = n 4δ
12 by Lemma 2.. Using the bound on the covariances, n var Y x n + nn n 4δ, and Chebyshev s inequality gives that as n n P Y x EY x nδ n + nn n 4δ n 2 δ 2 0. Since EY x ρ 2δ, this implies lim P n n Y x nρ 3δ =. 3.5 If Y x =, mˆξ {x} T, 2aR ρ 2δn B, for T = 2aR 2. Using Lemma 3., after an additional T 2 2 expcδn B units of time, the dual process contains at least ρ 2δn B many particles with probability 3 exp Cδn B. Using duality of the threshold contact process, for any subset S of vertices ˆξ{x} P ξt +T 2 S = P T +T 2 x S P ˆξ {x} T +T 2 ρ 2δn B x S P Y x = x S 3 S exp Cδn B P Y x = x S exp n B/2, since S n. Hence for T = T + T 2 using the attractiveness property of the threshold contact process, and combining the last calculation with 3.5 we conclude that as n ξ inf P t ξ t T n > ρ 3δ = P T n > ρ 3δ n P ξt {x : Y x = }, Y x nρ 3δ, which completes the proof of Theorem 3. References Albert, R. and Othmer, H. G The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in Drosophila melanogaster. Journal of Theoretical Biology, 223, 8 2
13 Athreya, K.B. 994 Large deviations for branching processes, I. Single type case. Ann. Appl. Prob. 4, Chaves, M., Albert, R., and Sontag, E.D Robustness and fragility of Boolean models for genetic regulatory networks. J. Theor. Biol. 235, Derrida, B. and Pomeau, Y. 986 Random networks of automata: a simplified annealed approximation. Europhysics Letters,, Durrett, R Random Graph Dynamics. Cambridge University Press. Flyvbjerg, H. and Kjaer, N. J. 988 Exact solution of Kaufmann s model with connectivity one. Journal of Physics A, 2, Kadanoff, L.P., Coppersmith, S., and Aldana, M Boolean dynamics with random couplings. arxiv:nlin.ao/ Kauffman, S. A. 969 Metabolic stability and epigenesis in randomly constructed genetic nets. Journal of Theoretical Biology, 22, Kauffman, S. A. 993 Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press. Kauffman, S.A., Peterson, C., Samuelsson, B., and Troein, C Random Boolean models and the yeast transcriptional network. Proceedings of the National Academy of Sciences 0, Li, F., Long, T., Lu Y., Ouyang Q., Tang C The yeast cell-cycle is robustly designed. Proceedings of the National Academy of Sciences, 0, Liggett, T. M.999 Stochastic Interacting Systems: Contact, Voter, and Exclusion Processes. Springer. Nyter, M., Price, N.D., Aldana, M., Ramsey. S.A., Kauffman, S.A., Hood, L.E., Yli-Harja, O., and Shmuelivich, I Proceedings of the National Academy of Sciences. 05, Shmulevih, I., Kauffmann, S.A., and Aldana, M Eukaryotic cells are dynamically ordered or critical but not chaotic. Proceedings of the National Academy of Sciences. 02,
Latent voter model on random regular graphs
Latent voter model on random regular graphs Shirshendu Chatterjee Cornell University (visiting Duke U.) Work in progress with Rick Durrett April 25, 2011 Outline Definition of voter model and duality with
More informationMeasures for information propagation in Boolean networks
Physica D 227 (2007) 100 104 www.elsevier.com/locate/physd Measures for information propagation in Boolean networks Pauli Rämö a,, Stuart Kauffman b, Juha Kesseli a, Olli Yli-Harja a a Institute of Signal
More informationA first order phase transition in the threshold θ 2 contact process on random r-regular graphs and r-trees
A first order phase transition in the threshold θ 2 contact process on random r-regular graphs and r-trees Shirshendu Chatterjee Courant Institute of Mathematical Sciences, New York University 251 Mercer
More informationRandom graphs: Random geometric graphs
Random graphs: Random geometric graphs Mathew Penrose (University of Bath) Oberwolfach workshop Stochastic analysis for Poisson point processes February 2013 athew Penrose (Bath), Oberwolfach February
More informationA first order phase transition in the threshold θ 2 contact process on random r-regular graphs and r-trees
Available online at www.sciencedirect.com Stochastic Processes and their Applications 123 (2013) 561 578 www.elsevier.com/locate/spa A first order phase transition in the threshold θ 2 contact process
More informationErdős-Renyi random graphs basics
Erdős-Renyi random graphs basics Nathanaël Berestycki U.B.C. - class on percolation We take n vertices and a number p = p(n) with < p < 1. Let G(n, p(n)) be the graph such that there is an edge between
More informationNetwork Structure and Activity in Boolean Networks
Network Structure and Activity in Boolean Networks Abhijin Adiga 1, Hilton Galyean 1,3, Chris J. Kuhlman 1, Michael Levet 1,2, Henning S. Mortveit 1,2, and Sichao Wu 1 1 Network Dynamics and Simulation
More informationThe Contact Process on the Complete Graph with Random, Vertex-dependent, Infection Rates
The Contact Process on the Complete Graph with Random, Vertex-dependent, Infection Rates Jonathon Peterson Purdue University Department of Mathematics December 2, 2011 Jonathon Peterson 12/2/2011 1 / 8
More informationJIGSAW PERCOLATION ON ERDÖS-RÉNYI RANDOM GRAPHS
JIGSAW PERCOLATION ON ERDÖS-RÉNYI RANDOM GRAPHS ERIK SLIVKEN Abstract. We extend the jigsaw percolation model to analyze graphs where both underlying people and puzzle graphs are Erdös-Rényi random graphs.
More informationThe Minesweeper game: Percolation and Complexity
The Minesweeper game: Percolation and Complexity Elchanan Mossel Hebrew University of Jerusalem and Microsoft Research March 15, 2002 Abstract We study a model motivated by the minesweeper game In this
More informationw i w j = w i k w k i 1/(β 1) κ β 1 β 2 n(β 2)/(β 1) wi 2 κ 2 i 2/(β 1) κ 2 β 1 β 3 n(β 3)/(β 1) (2.2.1) (β 2) 2 β 3 n 1/(β 1) = d
38 2.2 Chung-Lu model This model is specified by a collection of weights w =(w 1,...,w n ) that represent the expected degree sequence. The probability of an edge between i to is w i w / k w k. They allow
More informationRandom Geometric Graphs
Random Geometric Graphs Mathew D. Penrose University of Bath, UK Networks: stochastic models for populations and epidemics ICMS, Edinburgh September 2011 1 MODELS of RANDOM GRAPHS Erdos-Renyi G(n, p):
More informationarxiv:cond-mat/ v2 [cond-mat.stat-mech] 3 Oct 2005
Growing Directed Networks: Organization and Dynamics arxiv:cond-mat/0408391v2 [cond-mat.stat-mech] 3 Oct 2005 Baosheng Yuan, 1 Kan Chen, 1 and Bing-Hong Wang 1,2 1 Department of Computational cience, Faculty
More informationInput-State Incidence Matrix of Boolean Control Networks and Its Applications
Input-State Incidence Matrix of Boolean Control Networks and Its Applications Yin Zhao, Hongsheng Qi, Daizhan Cheng The Key Laboratory of Systems & Control Institute of Systems Science, Academy of Mathematics
More informationRandomized Algorithms III Min Cut
Chapter 11 Randomized Algorithms III Min Cut CS 57: Algorithms, Fall 01 October 1, 01 11.1 Min Cut 11.1.1 Problem Definition 11. Min cut 11..0.1 Min cut G = V, E): undirected graph, n vertices, m edges.
More informationA simple branching process approach to the phase transition in G n,p
A simple branching process approach to the phase transition in G n,p Béla Bollobás Department of Pure Mathematics and Mathematical Statistics Wilberforce Road, Cambridge CB3 0WB, UK b.bollobas@dpmms.cam.ac.uk
More informationBootstrap Percolation on Periodic Trees
Bootstrap Percolation on Periodic Trees Milan Bradonjić Iraj Saniee Abstract We study bootstrap percolation with the threshold parameter θ 2 and the initial probability p on infinite periodic trees that
More informationInduced subgraphs of prescribed size
Induced subgraphs of prescribed size Noga Alon Michael Krivelevich Benny Sudakov Abstract A subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(g denote the maximum
More informationUPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES
Applied Probability Trust 7 May 22 UPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES HAMED AMINI, AND MARC LELARGE, ENS-INRIA Abstract Upper deviation results are obtained for the split time of a
More informationLecture 06 01/31/ Proofs for emergence of giant component
M375T/M396C: Topics in Complex Networks Spring 2013 Lecture 06 01/31/13 Lecturer: Ravi Srinivasan Scribe: Tianran Geng 6.1 Proofs for emergence of giant component We now sketch the main ideas underlying
More informationAlgorithms Reading Group Notes: Provable Bounds for Learning Deep Representations
Algorithms Reading Group Notes: Provable Bounds for Learning Deep Representations Joshua R. Wang November 1, 2016 1 Model and Results Continuing from last week, we again examine provable algorithms for
More informationPERCOLATION IN SELFISH SOCIAL NETWORKS
PERCOLATION IN SELFISH SOCIAL NETWORKS Charles Bordenave UC Berkeley joint work with David Aldous (UC Berkeley) PARADIGM OF SOCIAL NETWORKS OBJECTIVE - Understand better the dynamics of social behaviors
More informationWeek Cuts, Branch & Bound, and Lagrangean Relaxation
Week 11 1 Integer Linear Programming This week we will discuss solution methods for solving integer linear programming problems. I will skip the part on complexity theory, Section 11.8, although this is
More information1 Mechanistic and generative models of network structure
1 Mechanistic and generative models of network structure There are many models of network structure, and these largely can be divided into two classes: mechanistic models and generative or probabilistic
More informationarxiv: v1 [math.pr] 1 Jan 2013
Stochastic spatial model of producer-consumer systems on the lattice arxiv:1301.0119v1 [math.pr] 1 Jan 2013 1. Introduction N. Lanchier Abstract The objective of this paper is to give a rigorous analysis
More informationBiological Networks: Comparison, Conservation, and Evolution via Relative Description Length By: Tamir Tuller & Benny Chor
Biological Networks:,, and via Relative Description Length By: Tamir Tuller & Benny Chor Presented by: Noga Grebla Content of the presentation Presenting the goals of the research Reviewing basic terms
More informationControlling chaos in random Boolean networks
EUROPHYSICS LETTERS 20 March 1997 Europhys. Lett., 37 (9), pp. 597-602 (1997) Controlling chaos in random Boolean networks B. Luque and R. V. Solé Complex Systems Research Group, Departament de Fisica
More informationSimulation of Gene Regulatory Networks
Simulation of Gene Regulatory Networks Overview I have been assisting Professor Jacques Cohen at Brandeis University to explore and compare the the many available representations and interpretations of
More informationLecture 16 Symbolic dynamics.
Lecture 16 Symbolic dynamics. 1 Symbolic dynamics. The full shift on two letters and the Baker s transformation. 2 Shifts of finite type. 3 Directed multigraphs. 4 The zeta function. 5 Topological entropy.
More informationMonomial Dynamical Systems over Finite Fields
Monomial Dynamical Systems over Finite Fields Omar Colón-Reyes Mathematics Department, University of Puerto Rico at Mayagüez, Mayagüez, PR 00681 Abdul Salam Jarrah Reinhard Laubenbacher Virginia Bioinformatics
More informationSome rigorous results for the stacked contact process
ALEA, Lat. Am. J.Probab. Math. Stat. 13 (1), 193 222(2016) Some rigorous results for the stacked contact process Nicolas Lanchier and Yuan Zhang School of Mathematical and Statistical Sciences, Arizona
More informationRandom Geometric Graphs
Random Geometric Graphs Mathew D. Penrose University of Bath, UK SAMBa Symposium (Talk 2) University of Bath November 2014 1 MODELS of RANDOM GRAPHS Erdos-Renyi G(n, p): start with the complete n-graph,
More informationFinite rooted tree. Each vertex v defines a subtree rooted at v. Picking v at random (uniformly) gives the random fringe subtree.
Finite rooted tree. Each vertex v defines a subtree rooted at v. Picking v at random (uniformly) gives the random fringe subtree. 1 T = { finite rooted trees }, countable set. T n : random tree, size n.
More informationACO Comprehensive Exam October 14 and 15, 2013
1. Computability, Complexity and Algorithms (a) Let G be the complete graph on n vertices, and let c : V (G) V (G) [0, ) be a symmetric cost function. Consider the following closest point heuristic for
More informationAncestor Problem for Branching Trees
Mathematics Newsletter: Special Issue Commemorating ICM in India Vol. 9, Sp. No., August, pp. Ancestor Problem for Branching Trees K. B. Athreya Abstract Let T be a branching tree generated by a probability
More informationA New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter
A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter Richard J. La and Maya Kabkab Abstract We introduce a new random graph model. In our model, n, n 2, vertices choose a subset
More informationRATE-OPTIMAL GRAPHON ESTIMATION. By Chao Gao, Yu Lu and Harrison H. Zhou Yale University
Submitted to the Annals of Statistics arxiv: arxiv:0000.0000 RATE-OPTIMAL GRAPHON ESTIMATION By Chao Gao, Yu Lu and Harrison H. Zhou Yale University Network analysis is becoming one of the most active
More informationChapter 11. Min Cut Min Cut Problem Definition Some Definitions. By Sariel Har-Peled, December 10, Version: 1.
Chapter 11 Min Cut By Sariel Har-Peled, December 10, 013 1 Version: 1.0 I built on the sand And it tumbled down, I built on a rock And it tumbled down. Now when I build, I shall begin With the smoke from
More informationModern Discrete Probability Branching processes
Modern Discrete Probability IV - Branching processes Review Sébastien Roch UW Madison Mathematics November 15, 2014 1 Basic definitions 2 3 4 Galton-Watson branching processes I Definition A Galton-Watson
More informationRandom Graphs. EECS 126 (UC Berkeley) Spring 2019
Random Graphs EECS 126 (UC Bereley) Spring 2019 1 Introduction In this note, we will briefly introduce the subject of random graphs, also nown as Erdös-Rényi random graphs. Given a positive integer n and
More informationNodal lines of random waves Many questions and few answers. M. Sodin (Tel Aviv) Ascona, May 2010
Nodal lines of random waves Many questions and few answers M. Sodin (Tel Aviv) Ascona, May 2010 1 Random 2D wave: random superposition of solutions to Examples: f + κ 2 f = 0 Random spherical harmonic
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationarxiv: v1 [math.pr] 1 Jan 2013
The role of dispersal in interacting patches subject to an Allee effect arxiv:1301.0125v1 [math.pr] 1 Jan 2013 1. Introduction N. Lanchier Abstract This article is concerned with a stochastic multi-patch
More informationSolution Set for Homework #1
CS 683 Spring 07 Learning, Games, and Electronic Markets Solution Set for Homework #1 1. Suppose x and y are real numbers and x > y. Prove that e x > ex e y x y > e y. Solution: Let f(s = e s. By the mean
More informationLecture 2: Review of Basic Probability Theory
ECE 830 Fall 2010 Statistical Signal Processing instructor: R. Nowak, scribe: R. Nowak Lecture 2: Review of Basic Probability Theory Probabilistic models will be used throughout the course to represent
More informationLatent Voter Model on Locally Tree-Like Random Graphs
Latent Voter Model on Locally Tree-Like Random Graphs Ran Huo and Rick Durrett Dept. of Math, Duke U., P.O. Box 932, Durham, NC 2778-32 March 11, 217 Abstract In the latent voter model, which models the
More informationLecture 2: Minimax theorem, Impagliazzo Hard Core Lemma
Lecture 2: Minimax theorem, Impagliazzo Hard Core Lemma Topics in Pseudorandomness and Complexity Theory (Spring 207) Rutgers University Swastik Kopparty Scribe: Cole Franks Zero-sum games are two player
More informationThe Algorithmic Aspects of the Regularity Lemma
The Algorithmic Aspects of the Regularity Lemma N. Alon R. A. Duke H. Lefmann V. Rödl R. Yuster Abstract The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in
More informationQuasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets Raphael Yuster 1 Department of Mathematics, University of Haifa, Haifa, Israel raphy@math.haifa.ac.il
More informationCoupling. 2/3/2010 and 2/5/2010
Coupling 2/3/2010 and 2/5/2010 1 Introduction Consider the move to middle shuffle where a card from the top is placed uniformly at random at a position in the deck. It is easy to see that this Markov Chain
More informationLearning Large-Alphabet and Analog Circuits with Value Injection Queries
Learning Large-Alphabet and Analog Circuits with Value Injection Queries Dana Angluin 1 James Aspnes 1, Jiang Chen 2, Lev Reyzin 1,, 1 Computer Science Department, Yale University {angluin,aspnes}@cs.yale.edu,
More informationarxiv: v1 [q-bio.mn] 7 Nov 2018
Role of self-loop in cell-cycle network of budding yeast Shu-ichi Kinoshita a, Hiroaki S. Yamada b a Department of Mathematical Engineering, Faculty of Engeneering, Musashino University, -- Ariake Koutou-ku,
More information1 Exercises for lecture 1
1 Exercises for lecture 1 Exercise 1 a) Show that if F is symmetric with respect to µ, and E( X )
More information< k 2n. 2 1 (n 2). + (1 p) s) N (n < 1
List of Problems jacques@ucsd.edu Those question with a star next to them are considered slightly more challenging. Problems 9, 11, and 19 from the book The probabilistic method, by Alon and Spencer. Question
More informationEvolutionary dynamics on graphs
Evolutionary dynamics on graphs Laura Hindersin May 4th 2015 Max-Planck-Institut für Evolutionsbiologie, Plön Evolutionary dynamics Main ingredients: Fitness: The ability to survive and reproduce. Selection
More informationComponent structure of the vacant set induced by a random walk on a random graph. Colin Cooper (KCL) Alan Frieze (CMU)
Component structure of the vacant set induced by a random walk on a random graph Colin Cooper (KCL) Alan Frieze (CMU) Vacant set definition and results Introduction: random walks and cover time G n,p vacant
More informationNotes 1 : Measure-theoretic foundations I
Notes 1 : Measure-theoretic foundations I Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Wil91, Section 1.0-1.8, 2.1-2.3, 3.1-3.11], [Fel68, Sections 7.2, 8.1, 9.6], [Dur10,
More informationIntroduction to Empirical Processes and Semiparametric Inference Lecture 12: Glivenko-Cantelli and Donsker Results
Introduction to Empirical Processes and Semiparametric Inference Lecture 12: Glivenko-Cantelli and Donsker Results Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics
More informationRandom Graphs. 7.1 Introduction
7 Random Graphs 7.1 Introduction The theory of random graphs began in the late 1950s with the seminal paper by Erdös and Rényi [?]. In contrast to percolation theory, which emerged from efforts to model
More informationU.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018
U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018 Lecture 3 In which we show how to find a planted clique in a random graph. 1 Finding a Planted Clique We will analyze
More informationAPPROXIMATING CONTINUOUS FUNCTIONS: WEIERSTRASS, BERNSTEIN, AND RUNGE
APPROXIMATING CONTINUOUS FUNCTIONS: WEIERSTRASS, BERNSTEIN, AND RUNGE WILLIE WAI-YEUNG WONG. Introduction This set of notes is meant to describe some aspects of polynomial approximations to continuous
More informationThe number of edge colorings with no monochromatic cliques
The number of edge colorings with no monochromatic cliques Noga Alon József Balogh Peter Keevash Benny Sudaov Abstract Let F n, r, ) denote the maximum possible number of distinct edge-colorings of a simple
More informationDuality of LPs and Applications
Lecture 6 Duality of LPs and Applications Last lecture we introduced duality of linear programs. We saw how to form duals, and proved both the weak and strong duality theorems. In this lecture we will
More informationCounting independent sets of a fixed size in graphs with a given minimum degree
Counting independent sets of a fixed size in graphs with a given minimum degree John Engbers David Galvin April 4, 01 Abstract Galvin showed that for all fixed δ and sufficiently large n, the n-vertex
More informationTHE SZEMERÉDI REGULARITY LEMMA AND ITS APPLICATION
THE SZEMERÉDI REGULARITY LEMMA AND ITS APPLICATION YAQIAO LI In this note we will prove Szemerédi s regularity lemma, and its application in proving the triangle removal lemma and the Roth s theorem on
More informationDiscrete (and Continuous) Optimization WI4 131
Discrete (and Continuous) Optimization WI4 131 Kees Roos Technische Universiteit Delft Faculteit Electrotechniek, Wiskunde en Informatica Afdeling Informatie, Systemen en Algoritmiek e-mail: C.Roos@ewi.tudelft.nl
More informationA TWO-SPECIES COMPETITION MODEL ON Z D
A TWO-SPECIES COMPETITION MODEL ON Z D GEORGE KORDZAKHIA AND STEVEN P. LALLEY Abstract. We consider a two-type stochastic competition model on the integer lattice Z d. The model describes the space evolution
More informationChaotic Dynamics in an Electronic Model of a Genetic Network
Journal of Statistical Physics, Vol. 121, Nos. 5/6, December 2005 ( 2005) DOI: 10.1007/s10955-005-7009-y Chaotic Dynamics in an Electronic Model of a Genetic Network Leon Glass, 1 Theodore J. Perkins,
More informationHow many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected?
How many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected? Michael Anastos and Alan Frieze February 1, 2018 Abstract In this paper we study the randomly
More informationSynchronous state transition graph
Heike Siebert, FU Berlin, Molecular Networks WS10/11 2-1 Synchronous state transition graph (0, 2) (1, 2) vertex set X (state space) edges (x,f(x)) every state has only one successor attractors are fixed
More informationResistance Growth of Branching Random Networks
Peking University Oct.25, 2018, Chengdu Joint work with Yueyun Hu (U. Paris 13) and Shen Lin (U. Paris 6), supported by NSFC Grant No. 11528101 (2016-2017) for Research Cooperation with Oversea Investigators
More informationNetwork Science: Principles and Applications
Network Science: Principles and Applications CS 695 - Fall 2016 Amarda Shehu,Fei Li [amarda, lifei](at)gmu.edu Department of Computer Science George Mason University 1 Outline of Today s Class 2 Robustness
More informationFerromagnetic Ising models
Stat 36 Stochastic Processes on Graphs Ferromagnetic Ising models Amir Dembo Lecture 3-4 - 0/5/2007 Introduction By ferromagnetic Ising models we mean the study of the large-n behavior of the measures
More informationA Parametric Simplex Algorithm for Linear Vector Optimization Problems
A Parametric Simplex Algorithm for Linear Vector Optimization Problems Birgit Rudloff Firdevs Ulus Robert Vanderbei July 9, 2015 Abstract In this paper, a parametric simplex algorithm for solving linear
More informationAttractor period distribution for critical Boolean networks
Attractor period distribution for critical Boolean networks Florian Greil Institut für Festkörperphysik, Technische Universität Darmstadt, D-64285 Darmstadt, Germany current address: Lehrstuhl für Bioinformatik,
More informationStochastic domination in space-time for the supercritical contact process
Stochastic domination in space-time for the supercritical contact process Stein Andreas Bethuelsen joint work with Rob van den Berg (CWI and VU Amsterdam) Workshop on Genealogies of Interacting Particle
More informationExpansion and Isoperimetric Constants for Product Graphs
Expansion and Isoperimetric Constants for Product Graphs C. Houdré and T. Stoyanov May 4, 2004 Abstract Vertex and edge isoperimetric constants of graphs are studied. Using a functional-analytic approach,
More information1 Primals and Duals: Zero Sum Games
CS 124 Section #11 Zero Sum Games; NP Completeness 4/15/17 1 Primals and Duals: Zero Sum Games We can represent various situations of conflict in life in terms of matrix games. For example, the game shown
More informationBranching. Teppo Niinimäki. Helsinki October 14, 2011 Seminar: Exact Exponential Algorithms UNIVERSITY OF HELSINKI Department of Computer Science
Branching Teppo Niinimäki Helsinki October 14, 2011 Seminar: Exact Exponential Algorithms UNIVERSITY OF HELSINKI Department of Computer Science 1 For a large number of important computational problems
More informationFIRST ORDER SENTENCES ON G(n, p), ZERO-ONE LAWS, ALMOST SURE AND COMPLETE THEORIES ON SPARSE RANDOM GRAPHS
FIRST ORDER SENTENCES ON G(n, p), ZERO-ONE LAWS, ALMOST SURE AND COMPLETE THEORIES ON SPARSE RANDOM GRAPHS MOUMANTI PODDER 1. First order theory on G(n, p) We start with a very simple property of G(n,
More informationUniqueness of the critical probability for percolation in the two dimensional Sierpiński carpet lattice
Uniqueness of the critical probability for percolation in the two dimensional Sierpiński carpet lattice Yasunari Higuchi 1, Xian-Yuan Wu 2, 1 Department of Mathematics, Faculty of Science, Kobe University,
More informationPhase transition of Boolean networks with partially nested canalizing functions
University of Nebrasa at Omaha DigitalCommons@UNO Mathematics Faculty Publications Department of Mathematics 7-3 Phase transition of Boolean networs with partially nested canalizing functions Kayse Jansen
More informationEvolutionary Dynamics on Graphs
Evolutionary Dynamics on Graphs Leslie Ann Goldberg, University of Oxford Absorption Time of the Moran Process (2014) with Josep Díaz, David Richerby and Maria Serna Approximating Fixation Probabilities
More informationNetworks. Can (John) Bruce Keck Founda7on Biotechnology Lab Bioinforma7cs Resource
Networks Can (John) Bruce Keck Founda7on Biotechnology Lab Bioinforma7cs Resource Networks in biology Protein-Protein Interaction Network of Yeast Transcriptional regulatory network of E.coli Experimental
More informationEdge-disjoint induced subgraphs with given minimum degree
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster Department of Mathematics University of Haifa Haifa 31905, Israel raphy@math.haifa.ac.il Submitted: Nov 9, 01; Accepted: Feb 5,
More information1 Homework. Recommended Reading:
Analysis MT43C Notes/Problems/Homework Recommended Reading: R. G. Bartle, D. R. Sherbert Introduction to real analysis, principal reference M. Spivak Calculus W. Rudin Principles of mathematical analysis
More informationIndependence numbers of locally sparse graphs and a Ramsey type problem
Independence numbers of locally sparse graphs and a Ramsey type problem Noga Alon Abstract Let G = (V, E) be a graph on n vertices with average degree t 1 in which for every vertex v V the induced subgraph
More informationLecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past.
1 Markov chain: definition Lecture 5 Definition 1.1 Markov chain] A sequence of random variables (X n ) n 0 taking values in a measurable state space (S, S) is called a (discrete time) Markov chain, if
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationCoupled Random Boolean Network Forming an Artificial Tissue
Coupled Random Boolean Network Forming an Artificial Tissue M. Villani, R. Serra, P.Ingrami, and S.A. Kauffman 2 DSSC, University of Modena and Reggio Emilia, via Allegri 9, I-4200 Reggio Emilia villani.marco@unimore.it,
More informationChapter 3. Erdős Rényi random graphs
Chapter Erdős Rényi random graphs 2 .1 Definitions Fix n, considerthe set V = {1,2,...,n} =: [n], andput N := ( n 2 be the numberofedgesonthe full graph K n, the edges are {e 1,e 2,...,e N }. Fix also
More informationCS 6820 Fall 2014 Lectures, October 3-20, 2014
Analysis of Algorithms Linear Programming Notes CS 6820 Fall 2014 Lectures, October 3-20, 2014 1 Linear programming The linear programming (LP) problem is the following optimization problem. We are given
More informationarxiv: v1 [math.pr] 25 Jul 2013
Survival and extinction results for a patch model with sexual reproduction arxiv:1307.6618v1 [math.pr] 25 Jul 2013 1. Introduction N. Lanchier Abstract This article is concerned with a version of the contact
More informationSublinear-Time Algorithms
Lecture 20 Sublinear-Time Algorithms Supplemental reading in CLRS: None If we settle for approximations, we can sometimes get much more efficient algorithms In Lecture 8, we saw polynomial-time approximations
More information5.3 METABOLIC NETWORKS 193. P (x i P a (x i )) (5.30) i=1
5.3 METABOLIC NETWORKS 193 5.3 Metabolic Networks 5.4 Bayesian Networks Let G = (V, E) be a directed acyclic graph. We assume that the vertices i V (1 i n) represent for example genes and correspond to
More informationORIE 6334 Spectral Graph Theory November 22, Lecture 25
ORIE 64 Spectral Graph Theory November 22, 206 Lecture 25 Lecturer: David P. Williamson Scribe: Pu Yang In the remaining three lectures, we will cover a prominent result by Arora, Rao, and Vazirani for
More informationthe neumann-cheeger constant of the jungle gym
the neumann-cheeger constant of the jungle gym Itai Benjamini Isaac Chavel Edgar A. Feldman Our jungle gyms are dimensional differentiable manifolds M, with preferred Riemannian metrics, associated to
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationSelf Similar (Scale Free, Power Law) Networks (I)
Self Similar (Scale Free, Power Law) Networks (I) E6083: lecture 4 Prof. Predrag R. Jelenković Dept. of Electrical Engineering Columbia University, NY 10027, USA {predrag}@ee.columbia.edu February 7, 2007
More information1 The Observability Canonical Form
NONLINEAR OBSERVERS AND SEPARATION PRINCIPLE 1 The Observability Canonical Form In this Chapter we discuss the design of observers for nonlinear systems modelled by equations of the form ẋ = f(x, u) (1)
More information