相关论文: Statistics of leaves in growing random trees

We investigate the joint distribution of nodes of small degrees and the degree profile in preferential dynamic attachment circuits. In particular, we study the joint asymptotic distribution of the number of the nodes of outdegree $0$…

We propose a wide class of preferential attachment models of random graphs, generalizing previous approaches. Graphs described by these models obey the power-law degree distribution, with the exponent that can be controlled in the models.…

We study a random graph $G_n$, which combines aspects of geometric random graphs and preferential attachment. The resulting random graphs have power-law degree sequences with finite mean and possibly infinite variance. In particular, the…

Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\ (1)\, Sharp upper bound on the total number…

We propose a simple random process inducing various types of random graphs and the scale free random graphs among others. The model is of a threshold nature and differs from the preferential attachment approach discussed in the literature…

Let $T$ be a tree. A vertex of degree one is a \emph{leaf} of $T$ and a vertex of degree at least three is a \emph{branch vertex} of $T$. A graph is said to be \emph{$K_{1,4}$-free} if it does not contain $K_{1,4}$ as an induced subgraph.…

Regression trees are a popular machine learning algorithm that fit piecewise constant models by recursively partitioning the predictor space. This paper focuses on statistical inference for a data-dependent model obtained from a fitted…

In a graph, nodes can be characterized locally (with their degree $k$) or globally (e.g. with their average length path $\xi$ to other nodes). Here we investigate how $\xi$ depends on $k$. Our earlier algorithm of the construction of the…

In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a Poisson process approximation that, for graphs which have independent edges, with a possibly…

We study the influence of the seed graph in the preferential attachment model, focusing on the case of trees. We first show that the seed has no effect from a weak local limit point of view. On the other hand, we conjecture that different…

Leaf powers and $k$-leaf powers have been studied for over 20 years, but there are still several aspects of this graph class that are poorly understood. One such aspect is the leaf rank of leaf powers, i.e. the smallest number $k$ such that…

We study a discrete-time duplication-deletion random graph model and analyse its asymptotic degree distribution. The random graphs consists of disjoint cliques. In each time step either a new vertex is brought in with probability $0<p<1$…

We prove that for any fixed $k$, the probability that a random vertex of a random increasing plane tree is of rank $k$, that is, the probability that a random vertex is at distance $k$ from the leaves, converges to a constant $c_k$ as the…

The Rooted Maximum Leaf Outbranching problem consists in finding a spanning directed tree rooted at some prescribed vertex of a digraph with the maximum number of leaves. Its parameterized version asks if there exists such a tree with at…

Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…

We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected…

A multi-type preferential attachment tree is introduced, and studied using general multi-type branching processes. For the $p$-type case we derive a framework for studying the tree where a type $i$ vertex generates new type $j$ vertices…

We study a variant of the standard random intersection graph model ($G(n,m,F,H)$) in which random weights are assigned to both vertex types in the bipartite structure. Under certain assumptions on the distributions of these weights, the…

We analyze dynamic random network models where younger vertices connect to older ones with probabilities proportional to their degrees as well as a propensity kernel governed by their attribute types. Using stochastic approximation…

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…