Generalizing Kronecker Graphs in order to Model Searchable Networks
|
|
- Irene Allison
- 5 years ago
- Views:
Transcription
1 Generalizing Kronecker Graphs in orer to Moel Searchable Networks Elizabeth Boine, Babak Hassibi, Aam Wierman California Institute of Technology Pasaena, CA {eaboine, hassibi, Abstract This paper escribes an extension to stochastic Kronecker graphs that provies the special structure require for searchability, by efining a istance -epenent Kronecker operator We show how this extension of Kronecker graphs can generate several existing social network moels, such as the Watts-Strogatz small-worl moel an Kleinberg s latticebase moel We focus on a specific example of an expaning hypercube, reminiscent of recently propose social network moels base on a hien hyperbolic metric space, an prove that a greey forwaring algorithm can fin very short paths of length O((log log n 2 for graphs with n noes I INTRODUCTION There exists a large boy of work exploring the various structural properties of social networks small iameter, high clustering, heavy-taile egree istributions, an searchability; see [], [2], an [] for surveys of this area Many generative moels have been propose that capture some of these properties with varying levels of complexity, but the challenge remains to evelop a simple, quantitative moel that can exhibit all of these properties For example, the simple Erös-Rényi ranom graph maintains a small iameter, but fails to capture many of the other properties [4], [5] The combination of small iameter an high clustering is often calle the small-worl effect, an Watts an Strogatz (see section 22 generate much interest on the topic when they propose a moel that maintains these two characteristics simultaneously [6] Several moels were then propose to explain the heavy-taile egree istributions an ensification of complex networks; these inclue the preferential attachment moel [7], the forest-fire moel [8], [9], Kronecker graphs [0] [], an many others [] As emonstrate by Milgram s 967 experiment using real people, iniviuals can iscover an use short paths using only local information [2] This is terme searchability Kleinberg focuses on this characteristic in his lattice moel an proves searchability for a precise set of input parameters, but his moel lacks any heavy-taile istributions [], [], [4] One promising moel propose recently is Kronecker graphs [0], [], [5] These graphs are simple to generate, are mathematically tractable, an have been shown to exhibit several important social network characteristics In particular, these graphs can have heavy-taile egree an eigenvalue istributions, a high-clustering coefficient, small iameter, an ensify over time Aitionally, Leskovec evelope an algorithm that coul fin an appropriate 2x2 or x initiator matrix to fit real-worl ata However, Kronecker graphs are not searchable by a istribute greey algorithm [5] The contribution of this work is to provie an extension of Kronecker graphs that maintains searchability We provie a general moeling framework that shoul allow the exploration of the interaction of several of the properties mentione above Instea of using the traitional Kronecker prouct operation to grow the network, we introuce a istance - epenent Kronecker operation that iteratively grows the network from an initiator matrix This extension allows for the generation of traitional moels such as the Watts- Strogatz ring, the Kleinberg moel, as well as the original Kronecker graphs The key feature of this new moel is that the likelihoo of long-range contacts is now base on a istance measure, which preserves the natural istinction between local an long-range contacts This aitional structure allows the moel to generate graphs that are searchable To illustrate this new moel, we present a few examples an stuy one particular example in etail: an expaning hypercube This example is chosen to mimic the efining features of tree metrics an hyperbolic space, which are thought to be representative of the Internet an social networks [6], [7], [8] In these moels an in ours, the key is to have exponentially expaning neighborhoos aroun each noe, which leas to O(log n iameter, even without long-range links Aing long range links, the iameter can shrink to O(log log n [9] In our expaning hypercube moel, we use a log n-imensional hypercube as the unerlying lattice, with istance -epenent long-range contacts ae to each noe We grow our moel by aing a imension in each iteration, oubling the number of noes We then prove that local, greey agents can fin paths of length O((log log n 2 This paper is organize as follows Section II escribes in etail our moel an its relation to the original Kronecker graph moel an other traitional moels Section III gives a etaile proof of searchability for the example of an expaning hypercube Section IV conclues with propose future work II DISTANCE-DEPENDENT KRONECKER GRAPHS In this section we escribe the original formulation of stochastic Kronecker graphs, as well as our new istance - epenent extension of the moel We then present a few
2 examples illustrating how to generate existing network moels using the istance -epenent Kronecker graph A Stochastic Kronecker Graphs Stochastic Kronecker graphs are generate by recursively using a stanar matrix operation, the Kronecker prouct [0] Beginning with an initiator probability matrix P, with N noes, where the entries p i enote the probability that ege (i, is present, successively larger graphs P 2,, P n are generate such that the k th graph P k has N k = N k noes The Kronecker prouct is use to generate each successive graph Definition 2: The k th power of P is efine as the matrix P k, such that: P k = P k = P P P }{{} = P k P k times For each entry p uv in P k, inclue an ege in the graph G between noes u an v with probability p uv The resulting binary ranom matrix is the aacency matrix of the generate graph Kronecker graphs have many of the static properties of social networks, such as small iameter an a heavy-taile egree istribution, a heavy-taile eigenvalue istribution, an a heavy-taile eigenvector istribution [0] In aition, they exhibit several temporal properties such as ensification an shrinking iameter Using a simple 2x2 P, Leskovec emonstrate that he coul generate graphs matching the patterns of the various properties mentione above for several real-worl atasets [0] However, as shown by Mahian an Xu, stochastic Kronecker graphs are not searchable by a istribute greey algorithm [5] they lack the necessary spatial structure that allows a local greey agent to fin a short path through the network This is the motivation for the current paper B Distance-Depenent Kronecker Graphs In this section, we propose an extension to Kronecker graphs incorporating the spatial structure necessary to have searchability We a to the framework of Kronecker graphs a notion of istance, which comes from the embeing of the graph, an exten the generator from a single matrix to a family of matrices, one for each istance, efining the likelihoo of a connection occurring between noes at a particular istance We accomplish this with a new Kronecker-like operation Specifically, whereas in the original formulation of Kronecker graphs one initiator matrix is iteratively Kronecker-multiplie with itself to prouce a new aacency or probability matrix, we efine a istance - epenent Kronecker operator Depening on the istance between two noes u an v, (u, v Z, a ifferent matrix [0] For a escription of eterministic Kronecker graphs, see Leskovec et al, from a efine family will be selecte to be multiplie by that entry, as shown below C = A H = where a H (, a 2H (,2 a nh (,n a 2H (2, a 22H (2,2 a 2nH (2,n a nh (n, a n2h (n,2 a nnh (n,n H = {H i } i Z So, the k th Kronecker power is now G k = G H H }{{} k times In the Kronecker-like multiplication, the choice of H i from the family H, multiplying entry (u, v, is epenent upon the istance (u, v Note that our (u, v is not a true istance measure we can have negative istances Further, (u, v is not symmetric ((u, v (v, u since we nee to maintain symmetry in the resulting matrix Instea, (u, v = (v, u an H (u,v = H (v,u This change to the Kronecker operation makes the moel more complicate, an we o give up some of the beneficial properties of Kronecker multiplication Potentially, we coul have to efine a large number of matrices for H However, for the moels we want to generate, there are actually only a few parameters to efine, as (i, an a simple function efines H i for i > The unerlying reason for this simplicity is that the local lattice structure is usually specifie by H 0 an H, while the global, istance-epenent probability of connection can usually be specifie by an H i with a simple form So, while we lose the benefits of true Kronecker multiplication, we gain generality an the ability to create many ifferent lattices an probability of long-range contacts We note in passing that the generation of these lattice structures is not possible with the original formulation of the Kronecker graph moel For example, it is impossible to generate the Watts-Strogatz moel with conventional Kronecker graphs However, it can be one with the current generalization This is illustrate in our examples below Example : Original Kronecker Graph The simplest example is that of the original Kronecker graph formulation For this case, the istance can be arbitrary, an the family of matrices, H, is simply G, the same G use in the original efinition Thus, we efine G k = G H H }{{} k times = G G G }{{} k times Example 2: Watts-Strogatz Small-Worl Moel The next example we consier, the Watts-Strogatz moel, consists of a ring of n noes, each connecte to their neighbors within istance k on the ring The probability of a connection to any other noe on the ring is then P (u, v = p [6] To generate the unerlying ring structure with k =,
3 start with an initiator matrix K, representing the graph in figure (a Fig Generating the Watts-Strogatz Moel In orer to obtain the sequence of matrices representing the graphs in Figure, we efine a istance measure as the number of hops from one noe to another along the ring, where clockwise hops are positive, an counter-clockwise hops are negative Recall that the efinition of negative istance is require only to keep the matrix symmetric The negative matrix is ust the transpose of the matrix efine for the positive irection After each operation, the istance between noes is still the number of hops along the ring, though the number of noes oubles each time We then efine the following family of matrices, H: ( ( ( p p H 0 =, H =, H i = i > p Note that H i = H i So, starting from the initiator matrix in Figure (a, we have the following progression of matrices: p p G = p, p G 2 = G H H 0 H p H 2 H H H 0 H p H 2 G 2 = p H 2 H H 0 H H p H 2 H H 0 p p p p p p p p p p p p p p p p p p p p G 2 = p p p p p p p p p p p p p p p p p p p p Note that the W-S moel is not searchable by a greey agent; however, if P (u, v = (u,v, it becomes searchable [], [] It is possible to moel this P (u, v by simply austing H i, i as follows: ( ( 2i 2i+ H 0 =, H i = i, i, i n 2, 2i 2i H i = i ( 2i 2i 2i 2i, i, i = n 2 As in the previous examples, H i = H i The ifferent efinition for the mile noe in the ring is ue to the fact that we nee the probability of a connection to reach a minimum at this point, an then start to rise again We omit showing the resulting matrices for brevity This example alreay illustrates that the generalize operator we have efine allows the generation of searchable networks, but we will provie another more realistic example in the next section Example : Kleinberg-like Moel The final example we consier, Kleinberg s lattice moel, is particularly pertinent as it was shown to be searchable [] In the original formulation, local connections of noes are efine on a k-imensional lattice, an long-range links occur between two noes at istance with probability proportional to α We focus on a Kleinberg-like moel here, where instea of a k-imensional lattice, we have an an expaning hypercube as our unerlying lattice In this example, at any point, the graph is a hypercube with some extra long-range connections, an when it grows, it grows by oubling the number of noes an aing a imension to the hypercube Note that we will have n noes arrange on a k = log n- imensional hypercube This example is of particular interest ue to recent work suggesting that many networks have an unerlying hyperbolic or tree-metric structure [7], [6] The expaning hypercube captures the core of these topologies, as the number of noes at istance grows exponentially in Interestingly, this example is also very naturally represente using our istance -epenent Kronecker operation an a Hamming istance as our istance measure Fig 2 Example: the growth of an expaning hypercube To efine the expaning hypercube, we efine a graph G with n noes, numbere n, where each noe is labele with its corresponing log n-length bit vector We efine the istance between two noes as the Hamming istance between their labels The family of matrices H is as follows: ( ( βi H 0 =, H i =, for all i β i
4 where β = a normalizing constant, β i = P (i P (i+ The graph may or may not be searchable epening on P (i To mimic ( Kleinberg s moel, we let P (i = i α, so that α i β i = i+ Thus, for the sequence of graphs shown in the figure above, we have the following sequence of matrices: ( G =, G = β β G 2 = β, β β β β β β 2 β β β β 2 β β β β β 2 β β β β 2 β β β β β β 2 β β β β 2 β β β β β 2 β β β β 2 β β β From the matrix, we can tell that in each step, { if (u, v = 0, P (u, v = (u, v α otherwise In the original k-imensional lattice, a istribute algorithm (as efine in Section III, can fin paths of length O(log n only if α = k []; in the moifie case presente above, we will see in the next section that we nee a ifferent probability of connection to fin short paths III PROVING SEARCHABILITY FOR AN EXPANDING HYPERCUBE While our moel is more complicate than the original Kronecker graphs, it can capture several existing network moels, an it incorporates istance into the probability of connection, allowing for several parameters in which searchability can be proven Given the moel of Example in the previous section, we will show that is searchable by a simple greey, istribute algorithm if the probability of a connection is inversely proportional to the number of noes in an exponentially expaning torus We efine a ecentralize algorithm A similar to [] In each step, the current message-holer u passes the message to a neighbor that is closest to the estination, t Each noe only has knowlege of its aress on the lattice (given by its bit vector label, the aress of the estination, an the noes that have previously come into contact with the message For the graph to be searchable, we nee to have this istribute algorithm A be able to fin short paths through the network of O((log log n 2 = O(log 2 k Recall that the hypercube itself provies paths of length log n; the aition of ranom long-range links reuces the iameter, similar to [9] We prove that for a particular efinition of β i, the algorithm A can fin these paths Specifically: Theorem : If β 0 =, β = [2 log k ln ], [ (k 2i ] [ (k 2(i+ β i = i (i + ] i 2 i i+ such that the probability of a connection is if (u, v = 0, P (u, v = [ (k 2 ] log k ln if (u, v = then the ecentralize algorithm A will fin paths of length O((log log n 2 Proof: We will say that the execution of A is in phase when 2 < (u, t 2 + ( Thus, the largest value of is log k Suppose we are in phase ; we want to fin out the probability that the phase ens at this step This is equivalent to the probability that the message enters a set of noes B where B = {v : (v, t 2 } Pr(msg enters B = v B ( P (u, v : v B (2 = u +2 = u 2 ( P ( Nu,t( u +2 ( = u 2 ( P ( min N( (4 where N u,t ( = {v : (v, t 2, (u, v = } an min N( = min N u,t( u,t,(u,t= In any network moel, enforcing searchibility boils own to etermining this min N(, the minimum number of noes at a istance from a given noe u within a ball of noes centere aroun the estination, t, as illustrate in Figure Once this min N( is foun, if we set the Fig Relative positions of noes u,v, an t in phase
5 probability of a connection between two noes istance apart to be inversely proportional to min N(, with an appropriate constant log k ln, we will fin that each phase escribe above will en in approximately log k steps, an, as there are only log k such phases, our greey forwaring algorithm will fin be able to fin very short paths of length O(log 2 k To etermine min N( in our case, since the istance measure is a Hamming istance, we must count the number of possible bit vectors that are at a specific istance from a noe u, while still being within a certain istance of the estination We show in Lemma 5 in Appenix A that min N( = ( k 2 Continuing, we have Pr(msg enters B u +2 = u 2 ( P ( min N( e u +2 = e log k ln (5 = u 2 min N( P ( u +2 (6 = u 2 (7 e u +2 log k ln ln u 2 (8 e 2 log k ln ln 2 (9 = e log k (0 log k ( where line (6 is true in the limit of large n (lim n ( x/n n = e x, an line ( comes from the power series expansion of e x Let X enote the total number of steps spent in phase So, EX = Pr[X i] (2 i= i= ( i ( log k = log k (4 Let X enote the total number of steps taken by the algorithm A log k X = X (5 an =0 log k EX = EX (6 =0 ( + log k(log k (7 δ(log k 2, for a large enough δ (8 Since the expecte number of steps in phase is log k, an there are at most log k phases, the expecte amount of steps taken by the algorithm A is at most δ log 2 k So, with this efinition of P (, the istribute algorithm provies searchabilty IV CONCLUSION We have presente a generalization of Kronecker Graphs that maintains several of their avantageous properties while aitionally allowing the generation of graphs that are searchable In general, by efining a family of istance - epenent matrices, use with a Kronecker-like operation to grow a network, we can efine both local regular structures an global istance-epenent long-range connections Even though this moel is more complicate than the original Kronecker graph formulation, we gain generality (as we can generate other social network moels an searchability (as shown by our example This general moeling framework shoul allow us to explore the interaction of properties such as searchability an heavy-taile egree istributions Other recent moels have attempte to explore this interaction by imposing a power-law egree istribution onto existing moels like the Kleinberg lattice [20] Distance-epenent Kronecker graphs, in contrast, allow for these properties to emerge naturally from the efinition of the family of istanceepenent matrices The expaning hypercube example in Section III bears a resemblance to recent moels propose base on hien hyperbolic metric spaces, which have been shown to be representative of real-worl complex networks [6] In [6], the observe network topology is base upon a hien metric space, assume to be a non-eucliean hyperbolic space As in our moel, this leas to scalefree topologies an very efficient greey forwaring, though searchability has only been shown via simulations [9] This paper shoul be viewe as a first step towars the analysis of istance -epenent Kronecker graphs There are many interesting questions that remain, incluing how to parameterize our moel from real-worl atasets Ieally, given any ataset, we woul like to be able to fin an appropriate family of istance -epenent matrices to match any esire characteristic of the ataset We woul also like to use our moel to examine the interaction of searchability an other properties, particularly egree istributions As our moel was not esigne to emonstrate one characteristic in particular, but rather a range of characteristics, it is ieally suite to this sort of analysis Finally, we woul also like to investigate the ynamics of complex networks within this moel etermining how we coul incorporate growth an mobility into our moel REFERENCES [] MEJ Newman, The structure an function of complex networks, SIAM Review, 200 [2] R Albert an A Barabási, Statistical mechanics of complex networks, Reviews of Moern Physics, vol 74, 2002 [] J Kleinberg, Complex networks an ecentralize search algorithms, in Proc of International Conference of Mathematicians, 2006 [4] B Bollobás, Ranom Graphs, Acaemic Press, Inc, 985 [5] P Erös an A Rényi, On ranom graphs, Publicationes Mathematicae 6, p , 959 [6] DJ Watts an SH Strogatz, Collective ynamics of small-worl networks, Nature, vol 9, pp 440, 998 [7] A Barabási an R Albert, Emergence of scaling in ranom networks, Science, vol 286, pp , 999
6 [8] J Leskovec, J Kleinberg, an C Faloutsos, Graphs over time: ensification laws, shrinking iameters an possible explanations, in Proc of ACM SIGKDD conf on knowlege iscovery in ata mining, 2005, pp [9] P Bak, K Chen, an C Tang, A forest-fire moel an some thoughts on turbulence, Phys Lett A, vol 47, pp 29700, 990 [0] J Leskovec, D Chakrabarti, J Kleinberg, an C Faloutsos, Realistic, mathematically tractable graph generation an evolution, using kronecker multiplication, in Conf on Principles an Practice of Knowlege Discovery in Databases, 2005 [] J Leskovec, Dynamics of Large Networks, PhD in Computer Science, Carnegie Mellon University, 2008 [2] S Migram, The small-worl problem, Psychology Toay, vol 2, pp 60, 967 [] J Kleinberg, The small-worl phenomenon: An algorithmic perspective, in Proc of the 2n ACM Symposium on Theory of Computing, 2000, pp 6 70 [4] C Martel an V Nguyen, Analyzing Kleinberg s an other smallworl moels, in In PODC 04: Proc of ACM symposium on Principles of istribute computing, 2004, pp [5] M Mahian an Y Xu, Stochastic kronecker graphs, in In WAW07: Proc of Workshop On Algorithms An Moels For The Web-Graph, 2007, pp [6] D Krioukov, F Papaopoulos, M Boguna, an A Vahat, Greey forwaring in scale-free networks embee in hyperbolic metric spaces, in Proc of MAMA Workshop at Sigmetrics, 2009 [7] A Cvetkovski an M Crovella, Hyperbolic embeing an routing for ynamic graphs, in Proc of Infocom, 2009 [8] V Ramasubramanian an D Malkhi, On the treeness of internet latency an banwith, in Proc of ACM Sigmetrics, 2009, pp 6 72 [9] M Boguna an D Krioukov, Navigating ultrasmall worls in ultrashort time, Physical Review Letters, vol 02, pp 05870, 2009 [20] P Fraigniau an G Giakkoupis, The effect of power-law egrees on the navigability of small worls, in 28th ACM Symposium on Principles of Distribute Computing (PODC, 2009 V APPENDIX - CALCULATING THE SIZE OF N u,t ( In this appenix, we show a lower boun for N u,t (, the number of noes at istance from a given noe u, still within istance 2 of the estination, t Lemma 5: min N u,t ( = ( k 2 Proof: We first count exactly the number of noes in N u,t (, the number of noes at a istance from a given noe u within a ball of noes centere aroun the estination, t, as illustrate in Figure Without loss of generality, efine t as the all zero noe, t = (000 Arrange the label of u such that u = ( 0 0 Define v = (v v 0 v 0 v 00 accoring to this partition of u, so that v an v 0 have entries an v 0 an v 00 have 0 entries Let x enote the weight, or number of ones, of the label of noe x We know the following: v + v 0 + v 0 + v 00 = k (9 We can solve in terms of v, yieling v + v 0 = u (20 v 0 + v 0 = (2 v + v 0 = v (22 v 00 =k v (2 v 0 = u v (24 v 0 = u + v (25 We also know that we must satisfy the following: v, v 0, v 0, v 00 0 (26 From these bouns we have 2 < u 2 + (27 u 2 u + 2 (28 v 2 (29 max(0, u v min( u, k, 2 (2 + u (0 Note that the secon an thir bouns o not affect v Counting the number of noes in the ball, we have N u,t ( = v u v =v l ( ( u k u v u + v ( where we have substitute v u an v l, for the upper an lower bouns above, respectively We can now approximate the number of noes in N u,t (, using the entropy approximation for combinations Let u = ak, = bk, 2 = ck, x = v Using this notation, we have where N u,t ( = v u x=v l ( x X = max ah x ak subect to ( ak x ( k( a k( b + x v u 2 k(ah( x ak +( ah x=v l ( b a+ x k a (2 ( 2 kx (4 + ( ah ( b a + x k a (5 k max(0, a b x k min(a, b, (a b+c (6 2 Note that line (4 is true as ( n k = 2 n(h(p+o( when k pn There are two solutions to the optimization problem state above, yieling two ifferent values of min N u,t ( : yieling x = ak abk when c a + b( 2a min N u,t ( = ( k x 2 = k(a b + c when c < a + b( 2a 2 yieling ( k 2 min N u,t ( = The function is concave in x, so the two possible solutions can be seen from the bounary points an the bouns for the region The resulting min N u,t ( are erive in Sections A an B below As the secon solution yiels a smaller min N u,t (, we have an overall min N u,t ( = ( k 2
7 A Solution : c a + b( 2a In this region, the solution to the unconstraine problem, x = ak abk gives us the maximal X Substituting in for the size of N u,t (, we have ( ak abk b a+ k(ah( ak abk k ak +( ah a N u,t ( = 2 (7 = 2 k(ah( b+( ah(b (8 = 2 kh(b (9 ( k (40 bk ( k = (4 where line (4 is true in the limit of large k B Solution 2: c < a + b( 2a In this region, we choose one of the bounary points, x 2 = 2k(a b + c, as the solution to the maximization problem Substituting this solution for x in N u,t (, we obtain N u,t ( = 2 a b+c k(ah( 2a +( ah ( a+b+c 2( a (42 This gives us a function of a, b, c, so we want to fin the worst case a, c that minimizes N u,t ( The new optimization problem is thus f(b = min N u,t ( (4 ( ( a b + c a + b + c = min ah + ( ah a,c 2a 2( a (44 Note that the bouns for this region are: a b c 0 2 a b + c 0 c < a 2c 4 0 c a, b a b c 7 0 a + b c 8 0 a + b c 2ab where an 2 come from the bouns on (u, v, comes from the bouns on u, an 4 an 5 come from the ranges for an the size of the network Note that -5 are always true, not ust in this region 6,7, an 8 come from the fact that our solution x 2 is minimal in this region Note that 8 implies 7 Computing the Hessian of the function in (45 shows that it is concave in both a an b; however, we omit the cumbersome calculation for brevity Since our function is concave, the min N u,t ( is foun from the bounary points of Region 2 Rearranging the bouns from before in terms of a we have: a b + c 2 a b c a > c, a 2c 4 c > 0, c a, a 6 a 2 b c 7 a b + c 8 a c 9 a c 2b 2b b 2b when b b 2 2b when b > 2 Fig 4 Bounaries of f(b when b 2 When b 2, only bouns (,2,,4 apply to f(b, yieling 5 points that we nee to examine, as shown in Figure 4 If b 5, then f(b is minimal at point (, ( b, 2b, yieling 2b k( min N u,t ( = 2 = ( k 2bk bk ( k 2 (45, for large k (46 H ( b 2b (47 If b < 05, then f(b is minimal at point (5, (b, 2b, yieling min N u,t ( = 2 k2b = 4 (48 When b > 2, only bouns (2,,4,an 8 apply to f(b, yieling 4 points that we nee to examine, as shown in Figure 5 For this region, f(b is minimal at point (, matching point Fig 5 Bounaries of f(b when b 2
8 (5 in the previous region, yieling 2b k( min N u,t ( = 2 ( k 2 H ( b 2b (49, for large k (50 Thus, when b < 05, we have min N u,t ( = 4, an when b 05, we have min N u,t ( = ( k 2 Finally, we have that when c < a + b( 2a, we apply Solution 2 from Lemma 5, an we have min N u,t ( = ( k 2 when Solution 2 is vali Comparing the Solution with Solution 2, we have again that min N u,t ( = ( k 2
Modeling Social Networks
Distance-epenent Kronecker Graphs for 1 Moeling Social Networks Elizabeth Boine-Baron,* Member, IEEE, Babak Hassibi, Member, IEEE, an Aam Wierman, Member, IEEE Abstract This paper focuses on a generalization
More informationDistance-dependent Kronecker Graphs for Modeling Social Networks
Distance-epenent Kronecker Graphs for Moeling Social Networks Elizabeth Boine-Baron,* Member, IEEE, Babak Hassibi, Member, IEEE, an Aam Wierman, Member, IEEE Abstract This paper focuses on a generalization
More informationMULTIFRACTAL NETWORK GENERATORS
MULTIFRACTAL NETWORK GENERATORS AUSTIN R. BENSON, CARLOS RIQUELME, SVEN P. SCHMIT (0) Abstract. Generating ranom graphs to moel networks has a rich history. In this paper, we explore a recent generative
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationDeterministic Decentralized Search in Random Graphs
Deterministic Decentralized Search in Random Graphs Esteban Arcaute 1,, Ning Chen 2,, Ravi Kumar 3, David Liben-Nowell 4,, Mohammad Mahdian 3, Hamid Nazerzadeh 1,, and Ying Xu 1, 1 Stanford University.
More information'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21
Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationMath 1B, lecture 8: Integration by parts
Math B, lecture 8: Integration by parts Nathan Pflueger 23 September 2 Introuction Integration by parts, similarly to integration by substitution, reverses a well-known technique of ifferentiation an explores
More informationLeaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes
Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,
More information19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control
19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior
More informationarxiv: v4 [cs.ds] 7 Mar 2014
Analysis of Agglomerative Clustering Marcel R. Ackermann Johannes Blömer Daniel Kuntze Christian Sohler arxiv:101.697v [cs.ds] 7 Mar 01 Abstract The iameter k-clustering problem is the problem of partitioning
More informationinflow outflow Part I. Regular tasks for MAE598/494 Task 1
MAE 494/598, Fall 2016 Project #1 (Regular tasks = 20 points) Har copy of report is ue at the start of class on the ue ate. The rules on collaboration will be release separately. Please always follow the
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationPerfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs
Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite
More informationarxiv: v1 [math.co] 29 May 2009
arxiv:0905.4913v1 [math.co] 29 May 2009 simple Havel-Hakimi type algorithm to realize graphical egree sequences of irecte graphs Péter L. Erős an István Miklós. Rényi Institute of Mathematics, Hungarian
More informationCalculus of Variations
16.323 Lecture 5 Calculus of Variations Calculus of Variations Most books cover this material well, but Kirk Chapter 4 oes a particularly nice job. x(t) x* x*+ αδx (1) x*- αδx (1) αδx (1) αδx (1) t f t
More informationensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y
Ph195a lecture notes, 1/3/01 Density operators for spin- 1 ensembles So far in our iscussion of spin- 1 systems, we have restricte our attention to the case of pure states an Hamiltonian evolution. Toay
More informationInfluence of weight initialization on multilayer perceptron performance
Influence of weight initialization on multilayer perceptron performance M. Karouia (1,2) T. Denœux (1) R. Lengellé (1) (1) Université e Compiègne U.R.A. CNRS 817 Heuiasyc BP 649 - F-66 Compiègne ceex -
More informationMath Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors
Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+
More informationGeneralization of the persistent random walk to dimensions greater than 1
PHYSICAL REVIEW E VOLUME 58, NUMBER 6 DECEMBER 1998 Generalization of the persistent ranom walk to imensions greater than 1 Marián Boguñá, Josep M. Porrà, an Jaume Masoliver Departament e Física Fonamental,
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationHyperbolic Moment Equations Using Quadrature-Based Projection Methods
Hyperbolic Moment Equations Using Quarature-Base Projection Methos J. Koellermeier an M. Torrilhon Department of Mathematics, RWTH Aachen University, Aachen, Germany Abstract. Kinetic equations like the
More informationLecture 10: Logistic growth models #2
Lecture 1: Logistic growth moels #2 Fugo Takasu Dept. Information an Computer Sciences Nara Women s University takasu@ics.nara-wu.ac.jp 6 July 29 1 Analysis of the stochastic process of logistic growth
More informationEVALUATING HIGHER DERIVATIVE TENSORS BY FORWARD PROPAGATION OF UNIVARIATE TAYLOR SERIES
MATHEMATICS OF COMPUTATION Volume 69, Number 231, Pages 1117 1130 S 0025-5718(00)01120-0 Article electronically publishe on February 17, 2000 EVALUATING HIGHER DERIVATIVE TENSORS BY FORWARD PROPAGATION
More informationRobust Low Rank Kernel Embeddings of Multivariate Distributions
Robust Low Rank Kernel Embeings of Multivariate Distributions Le Song, Bo Dai College of Computing, Georgia Institute of Technology lsong@cc.gatech.eu, boai@gatech.eu Abstract Kernel embeing of istributions
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationA new proof of the sharpness of the phase transition for Bernoulli percolation on Z d
A new proof of the sharpness of the phase transition for Bernoulli percolation on Z Hugo Duminil-Copin an Vincent Tassion October 8, 205 Abstract We provie a new proof of the sharpness of the phase transition
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationNOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,
NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which
More informationu t v t v t c a u t b a v t u t v t b a
Nonlinear Dynamical Systems In orer to iscuss nonlinear ynamical systems, we must first consier linear ynamical systems. Linear ynamical systems are just systems of linear equations like we have been stuying
More informationThe Principle of Least Action
Chapter 7. The Principle of Least Action 7.1 Force Methos vs. Energy Methos We have so far stuie two istinct ways of analyzing physics problems: force methos, basically consisting of the application of
More informationarxiv: v2 [math.st] 29 Oct 2015
EXPONENTIAL RANDOM SIMPLICIAL COMPLEXES KONSTANTIN ZUEV, OR EISENBERG, AND DMITRI KRIOUKOV arxiv:1502.05032v2 [math.st] 29 Oct 2015 Abstract. Exponential ranom graph moels have attracte significant research
More informationPower Generation and Distribution via Distributed Coordination Control
Power Generation an Distribution via Distribute Coorination Control Byeong-Yeon Kim, Kwang-Kyo Oh, an Hyo-Sung Ahn arxiv:407.4870v [math.oc] 8 Jul 204 Abstract This paper presents power coorination, power
More informationThermal conductivity of graded composites: Numerical simulations and an effective medium approximation
JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More informationPerformance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs
IEEE TRANSACTIONS ON COMMUNICATIONS, TCOM-9-63 Performance of Opportunistic Epiemic Routing on Ege-Markovian Dynamic Graphs John Whitbeck, Vania Conan, an Marcelo Dias e Amorim arxiv:99.29v3 [cs.ni] 25
More informationIntroduction to the Vlasov-Poisson system
Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its
More informationOptimal Variable-Structure Control Tracking of Spacecraft Maneuvers
Optimal Variable-Structure Control racking of Spacecraft Maneuvers John L. Crassiis 1 Srinivas R. Vaali F. Lanis Markley 3 Introuction In recent years, much effort has been evote to the close-loop esign
More informationDiagonalization of Matrices Dr. E. Jacobs
Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is
More informationLaplacian Cooperative Attitude Control of Multiple Rigid Bodies
Laplacian Cooperative Attitue Control of Multiple Rigi Boies Dimos V. Dimarogonas, Panagiotis Tsiotras an Kostas J. Kyriakopoulos Abstract Motivate by the fact that linear controllers can stabilize the
More informationarxiv: v4 [math.pr] 27 Jul 2016
The Asymptotic Distribution of the Determinant of a Ranom Correlation Matrix arxiv:309768v4 mathpr] 7 Jul 06 AM Hanea a, & GF Nane b a Centre of xcellence for Biosecurity Risk Analysis, University of Melbourne,
More informationSYNCHRONOUS SEQUENTIAL CIRCUITS
CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents
More informationDot trajectories in the superposition of random screens: analysis and synthesis
1472 J. Opt. Soc. Am. A/ Vol. 21, No. 8/ August 2004 Isaac Amiror Dot trajectories in the superposition of ranom screens: analysis an synthesis Isaac Amiror Laboratoire e Systèmes Périphériques, Ecole
More informationParameter estimation: A new approach to weighting a priori information
Parameter estimation: A new approach to weighting a priori information J.L. Mea Department of Mathematics, Boise State University, Boise, ID 83725-555 E-mail: jmea@boisestate.eu Abstract. We propose a
More informationMake graph of g by adding c to the y-values. on the graph of f by c. multiplying the y-values. even-degree polynomial. graph goes up on both sides
Reference 1: Transformations of Graphs an En Behavior of Polynomial Graphs Transformations of graphs aitive constant constant on the outsie g(x) = + c Make graph of g by aing c to the y-values on the graph
More information. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences.
S 63 Lecture 8 2/2/26 Lecturer Lillian Lee Scribes Peter Babinski, Davi Lin Basic Language Moeling Approach I. Special ase of LM-base Approach a. Recap of Formulas an Terms b. Fixing θ? c. About that Multinomial
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationsampling, resulting in iscrete-time, iscrete-frequency functions, before they can be implemente in any igital system an be of practical use. A consier
DISTANCE METRICS FOR DISCRETE TIME-FREQUENCY REPRESENTATIONS James G. Droppo an Les E. Atlas Department of Electrical Engineering University of Washington Seattle, WA fjroppo atlasg@u.washington.eu ABSTRACT
More informationMulti-View Clustering via Canonical Correlation Analysis
Technical Report TTI-TR-2008-5 Multi-View Clustering via Canonical Correlation Analysis Kamalika Chauhuri UC San Diego Sham M. Kakae Toyota Technological Institute at Chicago ABSTRACT Clustering ata in
More informationarxiv: v1 [hep-lat] 19 Nov 2013
HU-EP-13/69 SFB/CPP-13-98 DESY 13-225 Applicability of Quasi-Monte Carlo for lattice systems arxiv:1311.4726v1 [hep-lat] 19 ov 2013, a,b Tobias Hartung, c Karl Jansen, b Hernan Leovey, Anreas Griewank
More informationSwitching Time Optimization in Discretized Hybrid Dynamical Systems
Switching Time Optimization in Discretize Hybri Dynamical Systems Kathrin Flaßkamp, To Murphey, an Sina Ober-Blöbaum Abstract Switching time optimization (STO) arises in systems that have a finite set
More informationNon-deterministic Social Laws
Non-eterministic Social Laws Michael H. Coen MIT Artificial Intelligence Lab 55 Technology Square Cambrige, MA 09 mhcoen@ai.mit.eu Abstract The paper generalizes the notion of a social law, the founation
More informationDatabase-friendly Random Projections
Database-frienly Ranom Projections Dimitris Achlioptas Microsoft ABSTRACT A classic result of Johnson an Linenstrauss asserts that any set of n points in -imensional Eucliean space can be embee into k-imensional
More informationu!i = a T u = 0. Then S satisfies
Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace
More informationθ x = f ( x,t) could be written as
9. Higher orer PDEs as systems of first-orer PDEs. Hyperbolic systems. For PDEs, as for ODEs, we may reuce the orer by efining new epenent variables. For example, in the case of the wave equation, (1)
More informationCapacity Analysis of MIMO Systems with Unknown Channel State Information
Capacity Analysis of MIMO Systems with Unknown Channel State Information Jun Zheng an Bhaskar D. Rao Dept. of Electrical an Computer Engineering University of California at San Diego e-mail: juzheng@ucs.eu,
More informationVectors in two dimensions
Vectors in two imensions Until now, we have been working in one imension only The main reason for this is to become familiar with the main physical ieas like Newton s secon law, without the aitional complication
More informationTractability results for weighted Banach spaces of smooth functions
Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March
More informationII. First variation of functionals
II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent
More informationOn the Surprising Behavior of Distance Metrics in High Dimensional Space
On the Surprising Behavior of Distance Metrics in High Dimensional Space Charu C. Aggarwal, Alexaner Hinneburg 2, an Daniel A. Keim 2 IBM T. J. Watson Research Center Yortown Heights, NY 0598, USA. charu@watson.ibm.com
More informationarxiv: v2 [cs.ds] 11 May 2016
Optimizing Star-Convex Functions Jasper C.H. Lee Paul Valiant arxiv:5.04466v2 [cs.ds] May 206 Department of Computer Science Brown University {jasperchlee,paul_valiant}@brown.eu May 3, 206 Abstract We
More informationBohr Model of the Hydrogen Atom
Class 2 page 1 Bohr Moel of the Hyrogen Atom The Bohr Moel of the hyrogen atom assumes that the atom consists of one electron orbiting a positively charge nucleus. Although it oes NOT o a goo job of escribing
More informationarxiv:hep-th/ v1 3 Feb 1993
NBI-HE-9-89 PAR LPTHE 9-49 FTUAM 9-44 November 99 Matrix moel calculations beyon the spherical limit arxiv:hep-th/93004v 3 Feb 993 J. Ambjørn The Niels Bohr Institute Blegamsvej 7, DK-00 Copenhagen Ø,
More informationAPPROXIMATE SOLUTION FOR TRANSIENT HEAT TRANSFER IN STATIC TURBULENT HE II. B. Baudouy. CEA/Saclay, DSM/DAPNIA/STCM Gif-sur-Yvette Cedex, France
APPROXIMAE SOLUION FOR RANSIEN HEA RANSFER IN SAIC URBULEN HE II B. Bauouy CEA/Saclay, DSM/DAPNIA/SCM 91191 Gif-sur-Yvette Ceex, France ABSRAC Analytical solution in one imension of the heat iffusion equation
More informationTransmission Line Matrix (TLM) network analogues of reversible trapping processes Part B: scaling and consistency
Transmission Line Matrix (TLM network analogues of reversible trapping processes Part B: scaling an consistency Donar e Cogan * ANC Eucation, 308-310.A. De Mel Mawatha, Colombo 3, Sri Lanka * onarecogan@gmail.com
More informationThe Exact Form and General Integrating Factors
7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily
More informationA Review of Multiple Try MCMC algorithms for Signal Processing
A Review of Multiple Try MCMC algorithms for Signal Processing Luca Martino Image Processing Lab., Universitat e València (Spain) Universia Carlos III e Mari, Leganes (Spain) Abstract Many applications
More informationAsymptotic determination of edge-bandwidth of multidimensional grids and Hamming graphs
Asymptotic etermination of ege-banwith of multiimensional gris an Hamming graphs Reza Akhtar Tao Jiang Zevi Miller. Revise on May 7, 007 Abstract The ege-banwith B (G) of a graph G is the banwith of the
More informationLower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Lower Bouns for Local Monotonicity Reconstruction from Transitive-Closure Spanners Arnab Bhattacharyya Elena Grigorescu Mahav Jha Kyomin Jung Sofya Raskhonikova Davi P. Wooruff Abstract Given a irecte
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationCHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold
CHAPTER 1 : DIFFERENTIABLE MANIFOLDS 1.1 The efinition of a ifferentiable manifol Let M be a topological space. This means that we have a family Ω of open sets efine on M. These satisfy (1), M Ω (2) the
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationPart I: Web Structure Mining Chapter 1: Information Retrieval and Web Search
Part I: Web Structure Mining Chapter : Information Retrieval an Web Search The Web Challenges Crawling the Web Inexing an Keywor Search Evaluating Search Quality Similarity Search The Web Challenges Tim
More informationThroughput Optimal Control of Cooperative Relay Networks
hroughput Optimal Control of Cooperative Relay Networks Emun Yeh Dept. of Electrical Engineering Yale University New Haven, C 06520, USA E-mail: emun.yeh@yale.eu Ranall Berry Dept. of Electrical an Computer
More informationConcentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection and System Identification
Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection an System Ientification Borhan M Sananaji, Tyrone L Vincent, an Michael B Wakin Abstract In this paper,
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationQuantum Search on the Spatial Grid
Quantum Search on the Spatial Gri Matthew D. Falk MIT 2012, 550 Memorial Drive, Cambrige, MA 02139 (Date: December 11, 2012) This paper explores Quantum Search on the two imensional spatial gri. Recent
More informationStopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Codes
Stopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Coes Kaiann Fu an Achilleas Anastasopoulos Electrical Engineering an Computer Science Dept. University of Michigan, Ann Arbor, MI
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationAssignment 1. g i (x 1,..., x n ) dx i = 0. i=1
Assignment 1 Golstein 1.4 The equations of motion for the rolling isk are special cases of general linear ifferential equations of constraint of the form g i (x 1,..., x n x i = 0. i=1 A constraint conition
More informationCascaded redundancy reduction
Network: Comput. Neural Syst. 9 (1998) 73 84. Printe in the UK PII: S0954-898X(98)88342-5 Cascae reunancy reuction Virginia R e Sa an Geoffrey E Hinton Department of Computer Science, University of Toronto,
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationThe total derivative. Chapter Lagrangian and Eulerian approaches
Chapter 5 The total erivative 51 Lagrangian an Eulerian approaches The representation of a flui through scalar or vector fiels means that each physical quantity uner consieration is escribe as a function
More informationEstimation of the Maximum Domination Value in Multi-Dimensional Data Sets
Proceeings of the 4th East-European Conference on Avances in Databases an Information Systems ADBIS) 200 Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets Eleftherios Tiakas, Apostolos.
More informationELEC3114 Control Systems 1
ELEC34 Control Systems Linear Systems - Moelling - Some Issues Session 2, 2007 Introuction Linear systems may be represente in a number of ifferent ways. Figure shows the relationship between various representations.
More informationProof of SPNs as Mixture of Trees
A Proof of SPNs as Mixture of Trees Theorem 1. If T is an inuce SPN from a complete an ecomposable SPN S, then T is a tree that is complete an ecomposable. Proof. Argue by contraiction that T is not a
More informationStable and compact finite difference schemes
Center for Turbulence Research Annual Research Briefs 2006 2 Stable an compact finite ifference schemes By K. Mattsson, M. Svär AND M. Shoeybi. Motivation an objectives Compact secon erivatives have long
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationSpace-time Linear Dispersion Using Coordinate Interleaving
Space-time Linear Dispersion Using Coorinate Interleaving Jinsong Wu an Steven D Blostein Department of Electrical an Computer Engineering Queen s University, Kingston, Ontario, Canaa, K7L3N6 Email: wujs@ieeeorg
More informationIPA Derivatives for Make-to-Stock Production-Inventory Systems With Backorders Under the (R,r) Policy
IPA Derivatives for Make-to-Stock Prouction-Inventory Systems With Backorers Uner the (Rr) Policy Yihong Fan a Benamin Melame b Yao Zhao c Yorai Wari Abstract This paper aresses Infinitesimal Perturbation
More informationEIGEN-ANALYSIS OF KERNEL OPERATORS FOR NONLINEAR DIMENSION REDUCTION AND DISCRIMINATION
EIGEN-ANALYSIS OF KERNEL OPERATORS FOR NONLINEAR DIMENSION REDUCTION AND DISCRIMINATION DISSERTATION Presente in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Grauate
More informationDelay Limited Capacity of Ad hoc Networks: Asymptotically Optimal Transmission and Relaying Strategy
Delay Limite Capacity of A hoc Networks: Asymptotically Optimal Transmission an Relaying Strategy Eugene Perevalov Lehigh University Bethlehem, PA 85 Email: eup2@lehigh.eu Rick Blum Lehigh University Bethlehem,
More informationBayesian Estimation of the Entropy of the Multivariate Gaussian
Bayesian Estimation of the Entropy of the Multivariate Gaussian Santosh Srivastava Fre Hutchinson Cancer Research Center Seattle, WA 989, USA Email: ssrivast@fhcrc.org Maya R. Gupta Department of Electrical
More informationAlgorithms and matching lower bounds for approximately-convex optimization
Algorithms an matching lower bouns for approximately-convex optimization Yuanzhi Li Department of Computer Science Princeton University Princeton, NJ, 08450 yuanzhil@cs.princeton.eu Anrej Risteski Department
More informationA note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz
A note on asymptotic formulae for one-imensional network flow problems Carlos F. Daganzo an Karen R. Smilowitz (to appear in Annals of Operations Research) Abstract This note evelops asymptotic formulae
More informationA Sketch of Menshikov s Theorem
A Sketch of Menshikov s Theorem Thomas Bao March 14, 2010 Abstract Let Λ be an infinite, locally finite oriente multi-graph with C Λ finite an strongly connecte, an let p
More information