@article{1880,
  abstract     = {We investigate the relation between Bose-Einstein condensation (BEC) and superfluidity in the ground state of a one-dimensional model of interacting bosons in a strong random potential. We prove rigorously that in a certain parameter regime the superfluid fraction can be arbitrarily small while complete BEC prevails. In another regime there is both complete BEC and complete superfluidity, despite the strong disorder},
  author       = {Könenberg, Martin and Moser, Thomas and Seiringer, Robert and Yngvason, Jakob},
  journal      = {New Journal of Physics},
  publisher    = {IOP Publishing Ltd.},
  title        = {{Superfluid behavior of a Bose-Einstein condensate in a random potential}},
  doi          = {10.1088/1367-2630/17/1/013022},
  volume       = {17},
  year         = {2015},
}

@inproceedings{1882,
  abstract     = {We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear various types of quantitative information. Throughout the design process the actions can be further refined and the information made more precise. We show how to compute the results of standard operations on the systems, including the quotient (residual), which has not been previously considered for quantitative non-deterministic systems. Our quantitative framework has close connections to the modal nu-calculus and is compositional with respect to general notions of distances between systems and the standard operations.},
  author       = {Fahrenberg, Uli and Kretinsky, Jan and Legay, Axel and Traonouez, Louis},
  location     = {Bertinoro, Italy},
  pages        = {306 -- 324},
  publisher    = {Springer},
  title        = {{Compositionality for quantitative specifications}},
  doi          = {10.1007/978-3-319-15317-9_19},
  volume       = {8997},
  year         = {2015},
}

@article{1883,
  abstract     = {We introduce a one-parametric family of tree growth models, in which branching probabilities decrease with branch age τ as τ-α. Depending on the exponent α, the scaling of tree depth with tree size n displays a transition between the logarithmic scaling of random trees and an algebraic growth. At the transition (α=1) tree depth grows as (logn)2. This anomalous scaling is in good agreement with the trend observed in evolution of biological species, thus providing a theoretical support for age-dependent speciation and associating it to the occurrence of a critical point.
},
  author       = {Keller-Schmidt, Stephanie and Tugrul, Murat and Eguíluz, Víctor and Hernandez Garcia, Emilio and Klemm, Konstantin},
  journal      = {Physical Review E Statistical Nonlinear and Soft Matter Physics},
  number       = {2},
  publisher    = {American Institute of Physics},
  title        = {{Anomalous scaling in an age-dependent branching model}},
  doi          = {10.1103/PhysRevE.91.022803},
  volume       = {91},
  year         = {2015},
}

@article{1885,
  abstract     = {The concept of positional information is central to our understanding of how cells determine their location in a multicellular structure and thereby their developmental fates. Nevertheless, positional information has neither been defined mathematically nor quantified in a principled way. Here we provide an information-theoretic definition in the context of developmental gene expression patterns and examine the features of expression patterns that affect positional information quantitatively. We connect positional information with the concept of positional error and develop tools to directly measure information and error from experimental data. We illustrate our framework for the case of gap gene expression patterns in the early Drosophila embryo and show how information that is distributed among only four genes is sufficient to determine developmental fates with nearly single-cell resolution. Our approach can be generalized to a variety of different model systems; procedures and examples are discussed in detail. },
  author       = {Tkacik, Gasper and Dubuis, Julien and Petkova, Mariela and Gregor, Thomas},
  journal      = {Genetics},
  number       = {1},
  pages        = {39 -- 59},
  publisher    = {Genetics Society of America},
  title        = {{Positional information, positional error, and readout precision in morphogenesis: A mathematical framework}},
  doi          = {10.1534/genetics.114.171850},
  volume       = {199},
  year         = {2015},
}

