68 research outputs found
Comparing the reliability of networks by spectral analysis
We provide a method for the ranking of the reliability of two networks with
the same connectance. Our method is based on the Cheeger constant linking the
topological property of a network with its spectrum. We first analyze a set of
twisted rings with the same connectance and degree distribution, and obtain the
ranking of their reliability using their eigenvalue gaps. The results are
generalized to general networks using the method of rewiring. The success of
our ranking method is verified numerically for the IEEE57, the
Erd\H{o}s-R\'enyi, and the Small-World networks.Comment: 7 pages, 3 figure
Vertex Sparsifiers: New Results from Old Techniques
Given a capacitated graph and a set of terminals ,
how should we produce a graph only on the terminals so that every
(multicommodity) flow between the terminals in could be supported in
with low congestion, and vice versa? (Such a graph is called a
flow-sparsifier for .) What if we want to be a "simple" graph? What if
we allow to be a convex combination of simple graphs?
Improving on results of Moitra [FOCS 2009] and Leighton and Moitra [STOC
2010], we give efficient algorithms for constructing: (a) a flow-sparsifier
that maintains congestion up to a factor of , where , (b) a convex combination of trees over the terminals that maintains
congestion up to a factor of , and (c) for a planar graph , a
convex combination of planar graphs that maintains congestion up to a constant
factor. This requires us to give a new algorithm for the 0-extension problem,
the first one in which the preimages of each terminal are connected in .
Moreover, this result extends to minor-closed families of graphs.
Our improved bounds immediately imply improved approximation guarantees for
several terminal-based cut and ordering problems.Comment: An extended abstract appears in the 13th International Workshop on
Approximation Algorithms for Combinatorial Optimization Problems (APPROX),
2010. Final version to appear in SIAM J. Computin
Small doubling in groups
Let A be a subset of a group G = (G,.). We will survey the theory of sets A
with the property that |A.A| <= K|A|, where A.A = {a_1 a_2 : a_1, a_2 in A}.
The case G = (Z,+) is the famous Freiman--Ruzsa theorem.Comment: 23 pages, survey article submitted to Proceedings of the Erdos
Centenary conferenc
The geometry of spontaneous spiking in neuronal networks
The mathematical theory of pattern formation in electrically coupled networks
of excitable neurons forced by small noise is presented in this work. Using the
Freidlin-Wentzell large deviation theory for randomly perturbed dynamical
systems and the elements of the algebraic graph theory, we identify and analyze
the main regimes in the network dynamics in terms of the key control
parameters: excitability, coupling strength, and network topology. The analysis
reveals the geometry of spontaneous dynamics in electrically coupled network.
Specifically, we show that the location of the minima of a certain continuous
function on the surface of the unit n-cube encodes the most likely activity
patterns generated by the network. By studying how the minima of this function
evolve under the variation of the coupling strength, we describe the principal
transformations in the network dynamics. The minimization problem is also used
for the quantitative description of the main dynamical regimes and transitions
between them. In particular, for the weak and strong coupling regimes, we
present asymptotic formulas for the network activity rate as a function of the
coupling strength and the degree of the network. The variational analysis is
complemented by the stability analysis of the synchronous state in the strong
coupling regime. The stability estimates reveal the contribution of the network
connectivity and the properties of the cycle subspace associated with the graph
of the network to its synchronization properties. This work is motivated by the
experimental and modeling studies of the ensemble of neurons in the Locus
Coeruleus, a nucleus in the brainstem involved in the regulation of cognitive
performance and behavior
Fast Scramblers, Horizons and Expander Graphs
We propose that local quantum systems defined on expander graphs provide a
simple microscopic model for thermalization on quantum horizons. Such systems
are automatically fast scramblers and are motivated from the membrane paradigm
by a conformal transformation to the so-called optical metric.Comment: 22 pages, 2 figures. Added further discussion in section 3. Added
reference
The road to deterministic matrices with the restricted isometry property
The restricted isometry property (RIP) is a well-known matrix condition that
provides state-of-the-art reconstruction guarantees for compressed sensing.
While random matrices are known to satisfy this property with high probability,
deterministic constructions have found less success. In this paper, we consider
various techniques for demonstrating RIP deterministically, some popular and
some novel, and we evaluate their performance. In evaluating some techniques,
we apply random matrix theory and inadvertently find a simple alternative proof
that certain random matrices are RIP. Later, we propose a particular class of
matrices as candidates for being RIP, namely, equiangular tight frames (ETFs).
Using the known correspondence between real ETFs and strongly regular graphs,
we investigate certain combinatorial implications of a real ETF being RIP.
Specifically, we give probabilistic intuition for a new bound on the clique
number of Paley graphs of prime order, and we conjecture that the corresponding
ETFs are RIP in a manner similar to random matrices.Comment: 24 page
Expansion in perfect groups
Let Ga be a subgroup of GL_d(Q) generated by a finite symmetric set S. For an
integer q, denote by Ga_q the subgroup of Ga consisting of the elements that
project to the unit element mod q. We prove that the Cayley graphs of Ga/Ga_q
with respect to the generating set S form a family of expanders when q ranges
over square-free integers with large prime divisors if and only if the
connected component of the Zariski-closure of Ga is perfect.Comment: 62 pages, no figures, revision based on referee's comments: new ideas
are explained in more details in the introduction, typos corrected, results
and proofs unchange
Isoperimetric Inequalities in Simplicial Complexes
In graph theory there are intimate connections between the expansion
properties of a graph and the spectrum of its Laplacian. In this paper we
define a notion of combinatorial expansion for simplicial complexes of general
dimension, and prove that similar connections exist between the combinatorial
expansion of a complex, and the spectrum of the high dimensional Laplacian
defined by Eckmann. In particular, we present a Cheeger-type inequality, and a
high-dimensional Expander Mixing Lemma. As a corollary, using the work of Pach,
we obtain a connection between spectral properties of complexes and Gromov's
notion of geometric overlap. Using the work of Gunder and Wagner, we give an
estimate for the combinatorial expansion and geometric overlap of random
Linial-Meshulam complexes
- …