48 research outputs found
Creation and Growth of Components in a Random Hypergraph Process
Denote by an -component a connected -uniform hypergraph with
edges and vertices. We prove that the expected number of
creations of -component during a random hypergraph process tends to 1 as
and tend to with the total number of vertices such that
. Under the same conditions, we also show that
the expected number of vertices that ever belong to an -component is
approximately . As an immediate
consequence, it follows that with high probability the largest -component
during the process is of size . Our results
give insight about the size of giant components inside the phase transition of
random hypergraphs.Comment: R\'{e}sum\'{e} \'{e}tend
Correlation between clustering and degree in affiliation networks
We are interested in the probability that two randomly selected neighbors of
a random vertex of degree (at least) are adjacent. We evaluate this
probability for a power law random intersection graph, where each vertex is
prescribed a collection of attributes and two vertices are adjacent whenever
they share a common attribute. We show that the probability obeys the scaling
as . Our results are mathematically rigorous. The
parameter is determined by the tail indices of power law
random weights defining the links between vertices and attributes
Moment-based parameter estimation in binomial random intersection graph models
Binomial random intersection graphs can be used as parsimonious statistical
models of large and sparse networks, with one parameter for the average degree
and another for transitivity, the tendency of neighbours of a node to be
connected. This paper discusses the estimation of these parameters from a
single observed instance of the graph, using moment estimators based on
observed degrees and frequencies of 2-stars and triangles. The observed data
set is assumed to be a subgraph induced by a set of nodes sampled from
the full set of nodes. We prove the consistency of the proposed estimators
by showing that the relative estimation error is small with high probability
for . As a byproduct, our analysis confirms that the
empirical transitivity coefficient of the graph is with high probability close
to the theoretical clustering coefficient of the model.Comment: 15 pages, 6 figure
Parameter estimators of random intersection graphs with thinned communities
This paper studies a statistical network model generated by a large number of
randomly sized overlapping communities, where any pair of nodes sharing a
community is linked with probability via the community. In the special case
with the model reduces to a random intersection graph which is known to
generate high levels of transitivity also in the sparse context. The parameter
adds a degree of freedom and leads to a parsimonious and analytically
tractable network model with tunable density, transitivity, and degree
fluctuations. We prove that the parameters of this model can be consistently
estimated in the large and sparse limiting regime using moment estimators based
on partially observed densities of links, 2-stars, and triangles.Comment: 15 page
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
We study wear-leveling techniques for cuckoo hashing, showing that it is
possible to achieve a memory wear bound of after the
insertion of items into a table of size for a suitable constant
using cuckoo hashing. Moreover, we study our cuckoo hashing method empirically,
showing that it significantly improves on the memory wear performance for
classic cuckoo hashing and linear probing in practice.Comment: 13 pages, 1 table, 7 figures; to appear at the 13th Symposium on
Experimental Algorithms (SEA 2014