@article{1938,
  abstract     = {We numerically investigate the distribution of extrema of 'chaotic' Laplacian eigenfunctions on two-dimensional manifolds. Our contribution is two-fold: (a) we count extrema on grid graphs with a small number of randomly added edges and show the behavior to coincide with the 1957 prediction of Longuet-Higgins for the continuous case and (b) we compute the regularity of their spatial distribution using discrepancy, which is a classical measure from the theory of Monte Carlo integration. The first part suggests that grid graphs with randomly added edges should behave like two-dimensional surfaces with ergodic geodesic flow; in the second part we show that the extrema are more regularly distributed in space than the grid Z2.},
  author       = {Pausinger, Florian and Steinerberger, Stefan},
  journal      = {Physics Letters, Section A},
  number       = {6},
  pages        = {535 -- 541},
  publisher    = {Elsevier},
  title        = {{On the distribution of local extrema in quantum chaos}},
  doi          = {10.1016/j.physleta.2014.12.010},
  volume       = {379},
  year         = {2015},
}

@article{1940,
  abstract     = {We typically think of cells as responding to external signals independently by regulating their gene expression levels, yet they often locally exchange information and coordinate. Can such spatial coupling be of benefit for conveying signals subject to gene regulatory noise? Here we extend our information-theoretic framework for gene regulation to spatially extended systems. As an example, we consider a lattice of nuclei responding to a concentration field of a transcriptional regulator (the &quot;input&quot;) by expressing a single diffusible target gene. When input concentrations are low, diffusive coupling markedly improves information transmission; optimal gene activation functions also systematically change. A qualitatively new regulatory strategy emerges where individual cells respond to the input in a nearly step-like fashion that is subsequently averaged out by strong diffusion. While motivated by early patterning events in the Drosophila embryo, our framework is generically applicable to spatially coupled stochastic gene expression models.},
  author       = {Sokolowski, Thomas R and Tkacik, Gasper},
  journal      = {Physical Review E Statistical Nonlinear and Soft Matter Physics},
  number       = {6},
  publisher    = {American Institute of Physics},
  title        = {{Optimizing information flow in small genetic networks. IV. Spatial coupling}},
  doi          = {10.1103/PhysRevE.91.062710},
  volume       = {91},
  year         = {2015},
}

@article{1944,
  author       = {Rakusová, Hana and Fendrych, Matyas and Friml, Jirí},
  journal      = {Current Opinion in Plant Biology},
  number       = {2},
  pages        = {116 -- 123},
  publisher    = {Elsevier},
  title        = {{Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants}},
  doi          = {10.1016/j.pbi.2014.12.002},
  volume       = {23},
  year         = {2015},
}

@inproceedings{1992,
  abstract     = {We present a method and a tool for generating succinct representations of sets of concurrent traces. We focus on trace sets that contain all correct or all incorrect permutations of events from a given trace. We represent trace sets as HB-Formulas that are Boolean combinations of happens-before constraints between events. To generate a representation of incorrect interleavings, our method iteratively explores interleavings that violate the specification and gathers generalizations of the discovered interleavings into an HB-Formula; its complement yields a representation of correct interleavings.

We claim that our trace set representations can drive diverse verification, fault localization, repair, and synthesis techniques for concurrent programs. We demonstrate this by using our tool in three case studies involving synchronization synthesis, bug summarization, and abstraction refinement based verification. In each case study, our initial experimental results have been promising.

In the first case study, we present an algorithm for inferring missing synchronization from an HB-Formula representing correct interleavings of a given trace. The algorithm applies rules to rewrite specific patterns in the HB-Formula into locks, barriers, and wait-notify constructs. In the second case study, we use an HB-Formula representing incorrect interleavings for bug summarization. While the HB-Formula itself is a concise counterexample summary, we present additional inference rules to help identify specific concurrency bugs such as data races, define-use order violations, and two-stage access bugs. In the final case study, we present a novel predicate learning procedure that uses HB-Formulas representing abstract counterexamples to accelerate counterexample-guided abstraction refinement (CEGAR). In each iteration of the CEGAR loop, the procedure refines the abstraction to eliminate multiple spurious abstract counterexamples drawn from the HB-Formula.},
  author       = {Gupta, Ashutosh and Henzinger, Thomas A and Radhakrishna, Arjun and Samanta, Roopsha and Tarrach, Thorsten},
  isbn         = {978-1-4503-3300-9},
  location     = {Mumbai, India},
  pages        = {433 -- 444},
  publisher    = {ACM},
  title        = {{Succinct representation of concurrent trace sets}},
  doi          = {10.1145/2676726.2677008},
  year         = {2015},
}

