Filters








145,441 Hits in 5.8 sec

A Sequential Algorithm for Generating Random Graphs

Mohsen Bayati, Jeong Han Kim, Amin Saberi
2009 Algorithmica  
We present a nearly-linear time algorithm for counting and randomly generating simple graphs with a given degree sequence in a certain range.  ...  We also use sequential importance sampling to derive fully Polynomial-time Randomized Approximation Schemes (FPRAS) for counting and uniformly generating random graphs for the same range of d_=O(m^1/4-  ...  We also thank the anonymous referees for their great comments and suggestions. M. Bayati  ... 
doi:10.1007/s00453-009-9340-1 fatcat:jtg7yaugwfas5ins6lez35sgiy

A Sequential Algorithm for Generating Random Graphs [chapter]

Mohsen Bayati, Jeong Han Kim, Amin Saberi
2007 Lecture Notes in Computer Science  
We present a nearly-linear time algorithm for counting and randomly generating simple graphs with a given degree sequence in a certain range.  ...  We also use sequential importance sampling to derive fully Polynomial-time Randomized Approximation Schemes (FPRAS) for counting and uniformly generating random graphs for the same range of d max = O(m  ...  We also thank the anonymous referees for their great comments and suggestions. M  ... 
doi:10.1007/978-3-540-74208-1_24 fatcat:67ak4sdo6rbl5iuu77punzhdwy

A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees

Joseph Blitzstein, Persi Diaconis
2011 Internet Mathematics  
In this paper, we use a characterization due to Erdős and Gallai to develop a sequential algorithm for generating a random labeled graph with a given degree sequence.  ...  The algorithm is easy to implement and allows surprisingly efficient sequential importance sampling.  ...  We thank Alex Gamburd, Susan Holmes, Brendan McKay, Richard Stanley, and Nick Wormald for their helpful suggestions and references.  ... 
doi:10.1080/15427951.2010.557277 fatcat:ge33ty3zpjf63est6b3hvnhxcq

Sequential stub matching for uniform generation of directed graphs with a given degree sequence [article]

Femke van Ieperen, Ivan Kryven
2022 arXiv   pre-print
This suggests that the sequential stub matching can be viewed as a practical algorithm for almost uniform sampling of digraphs, and we show that this algorithm can be implemented to feature linear expected  ...  For undirected graphs, randomised approximation algorithms have nonetheless been shown to achieve almost linear expected complexity for this problem.  ...  Erdős for an interesting discussion about MC algorithms and Niels Scholte for a clever remark about constant time lookup in lists.  ... 
arXiv:2103.15958v3 fatcat:2tggjjm6j5hmnczbl3s24yfloe

A Parallel Algorithm for Generating a Random Graph with a Prescribed Degree Sequence [article]

Hasanuzzaman Bhuiyan, Maleq Khan, Madhav Marathe
2017 arXiv   pre-print
In this paper, we present an OpenMP-based shared-memory parallel algorithm for generating a random graph with a prescribed degree sequence, which achieves a speedup of 20.5 with 32 cores.  ...  This paper presents the first non-trivial parallel algorithm for checking the Erdős-Gallai characterization, which achieves a speedup of 23 using 32 cores.  ...  A parallel algorithm for generating a random graph with a given expected degree sequence has been presented in [31] .  ... 
arXiv:1708.07290v2 fatcat:rfzz2gpgwzdabl7yvdzkwc6qfy

Generation of synthetic sequential benchmark circuits

Michael Hutton, Jonathan Rose, Derek Corneil
1997 Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays - FPGA '97  
We presented a t o ol (circ) to extract them, and gave an algorithm and tool (gen) which generates random circuits, parameterized by those characteristics or by a realistic set of defaults.  ...  By comparing the post-layout properties of the generated circuits with already existing circuits, we demonstrate that the synthetic circuits are m u c h m o r e r ealistic than random graphs with the same  ...  Acknowledgements: The authors would like t o t h a n k Vaughn Betz for use of vpr.  ... 
doi:10.1145/258305.258333 dblp:conf/fpga/HuttonRC97 fatcat:mog6d4lhbfb4dhfm2yb4m5lyka

Fast Parallel Algorithms for Edge-Switching to Achieve a Target Visit Rate in Heterogeneous Graphs

Hasanuzzaman Bhuiyan, Jiangzhuo Chen, Maleq Khan, Madhav V. Marathe
2014 2014 43rd International Conference on Parallel Processing  
Edge switch operations have important applications in graph theory and network analysis, such as in generating random networks with a given degree sequence, modeling and analyzing dynamic networks (e.g  ...  One of the steps in our edge switch algorithm requires the computation of multinomial random variables in parallel. The paper presents the first non-trivial parallel algorithm for the problem.  ...  graphs generated by two different runs of the sequential algorithm.  ... 
doi:10.1109/icpp.2014.15 dblp:conf/icpp/BhuiyanCKM14 fatcat:mq7tdop57vbrjertkn5p73vpuu

Parallel algorithms for switching edges in heterogeneous graphs

Hasanuzzaman Bhuiyan, Maleq Khan, Jiangzhuo Chen, Madhav Marathe
2017 Journal of Parallel and Distributed Computing  
Edge switch operations have important applications in graph theory and network analysis, such as in generating random networks with a given degree sequence, modeling and analyzing dynamic networks, and  ...  This paper presents the first non-trivial parallel algorithm for the problem, achieving a speedup of 925 using 1024 processors.  ...  We are grateful to Anil Vullikanti for interesting discussions and helpful comments on a draft of this paper.  ... 
doi:10.1016/j.jpdc.2016.12.005 pmid:28757680 pmcid:PMC5526649 fatcat:pyazmucbbfbpvjcmslm7i6wwf4

Single-source shortest paths with the parallel boost graph library [chapter]

Nick Edmonds, Alex Breuer, Douglas Gregor, Andrew Lumsdaine
2009 DIMACS Series in Discrete Mathematics and Theoretical Computer Science  
The Parallel Boost Graph Library (Parallel BGL) is a library of graph algorithms and data structures for distributed-memory computation on large graphs.  ...  Developed with the Generic Programming paradigm, the Parallel BGL is highly customizable, supporting various graph data structures, arbitrary vertex and edge properties, and different communication media  ...  Acknowledgements This work was supported by a grant from the Lilly Endowment and by NSF grants EIA-0131354 and EIA-0202048.  ... 
doi:10.1090/dimacs/074/09 dblp:conf/dimacs/EdmondsBGL06 fatcat:gl6pxfencbg2djp7arfbfbsiwm

An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances [chapter]

Kamesh Madduri, David A. Bader, Jonathan W. Berry, Joseph R. Crobak
2007 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)  
Our implementation exhibits remarkable parallel speedup when compared with competitive sequential algorithms, for low-diameter sparse graphs.  ...  For instance, ∆-stepping on a directed scalefree graph of 100 million vertices and 1 billion edges takes less than ten seconds on 40 processors of the MTA-2, with a relative speedup of close to 30.  ...  Sandia is a multipurpose laboratory operated by Sandia Corporation, a Lockheed-Martin Company, for the United States Department of Energy under contract DE-AC04-94AL85000.  ... 
doi:10.1137/1.9781611972870.3 dblp:conf/alenex/MadduriBBC07 fatcat:vzlqjuezajaprdd6p7tc52irfe

Fast random graph generation

Sadegh Nobari, Xuesong Lu, Panagiotis Karras, Stéphane Bressan
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
Today, several database applications call for the generation of random graphs. A fundamental, versatile random graph model adopted for that purpose is the Erdős-Rényi Γv,p model.  ...  In this paper, we propose PPreZER, an alternative, data parallel algorithm for random graph generation under the Erdős-Rényi model, designed and implemented in a graphics processing unit (GPU).  ...  5 G ← ei; SEQUENTIAL ALGORITHMS In this section we successively introduce three sequential algorithms for random graph generation in the Γv,p model, namely ZER, PreLogZER and PreZER.  ... 
doi:10.1145/1951365.1951406 dblp:conf/edbt/NobariLKB11 fatcat:hsmrsslmlzcqnptt64hlg2s4dm

Adapting Local Sequential Algorithms to the Distributed Setting

Ken-Ichi Kawarabayashi, Gregory Schwartzman, Michael Wagner
2018 International Symposium on Distributed Computing  
It is a well known fact that sequential algorithms which exhibit a strong "local" nature can be adapted to the distributed setting given a legal graph coloring.  ...  and O( −1 ) running time for randomized ones.  ...  There exists a deterministic (1/2 − )-approximation algorithms for weighted max-agree correlation clustering on general graphs, running in O(log * n) communication rounds in the CONGEST model.  ... 
doi:10.4230/lipics.disc.2018.35 dblp:conf/wdag/KawarabayashiS18 fatcat:oa256jmgcbfcze77ueqymt27rm

Automatic generation of synthetic sequential benchmark circuits

M.D. Hutton, J.S. Rose, D.G. Corneil
2002 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
They give an algorithm (GEN) for generating sequential benchmark netlists, significantly expanding previous work (Hutton et al., 1998) which generated purely combinational circuits.  ...  They introduce an abstract model for describing sequential circuits and a collection of statistical parameters for better understanding the nature of circuits.  ...  ACKNOWLEDGMENT The authors would like to thank Altera Corporation for providing the first author with a summer internship, during which parts of this research were performed, and for allowing access to  ... 
doi:10.1109/tcad.2002.800456 fatcat:wsqglxdplvgf7locu46jb2l4vu

Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel [chapter]

Julian Shun, Yan Gu, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons
2014 Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms  
We show that simple sequential randomized iterative algorithms for random permutation, list contraction, and tree contraction are highly parallel.  ...  Experiments on a 40-core machine show reasonably good performance relative to the sequential algorithms.  ...  Computing Program, the Intel Science and Technology Center for Cloud Computing (ISTC-CC) and a Facebook Graduate Fellowship.  ... 
doi:10.1137/1.9781611973730.30 dblp:conf/soda/ShunGBFG15 fatcat:4gi73s3gvzh5bl5rvnow2hp63i

Properties and Performance of the ABCDe Random Graph Model with Community Structure [article]

Bogumił Kamiński, Tomasz Olczak, Bartosz Pankratz, Paweł Prałat, François Théberge
2022 arXiv   pre-print
We propose ABCDe, a multi-threaded implementation of the ABCD (Artificial Benchmark for Community Detection) graph generator.  ...  Moreover, the algorithm is not only faster but random graphs generated by ABCD have similar properties to the ones generated by the original LFR algorithm, while the parallelized NetworKit implementation  ...  Working together with the partners, SOSCIP is driving the uptake of AI and data science solutions and enabling the development of a knowledge-based and innovative economy in Ontario by supporting technical  ... 
arXiv:2203.14899v2 fatcat:vzy3meiuqrfszmgnaajdzynl4u
« Previous Showing results 1 — 15 out of 145,441 results