69,177 Hits in 3.7 sec

Scalable Generation of Scale-free Graphs [article]

Peter Sanders, Christian Schulz
2016 arXiv   pre-print
We explain how massive instances of scale-free graphs following the Barabasi-Albert model can be generated very quickly in an embarrassingly parallel way.  ...  This makes this popular model available for studying big data graph problems. As a demonstration, we generated a Petaedge graph in less than an hour.  ...  Introduction Scale-free graphs with a power-law degree distribution seem to be ubiquitous in complex network analysis.  ... 
arXiv:1602.07106v1 fatcat:usgbilcsazegnmfkw2u6qdv57q

A high-level and scalable approach for generating scale-free graphs using active objects

Keyvan Azadbakht, Nikolaos Bezirgiannis, Frank S. de Boer, Sadegh Aliakbary
2016 Proceedings of the 31st Annual ACM Symposium on Applied Computing - SAC '16  
The Barabasi-Albert model (BA) is designed to generate scale-free networks using the preferential attachment mechanism.  ...  In this paper we investigate a high-level Actor-based model of the parallel algorithm of network generation and its scalable multicore implementation in Haskell.  ...  Some existing network generative models are the Erdos-Renyi (ER) [15] model of random graphs, the Watts-Strogatz (WS) [26] model of Small-world networks, and the Barabasi-Albert model of scale-free  ... 
doi:10.1145/2851613.2851722 dblp:conf/sac/AzadbakhtBBA16 fatcat:lnusiky4cjc67ngq4oblp6sae4

Toward Compact Interdomain Routing [article]

Dmitri Krioukov, kc claffy
2005 arXiv   pre-print
of a new routing architecture with satisfactory and mathematically provable scalability characteristics.  ...  Despite prevailing concerns that the current Internet interdomain routing system will not scale to meet the needs of the 21st century global Internet, networking research has not yet led to the construction  ...  In more general terms, the scale-free routing problem is to utilize peculiarities of scale-free networks to obtain non-generic algorithms optimized specifically for Internet-like topologies.  ... 
arXiv:cs/0508021v1 fatcat:5ewovi7ri5abxdfuki4kvcmb3m

Investigating Graph Algorithms in the BSP Model on the Cray XMT

David Ediger, David A. Bader
2013 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum  
We show that scalable performance can be obtained with graph algorithms in the BSP model on the Cray XMT. These algorithms perform within a factor of 10 of hand-tuned C code.  ...  We investigate the algorithmic effects of the BSP model for graph algorithms and compare performance and scalability with hand-tuned, open source software using GraphCT.  ...  m ∈ M v do n ∈ N eighbors(v) do 14: Fig. 3 . 3 Scalability of breadth-first search levels 3 to 8 on an undirected, scale-free graph with 16 million vertices and 268 million edges.  ... 
doi:10.1109/ipdpsw.2013.107 dblp:conf/ipps/EdigerB13 fatcat:hrsoeslsezbzfm7j6vsudcguku

On compact routing for the internet

Dmitri Krioukov, k c claffy, Kevin Fall, Arthur Brady
2007 Computer communication review  
routing scaling in the presence of network topology dynamics or host mobility.  ...  this paper that in view of recent results in compact routing research, such logarithmic scaling on Internet-like topologies is fundamentally impossible in the presence of topology dynamics or topology-independent  ...  None of these properties is present in scale-free graphs.  ... 
doi:10.1145/1273445.1273450 fatcat:umclhzou6facdf25c3pxnfrrhi

Problem Domains in Complex Networks

Mini Singh Ahuja
2016 IOSR Journal of Computer Engineering  
Complex Network is a very Young and active area of scientific research which has its roots in graph theory.  ...  Complex networks are special graphs with non trivial topological properties-features that do not occur in simple networks such as lattices or random graphs.  ...  Therefore, the average hop count of scale-free graphs is lower than other two graph models.  ... 
doi:10.9790/0661-1805026568 fatcat:nxcrszgskjbkfmgzel4ml5a4sq

Scalable graph exploration and visualization: Sensemaking challenges and opportunities

Robert Pienta, James Abello, Minsuk Kahng, Duen Horng Chau
2015 2015 International Conference on Big Data and Smart Computing (BIGCOMP)  
Making sense of large graph datasets is a fundamental and challenging process that advances science, education and technology.  ...  We conclude with future research directions for graph sensemaking.  ...  In the case of networks with scale-free or near scale-free degree distributions (and other graphs with high degree nodes), pure topological browsing is insufficient, because drawing a single node's neighbors  ... 
doi:10.1109/35021bigcomp.2015.7072812 dblp:conf/bigcomp/PientaAKC15 fatcat:7fk36dc4wnc7niog5ej7hz6rpe

Parallel Generation of Massive Scale-Free Graphs [article]

Andy Yoo, Keith Henderson
2010 arXiv   pre-print
The algorithms, designed to achieve high degree of parallelism by minimizing inter-processor communications, are two of the fastest graph generators which are capable of generating scale-free graphs with  ...  To the best of our knowledge, this is the largest synthetic scale-free graph reported in the literature.  ...  Conclusions and Future Work Two efficient and scalable parallel graph generation methods that can generate scale-free graphs with billions of vertices and edges are proposed in this paper.  ... 
arXiv:1003.3684v1 fatcat:5kzniccy55elbeul3l5qpuejai

