Convergence and approximate calculation of average degree under different network sizes for decreasing random birth-and-death networks

2018 ◽  
Vol 32 (15) ◽  
pp. 1850159
Author(s):  
Yin Long ◽  
Xiao-Jun Zhang ◽  
Kui Wang
Keyword(s):  
Analytical Solution ◽  
Numerical Method ◽  
Power Law ◽  
Approximate Calculation ◽  
Approximate Expression ◽  
Network Size ◽  
Average Degree ◽  
Large Network ◽  
Network Link ◽  
Theoretical Results

In this paper, convergence and approximate calculation of average degree under different network sizes for decreasing random birth-and-death networks (RBDNs) are studied. First, we find and demonstrate that the average degree is convergent in the form of power law. Meanwhile, we discover that the ratios of the back items to front items of convergent reminder are independent of network link number for large network size, and we theoretically prove that the limit of the ratio is a constant. Moreover, since it is difficult to calculate the analytical solution of the average degree for large network sizes, we adopt numerical method to obtain approximate expression of the average degree to approximate its analytical solution. Finally, simulations are presented to verify our theoretical results.

SCALING OF THE AVERAGE RECEIVING TIME ON A FAMILY OF WEIGHTED HIERARCHICAL NETWORKS

Fractals ◽  
2016 ◽  
Vol 24 (03) ◽  
pp. 1650038 ◽  
Author(s):  
YU SUN ◽  
MEIFENG DAI ◽  
YANQIU SUN ◽  
SHUXIANG SHAO
Keyword(s):  
Bipartite Graph ◽  
Power Law ◽  
Complete Bipartite Graph ◽  
Network Size ◽  
Large Network ◽  
Weight Factor ◽  
Hierarchical Networks ◽  
Current Node ◽  
Edge Linking ◽  
Power Law Function

In this paper, based on the un-weight hierarchical networks, a family of weighted hierarchical networks are introduced, the weight factor is denoted by [Formula: see text]. The weighted hierarchical networks depend on the number of nodes in complete bipartite graph, denoted by [Formula: see text], [Formula: see text] and [Formula: see text]. Assume that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the weight of edge linking them. We deduce the analytical expression of the average receiving time (ART). The obtained remarkable results display two conditions. In the large network, when [Formula: see text], the ART grows as a power-law function of the network size [Formula: see text] with the exponent, represented by [Formula: see text], [Formula: see text]. This means that the smaller the value of [Formula: see text], the more efficient the process of receiving information. When [Formula: see text], the ART grows with increasing order [Formula: see text] as [Formula: see text] or [Formula: see text].

Models of network formation

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Degree Distribution ◽  
Network Formation ◽  
Preferential Attachment ◽  
Network Size ◽  
Large Network ◽  
Citation Networks ◽  
Airline Networks ◽  
Attachment Model ◽  
Delivery Networks

This chapter describes models of the growth or formation of networks, with a particular focus on preferential attachment models. It starts with a discussion of the classic preferential attachment model for citation networks introduced by Price, including a complete derivation of the degree distribution in the limit of large network size. Subsequent sections introduce the Barabasi-Albert model and various generalized preferential attachment models, including models with addition or removal of extra nodes or edges and models with nonlinear preferential attachment. Also discussed are node copying models and models in which networks are formed by optimization processes, such as delivery networks or airline networks.

Some misinterpretations and lack of understanding in differential operators with no singular kernels

Open Physics ◽  
2020 ◽  
Vol 18 (1) ◽  
pp. 594-612 ◽  
Author(s):  
Abdon Atangana ◽  
Emile Franc Doungmo Goufo
Keyword(s):  
Fractional Calculus ◽  
Power Law ◽  
Initial Value Problems ◽  
Differential Operators ◽  
Integral Operators ◽  
Initial Value ◽  
Complex Processes ◽  
Singular Kernels ◽  
Fractional Differential ◽  
Theoretical Results

AbstractHumans are part of nature, and as nature existed before mankind, mathematics was created by humans with the main aim to analyze, understand and predict behaviors observed in nature. However, besides this aspect, mathematicians have introduced some laws helping them to obtain some theoretical results that may not have physical meaning or even a representation in nature. This is also the case in the field of fractional calculus in which the main aim was to capture more complex processes observed in nature. Some laws were imposed and some operators were misused, such as, for example, the Riemann–Liouville and Caputo derivatives that are power-law-based derivatives and have been used to model problems with no power law process. To solve this problem, new differential operators depicting different processes were introduced. This article aims to clarify some misunderstandings about the use of fractional differential and integral operators with non-singular kernels. Additionally, we suggest some numerical discretizations for the new differential operators to be used when dealing with initial value problems. Applications of some nature processes are provided.

scholarly journals The Similarity Hypothesis and New Analytical Support on the Estimation of Horizontal Infiltration into Sand

