DOCSLIB.ORG

On Community Detection in Real-World Networks and the Importance of Degree Assortativity

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
On Community Detection in Real-World Networks and the Importance of Degree Assortativity On Community Detection in Real-World Networks and the Importance of Degree Assortativity Marek Ciglan Michal Laclavík Kjetil Nørvåg Institute of Informatics Institute of Informatics Dept. of Computer and Slovak Academy of Sciences Slovak Academy of Sciences Information Science Bratislava, Slovakia Bratislava, Slovakia Norwegian University of [email protected] [email protected] Science and Technology Trondheim, Norway [email protected] ABSTRACT lack of a consensus on the formal definition of a network commu- Graph clustering, often addressed as community detection, is a nity structure. The result of the ambiguity of the task definition is prominent task in the domain of graph data mining with dozens that a significant number of community detection algorithms hav- of algorithms proposed in recent years. In this paper, we focus ing been proposed, using different quality definitions of a commu- on several popular community detection algorithms with low com- nity structure or leaving the problem formulation in an ambiguous putational complexity and with decent performance on the artifi- informal description only. In this paper, we do not propose yet cial benchmarks, and we study their behaviour on real-world net- another community detection algorithm, nor do we attempt to pro- works. Motivated by the observation that there is a class of net- vide a new formalization of the task. Rather, we study community works for which the community detection methods fail to deliver detection methods on real-world networks and the possibility of good community structure, we examine the assortativity coefficient improving their precision by pre-processing the network topology. of ground-truth communities and show that assortativity of a com- Motivation. The motivation is that for a class of networks, the munity structure can be very different from the assortativity of the community detection techniques fail to deliver a good partitioning original network. We then examine the possibility of exploiting the (in the rest of the paper, we use the term partitioning to address the latter by weighting edges of a network with the aim to improve the result of a community detection algorithm; a partitioning is a set of detected communities). For example, when using community community detection outputs for networks with assortative com- 1 munity structure. The evaluation shows that the proposed weight- detection techniques to analyse the semantic network DBPedia , ing can significantly improve the results of community detection where nodes corresponds to the DBPedia concepts and edges de- methods on networks with assortative community structure. note a relation defined between two concepts, our expectation was that the analysis would reveal small clusters with semantically re- lated concepts and entities. The clusters were expected to be, for Categories and Subject Descriptors example, similar to Wikipedia categories (containing groups of Wi- H.2.8 [Database Applications]: Data mining; E.1 [DATA STRUC- kipedia articles handpicked by human contributors and assigned to TURES]: Graphs and networks be a member of the category, class). However, the detected struc- ture contains a few very large communities comprising the majority of the nodes. Keywords Due to the size of the data sets, our choice of community de- community detection, network assortativity, edge weighting tection methods for the network analysis was limited to a small family of fast community detection algorithms that are near-linear in the time complexity. We analysed the link graph using the la- 1. INTRODUCTION bel propagation [19] algorithm, a greedy modularity optimization The goal of community detection in networks is to identify sets algorithm [3] and a community detection method with parameter- of nodes, communities, that are densely connected among them- ized community size constraint (SCCD) [4]. The community struc- selves and have weaker connections to the other communities in the ture produced by the label propagation algorithm had the largest network. It is a task that can help to analyse large graphs and iden- community, with over 2.96 million of nodes. The SCCD method tify significant structures within and a classical example is to anal- with default setting yielded a structure with 78% of the nodes in yse social networks in order to find social groups of users. Commu- the 20 largest communities, and the greedy modularity optimiza- nity detection faces numerous challenges, the principal one is the tion method produced a partitioning with 88% of the nodes in the 20 largest clusters. The obtained results clearly did not match our expectations of the community structure of the DBPedia network. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed Overview of the study. Motivated by the above observation, we for profit or commercial advantage and that copies bear this notice and the full citation analyse several large social and information networks with known on the first page. Copyrights for components of this work owned by others than the ground-truth communities and compare the detected structure ob- author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or tained by the three community detection algorithms to the ground- republish, to post on servers or to redistribute to lists, requires prior specific permission truth clusters. On four of the analysed networks, the detected clus- and/or a fee. Request permissions from [email protected]. ters are a decent approximation of the ground-truth communities. KDD’13, August 11–14, 2013, Chicago, Illinois, USA. Copyright is held by the owner/author(s). Publication rights licensed to ACM. 1 Copyright 2013 ACM 978-1-4503-2174-7/13/08 ...$15.00. Knowledge base derived from Wikipedia, http://dbpedia.org 1007 For the rest of the networks, the similarity scores of the yielded par- the notion of the community structure in an informal description. titions with the ground-truth communities are low, and at the same The most widely used approach is to focus on maximizing the mod- time, a few of the largest detected clusters contain the majority of ularity measure (introduced by Newman and Girvan[17]) that com- the network nodes. pares how community-like the partitioning of the input network is We then study the assortativity of the analysed networks and to a random network with the same degrees of vertices. Modular- assortativity of their ground-truth communities. The interesting ity is a quality function for estimating how good the partitioning finding is that the assortativity coefficient of a network can be sig- of a network is. The basic formulation of the community detection nificantly different compared to the assortativity of its community task expects as an output a partitioning of a network; that is, each structure. Based on this, we examine the possibility of modifying node is a member of exactly one community. Numerous variants of the network by means of edge weighting. The underlying idea is to the problem have been studied, including detection of overlapping examine whether we can increase the precision of the community communities where a vertex can belong to multiple communities detection algorithms by the weighting functions for the networks (e.g., works by Gregory [9] and Zhang et al. [22]), clustering of with assortative community structure. We describe the weight- bipartite graphs (e.g., Papadimitriou et al. [18]), and detection of ing heuristics and show empirically that it is a suitable approach clusters exploiting additional information in addition to network in practice. On our test data, the similarity of the detected com- structure (e.g., attributes on nodes/edges, Yang et al. [21]). munity structure to the ground-truth is significantly increased after Community-detection algorithms are usually evaluated against applying the weightings on network with assortative community artificial benchmark graphs, where a community structure has been structure. injected (e.g., [11]). The advantage is that the evaluator can tune The main contributions of the paper are: the parameters of the generated network, the disadvantage is the • We show that assortativity of the community structure can artificiality itself. The real-world networks with known commu- differ from overall assortativity of the network. nity structure studied in the literature are usually small ones (e.g., Zachary’s karate club (36 nodes) or Dolphin social network (62 • We propose edge weighting functions designed to decrease nodes)), with few exceptions; e.g., in a recent study by Yang and the influence of edges connecting disassortative nodes. We Leskovec [20], the authors identify the ground-truth communities show that such edge weighting on networks with assortative for several large networks and study their properties. In this work, community structure can increase significantly the similarity we reuse their data sets. Abrahao et al. in [1] study structural prop- of the communities identified by community detection meth- erties of the ground-truth communities and compare them with the ods to the ground-truth communities, an increase of 2 to 10 properties of clusters discovered by several community detection times compared to the baseline solution is reported. approaches. The finding is that the communities produced by dif- The organization of the rest of the paper is as follows. Section 2 ferent approaches are clearly
Load more