Optimizations to the Parallel Breath First Search on Distributed Memory [article]

Anuj Sharma, Syed Mohammed Arshad Zaidi
2020 arXiv   pre-print
So fast, scalable, low-cost execution of parallel graph algorithms is very important.  ...  In this implementation of parallel breadth first search of graphs, we implemented Parallel BFS algorithm with 1-D partitioning of graph as described in [2] and have reduced execution time by optimizing  ...  We got inspired for this work from the fact that large and often scale-free, graphs are ubiquitous in communication networks and social networks like that of Facebook.  ... 
arXiv:2003.04826v1 fatcat:byaznnutgba5zmdstkonb7nj3y

Scalable matrix computations on large scale-free graphs using 2D graph partitioning

Erik G. Boman, Karen D. Devine, Sivasankaran Rajamanickam
2013 Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '13  
Scalable parallel computing is essential for processing large scale-free (power-law) graphs.  ...  Contrary to popular belief, we observe that current graph and hypergraph partitioners often yield relatively good partitions on scale-free graphs.  ...  Support for computer time at LLNL was provided by the Laboratory Directed Research and Development Graph Factorization Project (13-ERD-072) at Lawrence Livermore National Laboratory, which is operated  ... 
doi:10.1145/2503210.2503293 dblp:conf/sc/BomanDR13 fatcat:g5w2n53zzzelfnuourogfum3ii

Homogeneous and Scalable Gene Expression Regulatory Networks with Random Layouts of Switching Parameters [article]

D. Volchenkov, R. Lima
2003 arXiv   pre-print
Local dynamics observed in the inhomogeneous scalable regulatory networks is less sensitive to the choice of initial conditions. The scale free networks demonstrate their high error tolerance.  ...  Local dynamics of network nodes exhibits the multistationarity and oscillations and depends crucially upon the global topology of a "maximal" graph (comprising of all possible interactions between genes  ...  A flexible algorithm generating scale free graphs based on the principle of evolutionary selection of a common large-scale structure of biological networks incompatible with the preferential attachment  ... 
arXiv:q-bio/0311031v1 fatcat:iwrzkgu67bb6hakbrgzmraxaau

Network protocol scalability via a topological Kadanoff transformation

Costas Constantinou, Alexander Stepanenko
2008 2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops  
must be such that the effective interaction type between blocks is preserved at all levels of coarse-graining (i.e. all scales) Introduction  Notions of scalability and natural hierarchy of scales not  ...  as disparate as might appear naively -A hierarchy of scales can be used as a framework to achieve scalability  Employing a hierarchy of topological scales (hierarchical clustering) has long been recognised  ...  Characteristic time-scales of information summarisation correspond to scalable routing overheads:  If for a particular network class L = logn as n → ∞, then τ l = τ 0 ·b l , l = 0, ..., L Conclusion   ... 
doi:10.1109/wiopt.2008.4586133 dblp:conf/wiopt/ConstantinouS08 fatcat:d6w6t4idpzggjb3ay7xiylpxbm

Scale-free Protocol Design for Output and Regulated Output Synchronization of Heterogeneous Multi-agent Systems [article]

Donya Nojavanzadeh, Zhenwei Liu, Ali Saberi, Anton A. Stoorvogel
2020 arXiv   pre-print
We propose a scale-free linear protocol for each agent to achieve output and regulated output synchronizations.  ...  case of regulated output synchronization, the reference trajectory is generated by a so-called exosystem.  ...  We show that our protocol design (19) is scale-free and it works for any graph with any number of agents.  ... 
arXiv:2012.14032v1 fatcat:6rrubmfovvd4bddpqgjqwauarq

On the Scalability of Routing With Policies

Andras Gulyas, Gabor Retvari, Zalan Heszberger, Rachit Agarwal
2015 IEEE/ACM Transactions on Networking  
We define a general framework for policy routing, and we study the theoretical scaling properties of three fundamental policy models within this framework.  ...  In this context, a routing scheme is scalable if the amount of memory needed to implement it grows significantly slower than the network size.  ...  SCALING PROPERTIES OF THE POLICY ROUTING MODELS Next, we turn to the analysis of the theoretical scaling properties of policy routing models.  ... 
doi:10.1109/tnet.2014.2345839 fatcat:cjx57ec4bvcglcnf274yox2x6y

STINGER: High performance data structure for streaming graphs

David Ediger, Rob McColl, Jason Riedy, David A. Bader
2012 2012 IEEE Conference on High Performance Extreme Computing  
Our implementation of STINGER on the Cray XMT processes over 3 million updates per second on a scale-free graph with 537 million edges.  ...  In this paper, we present our high performance, scalable and portable software, Spatio-Temporal Interaction Networks and Graphs Extensible Representation (STINGER), that includes a graph data structure  ...  For these experiments, we utilize the popular RMAT [10] synthetic graph generator, which produces scale-free graphs with a power-law distribution in the number of neighbors.  ... 
doi:10.1109/hpec.2012.6408680 dblp:conf/hpec/EdigerMRB12 fatcat:xqdxzunbtzeexed35utpq35ola
« Previous Showing results 1 — 15 out of 69,177 results