In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and the formulas of degree distribution are transformed to the corresponding problems of growing network Markov chains. First we investigate the growing network Markov chains, and obtain the condition in which the steady ...

We apply the self-organization considering falseneighbor degree to the fine-tuning of Growing Grid after the growth process is finished. This study proposes a Growing Grid with False-Neighbor degree (FN-GG). We confirm that FN-GG can self-organize the input data, which is in a rectangular input space, most effectively.

Heat units, expressed in growing degree-days (GDD), are frequently used to describe the timing of biological processes. The basic equation used is GDD = [(T,,, + TM,,)/2] T,,,,, where T, and T,,, are daily maximum and minimum air temperature, respectively, and T,, is the base temperature. Two methods of interpreting this equation for calculating GDD are: (1) if the daily mean temperature is les...

The two main schemes for coding triangle mesh connectivity traverse a mesh with similar region-growing operations. Rossignac’s Edgebreaker uses triangle labels to encode the traversal whereas the coder of Touma and Gotsman uses vertex degrees. Although both schemes are guided by the same spiraling spanning tree, they process triangles in a different order, making it difficult to understand thei...

We consider growing random networks {Gn}n≥1 where, at each time, a new vertex attaches itself to collection of existing vertices via fixed number m≥1 edges, with probability proportional function f (called attachment function) their degree. It was shown in [BB21] that such network models exhibit two distinct regimes: (i) the persistent regime, corresponding ∑i=1∞f(i)−2<∞, where top K maximal de...