Recommended publications
  • 2021 Catalog
    2021 NEW PRODUCTS G-Power Flip and Punch Spin Bait Designed by Aaron Martens, Walleye anglers across the Midwest have become Gamakatsu has developed the dependent upon the spin style hooks for walleye rigs. new G-Power Heavy Cover Flip The Spin Bait hook can be rigged behind spinner & Punch Hook. A step up from blades, prop blades or used the G-Finesse Heavy Cover alone with just a simple Hook, for serious flipping and bead in front of them. It’s punching with heavy fluorocarbon and braid. The TGW (Tournament unique design incorporates Grade Wire) hook, paired with its welded eye, make this the strongest Gamakatsu swivels that is Heavy Cover hook in Gamakatsu’s G-Series lineup. Ideal for larger baits independent of the hook, giving the hook more freedom to spin while and weights, punching through grass mats and flipping into heavy reducing line twist. The Spin Bait hook features Nano Smooth Coat for timber. G-Power Flip and Punch ideally matches to all types of cover stealth presentations and unsurpassed hook penetration and the bait and able to withstand extreme conditions. Page 26 keeper barbs on the shank hold live and plastic baits on more securely. Page 48 G-Power Stinger Trailer Hook The new G-Power Stinger Trailer Hook Superline Offset Round Bend brilliance comes from Gamakatsu’s famous Gamakatsu’s Superline Offset Round B10S series of fly hooks and the expertise Bend is designed with a heavier of Professional Bass angler Aaron Martens. Superline wire best suited for heavy The Stinger Trailer has a strategically braided and fluorocarbon lines.
    [Show full text]
  • Analysis of Topological Characteristics of Huge Online Social Networking Services Yong-Yeol Ahn, Seungyeop Han, Haewoon Kwak, Young-Ho Eom, Sue Moon, Hawoong Jeong
    1 Analysis of Topological Characteristics of Huge Online Social Networking Services Yong-Yeol Ahn, Seungyeop Han, Haewoon Kwak, Young-Ho Eom, Sue Moon, Hawoong Jeong Abstract— Social networking services are a fast-growing busi- the statistics severely and it is imperative to use large data sets ness in the Internet. However, it is unknown if online relationships in network structure analysis. and their growth patterns are the same as in real-life social It is only very recently that we have seen research results networks. In this paper, we compare the structures of three online social networking services: Cyworld, MySpace, and orkut, from large networks. Novel network structures from human each with more than 10 million users, respectively. We have societies and communication systems have been unveiled; just access to complete data of Cyworld’s ilchon (friend) relationships to name a few are the Internet and WWW [3] and the patents, and analyze its degree distribution, clustering property, degree Autonomous Systems (AS), and affiliation networks [4]. Even correlation, and evolution over time. We also use Cyworld data in the short history of the Internet, SNSs are a fairly new to evaluate the validity of snowball sampling method, which we use to crawl and obtain partial network topologies of MySpace phenomenon and their network structures are not yet studied and orkut. Cyworld, the oldest of the three, demonstrates a carefully. The social networks of SNSs are believed to reflect changing scaling behavior over time in degree distribution. The the real-life social relationships of people more accurately than latest Cyworld data’s degree distribution exhibits a multi-scaling any other online networks.
    [Show full text]
  • Rolling Stone Magazine's Top 500 Songs
    Rolling Stone Magazine's Top 500 Songs No. Interpret Title Year of release 1. Bob Dylan Like a Rolling Stone 1961 2. The Rolling Stones Satisfaction 1965 3. John Lennon Imagine 1971 4. Marvin Gaye What’s Going on 1971 5. Aretha Franklin Respect 1967 6. The Beach Boys Good Vibrations 1966 7. Chuck Berry Johnny B. Goode 1958 8. The Beatles Hey Jude 1968 9. Nirvana Smells Like Teen Spirit 1991 10. Ray Charles What'd I Say (part 1&2) 1959 11. The Who My Generation 1965 12. Sam Cooke A Change is Gonna Come 1964 13. The Beatles Yesterday 1965 14. Bob Dylan Blowin' in the Wind 1963 15. The Clash London Calling 1980 16. The Beatles I Want zo Hold Your Hand 1963 17. Jimmy Hendrix Purple Haze 1967 18. Chuck Berry Maybellene 1955 19. Elvis Presley Hound Dog 1956 20. The Beatles Let It Be 1970 21. Bruce Springsteen Born to Run 1975 22. The Ronettes Be My Baby 1963 23. The Beatles In my Life 1965 24. The Impressions People Get Ready 1965 25. The Beach Boys God Only Knows 1966 26. The Beatles A day in a life 1967 27. Derek and the Dominos Layla 1970 28. Otis Redding Sitting on the Dock of the Bay 1968 29. The Beatles Help 1965 30. Johnny Cash I Walk the Line 1956 31. Led Zeppelin Stairway to Heaven 1971 32. The Rolling Stones Sympathy for the Devil 1968 33. Tina Turner River Deep - Mountain High 1966 34. The Righteous Brothers You've Lost that Lovin' Feelin' 1964 35.
    [Show full text]
  • Weight and Lifestyle Inventory (Wali)
    WEIGHT AND LIFESTYLE INVENTORY (Bariatric Surgery Version) © 2015 Thomas A. Wadden, Ph.D. and Gary D. Foster, Ph.D. 1 The Weight and Lifestyle Inventory (WALI) is designed to obtain information about your weight and dieting histories, your eating and exercise habits, and your relationships with family and friends. Please complete the questionnaire carefully and make your best guess when unsure of the answer. You will have an opportunity to review your answers with a member of our professional staff. Please allow 30-60 minutes to complete this questionnaire. Your answers will help us better identify problem areas and plan your treatment accordingly. The information you provide will become part of your medical record at Penn Medicine and may be shared with members of our treatment team. Thank you for taking the time to complete this questionnaire. SECTION A: IDENTIFYING INFORMATION ______________________________________________________________________________ 1 Name _________________________ __________ _______lbs. ________ft. ______inches 2 Date of Birth 3 Age 4 Weight 5 Height ______________________________________________________________________________ 6 Address ____________________ ________________________ ______________________/_______ yrs. 7 Phone: Cell 8 Phone: Home 9 Occupation/# of yrs. at job __________________________ 10 Today’s Date 11 Highest year of school completed: (Check one.) □ 6 □ 7 □ 8 □ 9 □ 10 □ 11 □ 12 □ 13 □ 14 □ 15 □ 16 □ Masters □ Doctorate Middle School High School College 12 Race (Check all that apply): □ American Indian □ Asian □ African American/Black □ Pacific Islander □White □ Other: ______________ 13 Are you Latino, Hispanic, or of Spanish origin? □ Yes □ No SECTION B: WEIGHT HISTORY 1. At what age were you first overweight by 10 lbs. or more? _______ yrs. old 2. What has been your highest weight after age 21? _______ lbs.
    [Show full text]
  • Song Lyrics of the 1950S
    Song Lyrics of the 1950s 1951 C’mon a my house by Rosemary Clooney Because of you by Tony Bennett Come on-a my house my house, I’m gonna give Because of you you candy Because of you, Come on-a my house, my house, I’m gonna give a There's a song in my heart. you Apple a plum and apricot-a too eh Because of you, Come on-a my house, my house a come on My romance had its start. Come on-a my house, my house a come on Come on-a my house, my house I’m gonna give a Because of you, you The sun will shine. Figs and dates and grapes and cakes eh The moon and stars will say you're Come on-a my house, my house a come on mine, Come on-a my house, my house a come on Come on-a my house, my house, I’m gonna give Forever and never to part. you candy Come on-a my house, my house, I’m gonna give I only live for your love and your kiss. you everything It's paradise to be near you like this. Because of you, (instrumental interlude) My life is now worthwhile, And I can smile, Come on-a my house my house, I’m gonna give you Christmas tree Because of you. Come on-a my house, my house, I’m gonna give you Because of you, Marriage ring and a pomegranate too ah There's a song in my heart.
    [Show full text]
  • Correlation in Complex Networks
    Correlation in Complex Networks by George Tsering Cantwell A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Physics) in the University of Michigan 2020 Doctoral Committee: Professor Mark Newman, Chair Professor Charles Doering Assistant Professor Jordan Horowitz Assistant Professor Abigail Jacobs Associate Professor Xiaoming Mao George Tsering Cantwell [email protected] ORCID iD: 0000-0002-4205-3691 © George Tsering Cantwell 2020 ACKNOWLEDGMENTS First, I must thank Mark Newman for his support and mentor- ship throughout my time at the University of Michigan. Further thanks are due to all of the people who have worked with me on projects related to this thesis. In alphabetical order they are Eliz- abeth Bruch, Alec Kirkley, Yanchen Liu, Benjamin Maier, Gesine Reinert, Maria Riolo, Alice Schwarze, Carlos Serván, Jordan Sny- der, Guillaume St-Onge, and Jean-Gabriel Young. ii TABLE OF CONTENTS Acknowledgments .................................. ii List of Figures ..................................... v List of Tables ..................................... vi List of Appendices .................................. vii Abstract ........................................ viii Chapter 1 Introduction .................................... 1 1.1 Why study networks?...........................2 1.1.1 Example: Modeling the spread of disease...........3 1.2 Measures and metrics...........................8 1.3 Models of networks............................ 11 1.4 Inference.................................
    [Show full text]
  • Learning on Hypergraphs: Spectral Theory and Clustering
    Learning on Hypergraphs: Spectral Theory and Clustering Pan Li, Olgica Milenkovic Coordinated Science Laboratory University of Illinois at Urbana-Champaign March 12, 2019 Learning on Graphs Graphs are indispensable mathematical data models capturing pairwise interactions: k-nn network social network publication network Important learning on graphs problems: clustering (community detection), semi-supervised/active learning, representation learning (graph embedding) etc. Beyond Pairwise Relations A graph models pairwise relations. Recent work has shown that high-order relations can be significantly more informative: Examples include: Understanding the organization of networks (Benson, Gleich and Leskovec'16) Determining the topological connectivity between data points (Zhou, Huang, Sch}olkopf'07). Graphs with high-order relations can be modeled as hypergraphs (formally defined later). Meta-graphs, meta-paths in heterogeneous information networks. Algorithmic methods for analyzing high-order relations and learning problems are still under development. Beyond Pairwise Relations Functional units in social and biological networks. High-order network motifs: Motif (Benson’16) Microfauna Pelagic fishes Crabs & Benthic fishes Macroinvertebrates Algorithmic methods for analyzing high-order relations and learning problems are still under development. Beyond Pairwise Relations Functional units in social and biological networks. Meta-graphs, meta-paths in heterogeneous information networks. (Zhou, Yu, Han'11) Beyond Pairwise Relations Functional units in social and biological networks. Meta-graphs, meta-paths in heterogeneous information networks. Algorithmic methods for analyzing high-order relations and learning problems are still under development. Review of Graph Clustering: Notation and Terminology Graph Clustering Task: Cluster the vertices that are \densely" connected by edges. Graph Partitioning and Conductance A (weighted) graph G = (V ; E; w): for e 2 E, we is the weight.
    [Show full text]
  • Multiplex Conductance and Gossip Based Information Spreading in Multiplex Networks
    1 Multiplex Conductance and Gossip Based Information Spreading in Multiplex Networks Yufan Huang, Student Member, IEEE, and Huaiyu Dai, Fellow, IEEE Abstract—In this network era, not only people are connected, different networks are also coupled through various interconnections. This kind of network of networks, or multilayer networks, has attracted research interest recently, and many beneficial features have been discovered. However, quantitative study of information spreading in such networks is essentially lacking. Despite some existing results in single networks, the layer heterogeneity and complicated interconnections among the layers make the study of information spreading in this type of networks challenging. In this work, we study the information spreading time in multiplex networks, adopting the gossip (random-walk) based information spreading model. A new metric called multiplex conductance is defined based on the multiplex network structure and used to quantify the information spreading time in a general multiplex network in the idealized setting. Multiplex conductance is then evaluated for some interesting multiplex networks to facilitate understanding in this new area. Finally, the tradeoff between the information spreading efficiency improvement and the layer cost is examined to explain the user’s social behavior and motivate effective multiplex network designs. Index Terms—Information spreading, multiplex networks, gossip algorithm, multiplex conductance F 1 INTRODUCTION N the election year, one of the most important tasks Arguably, this somewhat simplified version of multilayer I for presidential candidates is to disseminate their words networks already captures many interesting multi-scale and and opinions to voters in a fast and efficient manner. multi-component features, and serves as a good starting The underlying research problem on information spreading point for our intended study.
    [Show full text]
  • Before Using Scale Weight Measurement Only Personal Data
    Congratulations on purchasing this Bluetooth® The scale will now switch to Age setting mode. After a few seconds, the LCD will show your body weight, body fat percentage, • Skin temperature can have an influence also. Measuring body fat in warm, humid Bone mass – what is it? Before Using Scale body water percentage, BMI, bone mass and muscle mass percentage for several weather when skin is moist will yield a different result than if skin is cold and dry. Bone is a living, growing tissue. During youth, your body makes new bone tissue connected Weight Watchers Scales by Conair™ Age will flash. Press the UP or DOWN button to choose the seconds, and then turn off automatically. • As with weight, when your goal is to change body composition, it is better to track faster than it breaks down older bone. In young adulthood, bone mass is at its peak; Precautions for Use Body Analysis Monitor! age (10 to 100). Pressing and holding the UP or DOWN button trends over time than to use individual daily results. after that, bone loss starts to outpace bone growth, and bone mass decreases. CAUTION! Use of this device by persons with any electrical implant such will advance numbers quickly. Press the SET button to confirm • Results may not be accurate for persons under the age of 16, or persons with an But it’s a long and very slow process that can be slowed down even more through It is designed to work with the free Weight Watchers Scales by as a heart pacemaker, or by pregnant women, is not recommended.
    [Show full text]
  • Happiness Is Assortative in Online Social Networks
    Happiness Is Assortative in Johan Bollen*,** Online Social Networks Indiana University Bruno Goncalves**̧ Indiana University Guangchen Ruan** Indiana University Abstract Online social networking communities may exhibit highly Huina Mao** complex and adaptive collective behaviors. Since emotions play such Indiana University an important role in human decision making, how online networks Downloaded from http://direct.mit.edu/artl/article-pdf/17/3/237/1662787/artl_a_00034.pdf by guest on 25 September 2021 modulate human collective mood states has become a matter of considerable interest. In spite of the increasing societal importance of online social networks, it is unknown whether assortative mixing of psychological states takes place in situations where social ties are mediated solely by online networking services in the absence Keywords of physical contact. Here, we show that the general happiness, Social networks, mood, sentiment, or subjective well-being (SWB), of Twitter users, as measured from a assortativity, homophily 6-month record of their individual tweets, is indeed assortative across the Twitter social network. Our results imply that online social A version of this paper with color figures is networks may be equally subject to the social mechanisms that cause available online at http://dx.doi.org/10.1162/ assortative mixing in real social networks and that such assortative artl_a_00034. Subscription required. mixing takes place at the level of SWB. Given the increasing prevalence of online social networks, their propensity to connect users with similar levels of SWB may be an important factor in how positive and negative sentiments are maintained and spread through human society. Future research may focus on how event-specific mood states can propagate and influence user behavior in “real life.” 1 Introduction Bird flocking and fish schooling are typical and well-studied examples of how large communities of relatively simple individuals can exhibit highly complex and adaptive behaviors at the collective level.
    [Show full text]
  • Roadside Safety Design and Devices International Workshop
    TRANSPORTATION RESEARCH Number E-C172 February 2013 Roadside Safety Design and Devices International Workshop July 17, 2012 Milan, Italy TRANSPORTATION RESEARCH BOARD 2013 EXECUTIVE COMMITTEE OFFICERS Chair: Deborah H. Butler, Executive Vice President, Planning, and CIO, Norfolk Southern Corporation, Norfolk, Virginia Vice Chair: Kirk T. Steudle, Director, Michigan Department of Transportation, Lansing Division Chair for NRC Oversight: Susan Hanson, Distinguished University Professor Emerita, School of Geography, Clark University, Worcester, Massachusetts Executive Director: Robert E. Skinner, Jr., Transportation Research Board TRANSPORTATION RESEARCH BOARD 2012–2013 TECHNICAL ACTIVITIES COUNCIL Chair: Katherine F. Turnbull, Executive Associate Director, Texas A&M Transportation Institute, Texas A&M University System, College Station Technical Activities Director: Mark R. Norman, Transportation Research Board Paul Carlson, Research Engineer, Texas A&M Transportation Institute, Texas A&M University System, College Station, Operations and Maintenance Group Chair Thomas J. Kazmierowski, Manager, Materials Engineering and Research Office, Ontario Ministry of Transportation, Toronto, Canada, Design and Construction Group Chair Ronald R. Knipling, Principal, safetyforthelonghaul.com, Arlington, Virginia, System Users Group Chair Mark S. Kross, Consultant, Jefferson City, Missouri, Planning and Environment Group Chair Joung Ho Lee, Associate Director for Finance and Business Development, American Association of State Highway and Transportation
    [Show full text]
  • Rumour Spreading and Graph Conductance∗
    Rumour spreading and graph conductance∗ Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi fchierichetti,lattanzi,[email protected] Dipartimento di Informatica Sapienza Universit`adi Roma October 12, 2009 Abstract if its completion time is poly-logarithmic in the size of We show that if a connected graph with n nodes has the network regardless of the source, and that it is slow conductance φ then rumour spreading, also known as otherwise. randomized broadcast, successfully broadcasts a mes- Randomized broadcast has been intensely investi- sage within O(log4 n/φ6) many steps, with high proba- gated (see the related-work section). Our long term bility, using the PUSH-PULL strategy. An interesting goal is to characterize a set of necessary and/or suffi- feature of our approach is that it draws a connection be- cient conditions for rumour spreading to be fast in a tween rumour spreading and the spectral sparsification given network. In this work, we provide a very general procedure of Spielman and Teng [23]. sufficient condition{ high conductance. Our main moti- vation comes from the study of social networks. Loosely 1 Introduction stated, we are looking after a theorem of the form \Ru- mour spreading is fast in social networks". Our result is Rumour spreading, also known as randomized broadcast a good step in this direction because there are reasons or randomized gossip (all terms that will be used as to believe that social networks have high conductance. synonyms throughout the paper), refers to the following This is certainly the case for preferential attachment distributed algorithm. Starting with one source node models such as that of [18].
    [Show full text]