DOCSLIB.ORG

Random Graph Models

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Random Graph Models Random graph models References The best reference for this chapter that fits very well into this course mindset is: Barabási et al.(2016). Note that an online and interactive version is available at: http://networksciencebook.com/. Other good references for this chapter are (by order of relevance): Hofstad(2016), Durrett(2007), and Chung and Lu(2006). Other traditional books (but heavier on the maths side) written by "big names" of the field are Janson et al.(2011) and Bollobás(1998). 1.1 Some reminders 1.1.1 Probability toolbox Proposition 1.1.1. • For a; b constants, E(aX + b) = aE(X) + b • E(X1 + ··· + Xm) = E(X1) + ··· + E(Xm); • Let X be a r.v., A an event and 1A(X) the indicator that event is realized by X. Then: E 1A(X) = Pr(X 2 A): 2 Definition 1.1.2. Var(X) = E X − E(X) . Proposition 1.1.3. • Var(X) = E(X2) − (E(X))2; • For a; b constants, Var(aX + b) = a2 Var(X) • If X1;:::;Xm are mutually independent r.v., then Var(X1 + ··· + Xm) = Var(X1) + ··· + Var(Xm). • If we don’t have this independence, then Var(X1 +···+Xm) = Var(X1)+···+ P Var(Xm) + i6=j Cov(Xi;Xj), where Cov(Xi;Xj) = E(XiXj) − E(Xi)E(Xj). 1.1.2 Basic probability laws Definition 1.1.4. Let X be a random variable. We say X is generated around a Bernoulli law of parameter p 2 [0; 1], and denote X ∼ Ber(p) if: 1. X takes values in f0; 1g (almost surely); 2. Pr(X = 1) = p and Pr(X = 0) = 1 − p. 1 1.1. SOME REMINDERS Example 1.1.5. A Ber(p) model the result when we biased coin toss (p is the probability of winning the coin toss). Proposition 1.1.6. Let X ∼ Ber(p). We have EX = p and Var X = p(1 − p). Definition 1.1.7. The binomial distribution with parameters and p, denoted Bin(n; p), is the discrete probability distribution of the number of successes in a sequence of n independent Bernoulli trials of parameters p. Proposition 1.1.8. If (Xi)i=1;:::;n is a sequence of n i.i.d. random variable dis- P tributed according to Ber(p), then i Xi ∼ Bin(n; p). n Corollary 1.1.9. Let X ∼ Bin(n; p). Then: Pr(X = k) = pk(1 − p)n−k. k Moreover, EX = np and Var X = np(1 − p). Definition 1.1.10. The geometric distribution of parameter p, denoted Geo(p) is the probability of the number of Bernoulli trials (of parameter p) needed to get one success. In particular, if X ∼ Geo(p), then Pr(X = k) = (1 − p)k−1p. 1 1 − p Exercise 1.1.11. Let X ∼ Geo(p). Show that X = and Var p = . E p p2 1.1.3 Concentration of random variables First moment inequalities Proposition 1.1.12 (Markov’s inequality). Let X be a random variable, with pos- itive values, and a 2 R. We have: X Pr X ≥ a ≤ E : a Proof. EX ≥ E X1X≥a ≥ aE 1X≥a = a Pr X ≥ a : 1 Remark 1.1.13. By letting a = t X, we obtain Pr(X ≥ t X) ≤ . The con- E E t vergence speed in 1=t is rather slow, and depending on the situations might not be strong enough. Corollary 1.1.14 (First moment method). Let X be a positive, integer valued ran- dom variable. We have: Pr(X 6= 0) ≤ E(X): The first moment is an upper bound on the probability that a integer random variable is not equal to zero. Proof. Since X is integer valued, we have Pr(X 6= 0) = Pr(X > 0) = Pr(X ≥ 1), and from there we can use Markov inequality. 2 Maximilien Dreveton CHAPTER 1. RANDOM GRAPH MODELS Application 1.1.15 (Union bound). Let A1;:::;Am be a collection of events. Then, m X Pr(A1 [···[ An) ≤ Pr(Ai): i=1 Pm This can be shown by using the first moment method on X = i=1 1Ai and observe that fX > 0g = A1 [···[ Am. Remark 1.1.16. The first moment method is generally used when we have a se- quence of integer, positive r.v. Xn such that EXn ! 0. In that case, Xn ! 0 almost surely. Remark 1.1.17. We could think that, if EXn ! +1, then Pr(Xn > 0) ! 1, but this isn’t true, as the next example shows. 2 Example 1.1.18. Let’s take Xn such that Xn = n with probability 1=n and Xn = 0 otherwise. Then E(Xn) = n ! +1 but Xn ! 0. Loosely speaking, this can happen because the variance of X is very large. Second moment inequalities Proposition 1.1.19 (Chebyshev’s inequality). Let X be a random variable, and a > 0. We have: Var X Pr X − X ≥ a ≤ : E a2 Proof. Markov inequality to Y = (X − EX)2. r 2 Example 1.1.20. Let X be Gaussian N (0; σ2). Then jXj = σ . Markov E π applied to jXj gives us: r 2 σ P r(X ≥ a) ≤ ; π b while Chebyshev gives: σ 2 Pr(X ≥ a) ≤ : a If a is large, Chebyshev gives a stronger bound. Application 1.1.21 (Weak law of Large Numbers). X1;:::Xn be independent r.v. with mean µ and variance σ2 < +1. Then: X + ··· + X Pr 1 n − µ > ! 0: n Actually, with extra work, the condition σ2 < +1 isn’t needed. With lot of extra work, we can show that the convergence is almost surely (and not in probability, as we have here). X + ··· + X Proof. Chebychev at U := 1 n , which has a mean µ and variance σ2 n n gives: σ2 Pr jU j ≥ ≤ ! 0 n n2 Maximilien Dreveton 3 1.1. SOME REMINDERS Corollary 1.1.22 (Second moment method). Let X be a positive random variable. We have: Var X (X2) Pr X = 0 ≤ = E − 1: 2 2 EX (EX ) Proof. Chebychev with a = EX. Var X Pr X = 0 ≤ Pr X − X ≥ X ≤ : E E 2 EX The first inequality comes from X − EX ≥ EX ) X ≤ 0 or X ≥ 2EX. Concentration sum of i.i.d. random variables Proposition 1.1.23 (Hoeffding’s inequality). Let Xi be some independent random Pn values, such that ai ≤ Xi ≤ bi, and Sn = i=1 Xi. For t > 0, we have: 2t2 Pr S ≥ S + t ≤ exp − ; n E n P 2 i(bi − ai) 2t2 Pr S ≥ S − t ≤ exp − ; n E n P 2 i(bi − ai) 2t2 Pr jS − S j ≥ t ≤ 2 exp − : n E n P 2 i(bi − ai) More details about concentration inequalities can be found in the chapter 2 of Vershynin(2018). 1.1.4 Exercises Exercise 1.1.24. Let throw m balls into n bins. What can we say about the probability that one bin is empty: 1. If m = (1 + )n log n; 2. If m = (1 − )n log n. Exercise 1.1.25. 1. What’s the ‘typical’ position of a simple random walk after n steps? 2. What’s the longest run of Heads in n flips of a fair coin? 3. What is the maximum of n independent standard normal RV’s? 1.1.5 Graph Theory Definition, vocabulary Definition 1.1.26. A graph G is a pair (V; E), where V is a (finite) set, whose elements are called nodes (or vertices, or points) and E is a set of ordered node pairs called edges (or links, lines, bonds). Some vocabulary: 4 Maximilien Dreveton CHAPTER 1. RANDOM GRAPH MODELS • If (ij) 2 E () (ji) 2 E, the graph is said undirected. (It means that if there is a link going from i to j, there exists the same link in opposite direction). • If for all nodes i, (ii) 62 E, we say there is no self-loops. Definition 1.1.27. • We call path of G of length k a sequence e1; : : : ; ek of edges ei = (vi−1; vi) where the vi are distinct vertices. • A k-cycle is a path of legnth k that starts and ends at the same vertex. • Let suppose G is undirected. We say that two nodes u; v are connected if there exists a path going from u to v. We note u $ v. Proposition 1.1.28. $ is an equivalence relationship. In particular, we can par- tition the nodes into equivalent classes, that we will call connected components. Proof. We have u $ u (path of length 0), if u $ v and v $ z, then u $ z (by combining the two paths; transitivity). Finally, u $ v implies v $ u (the same path, on the opposite direction; symmetry). Definition 1.1.29. If G has only one equivalent class under the relation $, we say G is connected. We say G is disconnected otherwise. In particular, if a graph is connected, it means for every node i and j, there exists a path going from i to j. Definition 1.1.30. Let i; j be two nodes. We call the distance between i and j, and denote d(i; j) the length of the shortest path between i and j. If i 6$ j, then d(i; j) := +1. Definition 1.1.31 (Diameter). We call diameter of a graph the largest distance between any pair of connected vertices. Graph Theory and Linear Algebra Definition 1.1.32. We call adjacency matrix (denoted by A), the binary matrix such that Aij = 1 iff (ij) 2 E.
Load more

