Using an associated branching process as the basis of our approximation, we show that typical inter-point distances in a multitype random intersection graph have a defective distribution, which is well described by a mixture of translated and scaled Gumbel distributions, the missing mass corresponding to the event that the vertices are not in the same component of the graph
Some statements related to the distribution of small subgraphs in a sequence of random distance grap...
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidea...
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidea...
Using an associated branching process as the basis of our approximation, we show that typical inter-...
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Rényi...
A random intersection graph is constructed by assigning independently to each vertex a subset of a g...
Random-graphs and statistical inference with missing data are two separate topics that have been wid...
A random intersection graph is constructed by independently assigning each vertex a subset of a give...
We consider the problem of determining the proportion of edges that are discovered in a random graph...
AbstractWe consider the problem of finding the shortest distance between all pairs of vertices in a ...
There have lately been several suggestions for parametrized distances on a graph that generalize the...
The distance for a pair of vertices in a graph G is the length of the shortest path between them. Th...
AbstractA uniform random intersection graph G(n,m,k) is a random graph constructed as follows. Label...
In this paper we study a random graph with N nodes, where node j has degree Dj and {Dj} N j=1 are i....
Abstract: In this paper, we propose a form of random graph (network) model in which the probability ...
Some statements related to the distribution of small subgraphs in a sequence of random distance grap...
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidea...
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidea...
Using an associated branching process as the basis of our approximation, we show that typical inter-...
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Rényi...
A random intersection graph is constructed by assigning independently to each vertex a subset of a g...
Random-graphs and statistical inference with missing data are two separate topics that have been wid...
A random intersection graph is constructed by independently assigning each vertex a subset of a give...
We consider the problem of determining the proportion of edges that are discovered in a random graph...
AbstractWe consider the problem of finding the shortest distance between all pairs of vertices in a ...
There have lately been several suggestions for parametrized distances on a graph that generalize the...
The distance for a pair of vertices in a graph G is the length of the shortest path between them. Th...
AbstractA uniform random intersection graph G(n,m,k) is a random graph constructed as follows. Label...
In this paper we study a random graph with N nodes, where node j has degree Dj and {Dj} N j=1 are i....
Abstract: In this paper, we propose a form of random graph (network) model in which the probability ...
Some statements related to the distribution of small subgraphs in a sequence of random distance grap...
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidea...
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidea...
DOI
Add to ORKG