@article{1993,
  abstract     = {The fitness effects of symbionts on their hosts can be context-dependent, with usually benign symbionts causing detrimental effects when their hosts are stressed, or typically parasitic symbionts providing protection towards their hosts (e.g. against pathogen infection). Here, we studied the novel association between the invasive garden ant Lasius neglectus and its fungal ectosymbiont Laboulbenia formicarum for potential costs and benefits. We tested ants with different Laboulbenia levels for their survival and immunity under resource limitation and exposure to the obligate killing entomopathogen Metarhizium brunneum. While survival of L. neglectus workers under starvation was significantly decreased with increasing Laboulbenia levels, host survival under Metarhizium exposure increased with higher levels of the ectosymbiont, suggesting a symbiont-mediated anti-pathogen protection, which seems to be driven mechanistically by both improved sanitary behaviours and an upregulated immune system. Ants with high Laboulbenia levels showed significantly longer self-grooming and elevated expression of immune genes relevant for wound repair and antifungal responses (β-1,3-glucan binding protein, Prophenoloxidase), compared with ants carrying low Laboulbenia levels. This suggests that the ectosymbiont Laboulbenia formicarum weakens its ant host by either direct resource exploitation or the costs of an upregulated behavioural and immunological response, which, however, provides a prophylactic protection upon later exposure to pathogens. },
  author       = {Konrad, Matthias and Grasse, Anna V and Tragust, Simon and Cremer, Sylvia},
  issn         = {1471-2954},
  journal      = {Proceedings of the Royal Society of London Series B Biological Sciences},
  number       = {1799},
  publisher    = {The Royal Society},
  title        = {{Anti-pathogen protection versus survival costs mediated by an ectosymbiont in an ant host}},
  doi          = {10.1098/rspb.2014.1976},
  volume       = {282},
  year         = {2015},
}

@article{1997,
  abstract     = {We prove that the three-state toric homogeneous Markov chain model has Markov degree two. In algebraic terminology this means, that a certain class of toric ideals is generated by quadratic binomials. This was conjectured by Haws, Martin del Campo, Takemura and Yoshida, who proved that they are generated by degree six binomials.},
  author       = {Noren, Patrik},
  journal      = {Journal of Symbolic Computation},
  number       = {May-June},
  pages        = {285 -- 296},
  publisher    = {Elsevier},
  title        = {{The three-state toric homogeneous Markov chain model has Markov degree two}},
  doi          = {10.1016/j.jsc.2014.09.014},
  volume       = {68/Part 2},
  year         = {2015},
}

@article{2006,
  abstract     = {The monotone secant conjecture posits a rich class of polynomial systems, all of whose solutions are real. These systems come from the Schubert calculus on flag manifolds, and the monotone secant conjecture is a compelling generalization of the Shapiro conjecture for Grassmannians (Theorem of Mukhin, Tarasov, and Varchenko). We present some theoretical evidence for this conjecture, as well as computational evidence obtained by 1.9 teraHertz-years of computing, and we discuss some of the phenomena we observed in our data. },
  author       = {Hein, Nicolas and Hillar, Christopher and Martin Del Campo Sanchez, Abraham and Sottile, Frank and Teitler, Zach},
  journal      = {Experimental Mathematics},
  number       = {3},
  pages        = {261 -- 269},
  publisher    = {Taylor & Francis},
  title        = {{The monotone secant conjecture in the real Schubert calculus}},
  doi          = {10.1080/10586458.2014.980044},
  volume       = {24},
  year         = {2015},
}

