Matches in SemOpenAlex for { <https://semopenalex.org/work/W2275335637> ?p ?o ?g. }
- W2275335637 endingPage "571" @default.
- W2275335637 startingPage "555" @default.
- W2275335637 abstract "_Listing all triangles is a fundamental graph operation. Triangles can have important interpretations in real-world graphs, especially social and other interaction networks. Despite the lack of provably efficient (linear, or slightly super linear) worst-case algorithms for this problem, practitioners run simple, efficient heuristics to find all triangles in graphs with millions of vertices. How are these heuristics exploiting the structure of these special graphs to provide major speedups in running time_? _We study one of the most prevalent algorithms used by practitioners. A trivial algorithm enumerates all paths of length 2, and checks if each such path is incident to a triangle. A good heuristic is to enumerate only those paths of length 2 in which the middle vertex has the lowest degree. It is easily implemented and is empirically known to give remarkable speedups over the trivial algorithm_. _We study the behavior of this algorithm over graphs with heavy-tailed degree distributions, a defining feature of real-world graphs. The erased configuration model (ECM) efficiently generates a graph with asymptotically (almost) any desired degree sequence. We show that the expected running time of this algorithm over the distribution of graphs created by the ECM is controlled by the ℓ<sub>4/3</sub>-norm of the degree sequence. Norms of the degree sequence are a measure of the heaviness of the tail, and it is precisely this feature that allows non trivial speedups of simple triangle enumeration algorithms. As a corollary of our main theorem, we prove expected linear-time performance for degree sequences following a power law with exponent α ≥ 7/3, and non trivial speedup whenever_ α ∈ (2, 3)." @default.
- W2275335637 created "2016-06-24" @default.
- W2275335637 creator A5009558569 @default.
- W2275335637 creator A5022439451 @default.
- W2275335637 creator A5035120984 @default.
- W2275335637 creator A5038687804 @default.
- W2275335637 creator A5049434797 @default.
- W2275335637 creator A5074463808 @default.
- W2275335637 date "2015-05-29" @default.
- W2275335637 modified "2023-10-16" @default.
- W2275335637 title "Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?" @default.
- W2275335637 cites W1489509891 @default.
- W2275335637 cites W1589703745 @default.
- W2275335637 cites W1967022297 @default.
- W2275335637 cites W1968546622 @default.
- W2275335637 cites W1976969221 @default.
- W2275335637 cites W1991858502 @default.
- W2275335637 cites W1997698259 @default.
- W2275335637 cites W2002779084 @default.
- W2275335637 cites W2008620264 @default.
- W2275335637 cites W2016311778 @default.
- W2275335637 cites W2019724001 @default.
- W2275335637 cites W2022783258 @default.
- W2275335637 cites W2027377866 @default.
- W2275335637 cites W2039990322 @default.
- W2275335637 cites W2042634209 @default.
- W2275335637 cites W2044881936 @default.
- W2275335637 cites W2055245094 @default.
- W2275335637 cites W2067247412 @default.
- W2275335637 cites W2083750870 @default.
- W2275335637 cites W2090003226 @default.
- W2275335637 cites W2091476183 @default.
- W2275335637 cites W2103314753 @default.
- W2275335637 cites W2110814195 @default.
- W2275335637 cites W2112090702 @default.
- W2275335637 cites W2115059495 @default.
- W2275335637 cites W2129918926 @default.
- W2275335637 cites W2148606196 @default.
- W2275335637 cites W2152361742 @default.
- W2275335637 cites W2153409685 @default.
- W2275335637 cites W2169015768 @default.
- W2275335637 cites W2175110005 @default.
- W2275335637 cites W3123534837 @default.
- W2275335637 cites W4231916799 @default.
- W2275335637 doi "https://doi.org/10.1080/15427951.2015.1037030" @default.
- W2275335637 hasPublicationYear "2015" @default.
- W2275335637 type Work @default.
- W2275335637 sameAs 2275335637 @default.
- W2275335637 citedByCount "11" @default.
- W2275335637 countsByYear W22753356372016 @default.
- W2275335637 countsByYear W22753356372017 @default.
- W2275335637 countsByYear W22753356372018 @default.
- W2275335637 countsByYear W22753356372019 @default.
- W2275335637 countsByYear W22753356372020 @default.
- W2275335637 countsByYear W22753356372023 @default.
- W2275335637 crossrefType "journal-article" @default.
- W2275335637 hasAuthorship W2275335637A5009558569 @default.
- W2275335637 hasAuthorship W2275335637A5022439451 @default.
- W2275335637 hasAuthorship W2275335637A5035120984 @default.
- W2275335637 hasAuthorship W2275335637A5038687804 @default.
- W2275335637 hasAuthorship W2275335637A5049434797 @default.
- W2275335637 hasAuthorship W2275335637A5074463808 @default.
- W2275335637 hasBestOaLocation W22753356371 @default.
- W2275335637 hasConcept C111472728 @default.
- W2275335637 hasConcept C11413529 @default.
- W2275335637 hasConcept C114614502 @default.
- W2275335637 hasConcept C118615104 @default.
- W2275335637 hasConcept C121332964 @default.
- W2275335637 hasConcept C126255220 @default.
- W2275335637 hasConcept C127705205 @default.
- W2275335637 hasConcept C132525143 @default.
- W2275335637 hasConcept C138885662 @default.
- W2275335637 hasConcept C1465435 @default.
- W2275335637 hasConcept C156340839 @default.
- W2275335637 hasConcept C203776342 @default.
- W2275335637 hasConcept C22590252 @default.
- W2275335637 hasConcept C24890656 @default.
- W2275335637 hasConcept C2775997480 @default.
- W2275335637 hasConcept C2778112365 @default.
- W2275335637 hasConcept C2780586882 @default.
- W2275335637 hasConcept C311688 @default.
- W2275335637 hasConcept C33923547 @default.
- W2275335637 hasConcept C43517604 @default.
- W2275335637 hasConcept C54355233 @default.
- W2275335637 hasConcept C80899671 @default.
- W2275335637 hasConcept C86803240 @default.
- W2275335637 hasConceptScore W2275335637C111472728 @default.
- W2275335637 hasConceptScore W2275335637C11413529 @default.
- W2275335637 hasConceptScore W2275335637C114614502 @default.
- W2275335637 hasConceptScore W2275335637C118615104 @default.
- W2275335637 hasConceptScore W2275335637C121332964 @default.
- W2275335637 hasConceptScore W2275335637C126255220 @default.
- W2275335637 hasConceptScore W2275335637C127705205 @default.
- W2275335637 hasConceptScore W2275335637C132525143 @default.
- W2275335637 hasConceptScore W2275335637C138885662 @default.
- W2275335637 hasConceptScore W2275335637C1465435 @default.
- W2275335637 hasConceptScore W2275335637C156340839 @default.
- W2275335637 hasConceptScore W2275335637C203776342 @default.