Results 1  10
of
24,789
Drawing power law graphs
 IN PROCEEDINGS OF INTERNATIONAL SYMPOSIUM ON GRAPH DRAWING (GD2004)
, 2004
"... We present methods for drawing graphs that arise in various information networks. It has been noted that many realistic graphs have power law degree distribution and exhibit the small world phenomenon. Our algorithm is influenced by recent developments on modeling and analysis of such power law grap ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We present methods for drawing graphs that arise in various information networks. It has been noted that many realistic graphs have power law degree distribution and exhibit the small world phenomenon. Our algorithm is influenced by recent developments on modeling and analysis of such power law
PowerLaw Graph Cuts
, 2014
"... Algorithms based on spectral graph cut objectives such as normalized cuts, ratio cuts and ratio association have become popular in recent years because they are widely applicable and simple to implement via standard eigenvector computations. Despite strong performance for a number of clustering task ..."
Abstract
 Add to MetaCart
distribution; in image segmentation, for instance, humansegmented images tend to yield segment sizes that follow a powerlaw distribution. In this paper, we propose a general framework of powerlaw graph cut algorithms that produce clusters whose sizes are powerlaw distributed, and also does not fix
Eigenvalues of Random Power Law Graphs
, 2003
"... Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k −β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1+o(1)) √ m where m is the maximum ..."
Abstract

Cited by 64 (7 self)
 Add to MetaCart
Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k −β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1+o(1)) √ m where m is the maximum
On the Hardness of Optimization in Power Law Graphs
, 2005
"... Our motivation for this work is the remarkable discovery that many largescale realworld graphs ranging from Internet and World Wide Web to social and biological networks exhibit a powerlaw distribution: the number of nodes yi of a given degree i is proportional to i −β where β>0 is a constant ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Our motivation for this work is the remarkable discovery that many largescale realworld graphs ranging from Internet and World Wide Web to social and biological networks exhibit a powerlaw distribution: the number of nodes yi of a given degree i is proportional to i −β where β>0 is a
Compact Routing in PowerLaw Graphs
"... Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for powerlaw graphs. We analyze our adapted routing scheme based on the theory of unweighted random powerlaw graphs with fixed expected degree sequence by Aiello, Chung, and Lu. Our result is the first theoretical bou ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for powerlaw graphs. We analyze our adapted routing scheme based on the theory of unweighted random powerlaw graphs with fixed expected degree sequence by Aiello, Chung, and Lu. Our result is the first theoretical
Conductance and Congestion in Power Law Graphs
, 2003
"... It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the performance of basic communication tasks that a network is presumed to support? How does performance scale with the size ..."
Abstract

Cited by 69 (6 self)
 Add to MetaCart
with the size of the network? We study routing in families of sparse random graphs whose degrees follow heavy tailed distributions. Instantiations of such random graphs have been proposed as models for the topology of the Internet at the level of Autonomous Systems as well as at the level of routers. Let n
Comparing the Structure of PowerLaw Graphs and the Internet AS graph
, 2004
"... In this work we devise algorithmic techniques to compare the interconnection structure of the Internet AS Graph with that of graphs produced by topology generators that match the powerlaw degree distribution of the AS graph. We are guided by the existing notion that nodes in the AS graph can be pla ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
In this work we devise algorithmic techniques to compare the interconnection structure of the Internet AS Graph with that of graphs produced by topology generators that match the powerlaw degree distribution of the AS graph. We are guided by the existing notion that nodes in the AS graph can
STORAGE AND PROCESSING SYSTEMS FOR POWERLAW GRAPHS BY
"... Large graphs abound around us – online social networks, Web graphs, the Internet, citation networks, protein interaction networks, telephone call graphs, peertopeer overlay networks, electric power grid networks, etc. Many reallife graphs are powerlaw graphs. A fundamental challenge in today’s ..."
Abstract
 Add to MetaCart
Large graphs abound around us – online social networks, Web graphs, the Internet, citation networks, protein interaction networks, telephone call graphs, peertopeer overlay networks, electric power grid networks, etc. Many reallife graphs are powerlaw graphs. A fundamental challenge in today’s
A Random Graph Model for Power Law Graphs
 Experimental Math
, 2000
"... We propose a random graph m del which is a special case of sparse random graphs with given degree sequences which satisfy a power law. Thism odel involves only asm all num ber of param eters, called logsize and loglog growth rate. These param eters capturesom e universal characteristics ofm assive ..."
Abstract

Cited by 107 (4 self)
 Add to MetaCart
We propose a random graph m del which is a special case of sparse random graphs with given degree sequences which satisfy a power law. Thism odel involves only asm all num ber of param eters, called logsize and loglog growth rate. These param eters capturesom e universal characteristics ofm assive
Scalable Computing for Power Law Graphs: . . .
"... In this paper we investigate the numerical and parallel performance of linear algebra algorithms when applied to power law data typical for information retrieval. In particular, we report on the behavior of parallel numerical algorithms applied to computing the PageRank vector for a 1.5 billion node ..."
Abstract
 Add to MetaCart
In this paper we investigate the numerical and parallel performance of linear algebra algorithms when applied to power law data typical for information retrieval. In particular, we report on the behavior of parallel numerical algorithms applied to computing the PageRank vector for a 1.5 billion
Results 1  10
of
24,789