Filters








28,465 Hits in 8.1 sec

Generating constrained random graphs using multiple edge switches [article]

Lionel Tabourier, Camille Roth, Jean-Philippe Cointet
2012 arXiv   pre-print
The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions.  ...  We therefore propose to get round this issue by generalizing this classical approach through the use of higher-order edge switches.  ...  We are grateful to Clémence Magnien and Fernando Peruani for interesting discussions, thank the anonymous reviewers for their constructive feedback, and acknowledge useful comments from Hugues Chaté and  ... 
arXiv:1012.3023v2 fatcat:pfwvxuzaovb67j4qgsudkj2uaa

Generating constrained random graphs using multiple edge switches

Lionel Tabourier, Camille Roth, Jean-Philippe Cointet
2011 ACM Journal of Experimental Algorithmics  
The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions.  ...  We therefore propose to get round this issue by generalizing this classical approach through the use of higher-order edge switches.  ...  We are grateful to Clémence Magnien and Fernando Peruani for interesting discussions, thank the anonymous reviewers for their constructive feedback, and acknowledge useful comments from Hugues Chaté and  ... 
doi:10.1145/1963190.2063515 fatcat:xfyjffistjf2zb4aw7z5xv4vly

Switch chain mixing times through triangle counts [article]

Tom Bannink, Remco van der Hofstad, Clara Stegehuis
2017 arXiv   pre-print
We propose a method to sample uniform simple graphs that uses a constrained version of the configuration model together with a Markov Chain switching method.  ...  Using simulations and heuristic arguments, we conjecture that the number of triangles in the erased configuration model is larger than the number of triangles in the uniform random graph, provided that  ...  We introduce a new algorithm that uses a constrained version of the configuration model where self-loops and multiple edges are avoided.  ... 
arXiv:1711.06137v1 fatcat:xkdlhclfwrhsdj34hsftou6i2e

Depth-driven verification of simultaneous interfaces

Ilya Wagner, Valeria Bertacco, Todd Austin
2006 Proceedings of the 2006 conference on Asia South Pacific design automation - ASP-DAC '06  
We examine three non-trivial designs, two microprocessors and a chipmultiprocessor router switch, and we demonstrate that our technique finds many more bugs than constrained-random test generation technique  ...  Test accuracy is improved through the use of depth-driven random test generation. The approach allows users to specify correctness properties and key activity nodes in the design to be exercises.  ...  The vertices in the graph are connected by edges labeled with the probability of performing a graph transition through them: at the beginning of the test generation, all the outgoing edges from a vertex  ... 
doi:10.1145/1118299.1118410 fatcat:ixq4cmjixbfsrbbmw5cmhvefjq

Layout-conscious random topologies for HPC off-chip interconnects

M. Koibuchi, I. Fujiwara, H. Matsutani, H. Casanova
2013 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA)  
We quantitatively compare these two methods using both graph analysis and cycle-accurate network simulation, including comparisons with previously proposed random topologies and non-random topologies.  ...  Random network topologies can be used to achieve low hop counts between nodes and thus low latency.  ...  Note also that the generation procedure may lead to multiple edges between the same pair of switches, but only the first such edge is actually added and all other redundant edges are ignored if the link  ... 
doi:10.1109/hpca.2013.6522343 dblp:conf/hpca/KoibuchiFMC13 fatcat:lkozfi554fffrfvxfgomoj2pc4

Connectedness matters: Construction and exact random sampling of connected graphs [article]

Szabolcs Horvát, Carl D. Modes
2020 arXiv   pre-print
Our method builds on a recently introduced novel sampling approach that constructs graphs with given degrees independently (unlike edge-switching Markov Chain Monte Carlo methods) and efficiently (unlike  ...  We describe a new method for the random sampling of connected networks with a specified degree sequence. We consider both the case of simple graphs and that of loopless multigraphs.  ...  Horvát would like to acknowledge useful discussions with Kevin Bassler, Zoltán Toroczkai andÉva Czabarka.  ... 
arXiv:2009.03747v2 fatcat:pzexpjlhlffapfymllqioqe7lu

Detecting and Mitigating Abnormal Events in Large Scale Networks: Budget Constrained Placement on Smart Grids

N Santhi, Feng Pan
2011 2011 44th Hawaii International Conference on System Sciences  
In this paper we consider some natural network optimization questions related to the budget constrained interdiction problem over general graphs, specifically focusing on the sensor/switch placement problem  ...  This can be easily seen considering the following probabilistic argument: Ifȳ i is a fractional point in the solution, let us use the following randomized procedure -generate a uniform random variable  ...  In this paper, without loss of generality we will be considering an edge interdiction model on a directed network graph.  ... 
doi:10.1109/hicss.2011.153 dblp:conf/hicss/SanthiP11 fatcat:2tlnklda7nd3zoapc7lb7kd53m

Graph Generation with Prescribed Feature Constraints [chapter]

Xiaowei Ying, Xintao Wu
2009 Proceedings of the 2009 SIAM International Conference on Data Mining  
We present a simple switching based graph generation approach to generate graphs preserving features of a real graph.  ...  Our algorithms on graph generation with feature range and feature distribution constraints are based on the Metropolis-Hastings sampling.  ...  The algorithm uses a Markov chain to generate a random graph.  ... 
doi:10.1137/1.9781611972795.83 dblp:conf/sdm/YingW09a fatcat:dj4ovqmosjc7viytrl4fyil35e

A survey of graph-modification techniques for privacy-preserving on networks

Jordi Casas-Roma, Jordi Herrera-Joancomartí, Vicenç Torra
2016 Artificial Intelligence Review  
These methods allow researchers and third-parties to apply all graph-mining processes on anonymous data, from local to global knowledge extraction.  ...  In this paper we summarize privacy-preserving techniques, focusing on graph-modification methods which alter graph's structure and release the entire anonymous network.  ...  We will review the most important methods of graph-modification techniques for privacy-preserving on networks, i.e. random perturbation, constrained perturbation, uncertain graphs and generalization.  ... 
doi:10.1007/s10462-016-9484-8 fatcat:urgdo2l35rag3bneqgmwyxnkhm

Topology generators for Software Defined Network testing

Sunit Kumar Nandi
2016 2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT)  
The first is a random topology generator based on the Erdős-Rényi model and the second is a generator that uses a SNAP format dataset to build the topology.  ...  This delegates switching/routing decisions to a controller that is connected to the switches. The connectivity of the switches and controllers can be represented as a network topology.  ...  To get the connectivity, we need a graph. To generate a graph, we can use a random graph generating algorithm.  ... 
doi:10.1109/iceeot.2016.7755247 fatcat:ngmp53t5rbdrddeuald2kb4tim

