701 research outputs found
RiffleScrambler - a memory-hard password storing function
We introduce RiffleScrambler: a new family of directed acyclic graphs and a
corresponding data-independent memory hard function with password independent
memory access. We prove its memory hardness in the random oracle model.
RiffleScrambler is similar to Catena -- updates of hashes are determined by a
graph (bit-reversal or double-butterfly graph in Catena). The advantage of the
RiffleScrambler over Catena is that the underlying graphs are not predefined
but are generated per salt, as in Balloon Hashing. Such an approach leads to
higher immunity against practical parallel attacks. RiffleScrambler offers
better efficiency than Balloon Hashing since the in-degree of the underlying
graph is equal to 3 (and is much smaller than in Ballon Hashing). At the same
time, because the underlying graph is an instance of a Superconcentrator, our
construction achieves the same time-memory trade-offs.Comment: Accepted to ESORICS 201
MMed cohort supervision: A path out of the swamp?
The authors present the case for collaborative cohort supervision (CCM), including both master’s students and novice supervisors, as a possible way to rapidly increase the number of supervisors needed to address the recent implementation of a compulsory research component to specialist registration with the Health Professions Council of South Africa. Different models of CCM are discussed and possible pitfalls highlighted
Matchings on infinite graphs
Elek and Lippner (2010) showed that the convergence of a sequence of
bounded-degree graphs implies the existence of a limit for the proportion of
vertices covered by a maximum matching. We provide a characterization of the
limiting parameter via a local recursion defined directly on the limit of the
graph sequence. Interestingly, the recursion may admit multiple solutions,
implying non-trivial long-range dependencies between the covered vertices. We
overcome this lack of correlation decay by introducing a perturbative parameter
(temperature), which we let progressively go to zero. This allows us to
uniquely identify the correct solution. In the important case where the graph
limit is a unimodular Galton-Watson tree, the recursion simplifies into a
distributional equation that can be solved explicitly, leading to a new
asymptotic formula that considerably extends the well-known one by Karp and
Sipser for Erd\"os-R\'enyi random graphs.Comment: 23 page
Optimal spatial transportation networks where link-costs are sublinear in link-capacity
Consider designing a transportation network on vertices in the plane,
with traffic demand uniform over all source-destination pairs. Suppose the cost
of a link of length and capacity scales as for fixed
. Under appropriate standardization, the cost of the minimum cost
Gilbert network grows essentially as , where on and on . This quantity is an upper bound in
the worst case (of vertex positions), and a lower bound under mild regularity
assumptions. Essentially the same bounds hold if we constrain the network to be
efficient in the sense that average route-length is only times
average straight line length. The transition at corresponds to
the dominant cost contribution changing from short links to long links. The
upper bounds arise in the following type of hierarchical networks, which are
therefore optimal in an order of magnitude sense. On the large scale, use a
sparse Poisson line process to provide long-range links. On the medium scale,
use hierachical routing on the square lattice. On the small scale, link
vertices directly to medium-grid points. We discuss one of many possible
variant models, in which links also have a designed maximum speed and the
cost becomes .Comment: 13 page
The scaling limit of the incipient infinite cluster in high-dimensional percolation. II. Integrated super-Brownian excursion
For independent nearest-neighbour bond percolation on Z^d with d >> 6, we
prove that the incipient infinite cluster's two-point function and three-point
function converge to those of integrated super-Brownian excursion (ISE) in the
scaling limit. The proof is based on an extension of the new expansion for
percolation derived in a previous paper, and involves treating the magnetic
field as a complex variable. A special case of our result for the two-point
function implies that the probability that the cluster of the origin consists
of n sites, at the critical point, is given by a multiple of n^{-3/2}, plus an
error term of order n^{-3/2-\epsilon} with \epsilon >0. This is a strong
statement that the critical exponent delta is given by delta =2.Comment: 56 pages, 3 Postscript figures, in AMS-LaTeX, with graphicx, epic,
and xr package
On Bootstrap Percolation in Living Neural Networks
Recent experimental studies of living neural networks reveal that their
global activation induced by electrical stimulation can be explained using the
concept of bootstrap percolation on a directed random network. The experiment
consists in activating externally an initial random fraction of the neurons and
observe the process of firing until its equilibrium. The final portion of
neurons that are active depends in a non linear way on the initial fraction.
The main result of this paper is a theorem which enables us to find the
asymptotic of final proportion of the fired neurons in the case of random
directed graphs with given node degrees as the model for interacting network.
This gives a rigorous mathematical proof of a phenomena observed by physicists
in neural networks
Random graph asymptotics on high-dimensional tori. II. Volume, diameter and mixing time
For critical bond-percolation on high-dimensional torus, this paper proves
sharp lower bounds on the size of the largest cluster, removing a logarithmic
correction in the lower bound in Heydenreich and van der Hofstad (2007). This
improvement finally settles a conjecture by Aizenman (1997) about the role of
boundary conditions in critical high-dimensional percolation, and it is a key
step in deriving further properties of critical percolation on the torus.
Indeed, a criterion of Nachmias and Peres (2008) implies appropriate bounds on
diameter and mixing time of the largest clusters. We further prove that the
volume bounds apply also to any finite number of the largest clusters. The main
conclusion of the paper is that the behavior of critical percolation on the
high-dimensional torus is the same as for critical Erdos-Renyi random graphs.
In this updated version we incorporate an erratum to be published in a
forthcoming issue of Probab. Theory Relat. Fields. This results in a
modification of Theorem 1.2 as well as Proposition 3.1.Comment: 16 pages. v4 incorporates an erratum to be published in a forthcoming
issue of Probab. Theory Relat. Field
The topological structure of scaling limits of large planar maps
We discuss scaling limits of large bipartite planar maps. If p is a fixed
integer strictly greater than 1, we consider a random planar map M(n) which is
uniformly distributed over the set of all 2p-angulations with n faces. Then, at
least along a suitable subsequence, the metric space M(n) equipped with the
graph distance rescaled by the factor n to the power -1/4 converges in
distribution as n tends to infinity towards a limiting random compact metric
space, in the sense of the Gromov-Hausdorff distance. We prove that the
topology of the limiting space is uniquely determined independently of p, and
that this space can be obtained as the quotient of the Continuum Random Tree
for an equivalence relation which is defined from Brownian labels attached to
the vertices. We also verify that the Hausdorff dimension of the limit is
almost surely equal to 4.Comment: 45 pages Second version with minor modification
The structure of typical clusters in large sparse random configurations
The initial purpose of this work is to provide a probabilistic explanation of
a recent result on a version of Smoluchowski's coagulation equations in which
the number of aggregations is limited. The latter models the deterministic
evolution of concentrations of particles in a medium where particles coalesce
pairwise as time passes and each particle can only perform a given number of
aggregations. Under appropriate assumptions, the concentrations of particles
converge as time tends to infinity to some measure which bears a striking
resemblance with the distribution of the total population of a Galton-Watson
process started from two ancestors. Roughly speaking, the configuration model
is a stochastic construction which aims at producing a typical graph on a set
of vertices with pre-described degrees. Specifically, one attaches to each
vertex a certain number of stubs, and then join pairwise the stubs uniformly at
random to create edges between vertices. In this work, we use the configuration
model as the stochastic counterpart of Smoluchowski's coagulation equations
with limited aggregations. We establish a hydrodynamical type limit theorem for
the empirical measure of the shapes of clusters in the configuration model when
the number of vertices tends to . The limit is given in terms of the
distribution of a Galton-Watson process started with two ancestors
Packing and Hausdorff measures of stable trees
In this paper we discuss Hausdorff and packing measures of random continuous
trees called stable trees. Stable trees form a specific class of L\'evy trees
(introduced by Le Gall and Le Jan in 1998) that contains Aldous's continuum
random tree (1991) which corresponds to the Brownian case. We provide results
for the whole stable trees and for their level sets that are the sets of points
situated at a given distance from the root. We first show that there is no
exact packing measure for levels sets. We also prove that non-Brownian stable
trees and their level sets have no exact Hausdorff measure with regularly
varying gauge function, which continues previous results from a joint work with
J-F Le Gall (2006).Comment: 40 page
- …