Approximation and Inapproximation for The Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model
|
|
- Antony Gaines
- 5 years ago
- Views:
Transcription
1 20 3st Intrnational Confrnc on Distributd Computing Systms Workshops Approximation and Inapproximation for Th Influnc Maximization Problm in Social Ntworks undr Dtrministic Linar Thrshold Modl Zaixin Lu, Wi Zhang, Wili Wu, Bin Fu and Dingzhu Du Computr Scinc Dpartmnt Univrsity of Txas at Dallas, Richardson, USA Math Dpartmnt Xi an Jiaotong Univrsity, Xi an, PRC Computr Scinc Dpartmnt Univrsity of Txas-Pan Amrican, Edinburg, USA Abstract Influnc Maximization is th problm of finding a crtain amount of popl in a social ntwork such that thir aggrgation influnc through th ntwork is maximizd. In th past this problm has bn widly studid undr a numbr of diffrnt modls. In 2003, Kmp t al. gav a ( )- approximation algorithm for th linar thrshold modl and th indpndnt cascad modl, which ar th two main modls in th social ntwork analysis. In addition, Chn t al. provd that th problm of xactly computing th influnc givn a sd st in th two modls is #P-hard. Both th linar thrshold modl and th indpndnt cascad modl ar basd on randomizd propagation. Howvr such information might b obtaind by survys or data mining tchniqus, which maks grat diffrnc on th proprtis of th problm. In this papr, w study th Influnc Maximization problm in th dtrministic linar thrshold modl. As a contrast, w show that in th dtrministic linar thrshold modl, thr is no polynomial tim n ɛ -approximation unlss P=NP vn at th simpl cas that on prson nds at most two activ nighbors to bcom activ. This inapproximability rsult is drivd with slf-containd proofs without using PCP thorm. In th cas that a prson can b activatd whn on of its nighbors bcom activ, thr is a polynomial tim -approximation, and w prov it is th bst possibl approximation undr a rasonabl assumption in th complxity thory, NP DT IME(n log log n ). W also show that th xact computation of th final influnc givn a sd st can b solvd in linar tim in th dtrministic linar thrshold modl. Th Last Sd St problm, which aims to find a sd st with last numbr of popl to activat all th rquird popl in a givn social ntwork, is discussd. Using an analysis framwork basd on St Covr, w show a O(logn)- approximation in th cas that a popl bcom activ whn on of its nighbors is activatd. Kywords-influnc maximization; social ntwork; approximation; dtrministic modl; I. INTRODUCTION A social ntwork is a graph of rlationships (dgs) and individuals (nods). On of th issus usually considrd by markting managrs in this fild is how to maximiz th sprad of information through a social ntwork. For instanc, in ordr to promot a nw product, on can giv a fw influntial popl fr sampls of th product. Probably thos popl will rcommnd th product to thir frinds and many individuals will ultimatly try it through such wordof-mouth ffct. Th Influnc Maximization (IM) problm is how to slct th fw initial popl as sd st, such that th sprad of influnc can b maximizd. In ordr to study th complxity of th this problm, w first hav to gt about anothr problm, that is how to comput th total influnc givn a sd st. Plas s [], [2], [9] for rcnt works. Th nod slction problm w just mntiond was first proposd by Domingos and Richardson in [4] and [8] rspctivly. Thy considrd th rlations of individuals and proposd a probabilistic propagation modl for this problm. Kmp t al. in [6], [7] furthr formulatd it into an optimization problm and studid it on two diffrnt modls: th indpndnt cascad modl proposd by Goldnbrg t al. in [5], [2] and th linar thrshold modl proposd by Granovttr and Schlling in [0] and [] sparatly. Kmp t al. provd th natural grdy algorithm achivs a ( )-approximation simply by showing that th influnc sprads undr both th two modls ar submodular. Thraftr, Chn t al. in [], [2] showd that th problm of xactly computing th influnc givn a sd st in both th indpndnt cascad modl and th linar thrshold modl ar #P-hard, which indicats that th grdy algorithm is not a polynomial tim approximation for th two modls. In th indpndnt cascad modl, th propagation procdur is basd on a probabilistic way; individuals can succssfully activat thir nighbors with crtain probabilitis. In th linar thrshold modl, th propagation procdur is in a thrshold mannr; th influnc from an individual v i to anothr individual v j is prsntd by a wight w i,j and an individual can b activatd whn th sum of influncs it rcivs xcds a randomly dtrmind thrshold. It is / $ IEEE DOI 0.09/ICDCSW
2 worthy to mntion that th thrsholds in th linar thrshold modl ar randomly updatd during th sprad procss. Thrfor, it can b sn that both th linar thrshold modl and th indpndnt cascad modl ar basd on randomizd propagation. Howvr th thrsholds might b stimatd by survys and data mining tchniqus. If an individual can b activatd whn th sum of influncs xcds a prdtrmind thrshold, w say th propagation procdur is basd on th dtrministic linar thrshold modl. In this papr, w focus on studying th approximation and inapproximation for th Influnc Maximization problm in th dtrministic linar thrshold modl. Th main contribution of this papr includs: ) W show that in th dtrministic linar thrshold modl, thr is no polynomial tim n ɛ -approximation for th IM problm unlss P=NP vn in th simpl cas that a prson nds at most two activ nighbors to bcom activ. 2) W also show that th problm of xactly computing th influnc givn a sd st in this modl can b solvd in linar tim. 3) In th cas that a prson can b activatd aftr on of its nighbors bcoms activ, thr is a polynomial tim -approximation. 4) Th Last Sd St (LSS) problm, which is a variation of th IM problm, is discussd. It aims at finding a sd st with last numbr of popl such that all th popl of intrst in th social ntwork can b finally activatd. W giv a O(logn)-approximation for th cas that a nod can b activatd by anyon of its nighbors. Th rst of this papr is organizd as follows. In sction II, w prsnt a linar tim xact algorithm to comput th influnc sprad for a sd st. In sction III, w study th IM problm in th cas that a popl can b activatd by anyon of its nighbors. An inapproximation rsult for th cas that a prson nds two activ nighbors to bcom activ is providd in sction IV. In sction V, w show th approximation and inapproximation for a spcial cas of th LSS problm. In sction VI, w conclud our papr and discuss th futur work. II. COMPUTING THE INFLUENCE SPREAD IN THE DETERMINISTIC LINEAR THRESHOLD MODEL For th linar thrshold modl and th indpndnt cascadd modl, th problm of computing th influnc sprad givn a sd st was lft as an opn problm in [6]. Chn t al. closd this opn problm by showing its #P-hardnss in [], [2]. Dfinition. A social ntwork is a dirctd graph G(V, E), ach nod v i in V with a thrshold t i rprsnts a prson in th social ntwork, ach dirctd dg (v i, v j ) has wight w i,j that dnots how much th nod v j is influncd by th nod v i. In th dtrministic linar thrshold modl, th propagation procss has th following provisions: ) Lt x j = dnot v j is activ, and x j = 0 dnot v j is not. 2) At any tim, v i bcoms activ if and only if v j nighour(v i) (x j w j,i ) t i. 3) Th diffusion is a stp by stp procss: in stp t, all nods that wr activ in stp t rmain activ, and any nod v satisfis th activ condition will b activatd. Dfinition 2. Givn a social ntwork G(V, E) and a sd st A of initially activ nods, th Influnc Computation problm is to find all th nods that will b activatd dirctly or indirctly by th nods in A. In th nxt, w show that this problm in th dtrministic linar thrshold modl can b solvd in linar tim. A. A Linar Tim Algorithm Thorm. Givn a social ntwork G(V, E) and a sd st A, th problm of xactly computing th influnc sprad can b solvd in linar tim in th dtrministic linar thrshold modl. Algorithm Influnc Computing : Input: A dirctd graph G(V, E), a thrshold t i for ach nod v i V, a wight w i,j for ach dg (v i, v j ) E and a sd st A V. 2: Output: th st of all nods that will b activatd in th ntwork. 3: For ach nod v i in V, lt H i 0; (H i holds th sum of influncs for v i.) 4: Mark all th nods in A as nwly activatd nods; 5: rpat 6: for Each nwly activatd nod v j do 7: for Each its non activ nighbor v k do 8: Lt H k H k + w j,k ; 9: if H k t k thn 0: Mark v k as nwly activatd; : nd if 2: Mark v j as activ nod; (Not that activ nod nwly activatd nod.) 3: nd for 4: nd for 5: until Thr is no nwly activatd nods Proof: Th tim complxity asily follow from th Alg.. It trminats whn thr ar no nwly activatd nods. Each dg in E has only on chanc to b usd to adjust its nighbors. Assum th input dirctd graph G dos not hav isolatd nods, which mans that E V. Hnc th Alg. has tim complxity O( E ). B. A Lowr Bound for Computing th Influnc Sprad Thorm 2. For any α [0, ], thr is a class of graphs G(V, E) with E = Θ(n +α ) such that vry algorithm that 65 6
3 V n n n Figur. V 2 ( + α)-bipartit Graph xactly computs th final activatd nods givn an initial sd st nds at last Ω( E ) running tim, whr n = V 2. Proof: W can dsign a graph G(V, V 2, E) as shown in Fig., whr V = V 2 = n. Lt th in-dgr of ach nod in V 2 b n α, whr α [0, ]. Thrfor w allow a constant factor dgr diffrnc among th dgrs of nods in V 2. It is asy to s th xistnc of this kind of graphs and w call thm ( + α)-graph. Assum that thr xists an o( E ) tim algorithm h(.) to find th st of activatd nods from an initial st of activ nods. Lt G b a ( + α)-graph such that for ach dg (v i, v j ), it has wight w i,j = dgr(v. Th thrshold t j) j = for all nods v j in G. Assum th sd st is th st of all th nods in V. Sinc h(.) runs in o( E ) tim, thr xists an dg (v i, v j ) that th algorithm dos not accss. Lt G b th sam graph as G xcpt w i,j = 0. Sinc h(g, V ) dos not accss dg (v i, v j ), w hav h(g, V ) = h(g, V ) = V V 2, which is a contradiction. III. APPROXIMATION AND INAPPROXIMATION FOR THE ONE-ACTIVATE-ONE MODEL In this sction, w considr th IM problm undr th condition that a prson can b activatd by anyon of its nighbors. It is a spcial cas of th gnral dtrministic linar thrshold modl, in which a prson nds multipl activ nighbors with wights to b activatd. Th problm is solvd by transforming it into th maximum covrag problm. W driv a constant factor approximation that matchs th bound of th inapproximation. Th Influnc Maximization Problm undr th On- Activat-On Modl: Lt G(V, E) b a dirctd graph. Each dirctd dg (u, v) from nod u to nod v rprsnts that prson u can activat prson v. Th problm is to initially activat k popl so that th largst numbr of popl will b activatd vntually. For an approximation solution, lt Approximat(G, k) rprsnt th numbr of popl who ar vntually activatd dirctly or indirctly by th first slctd k popl and lt Optimal(G, k) rprsnt th optimal solution. Th problm has a polynomial tim approximation ratio c if and only if Approximat(G, k) can b computd in polynomial tim and Optimal(G, k) c Approximat(G, k) for vry input instanc (G and k). Th maximum covrag problm is a classical problm in th computational complxity thory. Th input is a list of m sts and an intgr k. Th targt is to slct k sts from th list to covr th largst numbr of lmnts in th ground st. It is wll known that th maximum covrag problm, such as St Covr problm, Vrtx Covr problm, and Indpndnt St problm, has a th approximation ratio is optimal. -approximation and Thorm 3. Thr is a polynomial tim -approximation algorithm for th Influnc Maximization problm in th On-Activat-On modl. Proof: Assum that w hav an input instanc (G, k) for th On-Activat-On IM problm. As shown in Alg. 2, for ach vrtx v i in G, us th dpth first sarch algorithm to find all th vrtics that ar rachabl from v i. This can b don in linar tim. Th problm bcoms a maximum covr problm. Thrfor, it has an polynomial tim approximation with. Algorithm 2 Influnc Maximization : Input: A dirctd graph G(V, E) and an intgr k. 2: Output: a st of k nods in V. 3: Lt H dnot th st of activ nods and P dnot th initial st. 4: for ach nod v i V, which has no incoming dgs do 5: Lt S vi rprsnt th st of nods rachabl from v i. 6: nd for 7: for j to k do 8: Slct th st S vi that maximiz H S vi 9: H H S vi and P P {v i }. 0: nd for Thorm 4. If th Influnc Maximization problm in th On-Activat-On modl has an approximation algorithm with approximation ratio d, thn th maximum covrag problm has an approximation with ratio d + o(). Proof: Assum S,, S m is a list of sts for th maximum covrag problm. W ar going to construct a dirctd graph G(V, E). Assum S S 2 S m = {a,, a n }. For ach st S i, crat a vrtx v i in V. For ach a j, crat hk 2 vrtics u j,,, u j,t in V, whr t = hk 2 and h is a larg constant. If a j S i, add dirctd dgs from v i to all u j,,, u j,t in E. W claim that an optimal solution for th maximum covrag problm can covr x o lmnts by slcting k sts if and only if th On-Activat-On IM problm can activat x o t + k popl by initially activating k popl. Lt a d-approximation solution for th IM problm to activat yt+k popl. W hav x o t+k d(yt+k). W can assum y ; othrwis, all sts S,, S m ar mpty. W also assum k ; othrwis, th problm is trivial. Thus, 66 62
4 x o dyt + (d )k, t () (d )k dy +, t (2) (d )k (d + )y, ty (3) (d ) (d + )y, h (4) (d + o())y. (h is larg) (5) Hnc, if th On-Activat-On IM problm has d- approximation, w can also hav an d o() approximation for th maximum covrag problm. Corollary. Thr is no polynomial tim ( o())- approximation for th On-Activat-On Influnc Maximization problm unlss NP DT IME(n log log n ). Proof: It simply follows from th Thm. 4 and Fig t al. s papr [3]. IV. INAPPROXIMATION FOR THE TWO-ACTIVATE-ONE MODEL In this sction, w study a mor gnral IM problm that on prson can b activatd by on or two popl. W driv a strong inapproximation rsult for this problm vn in boundd dgr graphs. To show th inapproximation, w rduc th St Covr problm to th IM problm in polynomial tim. Th input of a St Covr problm is an intgr k, and many sts S,, S m and S, whr S,, S m ar m substs of st S. Th targt is to find k substs S i,, S ik such that S i S ik = S. It is wll known that th St Covr problm is NP-hard. A. Boundd Dgr Graphs Dfinition 3. A graph G is a dirctd boundd (d, d 2 )- graph if vry nod in G has at most d incoming dgs and at most d 2 outgoing dgs. Th IM problm ovr such a dirctd graph is calld (d, d 2 )-Influnc Maximization ((d, d 2 )-IM) problm. Lmma. Assum that w,, w n ar nods with at most on incoming dg, and x is an isolatd nod. W can crat O(n) nw nods to form a (2, 2) graph such that x is activatd if and only if on of th nods in {w,, w n } is activatd. Furthrmor, x has at most on incoming dg and no outgoing dg. Proof: W can achiv th goal by finishing n phass. In th first phas, w crat a nw nod b and add an dg from w to b, and anothr dg from w 2 to b. If w or w 2 is activatd, thn b will b activatd. In th phas i +, for any < i < n, w crat a nw nod b i+, add an dg from b i to b i+ and anothr dg from w i+2 to b i+ such that b i+ will b activatd whn b i or w i+2 is activatd. W W 2 W 3 W i+ W n b b 2 Figur 2. b i- b i x On-to-On Graph W W 2 W 3 W i+ W n /2 /2 /2 b b 2 /2 /2 Figur 3. b i- /2 b i x All-to-On Graph Aftr th phas n, w add an dg from b n to x so that b n can activat x. Th total numbr of nw nods is n. Each nod b i has two incoming dgs and on outgoing dg. Nod x has on incoming dg and no outgoing dg. Th final (2, 2) graph is shown in Fig. 2, ach nod in th graph has a dtrmind thrshold. Lmma 2. Assum that w,, w n ar nods with at most on incoming dg, and x is an isolatd nod. W can crat O(n) nw nods to form a (2, 2) graph such that x is activatd if and only if w,, w n ar all activ. Furthrmor, x has at most on incoming dgs and no outgoing dg. Proof: Th ovrall argumnt is similar to th proof of Thm.. W still us n phass to construct th (2, 2) graph. In th first phas, crat b and add an dg from w to b with wight 2, and anothr dg from w 2 to b with wight 2. If both w and w 2 ar activatd, thn b will b activatd. In th phas i +, w crat nod b i+, add an dg from b i to b i+ and an dg from w i+2 to b i+. If both b i and w i+2 ar activ, thn b i+ will b activatd. Aftr phas n, w add an dg from b n to x so that b n itslf can activat x. Th total numbr of nw nods is n. Each nod b i has two incoming dgs and on outgoing dg. Nod x has on incoming dg and no outgoing dg. Th final (2, 2) graph is shown in Fig. 3, ach nod in th graph has a dtrmind thrshold. B. An Inapproximation Rsult in th Boundd Dgr Graphs Thorm 5. For any constant ɛ (0, ), thr is no polynomial tim p ɛ -approximation for th (2, 2)-IM problm /2 /2 b n- b n
5 unlss P=NP, whr p is th numbr of nods in th dirctd graph of social ntwork. Proof: W giv a polynomial tim rduction from th St Covr problm to a dirctd (2, 2) graph. Lt S,, S m b th input for th St Covr problm and S S 2 S m = {a,, a n }. Without loss of gnrality, assum ɛ < 00. Lt p b th numbr of nods in th graph, w first dfin th following paramtrs: p = (n + m) 20 ɛ, (6) g(p) = p ɛ, (7) m 5 = p 8ɛ, (8) p 8ɛ m p8ɛ, (9) n p ɛ 0, (0) k m p ɛ 0. () Th inqualitis (0) and () follow from quality (6). W construct th (2, 2) graph as follows: Phas : For ach st S i, crat a vrtx u i. Phas 2: For ach st S i with a j S i, crat a vrtx x i,j and an dg from u i to x i,j such that nod u i activats nod x i,j. If thr ar mor than two lmnts in S i, crat a binary tr with root u i such that u i activats all of thm. Phas 3: Lt H j b th st of all nods x i,j. For ach group H j, crat a vrtx y j and add som additional vrtics such that y j will b activatd if on of th nods in H j is activ. By Lmma, this part can b don in polynomial tim. Phas 4: For ach lmnt a j, crat a vrtx v j. For ach y j, crat an dg from y j to v j such that nod y j activats v j. Phas 5: For ach nod v j, crat a binary tr T j with root v j such that th tr has m 5 lavs and v j can activat all of thos lavs. W labl all th lavs as l,j,, l m5,j. Phas 6: Crat m 5 groups G,, G m5 of nods. Each group G i contains nods w i,,, w i,n. Crat an dg from l i,j to w i,j such that nod l i,j activats nod w i,j. Phas 7: For ach group G i, crat a nod x i such that x i will b activatd if and only if all lmnts w i,,, w i,n in G i ar activatd. By Lmma 2, this part can b don in linar tim for ach group G i. Phas 8: For ach x i, crat a path, which is calld Y i, starting from x i and has lngth m 8 such that vry nods in th path Y i can activat th nxt on. Lt A,7 b th st of nods cratd from Phas to Phas 7. Lt A 8 b th st of nods cratd in Phas 8. By inqualitis (6) to (), th numbr of nods in A,7 is boundd by A,7 O((n + m) 2 m 5 ) = o(p ɛ ). (2) W also hav th following quation: p = A,7 + m 5 m 8. (3) If w can slct k nods among u,, u k such that th corrsponding k substs covr th ntir st S, thn v,, v n can b activatd. Thus, all th p nods in th constructd (2, 2) graph will bcom activ. Assum that thr is a g(p)-approximation algorithm which activats nods in a st B. W claim that if B < p g(p), thn thr is no solution for th St Covr with k substs. Assum B p g(p) = p ɛ. (4) Thus, th numbr of activatd nods in th st A 8 is at last B A,7 B o(p ɛ ), (by (2)) (5) B, (by (4)) (6) 2 50km 8. (by (6) to ()) (7) W ar going to transform th first k slctd vrtics so that only th nods in u,, u m ar slctd. Th transformation follows th following ruls: ) If a slctd nod is in group G i, thn rmov this nod and th nods activatd by th nods from G i. This loss th numbr of activatd nods by at most O(n) + m 8 2m 8. Th total numbr of activatd nods lost by this rul is at most k(o(n)+m 8 ) 2km 8 sinc w slct at most k nods to start th activation. 2) For ach slctd nod, which is activatd by a nod v j, rplac it by v j. This dos not dcras th numbr of activatd nod. 3) For ach slctd nod v j, rplac it by a u i with v j S i. This dos not dcras th numbr of activatd nods. Finally, w only hav th nods in {u,, u m } to b slctd to start th procss of activation. Th total numbr of nods lost activation is at most 2km 8. By inquality (7), w hav th following quation: B A,7 50km 8 > 2km 8. (8) This implis that som nods in Phas 8 ar activatd. Thrfor, w hav a solution for th St Covr problm with k substs. V. APPROXIMATION FOR THE LEAST SEED SET PROBLEM In this sction, w considr th Last Sd St (LSS) problm in th cas that a prson can b activatd by anyon of its nighbors. This problm was proposd by Ning Chn in [3]. Last Sd St Problm in th On-Activat-On Modl: Lt G b a dirctd graph and T b a givn st 68 64
6 of nods nd to b activatd. Th LSS problm is to slct th last of nods as sd st so that all th nods in T will b activatd. Thorm 6. Thr is a polynomial tim O(log n)- approximation algorithm for th LSS problm in th On- Activat-On Modl. Proof: Th proof of Thm. 4 shows that th LSS problm can b convrtd to a St Covr problm. Thrfor, it has a polynomial tim approximation with O(log n) factor. Thorm 7. If th On-Activat-On LSS problm has an approximation algorithm with ratio d(n), thn th maximum covrag problm has an approximation algorithm with ratio d(n). Proof: Assum S,, S m is th list of sts for th St Covr problm and S S 2 S m = {a,, a n }. W can construct a social ntwork as follows. For ach st S i, crat a vrtx u i. For ach a j, crat a vrtx v j, add dirctd dgs from u i to v j if a j S i. An dg from u i to v j mans v j can b activatd by u i. Lt T b th st of vrtics {v,, v n }. Th St Covr problm is convrtd into an On-Activat- On LSS problm. It is asy to s th On-Activat-On LSS problm has a d(n)-approximation if and only if th St Covr problm has a d(n)-approximation. Corollary 2. Thr is no polynomial tim o(log n)- approximation for th LSS unlss P = NP. Proof: It follows from th Thm. 7 and th wll known inapproximability of th St Covr problm. VI. CONCLUSION AND FURTHER RESEARCH In this papr, w show that th dtrministic linar thrshold modl has no polynomial tim n ɛ -approximation unlss P=NP vn in th simpl cas that on prson nds at most two activ nighbors to bcom activ. In th cas that a prson can b activatd aftr on of its nighbors bcom activ, thr is a polynomial tim -approximation, and w prov it is th bst possibl approximation undr a rasonabl assumption in th complxity thory. W also show that thr is a O(logn)-approximation for LSS problm in th On-Activat-On modl. Th gnral IM problm in th dtrministic linar thrshold modl looks vry hard, but th Influnc Computation problm undr this modl can b solvd in linar tim. Thrfor, w can back up to som simpl cass to furthr study this problm. Th following opn problm will b considrd in our futur rsarch: ) Is thr a polynomial tim O(log n)-approximation for th LSS problm in dgr boundd graphs undr th dtrministic linar thrshold modl. 2) Is thr a polynomial tim O(log n)-approximation for th LSS problm in th linar thrshold modl and th indpndnt cascadd modl. VII. ACKNOWLEDGMENT This rsarch work is supportd in part by National Scinc Foundation of USA undr grants CNS and CCF REFERENCES [] W. Chn, Y. Yuan and L. Zhang: Scalabl Influnc Maximization in Social Ntworks undr th Linar Thrshold Modl. th 200 Intrnational Confrnc on Data Mining, 200. [2] W. Chn, C. Wang and Y. Wang: Scalabl Influnc Maximization for Prvalnt Viral Markting in Larg-scal Social Ntworks. th 200 ACM SIGKDD Confrnc on Knowldg Discovry and Data Mining, 200. [3] U. Fig:A Thrshold of ln n for Approximating St Covr. Journal of th ACM, 45: pp , 998. [4] P. Domingos and M. Richardson: Mining th Ntwork Valu of Customrs. th 200 Intrnational Confrnc on Knowldg Discovry and Data Mining, 200. [5] J. Goldnbrg, B. Libai and E. Mullr: Using Complx Systms Analysis to Advanc Markting Thory Dvlopmnt. Acadmy of Markting Scinc Rviw, 200. [6] D. Kmp, J. Klinbrg É. Tardos: Maximizing Th Sprad of Infunc Through a Social Ntwork. th 2003 Intrnational Confrnc on Knowldg Discovry and Data Mining, pp , [7] D. Kmp, J. Klinbrg and É. Tardos: Influntial Nods in a Diffusion Modl for Social Ntworks. th 2005 Intrnational Colloquium on Automata, Languags and Programming, pp , [8] M. Richardson and P. Domingos: Mining Knowldg-Sharing Sits for Viral Markting. th 2002 Intrnational Confrnc on Knowldg Discovry and Data Mining, pp. 6 70, [9] F. Zou, J. Willson, Z. Zhang and W. Wu: Fast information propagation in social ntworks. Discrt Mathmatics, Algorithm and Applications (DMAA), 200. [0] M. Granovttr: Thrshold Modls of Collctiv Bhavior. Amrican Journal of Sociology, 83(6): pp , 978. [] T. Schlling: Micromotivs and Macrobhavior. Norton, 978. [2] J. Goldnbrg, B. Libai and E. Mullr: Talk of th Ntwork: A Complx Systms Look at th Undrlying Procss of Wordof-Mouth. Markting Lttrs, 2(3): pp , 200. [3] N. Chn: On th Approximability of Influnc in Social Ntworks. th 2008 annual ACM SIAM symposium on Discrt algorithms, pp ,
Basic Polyhedral theory
Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist
More informationWeek 3: Connected Subgraphs
Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y
More informationOn spanning trees and cycles of multicolored point sets with few intersections
On spanning trs and cycls of multicolord point sts with fw intrsctions M. Kano, C. Mrino, and J. Urrutia April, 00 Abstract Lt P 1,..., P k b a collction of disjoint point sts in R in gnral position. W
More informationA Prey-Predator Model with an Alternative Food for the Predator, Harvesting of Both the Species and with A Gestation Period for Interaction
Int. J. Opn Problms Compt. Math., Vol., o., Jun 008 A Pry-Prdator Modl with an Altrnativ Food for th Prdator, Harvsting of Both th Spcis and with A Gstation Priod for Intraction K. L. arayan and. CH. P.
More informationThe Equitable Dominating Graph
Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay
More information1 Minimum Cut Problem
CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms
More informationConstruction of asymmetric orthogonal arrays of strength three via a replacement method
isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy
More informationcycle that does not cross any edges (including its own), then it has at least
W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th
More informationStrongly Connected Components
Strongly Connctd Componnts Lt G = (V, E) b a dirctd graph Writ if thr is a path from to in G Writ if and is an quivalnc rlation: implis and implis s quivalnc classs ar calld th strongly connctd componnts
More information(Upside-Down o Direct Rotation) β - Numbers
Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg
More informationCPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming
CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013
18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:
More informationHomotopy perturbation technique
Comput. Mthods Appl. Mch. Engrg. 178 (1999) 257±262 www.lsvir.com/locat/cma Homotopy prturbation tchniqu Ji-Huan H 1 Shanghai Univrsity, Shanghai Institut of Applid Mathmatics and Mchanics, Shanghai 272,
More informationPropositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018
Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs
More informationInternational Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN
Intrnational Journal of Scintific & Enginring Rsarch, Volum 6, Issu 7, July-25 64 ISSN 2229-558 HARATERISTIS OF EDGE UTSET MATRIX OF PETERSON GRAPH WITH ALGEBRAI GRAPH THEORY Dr. G. Nirmala M. Murugan
More informationSquare of Hamilton cycle in a random graph
Squar of Hamilton cycl in a random graph Andrzj Dudk Alan Friz Jun 28, 2016 Abstract W show that p = n is a sharp thrshold for th random graph G n,p to contain th squar of a Hamilton cycl. This improvs
More informationLINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM
Elctronic Journal of Diffrntial Equations, Vol. 2003(2003), No. 92, pp. 1 6. ISSN: 1072-6691. URL: http://jd.math.swt.du or http://jd.math.unt.du ftp jd.math.swt.du (login: ftp) LINEAR DELAY DIFFERENTIAL
More informationSOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH.
SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. K VASUDEVAN, K. SWATHY AND K. MANIKANDAN 1 Dpartmnt of Mathmatics, Prsidncy Collg, Chnnai-05, India. E-Mail:vasu k dvan@yahoo.com. 2,
More informationApplication of Vague Soft Sets in students evaluation
Availabl onlin at www.plagiarsarchlibrary.com Advancs in Applid Scinc Rsarch, 0, (6):48-43 ISSN: 0976-860 CODEN (USA): AASRFC Application of Vagu Soft Sts in studnts valuation B. Chtia*and P. K. Das Dpartmnt
More informationStochastic Submodular Maximization
Stochastic Submodular Maximization Arash Asadpour, Hamid Nazrzadh, and Amin Sabri Stanford Univrsity, Stanford, CA. {asadpour,hamidnz,sabri}@stanford.du Abstract. W study stochastic submodular maximization
More informationMutually Independent Hamiltonian Cycles of Pancake Networks
Mutually Indpndnt Hamiltonian Cycls of Pancak Ntworks Chng-Kuan Lin Dpartmnt of Mathmatics National Cntral Univrsity, Chung-Li, Taiwan 00, R O C discipl@ms0urlcomtw Hua-Min Huang Dpartmnt of Mathmatics
More informationNEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA
NE APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA Mirca I CÎRNU Ph Dp o Mathmatics III Faculty o Applid Scincs Univrsity Polithnica o Bucharst Cirnumirca @yahoocom Abstract In a rcnt papr [] 5 th indinit intgrals
More informationFinding low cost TSP and 2-matching solutions using certain half integer subtour vertices
Finding low cost TSP and 2-matching solutions using crtain half intgr subtour vrtics Sylvia Boyd and Robrt Carr Novmbr 996 Introduction Givn th complt graph K n = (V, E) on n nods with dg costs c R E,
More informationSection 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.
MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!
More informationSCHUR S THEOREM REU SUMMER 2005
SCHUR S THEOREM REU SUMMER 2005 1. Combinatorial aroach Prhas th first rsult in th subjct blongs to I. Schur and dats back to 1916. On of his motivation was to study th local vrsion of th famous quation
More informationTwo Products Manufacturer s Production Decisions with Carbon Constraint
Managmnt Scinc and Enginring Vol 7 No 3 pp 3-34 DOI:3968/jms9335X374 ISSN 93-34 [Print] ISSN 93-35X [Onlin] wwwcscanadant wwwcscanadaorg Two Products Manufacturr s Production Dcisions with Carbon Constraint
More informationCOMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH.
C:\Dallas\0_Courss\03A_OpSci_67\0 Cgh_Book\0_athmaticalPrliminaris\0_0 Combath.doc of 8 COPUTER GENERATED HOLOGRAS Optical Scincs 67 W.J. Dallas (onday, April 04, 005, 8:35 A) PART I: CHAPTER TWO COB ATH
More informationA Propagating Wave Packet Group Velocity Dispersion
Lctur 8 Phys 375 A Propagating Wav Packt Group Vlocity Disprsion Ovrviw and Motivation: In th last lctur w lookd at a localizd solution t) to th 1D fr-particl Schrödingr quation (SE) that corrsponds to
More informationLimiting value of higher Mahler measure
Limiting valu of highr Mahlr masur Arunabha Biswas a, Chris Monico a, a Dpartmnt of Mathmatics & Statistics, Txas Tch Univrsity, Lubbock, TX 7949, USA Abstract W considr th k-highr Mahlr masur m k P )
More informationSearching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.
3 3 4 8 6 3 3 4 8 6 3 3 4 8 6 () (d) 3 Sarching Linkd Lists Sarching Linkd Lists Sarching Linkd Lists ssum th list is sortd, but is stord in a linkd list. an w us binary sarch? omparisons? Work? What if
More informationFirst derivative analysis
Robrto s Nots on Dirntial Calculus Chaptr 8: Graphical analysis Sction First drivativ analysis What you nd to know alrady: How to us drivativs to idntiy th critical valus o a unction and its trm points
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!
More informationRecall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1
Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1
More informationHomework #3. 1 x. dx. It therefore follows that a sum of the
Danil Cannon CS 62 / Luan March 5, 2009 Homwork # 1. Th natural logarithm is dfind by ln n = n 1 dx. It thrfor follows that a sum of th 1 x sam addnd ovr th sam intrval should b both asymptotically uppr-
More informationChapter 10. The singular integral Introducing S(n) and J(n)
Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don
More informationOn the irreducibility of some polynomials in two variables
ACTA ARITHMETICA LXXXII.3 (1997) On th irrducibility of som polynomials in two variabls by B. Brindza and Á. Pintér (Dbrcn) To th mmory of Paul Erdős Lt f(x) and g(y ) b polynomials with intgral cofficints
More informationHigher order derivatives
Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of
More informationCombinatorial Networks Week 1, March 11-12
1 Nots on March 11 Combinatorial Ntwors W 1, March 11-1 11 Th Pigonhol Principl Th Pigonhol Principl If n objcts ar placd in hols, whr n >, thr xists a box with mor than on objcts 11 Thorm Givn a simpl
More informationCS 361 Meeting 12 10/3/18
CS 36 Mting 2 /3/8 Announcmnts. Homwork 4 is du Friday. If Friday is Mountain Day, homwork should b turnd in at my offic or th dpartmnt offic bfor 4. 2. Homwork 5 will b availabl ovr th wknd. 3. Our midtrm
More informationApproximating the Two-Level Facility Location Problem Via a Quasi-Greedy Approach. Jiawei Zhang. October 03, 2003
Approximating th Two-Lvl Facility Location Problm Via a Quasi-Grdy Approach Jiawi Zhang Octobr 03, 2003 Abstract W propos a quasi-grdy algorithm for approximating th classical uncapacitatd 2-lvl facility
More informationFrom Elimination to Belief Propagation
School of omputr Scinc Th lif Propagation (Sum-Product lgorithm Probabilistic Graphical Modls (10-708 Lctur 5, Sp 31, 2007 Rcptor Kinas Rcptor Kinas Kinas X 5 ric Xing Gn G T X 6 X 7 Gn H X 8 Rading: J-hap
More informationOuterplanar graphs and Delaunay triangulations
CCCG 011, Toronto ON, August 10 1, 011 Outrplanar graphs and Dlaunay triangulations Ashraful Alam Igor Rivin Ilana Strinu Abstract Ovr 0 yars ago, Dillncourt [1] showd that all outrplanar graphs can b
More informationCOHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.
MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function
More informationEinstein Equations for Tetrad Fields
Apiron, Vol 13, No, Octobr 006 6 Einstin Equations for Ttrad Filds Ali Rıza ŞAHİN, R T L Istanbul (Turky) Evry mtric tnsor can b xprssd by th innr product of ttrad filds W prov that Einstin quations for
More informationu x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula
7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting
More informationThat is, we start with a general matrix: And end with a simpler matrix:
DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit
More informationCOUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM
COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM Jim Brown Dpartmnt of Mathmatical Scincs, Clmson Univrsity, Clmson, SC 9634, USA jimlb@g.clmson.du Robrt Cass Dpartmnt of Mathmatics,
More informationDerangements and Applications
2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir
More informationSpectral Synthesis in the Heisenberg Group
Intrnational Journal of Mathmatical Analysis Vol. 13, 19, no. 1, 1-5 HIKARI Ltd, www.m-hikari.com https://doi.org/1.1988/ijma.19.81179 Spctral Synthsis in th Hisnbrg Group Yitzhak Wit Dpartmnt of Mathmatics,
More informationPROOF OF FIRST STANDARD FORM OF NONELEMENTARY FUNCTIONS
Intrnational Journal Of Advanc Rsarch In Scinc And Enginring http://www.ijars.com IJARSE, Vol. No., Issu No., Fbruary, 013 ISSN-319-8354(E) PROOF OF FIRST STANDARD FORM OF NONELEMENTARY FUNCTIONS 1 Dharmndra
More informationBifurcation Theory. , a stationary point, depends on the value of α. At certain values
Dnamic Macroconomic Thor Prof. Thomas Lux Bifurcation Thor Bifurcation: qualitativ chang in th natur of th solution occurs if a paramtr passs through a critical point bifurcation or branch valu. Local
More informationSearch sequence databases 3 10/25/2016
Sarch squnc databass 3 10/25/2016 Etrm valu distribution Ø Suppos X is a random variabl with probability dnsity function p(, w sampl a larg numbr S of indpndnt valus of X from this distribution for an
More informationMaximizing Influence in a Competitive Social Network: A Follower s Perspective
Maximizing Influnc in a Comptitiv Social Ntwork: A Followr s Prspctiv [Extndd Abstract] Tim Carns, Chandrashkhar Nagarajan, Stfan M. Wild, and Ank van Zuyln School of Oprations Rsarch and Information Enginring
More informationProblem Set 6 Solutions
6.04/18.06J Mathmatics for Computr Scinc March 15, 005 Srini Dvadas and Eric Lhman Problm St 6 Solutions Du: Monday, March 8 at 9 PM in Room 3-044 Problm 1. Sammy th Shark is a financial srvic providr
More informationAnother view for a posteriori error estimates for variational inequalities of the second kind
Accptd by Applid Numrical Mathmatics in July 2013 Anothr viw for a postriori rror stimats for variational inqualitis of th scond kind Fi Wang 1 and Wimin Han 2 Abstract. In this papr, w giv anothr viw
More informationSECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.
SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α
More informationECE602 Exam 1 April 5, You must show ALL of your work for full credit.
ECE62 Exam April 5, 27 Nam: Solution Scor: / This xam is closd-book. You must show ALL of your work for full crdit. Plas rad th qustions carfully. Plas chck your answrs carfully. Calculators may NOT b
More information10. The Discrete-Time Fourier Transform (DTFT)
Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w
More informationOn Grids in Topological Graphs
On Grids in Topological Graphs Eyal Ackrman Dpartmnt of Computr Scinc Fri Univrsität Brlin Takustr. 9, 14195 Brlin, Grmany yal@inf.fu-brlin.d Jacob Fox Dpartmnt of Mathmatics Princton Univrsity Princton,
More information1 Isoparametric Concept
UNIVERSITY OF CALIFORNIA BERKELEY Dpartmnt of Civil Enginring Spring 06 Structural Enginring, Mchanics and Matrials Profssor: S. Govindj Nots on D isoparamtric lmnts Isoparamtric Concpt Th isoparamtric
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1
More informationInapproximability Results for Combinatorial Auctions with Submodular Utility Functions
Inapproximability Rsults for Combinatorial Auctions with Submodular Utility Functions Subhash Khot Richard J. Lipton Evanglos Markakis Aranyak Mhta Abstract W considr th following allocation problm arising
More informationThe second condition says that a node α of the tree has exactly n children if the arity of its label is n.
CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is
More information22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.
Subjct Chmistry Papr No and Titl Modul No and Titl Modul Tag 8/ Physical Spctroscopy / Brakdown of th Born-Oppnhimr approximation. Slction ruls for rotational-vibrational transitions. P, R branchs. CHE_P8_M
More informationMA 262, Spring 2018, Final exam Version 01 (Green)
MA 262, Spring 218, Final xam Vrsion 1 (Grn) INSTRUCTIONS 1. Switch off your phon upon ntring th xam room. 2. Do not opn th xam booklt until you ar instructd to do so. 3. Bfor you opn th booklt, fill in
More informationCategory Theory Approach to Fusion of Wavelet-Based Features
Catgory Thory Approach to Fusion of Wavlt-Basd Faturs Scott A. DLoach Air Forc Institut of Tchnology Dpartmnt of Elctrical and Computr Enginring Wright-Pattrson AFB, Ohio 45433 Scott.DLoach@afit.af.mil
More informationINCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j)
INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS T D BROWNING AND A HAYNES Abstract W invstigat th solubility of th congrunc xy (mod ), whr is a rim and x, y ar rstrictd to li
More informationu r du = ur+1 r + 1 du = ln u + C u sin u du = cos u + C cos u du = sin u + C sec u tan u du = sec u + C e u du = e u + C
Tchniqus of Intgration c Donald Kridr and Dwight Lahr In this sction w ar going to introduc th first approachs to valuating an indfinit intgral whos intgrand dos not hav an immdiat antidrivativ. W bgin
More informationExponential inequalities and the law of the iterated logarithm in the unbounded forecasting game
Ann Inst Stat Math (01 64:615 63 DOI 101007/s10463-010-03-5 Exponntial inqualitis and th law of th itratd logarithm in th unboundd forcasting gam Shin-ichiro Takazawa Rcivd: 14 Dcmbr 009 / Rvisd: 5 Octobr
More informationMiddle East Technical University Department of Mechanical Engineering ME 413 Introduction to Finite Element Analysis
Middl East Tchnical Univrsity Dpartmnt of Mchanical Enginring ME 43 Introduction to Finit Elmnt Analysis Chaptr 3 Computr Implmntation of D FEM Ths nots ar prpard by Dr. Cünyt Srt http://www.m.mtu.du.tr/popl/cunyt
More informationEXST Regression Techniques Page 1
EXST704 - Rgrssion Tchniqus Pag 1 Masurmnt rrors in X W hav assumd that all variation is in Y. Masurmnt rror in this variabl will not ffct th rsults, as long as thy ar uncorrlatd and unbiasd, sinc thy
More informationA Simple Formula for the Hilbert Metric with Respect to a Sub-Gaussian Cone
mathmatics Articl A Simpl Formula for th Hilbrt Mtric with Rspct to a Sub-Gaussian Con Stéphan Chrétin 1, * and Juan-Pablo Ortga 2 1 National Physical Laboratory, Hampton Road, Tddinton TW11 0LW, UK 2
More informationA Sub-Optimal Log-Domain Decoding Algorithm for Non-Binary LDPC Codes
Procdings of th 9th WSEAS Intrnational Confrnc on APPLICATIONS of COMPUTER ENGINEERING A Sub-Optimal Log-Domain Dcoding Algorithm for Non-Binary LDPC Cods CHIRAG DADLANI and RANJAN BOSE Dpartmnt of Elctrical
More informationph People Grade Level: basic Duration: minutes Setting: classroom or field site
ph Popl Adaptd from: Whr Ar th Frogs? in Projct WET: Curriculum & Activity Guid. Bozman: Th Watrcours and th Council for Environmntal Education, 1995. ph Grad Lvl: basic Duration: 10 15 minuts Stting:
More informationDifferential Equations
UNIT I Diffrntial Equations.0 INTRODUCTION W li in a world of intrrlatd changing ntitis. Th locit of a falling bod changs with distanc, th position of th arth changs with tim, th ara of a circl changs
More informationRoadmap. XML Indexing. DataGuide example. DataGuides. Strong DataGuides. Multiple DataGuides for same data. CPS Topics in Database Systems
Roadmap XML Indxing CPS 296.1 Topics in Databas Systms Indx fabric Coopr t al. A Fast Indx for Smistructurd Data. VLDB, 2001 DataGuid Goldman and Widom. DataGuids: Enabling Qury Formulation and Optimization
More informationDeift/Zhou Steepest descent, Part I
Lctur 9 Dift/Zhou Stpst dscnt, Part I W now focus on th cas of orthogonal polynomials for th wight w(x) = NV (x), V (x) = t x2 2 + x4 4. Sinc th wight dpnds on th paramtr N N w will writ π n,n, a n,n,
More informationThe graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the
Copyright itutcom 005 Fr download & print from wwwitutcom Do not rproduc by othr mans Functions and graphs Powr functions Th graph of n y, for n Q (st of rational numbrs) y is a straight lin through th
More informationBackground: We have discussed the PIB, HO, and the energy of the RR model. In this chapter, the H-atom, and atomic orbitals.
Chaptr 7 Th Hydrogn Atom Background: W hav discussd th PIB HO and th nrgy of th RR modl. In this chaptr th H-atom and atomic orbitals. * A singl particl moving undr a cntral forc adoptd from Scott Kirby
More informationEquidistribution and Weyl s criterion
Euidistribution and Wyl s critrion by Brad Hannigan-Daly W introduc th ida of a sunc of numbrs bing uidistributd (mod ), and w stat and prov a thorm of Hrmann Wyl which charactrizs such suncs. W also discuss
More informationFunction Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0
unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr
More informationExam 1. It is important that you clearly show your work and mark the final answer clearly, closed book, closed notes, no calculator.
Exam N a m : _ S O L U T I O N P U I D : I n s t r u c t i o n s : It is important that you clarly show your work and mark th final answr clarly, closd book, closd nots, no calculator. T i m : h o u r
More information1 A lower bound. Lecture notes: Online bipartite matching algorithms
Cornll Univrsity, Fall 217 Lctur nots: Onlin bipartit matching algorithms CS 682: Algorithms 6 8 Spt In practic whn dsigning algorithms, it is oftn th cas that th input is a stram of data arriving ovr
More informationu 3 = u 3 (x 1, x 2, x 3 )
Lctur 23: Curvilinar Coordinats (RHB 8.0 It is oftn convnint to work with variabls othr than th Cartsian coordinats x i ( = x, y, z. For xampl in Lctur 5 w mt sphrical polar and cylindrical polar coordinats.
More informationNetwork Congestion Games
Ntwork Congstion Gams Assistant Profssor Tas A&M Univrsity Collg Station, TX TX Dallas Collg Station Austin Houston Bst rout dpnds on othrs Ntwork Congstion Gams Travl tim incrass with congstion Highway
More informationEconomics 201b Spring 2010 Solutions to Problem Set 3 John Zhu
Economics 20b Spring 200 Solutions to Problm St 3 John Zhu. Not in th 200 vrsion of Profssor Andrson s ctur 4 Nots, th charactrization of th firm in a Robinson Cruso conomy is that it maximizs profit ovr
More information1 General boundary conditions in diffusion
Gnral boundary conditions in diffusion Πρόβλημα 4.8 : Δίνεται μονοδιάτατη πλάκα πάχους, που το ένα άκρο της κρατιέται ε θερμοκραία T t και το άλλο ε θερμοκραία T 2 t. Αν η αρχική θερμοκραία της πλάκας
More informationWhy is a E&M nature of light not sufficient to explain experiments?
1 Th wird world of photons Why is a E&M natur of light not sufficint to xplain xprimnts? Do photons xist? Som quantum proprtis of photons 2 Black body radiation Stfan s law: Enrgy/ ara/ tim = Win s displacmnt
More informationFourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.
Lur 7 Fourir Transforms and th Wav Euation Ovrviw and Motivation: W first discuss a fw faturs of th Fourir transform (FT), and thn w solv th initial-valu problm for th wav uation using th Fourir transform
More informationWhere k is either given or determined from the data and c is an arbitrary constant.
Exponntial growth and dcay applications W wish to solv an quation that has a drivativ. dy ky k > dx This quation says that th rat of chang of th function is proportional to th function. Th solution is
More informationComputing and Communications -- Network Coding
89 90 98 00 Computing and Communications -- Ntwork Coding Dr. Zhiyong Chn Institut of Wirlss Communications Tchnology Shanghai Jiao Tong Univrsity China Lctur 5- Nov. 05 0 Classical Information Thory Sourc
More informationVishnu V. Narayan. January
A 17 12 -approimation algorithm for 2-rt-connctd spanning subgraphs on graphs with minimum dgr at last arxi:1612.047902 [cs.ds] 17 Jan 2017 Vishnu V. Naraan Januar 17 2017 W obtain a polnomial-tim 17 -approimation
More informationGEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES. Eduard N. Klenov* Rostov-on-Don, Russia
GEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES Eduard N. Klnov* Rostov-on-Don, Russia Th articl considrs phnomnal gomtry figurs bing th carrirs of valu spctra for th pairs of th rmaining additiv
More informationFinal Exam Solutions
CS 2 Advancd Data Structurs and Algorithms Final Exam Solutions Jonathan Turnr /8/20. (0 points) Suppos that r is a root of som tr in a Fionacci hap. Assum that just for a dltmin opration, r has no childrn
More information4. Money cannot be neutral in the short-run the neutrality of money is exclusively a medium run phenomenon.
PART I TRUE/FALSE/UNCERTAIN (5 points ach) 1. Lik xpansionary montary policy, xpansionary fiscal policy rturns output in th mdium run to its natural lvl, and incrass prics. Thrfor, fiscal policy is also
More informationPrinciples of Humidity Dalton s law
Principls of Humidity Dalton s law Air is a mixtur of diffrnt gass. Th main gas componnts ar: Gas componnt volum [%] wight [%] Nitrogn N 2 78,03 75,47 Oxygn O 2 20,99 23,20 Argon Ar 0,93 1,28 Carbon dioxid
More informationThus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.
Homwork 5 M 373K Solutions Mark Lindbrg and Travis Schdlr 1. Prov that th ring Z/mZ (for m 0) is a fild if and only if m is prim. ( ) Proof by Contrapositiv: Hr, thr ar thr cass for m not prim. m 0: Whn
More information