Related papers: Disassortativity of random critical branching tree…
Many models of fractal growth patterns (like Diffusion Limited Aggregation and Dielectric Breakdown Models) combine complex geometry with randomness; this double difficulty is a stumbling block to their elucidation. In this paper we…
We study the role of phylogenetic trees on correlations in mutation processes. Generally, correlations decay exponentially with the generation number. We find that two distinct regimes of behavior exist. For mutation rates smaller than a…
We obtain local weak limits in probability for Collapsed Branching Processes (CBP), which are directed random networks obtained by collapsing random-sized families of individuals in a general continuous-time branching process. The local…
In this article a collection of random self-similar fractal dendrites is constructed, and their Hausdorff dimension is calculated. Previous results determining this quantity for random self-similar structures have relied on geometrical…
We study an asymptotical behavior of the maximal degree in the degree distribution in an evolving tree model combining the local choice and the Mori's preferential attachment. In the considered model, the random graph is constructed in the…
In this work we explore degree assortativity in complex networks, and extend its usual definition beyond that of nearest neighbours. We apply this definition to model networks, and describe a rewiring algorithm that induces assortativity.…
The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree $T$ for graph $G=(V,E)$ with $n$ vertices, such that the maximum degree $d$ of $T$ is the smallest among all spanning trees of $G$. In this paper,…
We revisit the Bayesian Context Trees (BCT) modelling framework for discrete time series, which was recently found to be very effective in numerous tasks including model selection, estimation and prediction. A novel representation of the…
In recent years there has been a paradigm shift from the study of local task-related activation to the organization and functioning of large-scale functional and structural brain networks. However, a long-standing challenge in this…
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…
We report on our recent observation that the occurrence of diffractive patterns in the scattering of electrons off nuclei obeys the same law as the fluctuations of the height of genealogical trees in branching diffusion processes.
Decision Trees are some of the most popular machine learning models today due to their out-of-the-box performance and interpretability. Often, Decision Trees models are constructed greedily in a top-down fashion via heuristic search…
We investigate centrality and root-inference properties in a class of growing random graphs known as sublinear preferential attachment trees. We show that a continuous time branching processes called the Crump-Mode-Jagers (CMJ) branching…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
Random spanning trees are among the most prominent determinantal point processes. We give four examples of random spanning trees on ladder-like graphs whose rungs form stationary renewal processes or regenerative processes of order two,…
In the new field of financial systemic risk, the network of interbank counterparty relationships can be described as a directed random graph. In "cascade models" of systemic risk, this "skeleton" acts as the medium through which financial…
We introduce block Markov chains (BMCs) indexed by an infinite rooted tree. It turns out that BMCs define a new class of tree-indexed Markovian processes. We clarify the structure of BMCs in connection with Markov chains (MCs) and Markov…
We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the…
The fractal dimension of minimal spanning trees on percolation clusters is estimated for dimensions $d$ up to $d=5$. A robust analysis technique is developed for correlated data, as seen in such trees. This should be a robust method…
Many social networks exhibit assortative mixing so that the predictions of uncorrelated models might be inadequate. To analyze the role of assortativity we introduce an algorithm which changes correlations in a network and produces…