Algorithms and models for the web graph : 12th International Workshop, WAW 2015, Eindhoven, the Netherlands, December 10-11, 2015 : proceedings /: 12th International Workshop, WAW 2015, Eindhoven, the Netherlands, December 10-11, 2015 : proceedings. ([2015])

• Record Type: Book
• Other Titles: WAW 2015
• Further Information: Note: David F. Gleich, Júlia Komjáthy, Nelly Litvak (Eds.).
• Editors: Gleich, David F; Komjáthy, Júlia; Litvak, Nelly
• Other Names: WAW (Conference), 12th
• Contents: Intro; Preface; Organization; Contents; Properties of Large Graph Models; Robustness of Spatial Preferential Attachment Networks; 1 Introduction; 2 The Model; 3 Statement of the Result; 4 Proof Ideas and Strategies; 4.1 Robustness: Strategy of Proof; 4.2 Non-robustness: Strategy of Proof; References; Local Clustering Coefficient in Generalized Preferential Attachment Models; 1 Introduction; 2 Generalized Preferential Attachment; 2.1 Definition of the PA-class; 2.2 Power Law Degree Distribution; 2.3 Clustering Coefficient; 3 The Average Local Clustering for the Vertices of Degree d; 4 Proofs 4.1 Proof of Theorem ??4.2 Proof of Theorem ??; 5 Conclusion; References; Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs; 1 Introduction; 2 Preliminaries; 2.1 Random Intersection Graphs; 2.2 Degeneracy and Expansion; 2.3 Gromov's Hyperbolicity; 3 Structural Sparsity of Random Intersection Graphs; 3.1 Bounded Attribute-Degrees; 3.2 Alternative Characterization of Bounded Expansion; 3.3 Stable r-Subdivisions; 3.4 Density; 3.5 Main Result; 4 Hyperbolicity; 5 Conclusion and Open Problems; References Degree-Degree Distribution in a Power Law Random Intersection Graph with Clustering1 Introduction; 2 Proofs; References; Upper Bounds for Number of Removed Edges in the Erased Configuration Model; 1 Introduction; 2 Erased Configuration Model; 3 Main Result; 4 Upper Bounds for Erased Edges; 4.1 The Upper Bounds OP (n4 -- 3) and OP (n-1); 4.2 The Upper Bound OP (n1 -- 1); 5 Discussion; References; The Impact of Degree Variability on Connectivity Properties of Large Networks; 1 Introduction; 2 The Branching Functional of the Configuration Model; 2.1 Size Biasing and Downshifting 2.2 Branching Functional of the Configuration Model3 Ordering of Branching Processes; 3.1 Strong and Convex Stochastic Orders; 3.2 Stochastic Ordering and Branching Processes; 4 Stochastic Ordering of the Configuration Model; 4.1 A Counterexample; 4.2 A Monotonicity Result When One Extinction Probability is Small; 4.3 Application to Social Network Modeling; 5 Conclusions; References; Navigability is a Robust Property; 1 Introduction; 1.1 Related Work; 2 Our Contribution; 2.1 Geometric Requirements and a Unifying Framework for RBA; 2.2 Navigability from Organic Growth 2.3 Navigability as a Reflection of the Cost of Indexing3 Navigability via Reducibility and Uniform Richness; 4 Analyzing the Set of All Feasible Graphs; References; Dynamic Processes on Large Graphs; Local Majority Dynamics on Preferential Attachment Graphs; 1 Introduction; 2 Preferential Attachment Graphs; 3 Results and Related Work; 4 Structural Results; 5 Convergence of the Majority Dynamics; 6 Conclusion and Open Problems; References; Rumours Spread Slowly in a Small World Spatial Network; 1 Introduction; 1.1 The SPA Model; 1.2 Rumour Spreading; 1.3 Main Results
• Publisher Details: Cham : Springer
• Publication Date: 2015
• Copyright Date: 2015
• Extent: 1 online resource
• Subjects: 005.1; Computer science; Computer algorithms -- Congresses; Data mining -- Congresses; World Wide Web -- Congresses; Computer algorithms; Data mining; World Wide Web; Computer Science; Engineering & Applied Sciences; Computers -- Data Processing; Computers -- Database Management -- Data Mining; Computers -- System Administration -- Storage & Retrieval; Computers -- Information Technology; Computers -- Hardware -- Network Hardware; Discrete mathematics; Data mining; Information retrieval; Network hardware; Computer software; Computational complexity; Data mining; Information storage and retrieva; Computer Communication Networks; Computers -- Programming -- Algorithms; Algorithms & data structures; Electronic books; Conference papers and proceedings
• Languages: English
• ISBNs: 9783319267845; 3319267841
• Related ISBNs: 9783319267838; 3319267833
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.