Border trees of complex networks

The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small-world properties of real networks were fundamental to stimulate more realistic models and to understand important dynamical processes related to network growth. However, the properties of the network borders (nodes with degree equal to 1), one of its most fragile parts, remained little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze the border trees of complex networks, which are defined as the subgraphs without cycles connected to the remainder of the network (containing cycles) and terminating into border nodes. In addition to describing an algorithm for identification of such tree subgraphs, we also consider how their topological properties can be quantified in terms of their depth and number of leaves. We investigate the properties of border trees for several theoretical models as well as real-world networks. Among the obtained results, we found that more than half of the nodes of some real-world networks belong to the border trees. A power-law with cut-off was observed for the distribution of the depth and number of leaves of the border trees. An analysis of the local role of the nodes in the border trees was also performed.

Limit theorems for sequences of random trees

We consider a random tree and introduce a metric in the space of trees to define the ""mean tree"" as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and central limit theorems for sequence of independent identically distributed random trees. As application we propose tests to check if two samples of random trees have the same law.

Bootstrap percolation on homogeneous trees has 2 phase transitions

We study the threshold theta bootstrap percolation model on the homogeneous tree with degree b + 1, 2 <= theta <= b, and initial density p. It is known that there exists a nontrivial critical value for p, which we call p(f), such that a) for p > p(f), the final bootstrapped configuration is fully occupied for almost every initial configuration, and b) if p < p(f) , then for almost every initial configuration, the final bootstrapped configuration has density of occupied vertices less than 1. In this paper, we establish the existence of a distinct critical value for p, p(c), such that 0 < p(c) < p(f), with the following properties: 1) if p <= p(c), then for almost every initial configuration there is no infinite cluster of occupied vertices in the final bootstrapped configuration; 2) if p > p(c), then for almost every initial configuration there are infinite clusters of occupied vertices in the final bootstrapped configuration. Moreover, we show that 3) for p < p(c), the distribution of the occupied cluster size in the final bootstrapped configuration has an exponential tail; 4) at p = p(c), the expected occupied cluster size in the final bootstrapped configuration is infinite; 5) the probability of percolation of occupied vertices in the final bootstrapped configuration is continuous on [0, p(f)] and analytic on (p(c), p(f) ), admitting an analytic continuation from the right at p (c) and, only in the case theta = b, also from the left at p(f).

Examples from trees, related to discrete subsets, pseudo-radiality and omega-boundedness

We construct some examples using trees. Some of them are consistent counterexamples for the discrete reflection of certain topological properties. All the properties dealt with here were already known to be non-discretely reflexive if we assume CH and we show that the same is true assuming the existence of a Suslin tree. In some cases we actually get some ZFC results. We construct also, using a Suslin tree, a compact space that is pseudo-radial but it is not discretely generated. With a similar construction, but using an Aronszajn tree, we present a ZFC space that is first countable, omega-bounded but is not strongly w-bounded, answering a question of Peter Nyikos. (C) 2008 Elsevier B.V. All rights reserved.

Nuclear magnetic resonance characterization of metabolite disorder in orange trees caused by citrus sudden death disease

Citrus sudden death (CSD) is a new disease of sweet orange and mandarin trees grafted on Rangpur lime and Citrus volkameriana rootstocks. It was first seen in Brazil in 1999, and has since been detected in more than four million trees. The CSD causal agent is unknown and the current hypothesis involves a virus similar to Citrus tristeza virus or a new virus named Citrus sudden death-associated virus. CSD symptoms include generalized foliar discoloration, defoliation and root death, and, in most cases, it can cause tree death. One of the unique characteristics of CSD disease is the presence of a yellow stain in the rootstock bark near the bud union. This region also undergoes profound anatomical changes. In this study, we analyse the metabolic disorder caused by CSD in the bark of sweet orange grafted on Rangpur lime by nuclear magnetic resonance (NMR) spectroscopy and imaging. The imaging results show the presence of a large amount of non-functional phloem in the rootstock bark of affected plants. The spectroscopic analysis shows a high content of triacylglyceride and sucrose, which may be related to phloem blockage close to the bud union. We also propose that, without knowing the causal CSD agent, the determination of oil content in rootstock bark by low-resolution NMR can be used as a complementary method for CSD diagnosis, screening about 300 samples per hour.