Related papers: Growing random planar network with oriented branch…
Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…
We study the growth of London's street-network in its dual representation, as the city has evolved over the last 224 years. The dual representation of a planar graph is a content-based network, where each node is a set of edges of the…
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…
We establish an explicit rate of convergence for some systems of mean-field interacting diffusions with logistic binary branching towards the solutions of nonlinear evolution equations with non-local self-diffusion and logistic mass growth,…
We consider random recursive trees that are grown via community modulated schemes that involve random attachment or degree based attachment. The aim of this paper is to derive general techniques based on continuous time embedding to study…
A fundamental question regarding biological transport networks is the interplay between the network development or reorganization and the flows it carries. We use Physarum polycephalum, a true slime mould with a transport network which…
In this paper we consider a triangular array of branching processes with non-stationary immigration. We prove a weak convergence of properly normalized branching processes with immigration to deterministic function under assumption that…
We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…
Many growing networks possess accelerating statistics where the number of links added with each new node is an increasing function of network size so the total number of links increases faster than linearly with network size. In particular,…
In a recent paper, Krapivsky and Redner (Phys. Rev. E, 71 (2005) 036118) proposed a new growing network model with new nodes being attached to a randomly selected node, as well to all ancestors of the target node. The model leads to a…
We introduce a growing network model in which a new node attaches to a randomly-selected node, as well as to all ancestors of the target node. This mechanism produces a sparse, ultra-small network where the average node degree grows…
Tree search algorithms, such as branch-and-bound, are the most widely used tools for solving combinatorial and nonconvex problems. For example, they are the foremost method for solving (mixed) integer programs and constraint satisfaction…
Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is chosen randomly-uniformly. We introduce the notion of a distributional limit $G$ of such graphs. Assume that the…
We consider the genealogy of a sample of individuals taken from a spatially structured population when the variance of the offspring distribution is relatively large. The space is structured into discrete sites of a graph G. If the…
Finding a maximum independent set is a fundamental NP-hard problem that is used in many real-world applications. Given an unweighted graph, this problem asks for a maximum cardinality set of pairwise non-adjacent vertices. Some of the most…
The forest of mutations associated to a multitype branching forest is obtained by merging together all vertices of its clusters and by preserving connections between them. We first show that the forest of mutations of any mulitype branching…
We consider a continuous-time symmetric branching random walk on multidimensional lattices with immigration and infinite number of initial particles. We assume that at every lattice point a process of birth and death of particles is…
The symbiotic branching model describes a spatial population consisting of two types that are allowed to migrate in space and branch locally only if both types are present. We continue our investigation of the large scale behaviour of the…
Social networks have become an inseparable part of human life and processing them in an efficient manner is a top priority in the study of networks. These networks are highly dynamic and they are growing incessantly. Inspired by the concept…
Tissue growth can be modeled in two dimension by only using circular granular cells, which can grow and produce child. Linear spring-dashpot model is used to bind the cells with a cut-off interaction range of 1.1 times sum of radii of…