Related papers: Topological self-similarity on the random binary-t…
Different classes of communication network topologies and their representation in the form of adjacency matrix and its eigenvalues are presented. A self-organizing feature map neural network is used to map different classes of communication…
This paper provides answers to questions regarding the almost sure limiting behavior of rooted, binary tree-structured rules for regression. Examples show that questions raised by Gordon and Olshen in 1984 have negative answers. For these…
This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…
We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…
The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…
There has been quite some activity and progress concerning spectral asymptotics of random operators that are defined on percolation subgraphs of different types of graphs. In this short survey we record some of these results and explain the…
We establish the asymptotic normality of the regression estimator in a fixed-design setting when the errors are given by a field of dependent random variables. The result applies to martingale-difference or strongly mixing random fields. On…
The Horton-Strahler number, also known as the register function, provides a tool for quantifying the branching complexity of a rooted tree. We consider the Horton-Strahler number of critical Galton-Watson trees conditioned to have size $n$…
This is an introductory level survey of some topics from a new branch of fractal analysis -- the theory of self-similar groups. We discuss recent works on random walks on self-similar groups and their applications to the problem of…
We compute the homology of the matching complex $M(\Gamma)$, where $\Gamma$ is the complete hypergraph on $n\geq 2$ vertices, and analyse the $S_n$-representations carried by this homology. These results are achieved using standard…
It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…
Algorithmic statistics considers the following problem: given a binary string $x$ (e.g., some experimental data), find a "good" explanation of this data. It uses algorithmic information theory to define formally what is a good explanation.…
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…
We define a class of properties on random plane trees, which we call subtree additive properties, inspired by the combinatorics of certain biologically-interesting properties in a plane tree model of RNA secondary structure. The class of…
We study the asymptotic distribution of integers sharing the same rooted-tree structure that encodes their complete prime factorization tower. For each tree we derive an explicit density formula depending only on a pair $(m,k)$, the density…
The widespread occurrence of an inverse square relation in the hierarchical distribution of sub-communities within communities (or sub-species within species) has been recently invoked as a signature of hierarchical self-organization within…
We examine the homological structure of the Barabasi-Albert model, focusing on the time evolution of $\Delta$-dimensional simplices and topological holes as functions of time $t$ and the attachment parameter $m$ (the number of edges added…
We give exact relations for certain types of the hierarchic fractal structures. In the blatant distinction from regular networks of the "small world" (SW) topology [1], regular fractal networks manifests the logarithmic dependence of the…
We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…
We provide first a categorical exploration of, and then completion of the mapping of the relationships among, three fundamental perspectives on binary relations: as the incidence matrices of hypergraphs, as the formal contexts of concept…