@article{2008,
  abstract     = {The paper describes a generalized iterative proportional fitting procedure that can be used for maximum likelihood estimation in a special class of the general log-linear model. The models in this class, called relational, apply to multivariate discrete sample spaces that do not necessarily have a Cartesian product structure and may not contain an overall effect. When applied to the cell probabilities, the models without the overall effect are curved exponential families and the values of the sufficient statistics are reproduced by the MLE only up to a constant of proportionality. The paper shows that Iterative Proportional Fitting, Generalized Iterative Scaling, and Improved Iterative Scaling fail to work for such models. The algorithm proposed here is based on iterated Bregman projections. As a by-product, estimates of the multiplicative parameters are also obtained. An implementation of the algorithm is available as an R-package.},
  author       = {Klimova, Anna and Rudas, Tamás},
  journal      = {Scandinavian Journal of Statistics},
  number       = {3},
  pages        = {832 -- 847},
  publisher    = {Wiley},
  title        = {{Iterative scaling in curved exponential families}},
  doi          = {10.1111/sjos.12139},
  volume       = {42},
  year         = {2015},
}

@article{2014,
  abstract     = {The concepts of faithfulness and strong-faithfulness are important for statistical learning of graphical models. Graphs are not sufficient for describing the association structure of a discrete distribution. Hypergraphs representing hierarchical log-linear models are considered instead, and the concept of parametric (strong-) faithfulness with respect to a hypergraph is introduced. Strong-faithfulness ensures the existence of uniformly consistent parameter estimators and enables building uniformly consistent procedures for a hypergraph search. The strength of association in a discrete distribution can be quantified with various measures, leading to different concepts of strong-faithfulness. Lower and upper bounds for the proportions of distributions that do not satisfy strong-faithfulness are computed for different parameterizations and measures of association.},
  author       = {Klimova, Anna and Uhler, Caroline and Rudas, Tamás},
  journal      = {Computational Statistics & Data Analysis},
  number       = {7},
  pages        = {57 -- 72},
  publisher    = {Elsevier},
  title        = {{Faithfulness and learning hypergraphs from discrete distributions}},
  doi          = {10.1016/j.csda.2015.01.017},
  volume       = {87},
  year         = {2015},
}

@article{2025,
  abstract     = {Small GTP-binding proteins of the Ras superfamily play diverse roles in intracellular trafficking. Among them, the Rab, Arf, and Rho families function in successive steps of vesicle transport, in forming vesicles from donor membranes, directing vesicle trafficking toward target membranes and docking vesicles onto target membranes. These proteins act as molecular switches that are controlled by a cycle of GTP binding and hydrolysis regulated by guanine nucleotide exchange factors (GEFs) and GTPase-activating proteins (GAPs). In this study we explored the role of GAPs in the regulation of the endocytic pathway using fluorescently labeled yeast mating pheromone α-factor. Among 25 non-essential GAP mutants, we found that deletion of the GLO3 gene, encoding Arf-GAP protein, caused defective internalization of fluorescently labeled α-factor. Quantitative analysis revealed that glo3Δ cells show defective α-factor binding to the cell surface. Interestingly, Ste2p, the α-factor receptor, was mis-localized from the plasma membrane to the vacuole in glo3Δ cells. Domain deletion mutants of Glo3p revealed that a GAP-independent function, as well as the GAP activity, of Glo3p is important for both α-factor binding and Ste2p localization at the cell surface. Additionally, we found that deletion of the GLO3 gene affects the size and number of Arf1p-residing Golgi compartments and causes a defect in transport from the TGN to the plasma membrane. Furthermore, we demonstrated that glo3Δ cells were defective in the late endosome-to-TGN transport pathway, but not in the early endosome-to-TGN transport pathway. These findings suggest novel roles for Arf-GAP Glo3p in endocytic recycling of cell surface proteins.},
  author       = {Kawada, Daiki and Kobayashi, Hiromu and Tomita, Tsuyoshi and Nakata, Eisuke and Nagano, Makoto and Siekhaus, Daria E and Toshima, Junko and Toshimaa, Jiro},
  journal      = {Biochimica et Biophysica Acta - Molecular Cell Research},
  number       = {1},
  pages        = {144 -- 156},
  publisher    = {Elsevier},
  title        = {{The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins}},
  doi          = {10.1016/j.bbamcr.2014.10.009},
  volume       = {1853},
  year         = {2015},
}

