322 research outputs found
Decentralized Constraint Satisfaction
We show that several important resource allocation problems in wireless
networks fit within the common framework of Constraint Satisfaction Problems
(CSPs). Inspired by the requirements of these applications, where variables are
located at distinct network devices that may not be able to communicate but may
interfere, we define natural criteria that a CSP solver must possess in order
to be practical. We term these algorithms decentralized CSP solvers. The best
known CSP solvers were designed for centralized problems and do not meet these
criteria. We introduce a stochastic decentralized CSP solver and prove that it
will find a solution in almost surely finite time, should one exist, also
showing it has many practically desirable properties. We benchmark the
algorithm's performance on a well-studied class of CSPs, random k-SAT,
illustrating that the time the algorithm takes to find a satisfying assignment
is competitive with stochastic centralized solvers on problems with order a
thousand variables despite its decentralized nature. We demonstrate the
solver's practical utility for the problems that motivated its introduction by
using it to find a non-interfering channel allocation for a network formed from
data from downtown Manhattan
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
Spectrum of non-Hermitian heavy tailed random matrices
Let (X_{jk})_{j,k>=1} be i.i.d. complex random variables such that |X_{jk}|
is in the domain of attraction of an alpha-stable law, with 0< alpha <2. Our
main result is a heavy tailed counterpart of Girko's circular law. Namely,
under some additional smoothness assumptions on the law of X_{jk}, we prove
that there exists a deterministic sequence a_n ~ n^{1/alpha} and a probability
measure mu_alpha on C depending only on alpha such that with probability one,
the empirical distribution of the eigenvalues of the rescaled matrix a_n^{-1}
(X_{jk})_{1<=j,k<=n} converges weakly to mu_alpha as n tends to infinity. Our
approach combines Aldous & Steele's objective method with Girko's Hermitization
using logarithmic potentials. The underlying limiting object is defined on a
bipartized version of Aldous' Poisson Weighted Infinite Tree. Recursive
relations on the tree provide some properties of mu_alpha. In contrast with the
Hermitian case, we find that mu_alpha is not heavy tailed.Comment: Expanded version of a paper published in Communications in
Mathematical Physics 307, 513-560 (2011
CUTOFF AT THE " ENTROPIC TIME " FOR SPARSE MARKOV CHAINS
International audienceWe study convergence to equilibrium for a large class of Markov chains in random environment. The chains are sparse in the sense that in every row of the transition matrix P the mass is essentially concentrated on few entries. Moreover, the random environment is such that rows of P are independent and such that the entries are exchangeable within each row. This includes various models of random walks on sparse random directed graphs. The models are generally non reversible and the equilibrium distribution is itself unknown. In this general setting we establish the cutoff phenomenon for the total variation distance to equilibrium, with mixing time given by the logarithm of the number of states times the inverse of the average row entropy of P. As an application, we consider the case where the rows of P are i.i.d. random vectors in the domain of attraction of a Poisson-Dirichlet law with index α â (0, 1). Our main results are based on a detailed analysis of the weight of the trajectory followed by the walker. This approach offers an interpretation of cutoff as an instance of the concentration of measure phenomenon
Spectral density of random graphs with topological constraints
The spectral density of random graphs with topological constraints is
analysed using the replica method. We consider graph ensembles featuring
generalised degree-degree correlations, as well as those with a community
structure. In each case an exact solution is found for the spectral density in
the form of consistency equations depending on the statistical properties of
the graph ensemble in question. We highlight the effect of these topological
constraints on the resulting spectral density.Comment: 24 pages, 6 figure
A real quaternion spherical ensemble of random matrices
One can identify a tripartite classification of random matrix ensembles into
geometrical universality classes corresponding to the plane, the sphere and the
anti-sphere. The plane is identified with Ginibre-type (iid) matrices and the
anti-sphere with truncations of unitary matrices. This paper focusses on an
ensemble corresponding to the sphere: matrices of the form \bY= \bA^{-1} \bB,
where \bA and \bB are independent matrices with iid standard
Gaussian real quaternion entries. By applying techniques similar to those used
for the analogous complex and real spherical ensembles, the eigenvalue jpdf and
correlation functions are calculated. This completes the exploration of
spherical matrices using the traditional Dyson indices .
We find that the eigenvalue density (after stereographic projection onto the
sphere) has a depletion of eigenvalues along a ring corresponding to the real
axis, with reflective symmetry about this ring. However, in the limit of large
matrix dimension, this eigenvalue density approaches that of the corresponding
complex ensemble, a density which is uniform on the sphere. This result is in
keeping with the spherical law (analogous to the circular law for iid
matrices), which states that for matrices having the spherical structure \bY=
\bA^{-1} \bB, where \bA and \bB are independent, iid matrices the
(stereographically projected) eigenvalue density tends to uniformity on the
sphere.Comment: 25 pages, 3 figures. Added another citation in version
Non-Backtracking Alternating Walks
The combinatorics of walks on a graph is a key topic in network science. Here we study a special class of walks on directed graphs. We combine two features that have previously been considered in isolation. We consider alternating walks, which form the basis of algorithms for hub/authority detection and for discovering directed bipartite substructure. Within this class, we restrict to non-backtracking walks, since this constraint has been seen to offer advantages in related contexts. We derive a recursive formula for counting the total number of non-backtracking alternating walks of a given length, leading to an expression for any associated power series expansion. We discuss computational issues for the widely used cases of resolvent and exponential series, showing that non-backtracking can be incorporated at very little extra cost. We also derive an appropriate asymptotic limit which gives a parameter-free, spectral analogue. We perform tests on an artificial data set in order to quantify the advantages of the new methodology. We also show that the removal of backtracking allows us to identify larger bipartite subgraphs within an anatomical connectivity network from neuroscience
Small ball probability, Inverse theorems, and applications
Let be a real random variable with mean zero and variance one and
be a multi-set in . The random sum
where are iid copies of
is of fundamental importance in probability and its applications.
We discuss the small ball problem, the aim of which is to estimate the
maximum probability that belongs to a ball with given small radius,
following the discovery made by Littlewood-Offord and Erdos almost 70 years
ago. We will mainly focus on recent developments that characterize the
structure of those sets where the small ball probability is relatively
large. Applications of these results include full solutions or significant
progresses of many open problems in different areas.Comment: 47 page
- âŠ