Recent Progress in Complex Network Analysis. Models of Random Intersection Graphs
|
|
- Bryan Poole
- 8 years ago
- Views:
Transcription
1 Recent Progress in Complex Network Analysis. Models of Random Intersection Graphs Mindaugas Bloznelis, Erhard Godehardt, Jerzy Jaworski, Valentas Kurauskas, Katarzyna Rybarczyk Adam Mickiewicz University, Heinrich Heine University, Vilnius University Abstract Experimental results show that in large complex networks such as internet or biological networks, there is a tendency to connect elements which have a common neighbor. This tendency in theoretical random graph models is depicted by the asymptotically constant clustering coefficient. Moreover complex networks have power law degree distribution and small diameter (small world phenomena), thus these are desirable features of random graphs used for modeling real life networks. We survey various variants of random intersection graph models, which are important for networks modeling. key words: Random intersection graphs, Random graph applications, Network models, Compelx networks 1 Introduction Given a finite set W and a collection of its subsets D 1,..., D n, the active intersection graph defines an adjacency relation between the subsets by declaring two subsets adjacent whenever they share at least s common elements (in this sense, each subset D i can be considered as a vertex v i of a vertex set V ). The passive intersection graph defines an adjacency relation between the elements of W. A pair of elements is declared an edge if it is contained in s or more subsets. Here s 1 is a model parameter. Both models have reasonable interpretations, for example, in the active graph, two people v i and v j with sets of hobbies D i and D j establish a communication link whenever they have sufficiently many common hobbies. In the passive graph, students (represented by elements of W ) become acquaintances if they participate in sufficiently many joint projects; here the projects (respectively their managers) form the set V. In order to model active and passive graphs with desired statistical properties, we choose subsets D 1,..., D n at random and obtain random intersection graphs. Alternatively, a random intersection graph can be obtained from a random bipartite graph with bipartition V W, where each vertex (actor) v i from the set V = {v 1,..., v n } selects the set D i W of its neighbors (attributes) in the bipartite graph at random. Now, the active intersection graph defines the adjacency relation on the vertex set V : v i and v j are adjacent if they have at least s common 1
2 neighbors in the bipartite graph. Similarly, vertices w i, w j W are adjacent in the passive graph whenever they have at least s common neighbors in the bipartite graph. An attractive property of these models is that they capture important features of real networks, the power-law degree distribution (called also the scale-free property), small typical distances between vertices (the small-world property, see Strogatz and Watts 1998), and a high statistical dependency of neighboring adjacency relations expressed in terms of clustering and assortativity coefficients (we give a detailed account of these properties in the accompanying paper Bloznelis et al. 2015). In the literature a network possessing these properties is called a complex network. Many real life networks such as the internet network, the world wide web, or many biological networks are believed to be complex networks. Complex network models based on random intersection graphs help to explain and understand some statistical properties of real networks, like the actor network where actors are linked by an edge when they have acted in the same film, or the collaboration network where authors are declared adjacent when they have co-authored at least s papers. These networks exploit the underlying bipartite graph structure: Actors are linked to films, and authors to papers. Newman et al pointed out that the clustering property of those networks could be explained by the presence of such a bipartite graph structure, see also Barbour and Reinert 2011, Guillaume and Latapy The bipartite structure does not need to be given explicitly: The members of a social network tend to establish a link if they share some common interests even if the total set of interests might be difficult to specify. In what follows we present several random intersection graph models and describe relations between them. Our analysis shows that random intersection graph models provide remarkably good approximations to some real networks (such as the actor network) as long as the degree and clustering properties are considered. These empirical observations are supported by theoretical findings (see Bloznelis et al. 2015). The study of random intersection graphs has just started and many interesting properties are still unexplored. 2 Models Let n and m be positive integers. The structure of a random intersection graph results from relations between elements of two disjoint sets V = {v 1,..., v n } and W = {w 1,..., w m }. V is a set of actors and W a set of attributes. 2.1 Binomial intersection graph The first random intersection graph model, denoted by G(n, m, p), was introduced in Karoński et al Given p [0; 1], in G(n, m, p) each actor v j adds an attribute w i to D j with probability p independently of all other elements of V W. This relation may be represented by a bipartite graph with bipartition (V, W ) in which each edge joining an element of V with an element of W appears independently with probability p. G(n, m, p) is a graph with vertex set V in which vertices v i and v j are adjacent if D i and D j intersect on at least one attribute. First results from this model were applied 2
3 to the gate matrix layout problem that arises in the context of physical layout of Very Large Scale Integration, see Karoński et al and references therein. The model was generalised in Godehardt and Jaworski 2001, Godehardt and Jaworski 2003 to an active and passive random intersection graph. 2.2 Active intersection graph Given a set of attributes W = {w 1,..., w m }, an actor v is identified with the set D(v) of attributes selected by v from W. Let the actors v 1,..., v n choose their attribute sets D i = D(v i ), 1 i n, independently at random, and declare v i and v j adjacent (v i v j ) whenever they share at least s common attributes, i.e., D i D j s. Here and below, s 1 is the same for all pairs v i, v j. The graph on the vertex set V = {v 1,..., v n } defined by this adjacency relation is called the active random intersection graph, see Godehardt and Jaworski Subsets of W of size s play a special role; we call them joints. They serve as witnesses of established links: v i v j whenever there exists a joint included both in D i and D j. For simplicity, we assume that the random sets D 1,..., D n have the same probability distribution of the form P(D i = A) = P ( A ) ( m A ) 1 for A W. (1) That is, given an integer k, all subsets A W of size A = k receive equal chances, proportional to the weight P (k), where P is a probability on {0, 1,..., m}. The random intersection graph defined in this way is denoted G s (n, m, P ). Note that the active intersection graph G s (n, m, P ) becomes the binomial intersection graph G s (n, m, p) if we choose P = Bin(m, p). Also note that G 1 (n, m, p) is G(n, m, p) as defined in Karoński et al The active intersection graph G s (n, m, δ x ), where δ x is the probability distribution putting mass 1 on a positive integer x (i.e., all random sets are of the same, non-random size x) has attracted particular attention in the literature (Blackburn and Gerke 2009, Bloznelis and Luczak 2013, Eschenauer and Gligor 2002, Godehardt and Jaworski 2003, Nikoletseas et al. 2011, Rybarczyk 2011a, Yagan and Makowski 2009) as it provides a convenient model of a secure wireless network. It is called the uniform random intersection graph and denoted G s (n, m, x). The sparse active random intersection graph admits power-law degree distribution (asymptotic as n, m ), which has the form of a Poisson mixture (Bloznelis 2008, Bloznelis 2010c, Deijfen and Kets 2009, Jaworski et al. 2006, Rybarczyk 2012, Stark 2004), tunable clustering (Bloznelis 2013, Deijfen and Kets 2009, Yagan and Makowski 2009) and assortativity coefficients (Bloznelis et al. 2013). To get a power-law active intersection graph one chooses n = O(m) and the probability distribution of the size D i of the typical set such that n/m D i are asymptotically power-law distributed as n, m +. Detailed results concerning degree distribution, clustering and other properties are given in the accompanying paper Bloznelis et al The phase transition in the component size of an active random intersection graph has been studied in Behrisch 2007, Bloznelis et al. 2009, Godehardt et al. 2007, Rybarczyk 2011a. The effect of the clustering property on the phase transition in the com- 3
4 ponent size and on the epidemic spread has been studied in Lagerås and Lindholm 2008, Bloznelis 2010c, Britton et al respectively. Finally, we would like to mention the intersection graph model of Johnson and Markström 2013, where the sets D i have a special structure in that they are subcubes of the cube W = {0, 1} n. 2.3 Passive intersection graph Let D 1,..., D n be independent random subsets of W with the same probability distribution (1). Let vertices w, w W be linked by D j if w, w D j. For example, every w D j \ {w} is linked to w by D j. The links created by D 1,..., D n define a multigraph on the vertex set W. In the passive random intersection graph, two vertices w, w W are defined adjacent whenever there are at least s links between w and w, i.e., the pair {w, w } is contained in at least s subsets of the collection {D 1,..., D n }, see Godehardt and Jaworski We denote the passive random intersection graph G s(n, m, P ) with P as the common probability distribution of the random variables X 1 = D 1,..., X n = D n. The passive intersection graph G s(n, m, P ) becomes the binomial intersection graph G s (m, n, p) if P = Bin(n, p). The sparse passive random intersection graph admits a power-law asymptotic degree distribution which has the form of a compound Poisson distribution, see Bloznelis 2013, Jaworski and Stark It has a tunable clustering and assortativity coefficients (Bloznelis et al. 2013, Godehardt et al. 2012, see also Bloznelis 2013). 2.4 Inhomogeneous intersection graph In order to model inhomogeneity of adjacency relations that takes into account the variability of activity of actors and attractiveness of attributes, the binomial model has been generalized in Nikoletseas et al. 2004, Nikoletseas et al by introducing inhomogeneous weight sequences, see also Barbour and Reinert 2011, Deijfen and Kets 2009, Rybarczyk 2013, Shang Given weight sequences x = {x i } 1 i m and y = {y j } 1 j n with x i, y j [0, 1], i, j 1, consider the random bipartite graph H x,y with bipartition V = {v 1, v 2,... } and W = {w 1, w 2,... }, where edges {w i, v j } are inserted independently and with probabilities p ij = x i y j. Define the inhomogeneous graph G x,y on the vertex set V by declaring u, v V adjacent (denoted u v) whenever they have a common neighbor in H x,y. Now an attribute w i is picked with probability proportional to the activity y j of the actor v j and the attractiveness x i of the attribute w i. Consider, for example, the French actor network G F, where two actors v i, v j V are declared adjacent whenever they have acted in the same movie w k W (real network data from the actor network, see The number of actors V = and the number of movies W = Let G F be the inhomogeneous random intersection graph where the activity of an actor v j is proportional to the number of movies she or he acted in and the attractiveness of the movie w i is proportional to the number of actors that acted in this movie. We simulate an instance of G F so that in the simulated network actors pick attributes independently at random, but with the probabilities estimated from the true network G F. In Fig. 1. we plot the clustering coefficients k P(v1 v2 v 1 v3, v2 v3, d(v3) = k) of G F and G F, and the clustering function r P(v 1 v2 d(v 1, v2) = r) of G F and G F 4
5 1.0 French drama actors network Real actor network Simulated inhomogeneous network 1.0 French drama actors network clustering coefficient cl(r) k Real actor network Simulated inhomogeneous network r Figure 1: Clustering coefficient and clustering function. (Bloznelis and Kurauskas 2012). Here (v1, v2, v3) is an ordered triple of vertices sampled at random from V. By we denote the adjacency relation and d(v) counts the number of neighbors of v, d(v, u) counts the number of common neighbors of u and v. Analysis of the inhomogeneous intersection graph becomes simpler if we impose some regularity conditions on the weight sequences x and y. For example, if we drop the condition x i, y j [0, 1] and replace p ij by p ij = min{1, x i y j / nm}, we obtain a modification of G x,y, which we denote G x,y. In addition a convenient assumption is that x and y are realized values of two independent sequences of i.i.d. random variables X = {X i } 1 i m and Y = {Y j } 1 j n respectively. Let P 1 and P 2 denote the probability distributions of the random variables Y 1 and X 1. By G(n, m, P 1, P 2 ) we denote the random intersection graph G X,Y. Note that G(n, m, P 1, δ x ) is an active random intersection graph and G(n, m, δ x, P 2 ) a passive one (we recall that δ x is the probability distribution putting mass 1 on x > 0). In particular, the model G(n, m, P 1, P 2 ) admits a power-law asymptotic degree distribution and tunable clustering and assortativity coefficients (Bloznelis and Damarackas 2013, Bloznelis and Kurauskas 2012, see also Bloznelis and Karoński 2013). Bloznelis and Damarackas 2013 revises an incorrect result of Shang Inhomogeneous random intersection graphs reproduce empirically observed clustering properties of a real actor network with remarkable accuracy as shown in Bloznelis and Kurauskas One drawback of such models is that they do not account for various characteristics of the networks that change over time. This shortage is overcome by the random intersection graph process in Bloznelis and Karoński 2013, aimed at modeling an affiliation network evolving in time, see Martin et al Intersection digraph Often relations between actors of a social network are non-symmetric. Such adjacency relations are usually modeled with the aid of a directed graph (digraph). In order to obtain a random digraph admitting non-vanishing clustering coefficients it is convenient to employ the bipartite structure, similarly as in the case of a random intersection graph. 5
6 Given two collections of subsets S 1,..., S n and T 1,..., T n of a set W = {w 1,..., w m }, define the intersection digraph on a vertex set V = {v 1,..., v n } such that the arc v i v j is present in the digraph whenever S i T j for i j. Assuming that the sets S i and T i, i = 1,..., n, are drawn at random, one obtains a random intersection digraph (Bloznelis 2010a). For example, the set S i may be used to represent the set of papers (co-) authored by the i-th scientist, while T j may be the set of papers cited by the j- th scientist. Then the corresponding intersection digraph represents scholarly influences. For simplicity, one may consider the class of random intersection digraphs where the pairs of random subsets (S i, T i ), i = 1,..., n, are independent and identically distributed. In addition, we assume that the distributions of S i and T i are mixtures of uniform distributions. That is, for every k, conditionally on the event S i = k, the random set S i is uniformly distributed in the class W k of all subsets of W of size k. Similarly, conditionally on the event T i = k, the random set T i is uniformly distributed in W k. In particular, with P S and P T denoting the distributions of S i and T i, we have that, for every A W, P(S i = A) = ( ) m 1PS ( A ) and P(T A i = A) = ( m 1PT A ) ( A ). By D(n, m, P ) we denote the random intersection digraph generated by independent and identically distributed pairs of random subsets (S i, T i ), 1 i n, where P denotes the common distribution of pairs (S i, T i ). Random intersection digraphs D(n, m, P ) are flexible enough to model random digraphs with in- and outdegrees having some desired statistical properties as a power-law outdegree distribution and a bounded-support indegree distribution. Assuming, e.g., that S i and T i intersect with positive probability, one can obtain a random digraph with a clustering property (Bloznelis 2010a). 3 Relations between the models The theory of random graphs investigates asymptotic properties of random graph models, in particular properties of random intersection graphs. The following sets are examples of properties: B = B n consisting of all connected graphs on n vertices, C = C n consisting of all graphs on n vertices with maximal degree at most 6 or D = D n consisting of all graphs on n vertices which have a given degree distribution. If G B we say that G is connected and so on. Moreover A is called increasing (decreasing) if for every G with property A, G with added (deleted) any edge has property A. A property A which is either increasing or decreasing is called monotone. For instance B is increasing, C is decreasing and D is an intersection of one increasing and one decreasing property. Sometimes it is possible to compare graph models in order to deduce something about asymptotic (usually monotone) properties of one model using known results concerning the other one. The comparison technique is called coupling. It was used in Bloznelis et al to determine relationship between G s (n, m, δ d ), G s (n, m, p) and G s (n, m, P ). In particular it was shown that for any fixed s 1 and increasing property A, if ln n = o(m p) then for any integers 0 d m p t and m p + t d + m we have as n Pr ( G s (n, m, δ d ) A ) o(1) Pr ( G s (n, m, p) A ) Pr ( G s (n, m, δ d+ ) A ) + o(1). 6
7 Analogue inequalities hold for any decreasing property B. Informally speaking, the inequalities allow to show that for d mp and ln n = o(d) G s (n, m, δ d ) and G s (n, m, p) have the same monotone properties with probability tending to 1 as n. A similar theorem concerning more general G(n, m, P ) can be found in Bloznelis et al It would be convenient to find any such relation between random intersection graphs and well studied models such as the Erdős Rényi random graph G(n, ˆp), in which each edge appears independently with probability ˆp. For the inhomogeneous random intersection graph G x,y with x = (1, 1..., 1) and y = (p 1, p 2..., p m ), 0 p i 1 it is possible to define ˆp, such that for any increasing property A lim inf n Pr {G(n, ˆp) A} lim sup Pr {G x,y A)}. This and other relations between the random graph models are used in Rybarczyk 2011c, Rybarczyk 2013 to establish threshold functions in random intersection graphs for many monotone properties such as k-connectivity, Hamiltonicity and existance of a perfect matching. Some random graph models have the same asymptotic properties even though they are defined in different ways. We call such models equivalent. For example, for np small, the edges of G(n, m, p) appear almost independently. More precisely, in Fill et al. 2000, Rybarczyk 2011b, for p = o ((n 3 m) 1 ) there is ˆp such that for any property B n Pr {G(n, ˆp) B} a if and only if Pr {G(n, m, p) B} a. It is conjectured in Fill et al that the condition p = o ((n 3 m) 1 ) may be replaced by p = Ω(n 1 m 1/3 ) and p = O( ln n/m), and m = n α with α > 3. The conjecture is still open, however it is shown in Rybarczyk 2011b to be true for monotone properties. Acknowledgement. The work of M. Bloznelis and V. Kurauskas was supported by the Lithuanian Research Council (grant MIP 067/2013). J. Jaworski and K. Rybarczyk were supported by the National Science Centre DEC-2011/01/B/ST1/ Co-operation between E. Godehardt and J. Jaworski was also supported by Deutsche Forschungsgemeinschaft (grant no. GO 490/17 1). References BARBOUR, A.D. and REINERT, G. (2011): The shortest distance in random multitype intersection graphs, Random Structures and Algorithms, 39, BEHRISCH, M. (2007): Component evolution in random intersection graphs, The Electronic Journal of Combinatorics, 14(1). BLACKBURN, S. and GERKE, S. (2009): Connectivity of the uniform random intersection graph, Discrete Mathematics, 309, BLOZNELIS, M. (2008): Degree distribution of a typical vertex in a general random intersection graph, Lithuanian Mathematical Journal, 48,
8 BLOZNELIS, M. (2010a): A random intersection digraph: Indegree and outdegree distributions, Discrete Mathematics,310, BLOZNELIS, M. (2010b): Component evolution in general random intersection graphs, SIAM J. Discrete Math., 24, BLOZNELIS, M. (2010c): The largest component in an inhomogeneous random intersection graph with clustering, The Electronic Journal of Combinatorics 17(1), R110. BLOZNELIS, M. (2013): Degree and clustering coefficient in sparse random intersection graphs, The Annals of Applied Probability 23, BLOZNELIS, M. and DAMARACKAS, J. (2013): Degree distribution of an inhomogeneous random intersection graph, The Electronic Journal of Combinatorics, 20(3), R3. BLOZNELIS, M., GODEHARDT, E., JAWORSKI, J., KURAUSKAS, V., and RY- BARCZYK, K. (2015): Recent progress in complex network analysis properties of random intersection graphs, In: B. Lausen, S. Krolak-Schwerdt, and M. Boehmer (Eds.): European Conference on Data Analysis. Springer, Berlin Heidelberg New York, in this volume. BLOZNELIS, M., JAWORSKI, J. and KURAUSKAS, V. (2013): Assortativity and clustering of sparse random intersection graphs, Electronic Journal of Probability 18, N-38. BLOZNELIS, M., JAWORSKI, J. and RYBARCZYK, K. (2009): Component evolution in a secure wireless sensor network, Networks, 53(1), BLOZNELIS, M. and KAROŃSKI, M. (2013): Random intersection graph process, In: A. Bonato, M. Mitzenmacher, and P. Pralat (Eds.): WAW Algorithms and Models for the Web Graph. Lecture Notes in Computer Science Springer International Publishing, BLOZNELIS, M. and KURAUSKAS, V. (2012): Clustering function: a measure of social influence, BLOZNELIS, M. and LUCZAK, T. (2013): Perfect matchings in random intersection graphs, Acta Math. Hungar., 138, BRITTON, T., DEIJFEN, M., LINDHOLM, M. and LAGERÅS, N.A. (2008): Epidemics on random graphs with tunable clustering, J. Appl. Prob., 45, DEIJFEN, M. and KETS, W. (2009): Random intersection graphs with tunable degree distribution and clustering, Probab. Engrg. Inform. Sci., 23, ESCHENAUER, L. and GLIGOR, V.D. (2002): A key-management scheme for distributed sensor networks, in: Proceedings of the 9th ACM Conference on Computer and Communications Security,
9 FILL, J.A., SCHEINERMAN, E.R. and SINGER-COHEN, K.B. (2000): Random intersection graphs when m = ω(n): an equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models, Random Structures and Algorithms, 16, GODEHARDT, E. and JAWORSKI, J. (2001): Two models of random intersection graphs and their applications, Electronic Notes in Discrete Mathematics, 10, GODEHARDT, E. and JAWORSKI, J. (2003): Two models of random intersection graphs for classification. In: M. Schwaiger, and O. Opitz (Eds.): Exploratory Data Analysis in Empirical Research. Springer, Berlin Heidelberg New York, GODEHARDT, E., JAWORSKI, J. and RYBARCZYK, K. (2007): Random intersection graphs and classification. In: R. Decker, H.-J. Lenz (Eds.): Advances in Data Analysis. Springer, Berlin Heidelberg New York, GODEHARDT, E., JAWORSKI, J. and RYBARCZYK, K. (2012): Clustering coefficients of random intersection graphs, In: W. Gaul, A. Geier-Schulz, L. Schmidt-Thieme, J. Kunze (Eds.): Challenges at the Interface of Data Analysis, Computer Science, and Optimization. Springer, Berlin Heidelberg New York, GUILLAUME, J.L. and LATAPY, M. (2004): Bipartite structure of all complex networks, Inform. Process. Lett., 90, JAWORSKI, J., KAROŃSKI, M. and STARK, D. (2006): The degree of a typical vertex in generalized random intersection graph models, Discrete Mathematics, 306, JAWORSKI, J. and STARK, D. (2008): The vertex degree distribution of passive random intersection graph models, Combinatorics, Probability and Computing, 17, JOHNSON, J. R. and MARKSTRÖM, K. (2013): Turán and Ramsey properties of subcube intersection graphs, Combinatorics, Probability and Computing, 22(1), KAROŃSKI, M., SCHEINERMAN, E.R. and SINGER-COHEN,K.B. (1999): On random intersection graphs: The subgraph problem, Combinatorics, Probability and Computing, 8, LAGERÅS, A.N. and M. LINDHOLM, M. (2008): A note on the component structure in random intersection graphs with tunable clustering, Electronic Journal of Combinatorics, 15(1). MARTIN, T., BALL, B., KARRER, B. and NEWMAN, M.E.J. (2013): Coauthorship and citation in scientific publishing, ArXiv: v1. NEWMAN, M.E.J., WATTS, D.J. and STROGATZ, S.H. (2002): Random graph models of social networks, Proc. Natl. Acad. Sci. USA, 99 (Suppl. 1),
10 NIKOLETSEAS, S., RAPTOPOULOS, C. and SPIRAKIS, P. (2004): The existence and efficient construction of large independent sets in general random intersection graphs. In. J. Daz, J. Karhumki, A. Lepist and D. Sannella (Eds.): ICALP (Lecture Notes in Computer Science, Vol Springer, Berlin, NIKOLETSEAS, S., RAPTOPOULOS, C. and SPIRAKIS, P. (2008): Large independent sets in general random intersection graphs, Theoretical Computer Science, 406, NIKOLETSEAS, S., RAPTOPOULOS, C. and SPIRAKIS, P.G. (2011): On the independence number and Hamiltonicity of uniform random intersection graphs, Theoretical Computer Science, 412, RYBARCZYK, K. (2011a): Diameter, connectivity, and phase transition of the uniform random intersection graph, Discrete Mathematics, 311, RYBARCZYK, K. (2011b): Equivalence of the random intersection graph and G(n, p), Random Structures and Algorithms, 38, RYBARCZYK, K. (2011c): Sharp threshold functions for random intersection graphs via a coupling method, The Electronic Journal of Combinatorics, 18(1), P36. RYBARCZYK, K. (2012): The degree distribution in random intersection graphs. In: W. Gaul, A. Geier-Schulz, L. Schmidt-Thieme, J. Kunze (Eds.): Challenges at the Interface of Data Analysis, Computer Science, and Optimization. Springer, Berlin Heidelberg New York, RYBARCZYK, K. (2013): The coupling method for inhomogeneous random intersection graphs, arxiv: SHANG, Y. (2010): Degree distributions in general random intersection graphs, The Electronical Journal of Combinatorics 17, #R23. STARK, D. (2004): The vertex degree distribution of random intersection graphs, Random Structures and Algorithms, 24, STROGATZ, S.H. and WATTS, D.J. (1998): Collective dynamics of small-world networks, Nature, 393, YAGAN, O. and MAKOWSKI, A.M. (2009): Random key graphs can they be small worlds? In: 2009 First International Conference on Networks & Communications,
Graphs over Time Densification Laws, Shrinking Diameters and Possible Explanations
Graphs over Time Densification Laws, Shrinking Diameters and Possible Explanations Jurij Leskovec, CMU Jon Kleinberg, Cornell Christos Faloutsos, CMU 1 Introduction What can we do with graphs? What patterns
More informationComplex Networks Analysis: Clustering Methods
Complex Networks Analysis: Clustering Methods Nikolai Nefedov Spring 2013 ISI ETH Zurich nefedov@isi.ee.ethz.ch 1 Outline Purpose to give an overview of modern graph-clustering methods and their applications
More informationGeneral Network Analysis: Graph-theoretic. COMP572 Fall 2009
General Network Analysis: Graph-theoretic Techniques COMP572 Fall 2009 Networks (aka Graphs) A network is a set of vertices, or nodes, and edges that connect pairs of vertices Example: a network with 5
More informationGraph models for the Web and the Internet. Elias Koutsoupias University of Athens and UCLA. Crete, July 2003
Graph models for the Web and the Internet Elias Koutsoupias University of Athens and UCLA Crete, July 2003 Outline of the lecture Small world phenomenon The shape of the Web graph Searching and navigation
More informationThe average distances in random graphs with given expected degrees
Classification: Physical Sciences, Mathematics The average distances in random graphs with given expected degrees by Fan Chung 1 and Linyuan Lu Department of Mathematics University of California at San
More informationA discussion of Statistical Mechanics of Complex Networks P. Part I
A discussion of Statistical Mechanics of Complex Networks Part I Review of Modern Physics, Vol. 74, 2002 Small Word Networks Clustering Coefficient Scale-Free Networks Erdös-Rényi model cover only parts
More informationNetwork/Graph Theory. What is a Network? What is network theory? Graph-based representations. Friendship Network. What makes a problem graph-like?
What is a Network? Network/Graph Theory Network = graph Informally a graph is a set of nodes joined by a set of lines or arrows. 1 1 2 3 2 3 4 5 6 4 5 6 Graph-based representations Representing a problem
More informationMean Ramsey-Turán numbers
Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average
More informationBig Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network
, pp.273-284 http://dx.doi.org/10.14257/ijdta.2015.8.5.24 Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network Gengxin Sun 1, Sheng Bin 2 and
More informationON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME
ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME Alexey Chuprunov Kazan State University, Russia István Fazekas University of Debrecen, Hungary 2012 Kolchin s generalized allocation scheme A law of
More informationRandom graphs with a given degree sequence
Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.
More informationAn Empirical Study of Two MIS Algorithms
An Empirical Study of Two MIS Algorithms Email: Tushar Bisht and Kishore Kothapalli International Institute of Information Technology, Hyderabad Hyderabad, Andhra Pradesh, India 32. tushar.bisht@research.iiit.ac.in,
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
More informationA scalable multilevel algorithm for graph clustering and community structure detection
A scalable multilevel algorithm for graph clustering and community structure detection Hristo N. Djidjev 1 Los Alamos National Laboratory, Los Alamos, NM 87545 Abstract. One of the most useful measures
More informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
More informationGraphical degree sequences and realizations
swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS - Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös
More informationUSING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS
USING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS Natarajan Meghanathan Jackson State University, 1400 Lynch St, Jackson, MS, USA natarajan.meghanathan@jsums.edu
More informationIntroduction to Networks and Business Intelligence
Introduction to Networks and Business Intelligence Prof. Dr. Daning Hu Department of Informatics University of Zurich Sep 17th, 2015 Outline Network Science A Random History Network Analysis Network Topological
More informationCluster detection algorithm in neural networks
Cluster detection algorithm in neural networks David Meunier and Hélène Paugam-Moisy Institute for Cognitive Science, UMR CNRS 5015 67, boulevard Pinel F-69675 BRON - France E-mail: {dmeunier,hpaugam}@isc.cnrs.fr
More informationFrom Random Graphs to Complex Networks:
Unterschrift des Betreuers DIPLOMARBEIT From Random Graphs to Complex Networks: A Modelling Approach Ausgeführt am Institut für Diskrete Mathematik und Geometrie der Technischen Universität Wien unter
More informationSocial Media Mining. Graph Essentials
Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures
More informationFinding and counting given length cycles
Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected
More informationChapter 29 Scale-Free Network Topologies with Clustering Similar to Online Social Networks
Chapter 29 Scale-Free Network Topologies with Clustering Similar to Online Social Networks Imre Varga Abstract In this paper I propose a novel method to model real online social networks where the growing
More informationHigh degree graphs contain large-star factors
High degree graphs contain large-star factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a
More informationApproximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and Hing-Fung Ting 2 1 College of Mathematics and Computer Science, Hebei University,
More informationLarge induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
More informationGraph theoretic approach to analyze amino acid network
Int. J. Adv. Appl. Math. and Mech. 2(3) (2015) 31-37 (ISSN: 2347-2529) Journal homepage: www.ijaamm.com International Journal of Advances in Applied Mathematics and Mechanics Graph theoretic approach to
More informationOpen Access Research on Application of Neural Network in Computer Network Security Evaluation. Shujuan Jin *
Send Orders for Reprints to reprints@benthamscience.ae 766 The Open Electrical & Electronic Engineering Journal, 2014, 8, 766-771 Open Access Research on Application of Neural Network in Computer Network
More informationAn Introduction to APGL
An Introduction to APGL Charanpal Dhanjal February 2012 Abstract Another Python Graph Library (APGL) is a graph library written using pure Python, NumPy and SciPy. Users new to the library can gain an
More informationOn an anti-ramsey type result
On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element
More informationEffects of node buffer and capacity on network traffic
Chin. Phys. B Vol. 21, No. 9 (212) 9892 Effects of node buffer and capacity on network traffic Ling Xiang( 凌 翔 ) a), Hu Mao-Bin( 胡 茂 彬 ) b), and Ding Jian-Xun( 丁 建 勋 ) a) a) School of Transportation Engineering,
More informationBest Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
More informationCycles and clique-minors in expanders
Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor
More informationModelingandSimulationofthe OpenSourceSoftware Community
ModelingandSimulationofthe OpenSourceSoftware Community Yongqin Gao, GregMadey Departmentof ComputerScience and Engineering University ofnotre Dame ygao,gmadey@nd.edu Vince Freeh Department of ComputerScience
More informationA Brief Introduction to Property Testing
A Brief Introduction to Property Testing Oded Goldreich Abstract. This short article provides a brief description of the main issues that underly the study of property testing. It is meant to serve as
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationRandom graphs and complex networks
Random graphs and complex networks Remco van der Hofstad Honours Class, spring 2008 Complex networks Figure 2 Ye a s t p ro te in in te ra c tio n n e tw o rk. A m a p o f p ro tein p ro tein in tera c
More informationSome questions... Graphs
Uni Innsbruck Informatik - 1 Uni Innsbruck Informatik - 2 Some questions... Peer-to to-peer Systems Analysis of unstructured P2P systems How scalable is Gnutella? How robust is Gnutella? Why does FreeNet
More informationOn Integer Additive Set-Indexers of Graphs
On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that
More informationOn the k-path cover problem for cacti
On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we
More informationON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction
ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
More informationWORKSHOP Analisi delle Reti Sociali per conoscere uno strumento uno strumento per conoscere
Università di Salerno WORKSHOP Analisi delle Reti Sociali per conoscere uno strumento uno strumento per conoscere The scientific collaboration network of the University of Salerno Michele La Rocca, Giuseppe
More informationCycle transversals in bounded degree graphs
Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.
More informationGENERATING AN ASSORTATIVE NETWORK WITH A GIVEN DEGREE DISTRIBUTION
International Journal of Bifurcation and Chaos, Vol. 18, o. 11 (2008) 3495 3502 c World Scientific Publishing Company GEERATIG A ASSORTATIVE ETWORK WITH A GIVE DEGREE DISTRIBUTIO JI ZHOU, XIAOKE XU, JIE
More informationExpander Graph based Key Distribution Mechanisms in Wireless Sensor Networks
Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks Seyit Ahmet Çamtepe Computer Science Department Rensselaer Polytechnic Institute Troy, New York 12180 Email: camtes@cs.rpi.edu
More informationCommunity Detection Proseminar - Elementary Data Mining Techniques by Simon Grätzer
Community Detection Proseminar - Elementary Data Mining Techniques by Simon Grätzer 1 Content What is Community Detection? Motivation Defining a community Methods to find communities Overlapping communities
More informationCOUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS
COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics
More informationON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER
Séminaire Lotharingien de Combinatoire 53 (2006), Article B53g ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER RON M. ADIN AND YUVAL ROICHMAN Abstract. For a permutation π in the symmetric group
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Oriented Network Evolution Mechanism for Online Communities Caihong Sun and Xiaoping Yang School of Information, Renmin University of China, Beijing 100872, P.R. China {chsun.vang> @ruc.edu.cn
More informationPUBLIC TRANSPORT SYSTEMS IN POLAND: FROM BIAŁYSTOK TO ZIELONA GÓRA BY BUS AND TRAM USING UNIVERSAL STATISTICS OF COMPLEX NETWORKS
Vol. 36 (2005) ACTA PHYSICA POLONICA B No 5 PUBLIC TRANSPORT SYSTEMS IN POLAND: FROM BIAŁYSTOK TO ZIELONA GÓRA BY BUS AND TRAM USING UNIVERSAL STATISTICS OF COMPLEX NETWORKS Julian Sienkiewicz and Janusz
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationCSC2420 Fall 2012: Algorithm Design, Analysis and Theory
CSC2420 Fall 2012: Algorithm Design, Analysis and Theory Allan Borodin November 15, 2012; Lecture 10 1 / 27 Randomized online bipartite matching and the adwords problem. We briefly return to online algorithms
More informationIntroduced by Stuart Kauffman (ca. 1986) as a tunable family of fitness landscapes.
68 Part II. Combinatorial Models can require a number of spin flips that is exponential in N (A. Haken et al. ca. 1989), and that one can in fact embed arbitrary computations in the dynamics (Orponen 1995).
More informationThe Topology of Large-Scale Engineering Problem-Solving Networks
The Topology of Large-Scale Engineering Problem-Solving Networks by Dan Braha 1, 2 and Yaneer Bar-Yam 2, 3 1 Faculty of Engineering Sciences Ben-Gurion University, P.O.Box 653 Beer-Sheva 84105, Israel
More informationAccounting for Degree Distributions in Empirical Analysis of Network Dynamics
Accounting for Degree Distributions in Empirical Analysis of Network Dynamics Tom A.B. Snijders University of Groningen December 2002 Abstract Degrees (the number of links attached to a given node) play
More information! E6893 Big Data Analytics Lecture 10:! Linked Big Data Graph Computing (II)
E6893 Big Data Analytics Lecture 10: Linked Big Data Graph Computing (II) Ching-Yung Lin, Ph.D. Adjunct Professor, Dept. of Electrical Engineering and Computer Science Mgr., Dept. of Network Science and
More informationCOMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationPractical Graph Mining with R. 5. Link Analysis
Practical Graph Mining with R 5. Link Analysis Outline Link Analysis Concepts Metrics for Analyzing Networks PageRank HITS Link Prediction 2 Link Analysis Concepts Link A relationship between two entities
More informationMining Social-Network Graphs
342 Chapter 10 Mining Social-Network Graphs There is much information to be gained by analyzing the large-scale data that is derived from social networks. The best-known example of a social network is
More informationComplex Network Visualization based on Voronoi Diagram and Smoothed-particle Hydrodynamics
Complex Network Visualization based on Voronoi Diagram and Smoothed-particle Hydrodynamics Zhao Wenbin 1, Zhao Zhengxu 2 1 School of Instrument Science and Engineering, Southeast University, Nanjing, Jiangsu
More informationMining Social Network Graphs
Mining Social Network Graphs Debapriyo Majumdar Data Mining Fall 2014 Indian Statistical Institute Kolkata November 13, 17, 2014 Social Network No introduc+on required Really? We s7ll need to understand
More informationGraph Mining Techniques for Social Media Analysis
Graph Mining Techniques for Social Media Analysis Mary McGlohon Christos Faloutsos 1 1-1 What is graph mining? Extracting useful knowledge (patterns, outliers, etc.) from structured data that can be represented
More informationTesting Hereditary Properties of Non-Expanding Bounded-Degree Graphs
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs Artur Czumaj Asaf Shapira Christian Sohler Abstract We study graph properties which are testable for bounded degree graphs in time independent
More informationOn-line Ramsey numbers
On-line Ramsey numbers David Conlon Abstract Consider the following game between two players, Builder and Painter Builder draws edges one at a time and Painter colours them, in either red or blue, as each
More informationInduced subgraphs of Ramsey graphs with many distinct degrees
Journal of Combinatorial Theory, Series B 97 (2007) 62 69 www.elsevier.com/locate/jctb Induced subgraphs of Ramsey graphs with many distinct degrees Boris Bukh a, Benny Sudakov a,b a Department of Mathematics,
More informationEmbedding nearly-spanning bounded degree trees
Embedding nearly-spanning bounded degree trees Noga Alon Michael Krivelevich Benny Sudakov Abstract We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of
More informationA generalized allocation scheme
Annales Mathematicae et Informaticae 39 (202) pp. 57 70 Proceedings of the Conference on Stochastic Models and their Applications Faculty of Informatics, University of Debrecen, Debrecen, Hungary, August
More informationDistributed Computing over Communication Networks: Maximal Independent Set
Distributed Computing over Communication Networks: Maximal Independent Set What is a MIS? MIS An independent set (IS) of an undirected graph is a subset U of nodes such that no two nodes in U are adjacent.
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationGraphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
More informationIdentity Obfuscation in Graphs Through the Information Theoretic Lens
Identity Obfuscation in Graphs Through the Information Theoretic Lens Francesco Bonchi #1, Aristides Gionis #2, Tamir Tassa 3 # Yahoo! Research, Barcelona, Spain 1 bonchi@yahoo-inc.com 2 gionis@yahoo-inc.com
More informationNETZCOPE - a tool to analyze and display complex R&D collaboration networks
The Task Concepts from Spectral Graph Theory EU R&D Network Analysis Netzcope Screenshots NETZCOPE - a tool to analyze and display complex R&D collaboration networks L. Streit & O. Strogan BiBoS, Univ.
More informationThe positive minimum degree game on sparse graphs
The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University
More informationGraph Theory and Networks in Biology
Graph Theory and Networks in Biology Oliver Mason and Mark Verwoerd March 14, 2006 Abstract In this paper, we present a survey of the use of graph theoretical techniques in Biology. In particular, we discuss
More informationV. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005
V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer
More informationMathematics for Algorithm and System Analysis
Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface
More informationOnline Estimating the k Central Nodes of a Network
Online Estimating the k Central Nodes of a Network Yeon-sup Lim, Daniel S. Menasché, Bruno Ribeiro, Don Towsley, and Prithwish Basu Department of Computer Science UMass Amherst, Raytheon BBN Technologies
More informationOnline Social Networks and Network Economics. Aris Anagnostopoulos, Online Social Networks and Network Economics
Online Social Networks and Network Economics Who? Dr. Luca Becchetti Prof. Elias Koutsoupias Prof. Stefano Leonardi What will We Cover? Possible topics: Structure of social networks Models for social networks
More informationExponential time algorithms for graph coloring
Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].
More informationSPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE
SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE 2012 SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH (M.Sc., SFU, Russia) A THESIS
More informationBOUNDARY EDGE DOMINATION IN GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 0-4874, ISSN (o) 0-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 197-04 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA
More informationGraph Security Testing
JOURNAL OF APPLIED COMPUTER SCIENCE Vol. 23 No. 1 (2015), pp. 29-45 Graph Security Testing Tomasz Gieniusz 1, Robert Lewoń 1, Michał Małafiejski 1 1 Gdańsk University of Technology, Poland Department of
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More informationOptimal Index Codes for a Class of Multicast Networks with Receiver Side Information
Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information Lawrence Ong School of Electrical Engineering and Computer Science, The University of Newcastle, Australia Email: lawrence.ong@cantab.net
More informationA mixture model for random graphs
A mixture model for random graphs J-J Daudin, F. Picard, S. Robin robin@inapg.inra.fr UMR INA-PG / ENGREF / INRA, Paris Mathématique et Informatique Appliquées Examples of networks. Social: Biological:
More informationTemporal Dynamics of Scale-Free Networks
Temporal Dynamics of Scale-Free Networks Erez Shmueli, Yaniv Altshuler, and Alex Sandy Pentland MIT Media Lab {shmueli,yanival,sandy}@media.mit.edu Abstract. Many social, biological, and technological
More informationarxiv:physics/0601033 v1 6 Jan 2006
Analysis of telephone network traffic based on a complex user network Yongxiang Xia, Chi K. Tse, Francis C. M. Lau, Wai Man Tam, Michael Small arxiv:physics/0601033 v1 6 Jan 2006 Department of Electronic
More informationRamsey numbers for bipartite graphs with small bandwidth
Ramsey numbers for bipartite graphs with small bandwidth Guilherme O. Mota 1,, Gábor N. Sárközy 2,, Mathias Schacht 3,, and Anusch Taraz 4, 1 Instituto de Matemática e Estatística, Universidade de São
More informationScale-free user-network approach to telephone network traffic analysis
Scale-free user-network approach to telephone network traffic analysis Yongxiang Xia,* Chi K. Tse, WaiM.Tam, Francis C. M. Lau, and Michael Small Department of Electronic and Information Engineering, Hong
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationNetwork Theory: 80/20 Rule and Small Worlds Theory
Scott J. Simon / p. 1 Network Theory: 80/20 Rule and Small Worlds Theory Introduction Starting with isolated research in the early twentieth century, and following with significant gaps in research progress,
More informationAnalysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs
Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs Stavros Athanassopoulos, Ioannis Caragiannis, and Christos Kaklamanis Research Academic Computer Technology Institute
More informationProduct irregularity strength of certain graphs
Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer
More informationRouting on a weighted scale-free network
Physica A 387 (2008) 4967 4972 Contents lists available at ScienceDirect Physica A journal homepage: www.elsevier.com/locate/physa Routing on a weighted scale-free network Mao-Bin Hu a,b,, Rui Jiang a,
More informationThe Open University s repository of research publications and other research outputs
Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
More informationOPTIMAL DESIGN OF DISTRIBUTED SENSOR NETWORKS FOR FIELD RECONSTRUCTION
OPTIMAL DESIGN OF DISTRIBUTED SENSOR NETWORKS FOR FIELD RECONSTRUCTION Sérgio Pequito, Stephen Kruzick, Soummya Kar, José M. F. Moura, A. Pedro Aguiar Department of Electrical and Computer Engineering
More informationCacti with minimum, second-minimum, and third-minimum Kirchhoff indices
MATHEMATICAL COMMUNICATIONS 47 Math. Commun., Vol. 15, No. 2, pp. 47-58 (2010) Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices Hongzhuan Wang 1, Hongbo Hua 1, and Dongdong Wang
More informationDiscrete Applied Mathematics. The firefighter problem with more than one firefighter on trees
Discrete Applied Mathematics 161 (2013) 899 908 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The firefighter problem with
More information