Related papers: Rejoinder: Conditional Growth Charts
This is a significantly expanded version of the survey paper "Mixing and decay of correlations in non-uniformly expanding maps: a survey of recent results" math/0301319. We discuss recent results on decay of correlations for non-uniformly…
The aim of this article is to provide characterizations for subadditivity-like growth conditions for the so-called associated weight functions in terms of the defning weight sequence. Such growth requirements arise frequently in the…
Rejoinder to ``The 2005 Neyman Lecture: Dynamic Indeterminism in Science'' [arXiv:0808.0620]
We examine the conjectured asymptotic shape of the three dimensional corner growth model [Olejarz et. al.,PRL, 108, 016102 (2012)] by mapping the model onto a restricted solid on solid model on a triangular lattice. By choosing appropriate…
In the semisimple case, we derive (asymptotic) formulas for the growth rate of the number of summands in tensor powers of the generating object in diagram/interpolation categories.
We study a class of growth algorithms for directed graphs that are candidate models for the evolution of genetic regulatory networks. The algorithms involve partial duplication of nodes and their links, together with innovation of new…
In this rejoinder we summarize the comments, questions and remarks on the paper "A novel algorithmic approach to Bayesian Logic Regression" from the discussants. We then respond to those comments, questions and remarks, provide several…
In this appendix we provide additional supplementary material to "A Collective, Probabilistic Approach to Schema Mapping." We include an additional extended example, supplementary experiment details, and proof for the complexity result…
We define new statistics, (c, d)-descents, on the colored permutation groups Z_r \wr S_n and compute the distribution of these statistics on the elements in these groups. We use some combinatorial approaches, recurrences, and generating…
We investigate a class of Young diagrams growing via the addition of unit cells and satisfying the constraint that the height difference between adjacent columns $\geq r$. In the long time limit, appropriately re-scaled Young diagrams…
We characterize which graph invariants are partition functions of an edge-coloring model over the complex numbers, in terms of the rank growth of associated `connection matrices'.
Methods from additive number theory are applied to construct families of finitely generated linear semigroups with intermediate growth.
Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…
This results in this paper have been merged with the result in arXiv:1003.0167. The authors would like to withdraw this version. Please see arXiv:1008.5356 for the merged version.
Problem with the figures should be corrected. Apparently a broken uuencoder was the cause.
In this note we present some results that were already conjectured in the work [9] by Bildhauer, Fuchs and Weickert, where they have investigated analytical aspects of coupled variational models with applications to mathematical imaging.…
In the paper, some lower bounds for polygamma functions are refined.
We prove the existence of recurrent initial configurations for the rotor walk on many graphs, including Z^d, and planar graphs with locally finite embeddings. We also prove that recurrence and transience of rotor walks are invariant under…
In this supplementary appendix we provide additional results, omitted proofs and extensive simulations that complement the analysis of the main text (arXiv:1201.0224).
Misprints in eq. (7), which propagate up to eq. (13), are corrected. References are updated.