Related papers: An Exceptional Convolutional Recurrence
Theoretical background and an implementation of the (p)-group generation algorithm by Newman and O'Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
We consider the Brownian tree introduced by Aldous and the associated Q-process which consists in an infinite spine on which are grafted independent Brownian trees. We present a reversal procedure on these trees that consists in looking at…
This paper considers a random structure on the lattice $\mathbb{Z}^2$ of the following kind. To each edge $e$ a random variable $X_e$ is assigned, together with a random sign $Y_e \in \{-1,+1\}$. For an infinite self-avoiding path on…
In this paper we obtained several properties that the characteristic polynomials of the unit-primitive matrix satisfy. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In…
We study periodic infinite billiards in the plane. We show that for rational models, some particular obstacles can be added periodically, so that the billiard flow in the resulting table is recurrent in almost every direction.
We investigate the statistics of extremal path(s) (both the shortest and the longest) from the root to the bottom of a Cayley tree. The lengths of the edges are assumed to be independent identically distributed random variables drawn from a…
In the paper, the author presents diagonal recurrence relations for the Stirling numbers of the first kind. As by-products, the author also recovers three explicit formulas for special values of the Bell polynomials of the second kind.
There is a classical geometric construction which uses a binary quadratic form to define an involution on the space of binary d-ics. We give a complete characterization of a general class of such involutions which are definable using…
A calculational framework is proposed for phylogenetics, using nonlocal quantum field theories in hypercubic geometry. Quadratic terms in the Hamiltonian give the underlying Markov dynamics, while higher degree terms represent branching…
A fringe subtree of a rooted tree is a subtree induced by one of the vertices and all its descendants. We consider the problem of estimating the number of distinct fringe subtrees in two types of random trees: simply generated trees and…
A non-linear differential equation arising from a stochastic process known as branching Brownian motion is considered. We find an explicit solution and show the uniqueness of the solution under some boundedness conditions using…
We consider the genealogy tree for a critical branching process conditioned on non-extinction. We enumerate vertices in each generation of the tree so that for each two generations one can define a monotone map describing the…
We study an inverse problem for variable coefficient fractional parabolic operators of the form $(\partial_t -\operatorname{div}(A(x) \nabla_x)^s + q(x,t)$ for $s\in(0,1)$ and show the unique recovery of $q$ from exterior measured data.…
We consider planar maps adjusted with a (regular critical) Boltzmann distribution and show that the expected number of pattern occurrences of a given map is asymptotically linear when the number n of edges goes to infinity. The main…
We generalize the classical probability frame by adopting a wider family of random variables that includes nondeterministic ones. The frame that emerges is known to host a ''classical'' extension of quantum mechanics. We discuss the notion…
In this paper, we are interested in the study of a problem with fractional derivatives having boundary conditions of integral types. The problem represents a Caputo type advection-diffusion equation where the fractional order derivative…
The Yule branching process is a classical model for the random generation of gene tree topologies in population genetics. It generates binary ranked trees -- also called "histories" -- with a finite number $n$ of leaves. We study the…
The motivation for this paper is the study of the phase transition for recurrence/transience of a class of self-interacting random walks on trees, which includes the once-reinforced random walk. For this purpose, we define a quantity, that…
We introduce a family of extensions of the Hietarinta-Viallet equation to a multi-term recurrence relation via a reduction from the coprimeness-preserving extension to the discrete KdV equation. The recurrence satisfies the irreducibility…