Related papers: Fractality of wave functions on a Cayley tree: Dif…
Neutral macroevolutionary models, such as the Yule model, give rise to a probability distribution on the set of discrete rooted binary trees over a given leaf set. Such models can provide a signal as to the approximate location of the root…
The problem of how to estimate diffusion on a graph effectively is of importance both theoretically and practically. In this paper, we make use of two widely studied indices, geodesic distance and mean first-passage time ($MFPT$) for random…
The level curvature distribution function is studied both analytically and numerically for the case of T-breaking perturbations over the orthogonal ensemble. The leading correction to the shape of the curvature distribution beyond the…
Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to…
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…
We examine and discuss the spatial evolution of the statistical properties of mechanically generated surface gravity wave fields, initialised with unidirectional spectral energy distributions, uniformly distributed phases and Rayleigh…
We study traveling wave solutions to bistable differential equations on infinite $k$-ary trees. These graphs generalize the notion of classical square infinite lattices and our results complement those for bistable lattice equations on…
We consider stochastic processes with (or without) memory whose evolution is encoded by a finite or infinite rooted tree. The main goal is to compare the entropy rates of a given base process and a second one, to be considered as a…
Localization-delocalization transition in a discrete Anderson nonlinear Schr\"odinger equation with disorder is shown to be a critical phenomenon $-$ similar to a percolation transition on a disordered lattice, with the nonlinearity…
Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…
We prove that the infinite components of the Free Uniform Spanning Forest of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the…
The aim of this article is to discuss and clarify the notion of fractality for subgroups of the group of automorphisms of a regular rooted tree. For this purpose we define three types of fractality. We show that they are not equivalent, by…
Phylogenetic trees represent the evolutionary relationships between extant lineages, where extinct or non-sampled lineages are omitted. Extending the work of Stadler and collaborators, this paper focuses on the branch lengths in…
The object of the present investigation is an ensemble of self-avoiding and directed graphs belonging to eight-branching Cayley tree (Bethe lattice) generated by the Fucsian group of a Riemann surface of genus two and embedded in the…
We study the properties of random walks on complex trees. We observe that the absence of loops reflects in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and…
We consider the fragmentation at nodes of the L\'{e}vy continuous random tree introduced in a previous paper. In this framework we compute the asymptotic for the number of small fragments at time $\theta$. This limit is increasing in…
We prove delocalization for the Anderson model on an infinite regular tree (or Cayley graph or Bethe lattice) at low disorder. This extends earlier results of Klein and Aizenman--Warzel by filling in the previously missing parts of the…
The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…
Biology presents many examples of planar distribution and structural networks having dense sets of closed loops. An archetype of this form of network organization is the vasculature of dicotyledonous leaves, which showcases a…
We extend Feynman's analysis of the infinite ladder AC circuit to fractal AC circuits. We show that the characteristic impedances can have positive real part even though all the individual impedances inside the circuit are purely imaginary.…