All Questions
14
questions
0
votes
0answers
50 views
L1 sampling for sampling edges of a graph
I am trying to sample the edges of an undirected graph using weights. The goal is to run a sparsification algorithm on the graph. I see the point that L1 norm is best for sparsification. Can someone ...
4
votes
1answer
115 views
Uniformly sampling from cycles of a graph
I was wondering if, given an arbitrary cycle basis (that's complete, e.g. every cycle in the graph can be expressed as the $\mathbb{Z}/2\mathbb{Z}$ sum of elements from the basis) of some graph $G$, ...
1
vote
0answers
254 views
Uniform generation of random bipartite bi-regular graphs?
I want an algorithm that takes the following
Input: $M,N,k,d$ positive integers such that $kM = dN$.
and produces the following
Output: Random bipartite graph, with $M$ vertices all of degree $k$ ...
2
votes
0answers
360 views
Sampling random graphs with Eulerian paths
How to generate random graphs with eulerian Paths?
Its well known that there is a eulerian path if the number of nodes with odd degree is exactly 2 or zero. I'm interested in an algorithm to make ...
3
votes
2answers
123 views
Generating graphs such as found on Sedgewick's Algorithms book on the MST chapters
I always wondered what the algorithm might be to generate graphs such as those found on Sedgewick's algorithms books (consider the picture on the left):
Could any one point me to the name (or ...
1
vote
1answer
45 views
How to get samples of different paths?
Say I have a "semi" directed, weighted, graph (some edges are undirected, some are directed).
Consider two nodes, A and B. Consider the set of all paths that take me from node A to node B.
I ...
6
votes
1answer
820 views
Generate a random graph with geometrical degree distribution
I'm working on graph generation, trying to implement the RT-nested-Smallworld network model described in this paper.
We are talking about generating an undirected graph in a slightly different way ...
4
votes
1answer
1k views
Set the parameters of a Erdos-Renyi graph generator to get a specific mean degree
I'm trying to reproduce the synthetic networks (graphs) described in some papers.
The topic is the same as a previous question of mine, but with a different focus.
It is stated that the Erdos-Renyi ...
11
votes
1answer
6k views
Generate scale-free networks with power-law degree distributions using Barabasi-Albert
I'm trying to reproduce the synthetic networks (graphs) described in some papers.
It is stated that the Barabasi-Albert model was used to create "scale-free networks with power-law degree ...
6
votes
3answers
2k views
Constructing a random Hamiltonian Cycle (Secret Santa)
I was programming a little Secret Santa tool for my extended family's gift exchange. We had a few constraints:
No recipients within the immediate family
Nobody should get who they got last year
The ...
2
votes
0answers
141 views
Sampling a Large Undirected Graph
I'm working with a very large undirected graph (a social network from a telecomunication company).
I'm applying a clustering algorithm on this graph to find it’s most relevant communities. The ...
4
votes
2answers
119 views
Uniformly random efficient sampling of shortest s-t paths, with optimal random bits
Motivated by Efficiently sampling shortest s-t paths uniformly and independently at random,
The answers give methods of randomly sampling shortest $s\text{-}t$ paths. However, they use a lot of ...
14
votes
2answers
891 views
Efficiently sampling shortest $s$-$t$ paths uniformly and independently at random
Let $G$ be a graph, and let $s$ and $t$ be two vertices of $G$. Can we efficiently sample a shortest $s$-$t$ path uniformly and independently at random from the set of all shortest paths between $s$ ...
7
votes
1answer
2k views
Algorithms for graph generation using given properties
There may be a large number of algorithms proposed for generating graphs satisfying some common properties (e.g., clustering coefficient, average shortest path length, degree distribution, etc).
My ...
