Related papers: Transport on randomly evolving trees

We observe $n$ sequences at each of $m$ sites, and assume that they have evolved from an ancestral sequence that forms the root of a binary tree of known topology and branch lengths, but the sequence states at internal nodes are unknown.…

We study the problem of random search in finite networks with a tree topology, where it is expected that the distribution of the first-passage time F(t) decays exponentially. We show that the slope of the exponential tail is independent of…

We propose a stochastic model for evolution through mutation and natural selection of a population that evolves on a $\bbT_d^+$ tree. We think of this model as a way of describing the evolution fitness landscape of a population. We obtain…

We discuss how spreading processes on temporal networks are impacted by the shape of their inter-event time distributions. Through simple mathematical arguments and toy examples, we find that the key factor is the ordering in which events…

Localization phenomena permeate many branches of physics playing a fundamental role on dynamical processes evolving on heterogeneous networks. These localization analyses are frequently grounded, for example, on eigenvectors of adjacency or…

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…

The ongoing explosion of genome sequence data is transforming how we reconstruct and understand the histories of biological systems. Across biological scales, from individual cells to populations and species, trees-based models provide a…

Many organisms exhibit branching morphologies that twist around each other and become entangled. Entanglement occurs when different objects interlock, creating complex and often irreversible configurations. This physical phenomenon is…

Branched structures that evolve over time critically determine the function of various natural and engineered systems, including growing vasculature, neural arborization, pulmonary networks such as lungs, river basins, power distribution…

Networks are important representations in computer science to communicate structural aspects of a given system of interacting components. The evolution of a network has several topological properties that can provide us information on the…

Following up on a previous work we examine a model of transportation network in some source-sink flow paradigm subjected to growth and resource allocation. The model is inspired from plants, and we add rules and factors that are analogous…

Staged trees are a relatively recent class of probabilistic graphical models that extend Bayesian networks to formally and graphically account for non-symmetric patterns of dependence. Machine learning algorithms to learn them from data…

We investigate the structural organization of the point-to-point electric, diffusive or hydraulic transport in complex scale-free networks. The random choice of two nodes, a source and a drain, to which a potential difference is applied,…

Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the…

This article examines how diseases on random networks spread in time. The disease is described by a probability distribution function for the number of infected and recovered individuals, and the probability distribution is described by a…

Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…

We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of…

A dynamic model for a random network evolving in continuous time is defined where new vertices are born and existing vertices may die. The fitness of a vertex is defined as the accumulated in-degree of the vertex and a new vertex is…

A heterogeneous continuous time random walk is an analytical formalism for studying and modeling diffusion processes in heterogeneous structures on microscopic and macroscopic scales. In this paper we study both analytically and numerically…

We consider the random evolution described by the motion of a particle moving on a circle alternating the angular velocities $ \pm c $ and changing rotation at Poisson random times, resulting in a telegraph process over the circle. We study…