2010 ◽  
Vol 2010 ◽  
pp. 1-7 ◽  
Author(s):  
Celso L. Prevedello ◽  
Jocely M. T. Loyola
Keyword(s):  
Analytical Solution ◽  
Soil Water ◽  
Power Law ◽  
Specific Power ◽  
Water Density ◽  
Diverse Range ◽  
Similarity Hypothesis ◽  
Initial Soil ◽  
Water Contents ◽  
Soil Water Contents

A method based on a specific power-law relationship between the hydraulic head and the Boltzmann variable, presented using a similarity hypothesis, was recently generalized to a range of powers to satisfy the Bruce and Klute equation exactly. Here, considerations are presented on the proposed similarity assumption, and new analytical support is given to estimate the water density flux into and inside the soil, based on the concept of sorptivity and on Buckingham-Darcy's law. Results show that the new analytical solution satisfies both theories in the calculation of water density fluxes and is in agreement with experimental results of water infiltrating horizontally into sand. However, the utility of this analysis still needs to be verified for a variety of different textured soils having a diverse range of initial soil water contents.

Vibration Characteristics of Straight Blades of Asymmetrical Aerofoil Cross-Section

1969 ◽  
Vol 20 (2) ◽  
pp. 178-190 ◽  
Author(s):  
W. Carnegie ◽  
B. Dawson
Keyword(s):  
Analytical Solution ◽  
Cross Section ◽  
Natural Frequencies ◽  
Equations Of Motion ◽  
Limited Range ◽  
First Order ◽  
Special Cases ◽  
Theoretical Results ◽  
Theoretical Procedure ◽  
Good Agreement

SummaryTheoretical and experimental natural frequencies and modal shapes up to the fifth mode of vibration are given for a straight blade of asymmetrical aerofoil cross-section. The theoretical procedure consists essentially of transforming the differential equations of motion into a set of simultaneous first-order equations and solving them by a step-by-step finite difference procedure. The natural frequency values are compared with results obtained by an analytical solution and with standard solutions for certain special cases. Good agreement is shown to exist between the theoretical results for the various methods presented. The equations of motion are dependent upon the coordinates of the axis of the centre of flexure of the beam relative to the centroidal axis. The effect of variations of the centre of flexure coordinates upon the frequencies and modal shapes is shown for a limited range of coordinate values. Comparison is made between the theoretical natural frequencies and modal shapes and corresponding results obtained by experiment.

Influence of reciprocal links on the dynamics of scale-free Boolean networks

2020 ◽  
Vol 31 (03) ◽  
pp. 2050040
Author(s):  
Luca Agostini
Keyword(s):  
Numerical Simulation ◽  
Direct Effect ◽  
Network Size ◽  
Boolean Networks ◽  
Average Degree ◽  
Scale Free ◽  
Kauffman Model ◽  
Dynamical Properties

We study the effects of the reciprocal links on the dynamics of direct Boolean networks with scale-free topology (SFRBNs). By means of the method of the Derrida Plot, we have investigated the SFRBNs characterized by different values of average degree and different values of reciprocity in order to test the behavioral regimes of the system. The following step was to perform numerical simulation with the quenched Kauffman model to study the dynamical properties of critical SFRBNs with [Formula: see text]. The distribution of the number of different attractors, the period of the cyclic attractors, the transient duration and the fraction of the frozen nodes, have been studied as a function of the reciprocity and network size. The results presented reveal that reciprocity seems to have no direct effect on the changing of the behavioral regime of SFRBNs with given value of [Formula: see text]. On the contrary, we observed that reciprocal links have a profound effect on the dynamic of critical SFRBNs.

Scalings of first-return time for random walks on generalized and weighted transfractal networks

2019 ◽  
Vol 33 (26) ◽  
pp. 1950306
Author(s):  
Qin Liu ◽  
Weigang Sun ◽  
Suyu Liu
Keyword(s):  
Random Walks ◽  
Large Scale ◽  
Probability Generating Function ◽  
Return Time ◽  
Network Size ◽  
Large Network ◽  
Large Scale Network ◽  
Scale Network ◽  
The Mean ◽  
First Return Time

The first-return time (FRT) is an effective measurement of random walks. Presently, it has attracted considerable attention with a focus on its scalings with regard to network size. In this paper, we propose a family of generalized and weighted transfractal networks and obtain the scalings of the FRT for a prescribed initial hub node. By employing the self-similarity of our networks, we calculate the first and second moments of FRT by the probability generating function and obtain the scalings of the mean and variance of FRT with regard to network size. For a large network, the mean FRT scales with the network size at the sublinear rate. Further, the efficiency of random walks relates strongly with the weight factor. The smaller the weight, the better the efficiency bears. Finally, we show that the variance of FRT decreases with more number of initial nodes, implying that our method is more effective for large-scale network size and the estimation of the mean FRT is more reliable.

Sign in / Sign up

Export Citation Format

Share Document