Far-from-equilibrium Ostwald ripening in electrostatically driven granular powders

We report the first experimental study of cluster size distributions in electrostatically driven granular submonolayers. The cluster size distribution in this far-from-equilibrium process exhibits dynamic scaling behavior characteristic of the (nearly equilibrium) Ostwald ripening, controlled by the attachment and detachment of the "gas" particles. The scaled size distribution, however, is different from the classical Wagner distribution obtained in the limit of a vanishingly small area fraction of the clusters. A much better agreement is found with the theory of Conti et al. [Phys. Rev. E 65, 046117 (2002)] which accounts for the cluster merger.Comment: 5 pages, to appear in PR

Outage probability for soliton transmission

PACS. 78.55.Qr – Amorphous materials; glasses and other disordered solids. PACS. 05.40.-a – Fluctuation phenomena, random processes, noise, and Brownian motion. Abstract. – We study the interplay between amplifier noise and birefringent disorder in the case of strongly nonlinear (soliton) type of transmission in optical fibers. Assuming both noise and disorder to be weak, we evaluate the probability distribution function (PDF) of the Bit-Error-Rate (BER) for the values of BER that are much larger than the typical (average) value. The PDFtail that describes probability of the system outage shows log-normal shape, strongly dependent on the fiber length. We also discuss a simple timing shift technique capable of the outage compensation. Nonlinear information transmission in optical fibers when elementary bits are represented by optical solitons constitutes a promising technology that has been a subject of intensive research over the past decades [1, 2]. In idealfibers, the information carried by the solitons would be transmitted without any loss. In practice, however, various impairments lead to information loss. Amplifier noise and birefringent disorder represent the two major impairments in both linear and nonlinear transmission regimes. The noise generated by spontaneous emissio

Conditional association between melanism and personality in Israeli barn owls

Capsule Boldness defines the extent to which animals are willing to take risks in the presence of a predator. Late, but not early, in the breeding season, Israeli nestling Barn Owls displaying larger black feather spots were more docile, feigned death longer and had a lower breathing rate when handled than smaller-spotted nestlings. Larger-spotted breeding females were less docile if heavy but more more docile if light. The covariation between personality (boldness vs. timid) and melanin-based colouration is therefore conditional on environmental factors

Discrete and surface solitons in photonic graphene nanoribbons

We analyze localization of light in honeycomb photonic lattices restricted in one dimension which can be regarded as an optical analog of (``armchair'' and ``zigzag'') graphene nanoribbons. We find the conditions for the existence of spatially localized states and discuss the effect of lattice topology on the properties of discrete solitons excited inside the lattice and at its edges. In particular, we discover a novel type of soliton bistability, the so-called geometry-induced bistability, in the lattices of a finite extent.Comment: three double-column pages, 5 figures, submitted for publicatio

Normal scaling in globally conserved interface-controlled coarsening of fractal clusters

Globally conserved interface-controlled coarsening of fractal clusters exhibits dynamic scale invariance and normal scaling. This is demonstrated by a numerical solution of the Ginzburg-Landau equation with a global conservation law. The sharp-interface limit of this equation is volume preserving motion by mean curvature. The scaled form of the correlation function has a power-law tail accommodating the fractal initial condition. The coarsening length exhibits normal scaling with time. Finally, shrinking of the fractal clusters with time is observed. The difference between global and local conservation is discussed.Comment: 4 pages, 3 eps figure

Distributed Symmetry Breaking in Hypergraphs

Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS) and coloring have been recognized as important by the community, and studied extensively in (standard) graphs. In particular, fast (i.e., logarithmic run time) randomized algorithms are well-established for MIS and $\Delta +1$-coloring in both the LOCAL and CONGEST distributed computing models. On the other hand, comparatively much less is known on the complexity of distributed symmetry breaking in {\em hypergraphs}. In particular, a key question is whether a fast (randomized) algorithm for MIS exists for hypergraphs. In this paper, we study the distributed complexity of symmetry breaking in hypergraphs by presenting distributed randomized algorithms for a variety of fundamental problems under a natural distributed computing model for hypergraphs. We first show that MIS in hypergraphs (of arbitrary dimension) can be solved in $O(\log^2 n)$ rounds ($n$ is the number of nodes of the hypergraph) in the LOCAL model. We then present a key result of this paper --- an $O(\Delta^{\epsilon}\text{polylog}(n))$-round hypergraph MIS algorithm in the CONGEST model where $\Delta$ is the maximum node degree of the hypergraph and $\epsilon > 0$ is any arbitrarily small constant. To demonstrate the usefulness of hypergraph MIS, we present applications of our hypergraph algorithm to solving problems in (standard) graphs. In particular, the hypergraph MIS yields fast distributed algorithms for the {\em balanced minimal dominating set} problem (left open in Harris et al. [ICALP 2013]) and the {\em minimal connected dominating set problem}. We also present distributed algorithms for coloring, maximal matching, and maximal clique in hypergraphs.Comment: Changes from the previous version: More references adde

How Many Cooks Spoil the Soup?

In this work, we study the following basic question: "How much parallelism does a distributed task permit?" Our definition of parallelism (or symmetry) here is not in terms of speed, but in terms of identical roles that processes have at the same time in the execution. We initiate this study in population protocols, a very simple model that not only allows for a straightforward definition of what a role is, but also encloses the challenge of isolating the properties that are due to the protocol from those that are due to the adversary scheduler, who controls the interactions between the processes. We (i) give a partial characterization of the set of predicates on input assignments that can be stably computed with maximum symmetry, i.e., $\Theta(N_{min})$, where $N_{min}$ is the minimum multiplicity of a state in the initial configuration, and (ii) we turn our attention to the remaining predicates and prove a strong impossibility result for the parity predicate: the inherent symmetry of any protocol that stably computes it is upper bounded by a constant that depends on the size of the protocol.Comment: 19 page

A Matrix Hyperbolic Cosine Algorithm and Applications

In this paper, we generalize Spencer's hyperbolic cosine algorithm to the matrix-valued setting. We apply the proposed algorithm to several problems by analyzing its computational efficiency under two special cases of matrices; one in which the matrices have a group structure and an other in which they have rank-one. As an application of the former case, we present a deterministic algorithm that, given the multiplication table of a finite group of size $n$, it constructs an expanding Cayley graph of logarithmic degree in near-optimal O(n^2 log^3 n) time. For the latter case, we present a fast deterministic algorithm for spectral sparsification of positive semi-definite matrices, which implies an improved deterministic algorithm for spectral graph sparsification of dense graphs. In addition, we give an elementary connection between spectral sparsification of positive semi-definite matrices and element-wise matrix sparsification. As a consequence, we obtain improved element-wise sparsification algorithms for diagonally dominant-like matrices.Comment: 16 pages, simplified proof and corrected acknowledging of prior work in (current) Section