Results 1  10
of
612
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such
A sharp lower bound on the number of hyperedges in a friendship
"... Let (X, B) be a set system in which B is a set of 3subsets of X. Then (X, B) is a friendship 3hypergraph if it satisfies the following property: for all distinct elements u, v, w ∈ X, there exists a unique fourth element x ∈ X such that {u, v, x}, {u, w, x}, {v, w, x} ∈ B. The element x is called ..."
Abstract
 Add to MetaCart
Let (X, B) be a set system in which B is a set of 3subsets of X. Then (X, B) is a friendship 3hypergraph if it satisfies the following property: for all distinct elements u, v, w ∈ X, there exists a unique fourth element x ∈ X such that {u, v, x}, {u, w, x}, {v, w, x} ∈ B. The element x
On a question of Sós about 3uniform friendship hypergraphs
, 2007
"... The wellknown Friendship Theorem states that if G is a graph in which every pair of vertices has exactly one common neighbor, then G has a single vertex joined to all others (a “universal friend”). This property uniquely defines the graph for a given number of vertices. V. Sós defined an analogous ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
friendship property for 3uniform hypergraphs, and gave a construction satisfying the friendship property that has a universal friend. She also asked whether any other 3uniform hypergraphs satisfy the friendship property. We answer this question affirmatively by demonstrating hypergraphs without a
The Small World Inside Large Metabolic Networks
, 2000
"... We analyze the structuture of a large metabolic network, that of the energy and biosynthesis metabolism of Escherichia coli. This network is a paradigmatic case for the large genetic and metabolic networks that functional genomics efforts are beginning to elucidate. To analyze the structure of net ..."
Abstract

Cited by 217 (7 self)
 Add to MetaCart
. We find that this network is a small world graph, a type of graph observed in a variety of seemingly unrelated areas, such as friendship networks in sociology, the structure of electrical power grids, and the nervous system of C. elegans. Moreover, its connectivity follows a power law, another
Extraction and Analysis of Facebook Friendship Relations
"... Online Social Networks (OSNs) are a unique Web and social phenomenon, affecting tastes and behaviors of their users and helping them to maintain/create friendships. It is interesting to analyze the growth and evolution of Online Social Networks both from the point of view of marketing and offer of ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Online Social Networks (OSNs) are a unique Web and social phenomenon, affecting tastes and behaviors of their users and helping them to maintain/create friendships. It is interesting to analyze the growth and evolution of Online Social Networks both from the point of view of marketing and offer
A dynamic survey of graph labellings
 Electron. J. Combin., Dynamic Surveys(6):95pp
, 2001
"... A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the late 1960s. In the intervening years dozens of graph labelings techniques have been studied in over 1000 papers. Finding out what has been done ..."
Abstract

Cited by 167 (0 self)
 Add to MetaCart
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the late 1960s. In the intervening years dozens of graph labelings techniques have been studied in over 1000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey I have collected everything I could find on graph labeling. For the convenience of the reader the survey includes a detailed table of contents and index.
Chapter 12 Extraction and Analysis of Facebook Friendship Relations
"... Abstract Online social networks (OSNs) are a unique web and social phenomenon, affecting tastes and behaviors of their users and helping them to maintain/create friendships. It is interesting to analyze the growth and evolution of online social networks both from the point of view of marketing and o ..."
Abstract
 Add to MetaCart
Abstract Online social networks (OSNs) are a unique web and social phenomenon, affecting tastes and behaviors of their users and helping them to maintain/create friendships. It is interesting to analyze the growth and evolution of online social networks both from the point of view of marketing
Friendship, Altruism, and Reward Sharing in Stable Matching and Contribution Games∗
, 2014
"... ar ..."
PowerGraph: Distributed GraphParallel Computation on Natural Graphs
"... Largescale graphstructured computation is central to tasks ranging from targeted advertising to natural language processing and has led to the development of several graphparallel abstractions including Pregel and GraphLab. However, the natural graphs commonly found in the realworld have highly ..."
Abstract

Cited by 117 (4 self)
 Add to MetaCart
Largescale graphstructured computation is central to tasks ranging from targeted advertising to natural language processing and has led to the development of several graphparallel abstractions including Pregel and GraphLab. However, the natural graphs commonly found in the realworld have highly skewed powerlaw degree distributions, which challenge the assumptions made by these abstractions, limiting performance and scalability. In this paper, we characterize the challenges of computation on natural graphs in the context of existing graphparallel abstractions. We then introduce the PowerGraph abstraction which exploits the internal structure of graph programs to address these challenges. Leveraging the PowerGraph abstraction we introduce a new approach to distributed graph placement and representation that exploits the structure of powerlaw graphs. We provide a detailed analysis and experimental evaluation comparing PowerGraph to two popular graphparallel systems. Finally, we describe three different implementation strategies for PowerGraph and discuss their relative merits with empirical evaluations on largescale realworld problems demonstrating order of magnitude gains. 1
Results 1  10
of
612