11,376 research outputs found
An analytically solvable model of probabilistic network dynamics
We present a simple model of network dynamics that can be solved analytically
for uniform networks. We obtain the dynamics of response of the system to
perturbations. The analytical solution is an excellent approximation for random
networks. A comparison with the scale-free network, though qualitatively
similar, shows the effect of distinct topology.Comment: 4 pages, 1 figur
Spectral Analysis and the Dynamic Response of Complex Networks
The eigenvalues and eigenvectors of the connectivity matrix of complex
networks contain information about its topology and its collective behavior. In
particular, the spectral density of this matrix reveals
important network characteristics: random networks follow Wigner's semicircular
law whereas scale-free networks exhibit a triangular distribution. In this
paper we show that the spectral density of hierarchical networks follow a very
different pattern, which can be used as a fingerprint of modularity. Of
particular importance is the value , related to the homeostatic
response of the network: it is maximum for random and scale free networks but
very small for hierarchical modular networks. It is also large for an actual
biological protein-protein interaction network, demonstrating that the current
leading model for such networks is not adequate.Comment: 4 pages 14 figure
Fast Structuring of Radio Networks for Multi-Message Communications
We introduce collision free layerings as a powerful way to structure radio
networks. These layerings can replace hard-to-compute BFS-trees in many
contexts while having an efficient randomized distributed construction. We
demonstrate their versatility by using them to provide near optimal distributed
algorithms for several multi-message communication primitives.
Designing efficient communication primitives for radio networks has a rich
history that began 25 years ago when Bar-Yehuda et al. introduced fast
randomized algorithms for broadcasting and for constructing BFS-trees. Their
BFS-tree construction time was rounds, where is the network
diameter and is the number of nodes. Since then, the complexity of a
broadcast has been resolved to be rounds. On the other hand, BFS-trees have been used as a crucial building
block for many communication primitives and their construction time remained a
bottleneck for these primitives.
We introduce collision free layerings that can be used in place of BFS-trees
and we give a randomized construction of these layerings that runs in nearly
broadcast time, that is, w.h.p. in rounds for any constant . We then use these
layerings to obtain: (1) A randomized algorithm for gathering messages
running w.h.p. in rounds. (2) A randomized -message
broadcast algorithm running w.h.p. in rounds. These
algorithms are optimal up to the small difference in the additive
poly-logarithmic term between and . Moreover, they imply the
first optimal round randomized gossip algorithm
How Unsplittable-Flow-Covering helps Scheduling with Job-Dependent Cost Functions
Generalizing many well-known and natural scheduling problems, scheduling with
job-specific cost functions has gained a lot of attention recently. In this
setting, each job incurs a cost depending on its completion time, given by a
private cost function, and one seeks to schedule the jobs to minimize the total
sum of these costs. The framework captures many important scheduling objectives
such as weighted flow time or weighted tardiness. Still, the general case as
well as the mentioned special cases are far from being very well understood
yet, even for only one machine. Aiming for better general understanding of this
problem, in this paper we focus on the case of uniform job release dates on one
machine for which the state of the art is a 4-approximation algorithm. This is
true even for a special case that is equivalent to the covering version of the
well-studied and prominent unsplittable flow on a path problem, which is
interesting in its own right. For that covering problem, we present a
quasi-polynomial time -approximation algorithm that yields an
-approximation for the above scheduling problem. Moreover, for
the latter we devise the best possible resource augmentation result regarding
speed: a polynomial time algorithm which computes a solution with \emph{optimal
}cost at speedup. Finally, we present an elegant QPTAS for the
special case where the cost functions of the jobs fall into at most
many classes. This algorithm allows the jobs even to have up to many
distinct release dates.Comment: 2 pages, 1 figur
Proposing "b-Parity" - a New Approximate Quantum Number in Inclusive b-jet Production - as an Efficient Probe of New Flavor Physics
We consider the inclusive reaction \ell^+ \ell^- -> nb +X (n = number of
b-jets) in lepton colliders for which we propose a useful approximately
conserved quantum number b_P=(-1)^n that we call b-Parity (b_P). We make the
observation that the Standard Model (SM) is essentially b_P-even since SM
b_P-violating signals are necessarily CKM suppressed. In contrast new flavor
physics can produce b_P=-1 signals whose only significant SM background is due
to b-jet misidentification. Thus, we show that b-jet counting, which relies
primarily on b-tagging, becomes a very simple and sensitive probe of new flavor
physics (i.e., of b_P-violation).Comment: 5 pages using revtex, 2 figures embadded in the text using epsfig. As
will appear in Phys.Rev.Lett.. Considerable improvement was made in the
background calculation as compared to version 1, by including purity
parameters, QCD effects and 4-jets processe
Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost
In a two-player game, two cooperating but non communicating players, Alice
and Bob, receive inputs taken from a probability distribution. Each of them
produces an output and they win the game if they satisfy some predicate on
their inputs/outputs. The entangled value of a game is the
maximum probability that Alice and Bob can win the game if they are allowed to
share an entangled state prior to receiving their inputs.
The -fold parallel repetition of consists of instances of
where the players receive all the inputs at the same time and produce all
the outputs at the same time. They win if they win each instance of .
In this paper we show that for any game such that , decreases exponentially in . First, for
any game on the uniform distribution, we show that , where and are the sizes of the input
and output sets. From this result, we show that for any entangled game ,
where is the input distribution of and
. This implies parallel
repetition with exponential decay as long as for
general games. To prove this parallel repetition, we introduce the concept of
\emph{Superposed Information Cost} for entangled games which is inspired from
the information cost used in communication complexity.Comment: In the first version of this paper we presented a different, stronger
Corollary 1 but due to an error in the proof we had to modify it in the
second version. This third version is a minor update. We correct some typos
and re-introduce a proof accidentally commented out in the second versio
Transport in quasiperiodic interacting systems: from superdiffusion to subdiffusion
Using a combination of numerically exact and renormalization-group techniques
we study the nonequilibrium transport of electrons in an one-dimensional
interacting system subject to a quasiperiodic potential. For this purpose we
calculate the growth of the mean-square displacement as well as the melting of
domain walls. While the system is nonintegrable for all studied parameters,
there is no on finite region default of parameters for which we observe
diffusive transport. In particular, our model shows a rich dynamical behavior
crossing over from superdiffusion to subdiffusion. We discuss the implications
of our results for the general problem of many-body localization, with a
particular emphasis on the rare region Griffiths picture of subdiffusion.Comment: 6 pages, 5 figures. A more detailed analysis of the dynamical
exponents extraction and discussion of the relevant times. Adds a
log-derivative for the FRG sectio
Lower Bounds for Structuring Unreliable Radio Networks
In this paper, we study lower bounds for randomized solutions to the maximal
independent set (MIS) and connected dominating set (CDS) problems in the dual
graph model of radio networks---a generalization of the standard graph-based
model that now includes unreliable links controlled by an adversary. We begin
by proving that a natural geographic constraint on the network topology is
required to solve these problems efficiently (i.e., in time polylogarthmic in
the network size). We then prove the importance of the assumption that nodes
are provided advance knowledge of their reliable neighbors (i.e, neighbors
connected by reliable links). Combined, these results answer an open question
by proving that the efficient MIS and CDS algorithms from [Censor-Hillel, PODC
2011] are optimal with respect to their dual graph model assumptions. They also
provide insight into what properties of an unreliable network enable efficient
local computation.Comment: An extended abstract of this work appears in the 2014 proceedings of
the International Symposium on Distributed Computing (DISC
- …