@article{2030,
  abstract     = {A hybrid-parallel direct-numerical-simulation method with application to turbulent Taylor-Couette flow is presented. The Navier-Stokes equations are discretized in cylindrical coordinates with the spectral Fourier-Galerkin method in the axial and azimuthal directions, and high-order finite differences in the radial direction. Time is advanced by a second-order, semi-implicit projection scheme, which requires the solution of five Helmholtz/Poisson equations, avoids staggered grids and renders very small slip velocities. Nonlinear terms are evaluated with the pseudospectral method. The code is parallelized using a hybrid MPI-OpenMP strategy, which, compared with a flat MPI parallelization, is simpler to implement, allows to reduce inter-node communications and MPI overhead that become relevant at high processor-core counts, and helps to contain the memory footprint. A strong scaling study shows that the hybrid code maintains scalability up to more than 20,000 processor cores and thus allows to perform simulations at higher resolutions than previously feasible. In particular, it opens up the possibility to simulate turbulent Taylor-Couette flows at Reynolds numbers up to O(105). This enables to probe hydrodynamic turbulence in Keplerian flows in experimentally relevant regimes.},
  author       = {Shi, Liang and Rampp, Markus and Hof, Björn and Avila, Marc},
  journal      = {Computers and Fluids},
  number       = {1},
  pages        = {1 -- 11},
  publisher    = {Elsevier},
  title        = {{A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow}},
  doi          = {10.1016/j.compfluid.2014.09.021},
  volume       = {106},
  year         = {2015},
}

