Related papers: On The Joint Normality of Certain Statistics on Or…
This paper considers the probabilistic representation of the solutions of ordinary differential equations (ODEs) by the generation of marked random trees in which marks can be interpreted as mutant types in population genetics models. We…
We prove that a random labeled (unlabeled) tree is balanced. We also prove that random labeled and unlabeled trees are strongly $k$-balanced for any $k\geq 3$.
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have been made to provide accurate models. We study here a model…
In this paper we are interested in the joint distribution of two order statistics from overlapping samples. We give an explicit formula for the distribution of such a pair of random variables under the assumption that the parent…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
In this paper, we redesign and simplify an algorithm due to Remy et al. for the generation of rooted planar trees that satisfies a given partition of degrees. This new version is now optimal in terms of random bit complexity, up to a…
In this paper, we provide algorithms to rank and unrank certain degree-restricted classes of Cayley trees (spanning trees of the n-vertex complete graph). Specifically, we consider classes of trees that have a given set of leaves or a fixed…
This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…
Graphlet analysis is an approach to network analysis that is particularly popular in bioinformatics. We show how to set up a system of linear equations that relate the orbit counts and can be used in an algorithm that is significantly…
Let $G=\mathop{A\ast B}\limits_C$ be an amalgamated product of finite rank free groups $A$, $B$ and $C$. We introduce atomic measures and corresponding asymptotic densities on a set of normal forms of elements in $G$. We also define two…
Given a tree of weighted vertices, it is sometimes possible to break the tree into two equally-weighted subtrees within an allowable error. We give a fast algorithm that finds an edge which breaks the tree into equal-weight components or…
Tree-based ensemble methods such as random forests, gradient-boosted trees, and Bayesianadditive regression trees have been successfully used for regression problems in many applicationsand research studies. In this paper, we study ensemble…
A Yule tree is the result of a branching process with constant birth and death rates. Such a process serves as an instructive null model of many empirical systems, for instance, the evolution of species leading to a phylogenetic tree.…
We study a random tree, which was introduced by Ajazi et al. as part of a model of a neuronal network. Realising a scaling relation for the law of the tree, we can use elementary techniques to derive asymptotic results on the geometry as…
We consider the creation conditions of diverse hierarchical trees both analytically and numerically. A connection between the probabilities to create hierarchical levels and the probability to associate these levels into a united structure…
Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph. We show that,…
Scarf's algorithm gives a pivoting procedure to find a special vertex -- a dominating vertex -- in down-monotone polytopes. This paper studies the behavior of Scarf's algorithm when employed to find stable matchings in bipartite graphs.…
We study the asymptotic behaviour of uniform random maps with a prescribed face-degree sequence, in the bipartite case, as the number of faces tends to infinity. Under mild assumptions, we show that, properly rescaled, such maps converge in…
A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its…
A new method involving particle diagrams is introduced and developed into a rigorous framework for carrying out embedded random matrix calculations. Using particle diagrams and the attendant methodology including loop counting it becomes…