The Stable Roommates problem with short lists

We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists SRI that are degree constrained, i.e., preference lists are of bounded length. The first variant, EGAL d-SRI, involves finding an egalitarian stable matching in solvable instances of SRI with preference lists of length at most d. We show that this problem is NP-hard even if d=3. On the positive side we give a (2d+3)/7-approximation algorithm for d={3,4,5} which improves on the known bound of 2 for the unbounded preference list case. In the second variant of SRI, called d-SRTI, preference lists can include ties and are of length at most d. We show that the problem of deciding whether an instance of d-SRTI admits a stable matching is NP-complete even if d=3. We also consider the "most stable" version of this problem and prove a strong inapproximability bound for the d=3 case. However for d=2 we show that the latter problem can be solved in polynomial time.Comment: short version appeared at SAGT 201

Emergence of fractal behavior in condensation-driven aggregation

We investigate a model in which an ensemble of chemically identical Brownian particles are continuously growing by condensation and at the same time undergo irreversible aggregation whenever two particles come into contact upon collision. We solved the model exactly by using scaling theory for the case whereby a particle, say of size $x$, grows by an amount $\alpha x$ over the time it takes to collide with another particle of any size. It is shown that the particle size spectra of such system exhibit transition to dynamic scaling $c(x,t)\sim t^{-\beta}\phi(x/t^z)$ accompanied by the emergence of fractal of dimension $d_f={{1}\over{1+2\alpha}}$. One of the remarkable feature of this model is that it is governed by a non-trivial conservation law, namely, the $d_f^{th}$ moment of $c(x,t)$ is time invariant regardless of the choice of the initial conditions. The reason why it remains conserved is explained by using a simple dimensional analysis. We show that the scaling exponents $\beta$ and $z$ are locked with the fractal dimension $d_f$ via a generalized scaling relation $\beta=(1+d_f)z$.Comment: 8 pages, 6 figures, to appear in Phys. Rev.

Spectral fluctuation characterization of random matrix ensembles through wavelets

A recently developed wavelet based approach is employed to characterize the scaling behavior of spectral fluctuations of random matrix ensembles, as well as complex atomic systems. Our study clearly reveals anti-persistent behavior and supports the Fourier power spectral analysis. It also finds evidence for multi-fractal nature in the atomic spectra. The multi-resolution and localization nature of the discrete wavelets ideally characterizes the fluctuations in these time series, some of which are not stationary.Comment: 7 pages, 2 eps figure

Generating ring currents, solitons, and svortices by stirring a Bose-Einstein condensate in a toroidal trap