@article{2034,
  abstract     = {Opacity is a generic security property, that has been defined on (non-probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an external observer, the value of interest for opacity is a measure of the set of runs disclosing the secret. We extend this definition to the richer framework of Markov decision processes, where non-deterministicchoice is combined with probabilistic transitions, and we study related decidability problems with partial or complete observation hypotheses for the schedulers. We prove that all questions are decidable with complete observation and ω-regular secrets. With partial observation, we prove that all quantitative questions are undecidable but the question whether a system is almost surely non-opaquebecomes decidable for a restricted class of ω-regular secrets, as well as for all ω-regular secrets under finite-memory schedulers.},
  author       = {Bérard, Béatrice and Chatterjee, Krishnendu and Sznajder, Nathalie},
  journal      = { Information Processing Letters},
  number       = {1},
  pages        = {52 -- 59},
  publisher    = {Elsevier},
  title        = {{Probabilistic opacity for Markov decision processes}},
  doi          = {10.1016/j.ipl.2014.09.001},
  volume       = {115},
  year         = {2015},
}

@article{2035,
  abstract     = {Considering a continuous self-map and the induced endomorphism on homology, we study the eigenvalues and eigenspaces of the latter. Taking a filtration of representations, we define the persistence of the eigenspaces, effectively introducing a hierarchical organization of the map. The algorithm that computes this information for a finite sample is proved to be stable, and to give the correct answer for a sufficiently dense sample. Results computed with an implementation of the algorithm provide evidence of its practical utility.
},
  author       = {Edelsbrunner, Herbert and Jablonski, Grzegorz and Mrozek, Marian},
  journal      = {Foundations of Computational Mathematics},
  number       = {5},
  pages        = {1213 -- 1244},
  publisher    = {Springer},
  title        = {{The persistent homology of a self-map}},
  doi          = {10.1007/s10208-014-9223-y},
  volume       = {15},
  year         = {2015},
}

@article{2085,
  abstract     = {We study the spectrum of a large system of N identical bosons interacting via a two-body potential with strength 1/N. In this mean-field regime, Bogoliubov's theory predicts that the spectrum of the N-particle Hamiltonian can be approximated by that of an effective quadratic Hamiltonian acting on Fock space, which describes the fluctuations around a condensed state. Recently, Bogoliubov's theory has been justified rigorously in the case that the low-energy eigenvectors of the N-particle Hamiltonian display complete condensation in the unique minimizer of the corresponding Hartree functional. In this paper, we shall justify Bogoliubov's theory for the high-energy part of the spectrum of the N-particle Hamiltonian corresponding to (non-linear) excited states of the Hartree functional. Moreover, we shall extend the existing results on the excitation spectrum to the case of non-uniqueness and/or degeneracy of the Hartree minimizer. In particular, the latter covers the case of rotating Bose gases, when the rotation speed is large enough to break the symmetry and to produce multiple quantized vortices in the Hartree minimizer. },
  author       = {Nam, Phan and Seiringer, Robert},
  journal      = {Archive for Rational Mechanics and Analysis},
  number       = {2},
  pages        = {381 -- 417},
  publisher    = {Springer},
  title        = {{Collective excitations of Bose gases in the mean-field regime}},
  doi          = {10.1007/s00205-014-0781-6},
  volume       = {215},
  year         = {2015},
}

@article{2166,
  abstract     = {We consider the spectral statistics of large random band matrices on mesoscopic energy scales. We show that the correlation function of the local eigenvalue density exhibits a universal power law behaviour that differs from the Wigner-Dyson- Mehta statistics. This law had been predicted in the physics literature by Altshuler and Shklovskii in (Zh Eksp Teor Fiz (Sov Phys JETP) 91(64):220(127), 1986); it describes the correlations of the eigenvalue density in general metallic sampleswith weak disorder. Our result rigorously establishes the Altshuler-Shklovskii formulas for band matrices. In two dimensions, where the leading term vanishes owing to an algebraic cancellation, we identify the first non-vanishing term and show that it differs substantially from the prediction of Kravtsov and Lerner in (Phys Rev Lett 74:2563-2566, 1995). The proof is given in the current paper and its companion (Ann. H. Poincaré. arXiv:1309.5107, 2014). },
  author       = {Erdös, László and Knowles, Antti},
  journal      = {Communications in Mathematical Physics},
  number       = {3},
  pages        = {1365 -- 1416},
  publisher    = {Springer},
  title        = {{The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case}},
  doi          = {10.1007/s00220-014-2119-5},
  volume       = {333},
  year         = {2015},
}

@article{2271,
  abstract     = {A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. Finite-valued constraint languages contain functions that take on rational costs and general-valued constraint languages contain functions that take on rational or infinite costs. An instance of the problem is specified by a sum of functions from the language with the goal to minimise the sum. This framework includes and generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint satisfaction problems (Max-CSPs).
Our main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation (BLP). For a general-valued constraint language Γ, BLP is a decision procedure for Γ if and only if Γ admits a symmetric fractional polymorphism of every arity. For a finite-valued constraint language Γ, BLP is a decision procedure if and only if Γ admits a symmetric fractional polymorphism of some arity, or equivalently, if Γ admits a symmetric fractional polymorphism of arity 2.
Using these results, we obtain tractability of several novel and previously widely-open classes of VCSPs, including problems over valued constraint languages that are: (1) submodular on arbitrary lattices; (2) bisubmodular (also known as k-submodular) on arbitrary finite domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees. },
  author       = {Kolmogorov, Vladimir and Thapper, Johan and Živný, Stanislav},
  journal      = {SIAM Journal on Computing},
  number       = {1},
  pages        = {1 -- 36},
  publisher    = {SIAM},
  title        = {{The power of linear programming for general-valued CSPs}},
  doi          = {10.1137/130945648},
  volume       = {44},
  year         = {2015},
}

