Related papers: Infinite cycles in the random stirring model on tr…

Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…

The classical model for the genealogies of a neutrally evolving population in a fixed environment is due to Kingman. Kingman's coalescent process, which produces a binary tree, universally emerges from many microscopic models in which the…

Let $p$ be a fixed prime number, and $q$ a power of $p$. For any curve over $\mathbb{F}_q$ and any local system on it, we have a number field generated by the traces of Frobenii at closed points, known as the trace field. We show that as we…

We count invertible Schr\"odinger operators (perturbations by diagonal matrices of the adjacency matrix) over finite fieldsfor trees, cycles and complete graphs.This is achieved for trees through the definition and use of local invariants…

This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes…

We will consider cross products of finite graphs with a class of trees that have arbitrarily but finitely long line segments, such as the Fibonacci tree. Such cross products are called tree-strips. We prove that for small disorder random…

This paper is concerned with the characterizations of fixed points of the generating function of branching processes with countably infinitely many types. We assume each particle of type $i$ can only give offspring of type $j\geq i$, whose…

We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1-\epsilon)n vertices, in terms of the expansion properties of G. As a result we show that for fixed d\geq 2…

We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles…

We show that products of sufficiently thick Cantor sets generate trees in the plane with constant distance between adjacent vertices. Moreover, we prove that the set of choices for this distance has non-empty interior. We allow our trees to…

The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.

Let $T$ be a random tree taken uniformly at random from the family of labelled trees on $n$ vertices. In this note, we provide bounds for $c(n)$, the number of sub-trees of $T$ that hold asymptotically almost surely. With computer support…

We prove that every heteroclinic saddle loop (a two-saddle cycle) occurring in an analytic finite-parameter family of plane analytic vector fields, may generate no more than a finite number of limit cycles within the family.

This paper derives a unifying theorem establishing consistency results for a broad class of tree-based algorithms. It improves current results in two aspects. First of all, it can be applied to algorithms that vary from traditional Random…

We consider an independently identically distributed random dynamical system generated by finitely many, non-uniformly expanding Markov interval maps with a finite number of branches. Assuming a topologically mixing condition and the…

In quenched disordered systems, the existence of ordering is generally believed to be only possible in the weak disorder regime (disregarding models of spin-glass type). In particular, sufficiently large random fields is expected to…

We introduce a new family of models for growing networks. In these networks new edges are attached preferentially to vertices with higher number of connections, and new vertices are created by already existing ones, inheriting part of their…

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. The questions of whether and…

We consider Galton-Watson trees with Geom$(p)$ offspring distribution. We let $T_{\infty}(p)$ denote such a tree conditioned on being infinite. We prove that for any $1/2\leq p_1 <p_2 \leq 1$, there exists a coupling between…

One class of random walks with infinite memory, so called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We…