Rearranging similar objects with a manipulator using pebble graphs

Athanasios Krontiris, Rahul Shome, Andrew Dobson, Andrew Kimmel, Kostas Bekris
2014 2014 IEEE-RAS International Conference on Humanoid Robots  
Rearrangement is a challenging problem as it involves combinatorially large, continuous configuration spaces due to the presence of multiple bodies and kinematically complex manipulators.  ...  It is helpful to generate multiple such graphs and identify transitions between them to find a solution.  ...  (B) CONNECT SIBLINGS connects "sibling" super-nodes by using the constraint edges E c to switch between different signatures on the same MPG.  ... 
doi:10.1109/humanoids.2014.7041499 dblp:conf/humanoids/KrontirisSDKB14 fatcat:tknyd5g3ajdsxb5dpjhyzo6aki

SHERPA: A SDN Multipath Approach to Eliminate Resilience Impact on Video Streams

Constant Colombo, Francis Lepage, Rene Kopp, Eric Gnaedinger
2018 2018 IEEE 18th International Conference on Communication Technology (ICCT)  
Experimentation Scheme SHERPA algorithm is here evaluated in terms of performance and scalability. 1) Problem generation: Random graphs are generated given a number of nodes following an Erdõs-Rényi model  ...  The produced graph is called Residual Graph. 4: Using a delay constrained shortest path algorithm, a path P 2 from s to t is found in this new graph. 5: Edges that exists in opposite directions in P 1  ... 
doi:10.1109/icct.2018.8600180 fatcat:fogcx2ta2ja4tea65arqvqesmm

Two SDN Multi-tree Approaches for Constrained Seamless Multicast

Constant Colombo, Francis Lepage, Rene Kopp, Eric Gnaedinger
2018 2018 IEEE International Conference on Computational Science and Engineering (CSE)  
This work aims to propose a Software Defined Networking (SDN) architecture [1] in which a central controller uses its knowledge of the performance and bandwidth allocation to compute redundant disjoint  ...  Experimentation Scheme The two proposed algorithms are here evaluated in terms of performance and scalability. 1) Problem generation: Random graphs are generated given a number of nodes following an Erdõs-Rényi  ...  Sparse and dense graphs will be generated with p = 0.1 and 0.6 for n = 20. Medium graphs will be generated with p = 0.01 for n = 100.  ... 
doi:10.1109/cse.2018.00017 dblp:conf/cse/ColomboLKG18 fatcat:f6ppymce3zg7fh2z62voccy6eq

Constrained Markovian Dynamics of Random Graphs

A. C. C. Coolen, A. De Martino, A. Annibale
2009 Journal of statistical physics  
As an application of the general theory we analyze the properties of degree-preserving Markov chains based on elementary edge switchings.  ...  This formula allows us to define acceptance probabilities for edge switchings, such that the Markov chains become controlled Glauber-type detailed balance processes, designed to evolve to any required  ...  Multiple examples of these are found in systems biology, where different graph randomization protocols have for instance been tested and used to identify the elementary bricks ('motifs') characterizing  ... 
doi:10.1007/s10955-009-9821-2 fatcat:45ub2eg3nraplkr6sk2rjb7ade

CNOP - A Package for Constrained Network Optimization [chapter]

K. Mehlhorn, M. Ziegelmann
2001 Lecture Notes in Computer Science  
We present a generic package for resource constrained network optimization problems.  ...  We illustrate the flexibility and the use of our package by solving four applications: route planning, curve approximation, minimum cost reliability constrained spanning trees and the table layout problem  ...  After setting up the graph and the edge costs and resources we can simply use the csp function of CNOP.  ... 
doi:10.1007/3-540-44808-x_2 fatcat:okl72bsk5vhk7i4lruwflsl5qe
« Previous Showing results 1 — 15 out of 28,465 results