We propose a simple stirring experiment to generate quantized ring currents and solitary excitations in Bose-Einstein condensates in a toroidal trap geometry. Simulations of the 3D Gross-Pitaevskii equation show that pure ring current states can be generated efficiently by adiabatic manipulation of the condensate, which can be realized on experimental time scales. This is illustrated by simulated generation of a ring current with winding number two. While solitons can be generated in quasi-1D tori, we show the even more robust generation of hybrid, solitonic vortices (svortices) in a regime of wider confinement. Svortices are vortices confined to essentially one-dimensional dynamics, which obey a similar phase-offset--velocity relationship as solitons. Marking the transition between solitons and vortices, svortices are a distinct class of symmetry-breaking stationary and uniformly rotating excited solutions of the 2D and 3D Gross-Pitaevskii equation in a toroidal trapping potential. Svortices should be observable in dilute-gas experiments.Comment: 8 pages, 4 figures; accepted for publication in J. Phys. B (Letters

Stable marriage and roommates problems with restricted edges: complexity and approximability

In the Stable Marriage and Roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is a set of disjoint pairs of mutually acceptable agents. If any two agents mutually prefer each other to their partner, then they block the matching, otherwise, the matching is said to be stable. We investigate the complexity of finding a solution satisfying additional constraints on restricted pairs of agents. Restricted pairs can be either forced or forbidden. A stable solution must contain all of the forced pairs, while it must contain none of the forbidden pairs. Dias et al. (2003) gave a polynomial-time algorithm to decide whether such a solution exists in the presence of restricted edges. If the answer is no, one might look for a solution close to optimal. Since optimality in this context means that the matching is stable and satisfies all constraints on restricted pairs, there are two ways of relaxing the constraints by permitting a solution to: (1) be blocked by as few as possible pairs, or (2) violate as few as possible constraints n restricted pairs. Our main theorems prove that for the (bipartite) Stable Marriage problem, case (1) leads to View the MathML source-hardness and inapproximability results, whilst case (2) can be solved in polynomial time. For non-bipartite Stable Roommates instances, case (2) yields an View the MathML source-hard but (under some cardinality assumptions) 2-approximable problem. In the case of View the MathML source-hard problems, we also discuss polynomially solvable special cases, arising from restrictions on the lengths of the preference lists, or upper bounds on the numbers of restricted pairs

Multifractal properties of power-law time sequences; application to ricepiles

We study the properties of time sequences extracted from a self-organized critical system, within the framework of the mathematical multifractal analysis. To this end, we propose a fixed-mass algorithm, well suited to deal with highly inhomogeneous one dimensional multifractal measures. We find that the fixed mass (dual) spectrum of generalized dimensions depends on both the system size L and the length N of the sequence considered, being however stable when these two parameters are kept fixed. A finite-size scaling relation is proposed, allowing us to define a renormalized spectrum, independent of size effects.We interpret our results as an evidence of extremely long-range correlations induced in the sequence by the criticality of the systemComment: 12 pages, RevTex, includes 9 PS figures, Phys. Rev. E (in press

Fractal dimension and degree of order in sequential deposition of mixture

We present a number models describing the sequential deposition of a mixture of particles whose size distribution is determined by the power-law $p(x) \sim \alpha x^{\alpha-1}$, $x\leq l$ . We explicitly obtain the scaling function in the case of random sequential adsorption (RSA) and show that the pattern created in the long time limit becomes scale invariant. This pattern can be described by an unique exponent, the fractal dimension. In addition, we introduce an external tuning parameter beta to describe the correlated sequential deposition of a mixture of particles where the degree of correlation is determined by beta, while beta=0 corresponds to random sequential deposition of mixture. We show that the fractal dimension of the resulting pattern increases as beta increases and reaches a constant non-zero value in the limit $\beta \to \infty$ when the pattern becomes perfectly ordered or non-random fractals.Comment: 16 pages Latex, Submitted to Phys. Rev.

Is subdiffusional transport slower than normal?

We consider anomalous non-Markovian transport of Brownian particles in viscoelastic fluid-like media with very large but finite macroscopic viscosity under the influence of a constant force field F. The viscoelastic properties of the medium are characterized by a power-law viscoelastic memory kernel which ultra slow decays in time on the time scale \tau of strong viscoelastic correlations. The subdiffusive transport regime emerges transiently for t<\tau. However, the transport becomes asymptotically normal for t>>\tau. It is shown that even though transiently the mean displacement and the variance both scale sublinearly, i.e. anomalously slow, in time, ~ F t^\alpha, ~ t^\alpha, 0<\alpha<1, the mean displacement at each instant of time is nevertheless always larger than one obtained for normal transport in a purely viscous medium with the same macroscopic viscosity obtained in the Markovian approximation. This can have profound implications for the subdiffusive transport in biological cells as the notion of "ultra-slowness" can be misleading in the context of anomalous diffusion-limited transport and reaction processes occurring on nano- and mesoscales

Lower Bounds for the Graph Homomorphism Problem

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the graph coloring problem and at the same time can be viewed as a special case of the $2$-CSP problem. In this paper, we prove several lower bound for HOM under the Exponential Time Hypothesis (ETH) assumption. The main result is a lower bound $2^{\Omega\left( \frac{n \log h}{\log \log h}\right)}$. This rules out the existence of a single-exponential algorithm and shows that the trivial upper bound $2^{{\mathcal O}(n\log{h})}$ is almost asymptotically tight. We also investigate what properties of graphs $G$ and $H$ make it difficult to solve HOM$(G,H)$. An easy observation is that an ${\mathcal O}(h^n)$ upper bound can be improved to ${\mathcal O}(h^{\operatorname{vc}(G)})$ where $\operatorname{vc}(G)$ is the minimum size of a vertex cover of $G$. The second lower bound $h^{\Omega(\operatorname{vc}(G))}$ shows that the upper bound is asymptotically tight. As to the properties of the "right-hand side" graph $H$, it is known that HOM$(G,H)$ can be solved in time $(f(\Delta(H)))^n$ and $(f(\operatorname{tw}(H)))^n$ where $\Delta(H)$ is the maximum degree of $H$ and $\operatorname{tw}(H)$ is the treewidth of $H$. This gives single-exponential algorithms for graphs of bounded maximum degree or bounded treewidth. Since the chromatic number $\chi(H)$ does not exceed $\operatorname{tw}(H)$ and $\Delta(H)+1$, it is natural to ask whether similar upper bounds with respect to $\chi(H)$ can be obtained. We provide a negative answer to this question by establishing a lower bound $(f(\chi(H)))^n$ for any function $f$. We also observe that similar lower bounds can be obtained for locally injective homomorphisms.Comment: 19 page

Domain size effects in Barkhausen noise

The possible existence of self-organized criticality in Barkhausen noise is investigated theoretically through a single interface model, and experimentally from measurements in amorphous magnetostrictive ribbon Metglas 2605TCA under stress. Contrary to previous interpretations in the literature, both simulation and experiment indicate that the presence of a cutoff in the avalanche size distribution may be attributed to finite size effects.Comment: 5 pages, 3 figures, submitted so Physical Review