Recommended publications
  • Basic Models and Questions in Statistical Network Analysis
    Basic models and questions in statistical network analysis Mikl´osZ. R´acz ∗ with S´ebastienBubeck y September 12, 2016 Abstract Extracting information from large graphs has become an important statistical problem since network data is now common in various fields. In this minicourse we will investigate the most natural statistical questions for three canonical probabilistic models of networks: (i) community detection in the stochastic block model, (ii) finding the embedding of a random geometric graph, and (iii) finding the original vertex in a preferential attachment tree. Along the way we will cover many interesting topics in probability theory such as P´olya urns, large deviation theory, concentration of measure in high dimension, entropic central limit theorems, and more. Outline: • Lecture 1: A primer on exact recovery in the general stochastic block model. • Lecture 2: Estimating the dimension of a random geometric graph on a high-dimensional sphere. • Lecture 3: Introduction to entropic central limit theorems and a proof of the fundamental limits of dimension estimation in random geometric graphs. • Lectures 4 & 5: Confidence sets for the root in uniform and preferential attachment trees. Acknowledgements These notes were prepared for a minicourse presented at University of Washington during June 6{10, 2016, and at the XX Brazilian School of Probability held at the S~aoCarlos campus of Universidade de S~aoPaulo during July 4{9, 2016. We thank the organizers of the Brazilian School of Probability, Paulo Faria da Veiga, Roberto Imbuzeiro Oliveira, Leandro Pimentel, and Luiz Renato Fontes, for inviting us to present a minicourse on this topic. We also thank Sham Kakade, Anna Karlin, and Marina Meila for help with organizing at University of Washington.
    [Show full text]
  • Networkx Reference Release 1.9.1
    NetworkX Reference Release 1.9.1 Aric Hagberg, Dan Schult, Pieter Swart September 20, 2014 CONTENTS 1 Overview 1 1.1 Who uses NetworkX?..........................................1 1.2 Goals...................................................1 1.3 The Python programming language...................................1 1.4 Free software...............................................2 1.5 History..................................................2 2 Introduction 3 2.1 NetworkX Basics.............................................3 2.2 Nodes and Edges.............................................4 3 Graph types 9 3.1 Which graph class should I use?.....................................9 3.2 Basic graph types.............................................9 4 Algorithms 127 4.1 Approximation.............................................. 127 4.2 Assortativity............................................... 132 4.3 Bipartite................................................. 141 4.4 Blockmodeling.............................................. 161 4.5 Boundary................................................. 162 4.6 Centrality................................................. 163 4.7 Chordal.................................................. 184 4.8 Clique.................................................. 187 4.9 Clustering................................................ 190 4.10 Communities............................................... 193 4.11 Components............................................... 194 4.12 Connectivity..............................................
    [Show full text]
  • Latent Distance Estimation for Random Geometric Graphs ∗
    Latent Distance Estimation for Random Geometric Graphs ∗ Ernesto Araya Valdivia Laboratoire de Math´ematiquesd'Orsay (LMO) Universit´eParis-Sud 91405 Orsay Cedex France Yohann De Castro Ecole des Ponts ParisTech-CERMICS 6 et 8 avenue Blaise Pascal, Cit´eDescartes Champs sur Marne, 77455 Marne la Vall´ee,Cedex 2 France Abstract: Random geometric graphs are a popular choice for a latent points generative model for networks. Their definition is based on a sample of n points X1;X2; ··· ;Xn on d−1 the Euclidean sphere S which represents the latent positions of nodes of the network. The connection probabilities between the nodes are determined by an unknown function (referred to as the \link" function) evaluated at the distance between the latent points. We introduce a spectral estimator of the pairwise distance between latent points and we prove that its rate of convergence is the same as the nonparametric estimation of a d−1 function on S , up to a logarithmic factor. In addition, we provide an efficient spectral algorithm to compute this estimator without any knowledge on the nonparametric link function. As a byproduct, our method can also consistently estimate the dimension d of the latent space. MSC 2010 subject classifications: Primary 68Q32; secondary 60F99, 68T01. Keywords and phrases: Graphon model, Random Geometric Graph, Latent distances estimation, Latent position graph, Spectral methods. 1. Introduction Random geometric graph (RGG) models have received attention lately as alternative to some simpler yet unrealistic models as the ubiquitous Erd¨os-R´enyi model [11]. They are generative latent point models for graphs, where it is assumed that each node has associated a latent d point in a metric space (usually the Euclidean unit sphere or the unit cube in R ) and the connection probability between two nodes depends on the position of their associated latent points.
    [Show full text]
  • Analyzing Social Media Network for Students in Presidential Election 2019 with Nodexl
    ANALYZING SOCIAL MEDIA NETWORK FOR STUDENTS IN PRESIDENTIAL ELECTION 2019 WITH NODEXL Irwan Dwi Arianto Doctoral Candidate of Communication Sciences, Airlangga University Corresponding Authors: [email protected] Abstract. Twitter is widely used in digital political campaigns. Twitter as a social media that is useful for building networks and even connecting political participants with the community. Indonesia will get a demographic bonus starting next year until 2030. The number of productive ages that will become a demographic bonus if not recognized correctly can be a problem. The election organizer must seize this opportunity for the benefit of voter participation. This study aims to describe the network structure of students in the 2019 presidential election. The first debate was held on January 17, 2019 as a starting point for data retrieval on Twitter social media. This study uses data sources derived from Twitter talks from 17 January 2019 to 20 August 2019 with keywords “#pilpres2019 OR #mahasiswa since: 2019-01-17”. The data obtained were analyzed by the communication network analysis method using NodeXL software. Our Analysis found that Top Influencer is @jokowi, as well as Top, Mentioned also @jokowi while Top Tweeters @okezonenews and Top Replied-To @hasmi_bakhtiar. Jokowi is incumbent running for re-election with Ma’ruf Amin (Senior Muslim Cleric) as his running mate against Prabowo Subianto (a former general) and Sandiaga Uno as his running mate (former vice governor). This shows that the more concentrated in the millennial generation in this case students are presidential candidates @jokowi. @okezonenews, the official twitter account of okezone.com (MNC Media Group).
    [Show full text]
  • The Domination Number of On-Line Social Networks and Random Geometric Graphs?
    The domination number of on-line social networks and random geometric graphs? Anthony Bonato1, Marc Lozier1, Dieter Mitsche2, Xavier P´erez-Gim´enez1, and Pawe lPra lat1 1 Ryerson University, Toronto, Canada, [email protected], [email protected], [email protected], [email protected] 2 Universit´ede Nice Sophia-Antipolis, Nice, France [email protected] Abstract. We consider the domination number for on-line social networks, both in a stochastic net- work model, and for real-world, networked data. Asymptotic sublinear bounds are rigorously derived for the domination number of graphs generated by the memoryless geometric protean random graph model. We establish sublinear bounds for the domination number of graphs in the Facebook 100 data set, and these bounds are well-correlated with those predicted by the stochastic model. In addition, we derive the asymptotic value of the domination number in classical random geometric graphs. 1. Introduction On-line social networks (or OSNs) such as Facebook have emerged as a hot topic within the network science community. Several studies suggest OSNs satisfy many properties in common with other complex networks, such as: power-law degree distributions [2, 13], high local cluster- ing [36], constant [36] or even shrinking diameter with network size [23], densification [23], and localized information flow bottlenecks [12, 24]. Several models were designed to simulate these properties [19, 20], and one model that rigorously asymptotically captures all these properties is the geometric protean model (GEO-P) [5{7] (see [16, 25, 30, 31] for models where various ranking schemes were first used, and which inspired the GEO-P model).
    [Show full text]
  • A Multigraph Approach to Social Network Analysis
    1 Introduction Network data involving relational structure representing interactions between actors are commonly represented by graphs where the actors are referred to as vertices or nodes, and the relations are referred to as edges or ties connecting pairs of actors. Research on social networks is a well established branch of study and many issues concerning social network analysis can be found in Wasserman and Faust (1994), Carrington et al. (2005), Butts (2008), Frank (2009), Kolaczyk (2009), Scott and Carrington (2011), Snijders (2011), and Robins (2013). A common approach to social network analysis is to only consider binary relations, i.e. edges between pairs of vertices are either present or not. These simple graphs only consider one type of relation and exclude the possibility for self relations where a vertex is both the sender and receiver of an edge (also called edge loops or just shortly loops). In contrast, a complex graph is defined according to Wasserman and Faust (1994): If a graph contains loops and/or any pairs of nodes is adjacent via more than one line the graph is complex. [p. 146] In practice, simple graphs can be derived from complex graphs by collapsing the multiple edges into single ones and removing the loops. However, this approach discards information inherent in the original network. In order to use all available network information, we must allow for multiple relations and the possibility for loops. This leads us to the study of multigraphs which has not been treated as extensively as simple graphs in the literature. As an example, consider a network with vertices representing different branches of an organ- isation.
    [Show full text]
  • Social Networking Analysis to Analyze the Function of Collaborative Care Teams in an Online Social Networking Tool
    Using Social Networking Analysis to Analyze the Function of Collaborative Care Teams in an Online Social Networking Tool By William Trevor Jamieson B.Math(CS) M.D. FRCPC A CAPSTONE PROJECT Presented to the Department of Medical Informatics and Clinical Epidemiology and the Oregon Health & Sciences University School of Medicine In partial fulfillment of the requirements for the degree of Master of Biomedical Informatics December 2015 1 School of Medicine Oregon Health & Science University CERTIFICATE OF APPROVAL This is to certify that the Master’s Capstone Project of William Trevor Jamieson “USING SOCIAL NETWORKING ANALYSIS TO ANALYZE THE FUNCTION OF COLLABORATIVE CARE TEAMS IN AN ONLINE SOCIAL NETWORKING TOOL” Has been approved Michael F. Chiang, M.D. Capstone Advisor 2 ACKNOWLEDGEMENTS ............................................................................................................ 5 ABSTRACT ................................................................................................................................ 6 INTRODUCTION ....................................................................................................................... 7 LOOP – A PATIENT-CENTERED ONLINE COLLABORATION TOOL .............................................. 10 DESIGN, DEVELOPMENT AND BASIC FUNCTIONALITY OF LOOP ............................................................. 10 EVALUATION OF LOOP THROUGH A PRAGMATIC RANDOMIZED-CONTROLLED TRIAL ................................ 15 SOCIAL NETWORKING ANALYSIS – AN EVALUATION TECHNIQUE
    [Show full text]
  • Clique Colourings of Geometric Graphs
    CLIQUE COLOURINGS OF GEOMETRIC GRAPHS COLIN MCDIARMID, DIETER MITSCHE, AND PAWELPRA LAT Abstract. A clique colouring of a graph is a colouring of the vertices such that no maximal clique is monochromatic (ignoring isolated vertices). The least number of colours in such a colouring is the clique chromatic number. Given n points x1;:::; xn in the plane, and a threshold r > 0, the corre- sponding geometric graph has vertex set fv1; : : : ; vng, and distinct vi and vj are adjacent when the Euclidean distance between xi and xj is at most r. We investigate the clique chromatic number of such graphs. We first show that the clique chromatic number is at most 9 for any geometric graph in the plane, and briefly consider geometric graphs in higher dimensions. Then we study the asymptotic behaviour of the clique chromatic number for the random geometric graph G(n; r) in the plane, where n random points are independently and uniformly distributed in a suitable square. We see that as r increases from 0, with high probability the clique chromatic number is 1 for very small r, then 2 for small r, then at least 3 for larger r, and finally drops back to 2. 1. Introduction and main results In this section we introduce clique colourings and geometric graphs; and we present our main results, on clique colourings of deterministic and random geometric graphs. Recall that a proper colouring of a graph is a labeling of its vertices with colours such that no two vertices sharing the same edge have the same colour; and the smallest number of colours in a proper colouring of a graph G = (V; E) is its chromatic number, denoted by χ(G).
    [Show full text]
  • Betweenness Centrality in Dense Random Geometric Networks
    Betweenness Centrality in Dense Random Geometric Networks Alexander P. Giles Orestis Georgiou Carl P. Dettmann School of Mathematics Toshiba Telecommunications Research Laboratory School of Mathematics University of Bristol 32 Queen Square University of Bristol Bristol, UK, BS8 1TW Bristol, UK, BS1 4ND Bristol, UK, BS8 1TW [email protected] [email protected] [email protected] Abstract—Random geometric networks are mathematical are routed in a multi-hop fashion between any two nodes that structures consisting of a set of nodes placed randomly within wish to communicate, allowing much larger, more flexible d a bounded set V ⊆ R mutually coupled with a probability de- networks (due to the lack of pre-established infrastructure or pendent on their Euclidean separation, and are the classic model used within the expanding field of ad-hoc wireless networks. In the need to be within range of a switch). Commercial ad hoc order to rank the importance of the network’s communicating networks are nowadays realised under Wi-Fi Direct standards, nodes, we consider the well established ‘betweenness’ centrality enabling device-to-device (D2D) offloading in LTE cellular measure (quantifying how often a node is on a shortest path of networks [5]. links between any pair of nodes), providing an analytic treatment This new diversity in machine betweenness needs to be of betweenness within a random graph model by deriving a closed form expression for the expected betweenness of a node understood, and moreover can be harnessed in at least three placed within a dense random geometric network formed inside separate ways: historically, in 2005 Gupta et al.
    [Show full text]
  • Assortativity Measures for Weighted and Directed Networks
    Assortativity measures for weighted and directed networks Yelie Yuan1, Jun Yan1, and Panpan Zhang2,∗ 1Department of Statistics, University of Connecticut, Storrs, CT 06269 2Department of Biostatistics, Epidemiology and Informatics, University of Pennsylvania, Philadelphia, PA 19104 ∗Corresponding author: [email protected] January 15, 2021 arXiv:2101.05389v1 [stat.AP] 13 Jan 2021 Abstract Assortativity measures the tendency of a vertex in a network being connected by other ver- texes with respect to some vertex-specific features. Classical assortativity coefficients are defined for unweighted and undirected networks with respect to vertex degree. We propose a class of assortativity coefficients that capture the assortative characteristics and structure of weighted and directed networks more precisely. The vertex-to-vertex strength correlation is used as an example, but the proposed measure can be applied to any pair of vertex-specific features. The effectiveness of the proposed measure is assessed through extensive simula- tions based on prevalent random network models in comparison with existing assortativity measures. In application World Input-Ouput Networks, the new measures reveal interesting insights that would not be obtained by using existing ones. An implementation is publicly available in a R package wdnet. 1 Introduction In traditional network analysis, assortativity or assortative mixing (Newman, 2002) is a mea- sure assessing the preference of a vertex being connected (by edges) with other vertexes in a network. The measure reflects the principle of homophily (McPherson et al., 2001)|the tendency of the entities to be associated with similar partners in a social network. The prim- itive assortativity measure proposed by Newman(2002) was defined to study the tendency of connections between nodes based on their degrees, which is why it is also called degree-degree correlation (van der Hofstad and Litvak, 2014).
    [Show full text]
  • Robustness of Community Detection to Random Geometric Perturbations
    Robustness of Community Detection to Random Geometric Perturbations Sandrine Péché Vianney Perchet LPSM, University Paris Diderot Crest, ENSAE & Criteo AI Lab [email protected] [email protected] Abstract We consider the stochastic block model where connection between vertices is perturbed by some latent (and unobserved) random geometric graph. The objective is to prove that spectral methods are robust to this type of noise, even if they are agnostic to the presence (or not) of the random graph. We provide explicit regimes where the second eigenvector of the adjacency matrix is highly correlated to the true community vector (and therefore when weak/exact recovery is possible). This is possible thanks to a detailed analysis of the spectrum of the latent random graph, of its own interest. Introduction In a d-dimensional random geometric graph, N vertices are assigned random coordinates in Rd, and only points close enough to each other are connected by an edge. Random geometric graphs are used to model complex networks such as social networks, the world wide web and so on. We refer to [19]- and references therein - for a comprehensive introduction to random geometric graphs. On the other hand, in social networks, users are more likely to connect if they belong to some specific community (groups of friends, political party, etc.). This has motivated the introduction of the stochastic block models (see the recent survey [1] and the more recent breakthrough [5] for more details), where in the simplest case, each of the N vertices belongs to one (and only one) of the two communities that are present in the network.
    [Show full text]
  • Loop-Free Routing Using Diffusing Computations
    130 IEEIYACM TRANSACTIONS ON NETWORKING, VOL. 1, NO, 1, FEBRUARY 1993 Loop-Free Routing Using Diffusing Computations J. J. Garcia-Lunes-Aceves, Member, IEEE Abstract-A family of distributed algorithms for the dynamic networks including the old ARPANET routing protocol [18] computation of the shortest paths in a computer network or and the NETCHANGE protocol of the MERIT network [26]. Memet is presented, validated, and analyzed. According to these Well-known examples of DVP’S implemented in intemetworks algorithms, each node maintains a vector with its distance to every other node. Update messages from a node are sent only are the Routing Information Protocol (RIP) [10], the Gateway- to its neighbors; each such message contains a dktance vector to-Gateway Protocol (GGP) [11], and the Exterior Gateway of one or more entries, and each entry specifies the length Protocol (EGP) [20]. All of these DVP’S have used variants of the selected path to a network destination, as well as m of the distributed Bellman-Ford algorithm (DBF) for shortest indication of whether the entry constitutes an update, a query, path computation [4]. The primary disadvantages of this or a reply to a previous query. The new algorithms treat the problem of distributed shortest-path routing as one of diffusing algorithm are routing-table loops and counting to infinity [13]. computations, which was firzt proposed by Dijkztra and Scholten. A routing-table loop is a path specified in the nodes’ routing They improve on algorithms introduced previously by Chandy tables at a particular point in time, such that the path visits and Misra, JatYe and Moss, Merlin and Segatl, and the author.
    [Show full text]