On directed Barabasi-Albert networks with two and seven neighbours selected by each added site, the Ising model was seen not to show a spontaneous magnetisation. Instead, the decay time for flipping of the magnetisation followed an Arrhenius law for Metropolis and Glauber algorithms, but for Wolff cluster flipping the magnetisation decayed exponentially with time. On these networks the Majority-vote model with noise is now studied through Monte Carlo simulations. However, in this model, the order-disorder phase transition of the order parameter is well defined in this system. We calculate the value of the critical noise parameter q_c for several values of connectivity z of the directed Barabasi-Albert network. The critical exponents beta/nu., gamma/nu and 1/nu were calculated for several values of z.
The ability to sample random networks that can accurately represent real social contact networks is essential to the study of viral epidemics. The Barabási-Albert model and its extensions attempt to capture reality by generating networks with power-law degree distributions, but properties of the resulting distributions (e.g. minimum, average, and maximum degree) are often unrealistic of the social contacts the models attempt to capture. I propose a novel extension of the Barabási-Albert model, which I call the "dual-Barabási-Albert" (DBA) model, that attempts to better capture these properties…
Barabási-Albert model describes many different natural networks, often yielding sensible explanations to the subjacent dynamics. However, finite size effects may prevent from discerning among different underlying physical mechanisms and from determining whether a particular finite system is driven by Barabási-Albert dynamics. Here we propose master equations for the evolution of the degrees, links and triangles distributions, solve them both analytically and by numerical iteration, and compare with numerical simulations. The analytic solutions for all these distributions predict the network ev…
Using Monte Carlo simulations, we study the evolution of contigent cooperation and ethnocentrism in the one-move game. Interactions and reproduction among computational agents are simulated on {\it undirected} and {\it directed} Barabási-Albert (BA) networks. We first replicate the Hammond-Axelrod model of in-group favoritism on a square lattice and then generalize this model on {\it undirected} and {\it directed} BA networks for both asexual and sexual reproduction cases. Our simulations demonstrate that irrespective of the mode of reproduction, ethnocentric strategy becomes common even thoug…
Presented here is the explicit solution to the continuous time approximation of the Albert-Barabási scale-free network model at any time t. The solution is found by recursively solving the differential equations via integrating factors, identifying a pattern for the coefficients and then proving this observed pattern using induction.
In usual scale-free networks of Barabasi-Albert type, a newly added node selects randomly m neighbors from the already existing network nodes, proportionally to the number of links these had before. Then the number N(k) of nodes with k links each decays as 1/k^gamma where gamma=3 is universal, i.e. independent of m. Now we use a limited directedness in the construction of the network, as a result of which the exponent gamma decreases from 3 to 2 for increasing m.
Recently, Yin et al. [Eur. Phys. J. B 49, 205 (2006)] introduced an efficient small-world network traffic model using preferential next-nearest neighbor routing strategy with the so-called path iteration avoidance (PIA) rule to study the jamming transition of internet. Here we study their model without PIA rule by a mean-field analysis which carefully divides the message packets into two types. Then, we argue that our mean-field analysis is also applicable in the presence of PIA rule in the limit of a large number of nodes in the network. Our analysis gives an explicit expression of the critic…
Using a mean-field network formulation of the Bass innovation diffusion model and exact results by Fotouhi and Rabbat on the degree correlations of Barabasi-Albert networks, we compute the times of the diffusion peak and compare them with those on scale-free networks which have the same scale-free exponent but different assortativity properties. We compare our results with those obtained by Caldarelli et al. for the SIS epidemic model with the spectral method applied to adjacency matrices. It turns out that diffusion times on finite Barabasi-Albert networks are at a minimum. This may be due to…
With the evolution of social networks, the network structure shows dynamic nature in which nodes and edges appear as well as disappear for various reasons. The role of a node in the network is presented as the number of interactions it has with the other nodes. For this purpose a network is modeled as a graph where nodes represent network members and edges represent a relationship among them. Several models for evolution of social networks has been proposed till date, most widely accepted being the Barabási-Albert \cite{Network science} model that is based on \emph{preferential attachment} of …
We develop and test a rewiring method (originally proposed by Newman) which allows to build random networks having pre-assigned degree distribution and two-point correlations. For the case of scale-free degree distributions, we discretize the tail of the distribution according to the general prescription by Dorogovtsev and Mendes. The application of this method to Barabasi-Albert (BA) networks is possible thanks to recent analytical results on their correlations, and allows to compare the ensemble of random networks generated in the configuration model with that of "real" networks obtained fro…
We consider two consensus formation models coupled to Barabasi-Albert networks, namely the Majority Vote model and Biswas-Chatterjee-Sen model. Recent works point to a non-universal behavior of the Majority Vote model, where the critical exponents have a dependence on the connectivity while the effective dimension $D_\mathrm{eff} = 2β/ν+ γ/ν$ of the lattice is unity. We considered a generalization of the scaling relations in order to include logarithmic corrections. We obtained the leading critical exponent ratios $1/ν$, $β/ν$, and $γ/ν$ by finite size scaling data collapses, as well as the lo…
In this article, we show that if each node of the Barabási-Albert (BA) network is characterized by the generalized degree $q$, i.e. the product of their degree $k$ and the square root of their respective birth time, then the distribution function $F(q,t)$ exhibits dynamic scaling $F(q,t\rightarrow \infty)\sim t^{-1/2}ϕ(q/t^{1/2})$ where $ϕ(x)$ is the scaling function. We verified it by showing that a series of distinct $F(q,t)$ vs $q$ curves for different network sizes $N$ collapse onto a single universal curve if we plot $t^{1/2}F(q,t)$ vs $q/t^{1/2}$ instead. Finally, we show that the BA net…
We show results for the contact process on Barabasi networks. The contact process is a model for an epidemic spreading without permanent immunity that has an absorbing state. For finite lattices, the absorbing state is the true stationary state, which leads to the need for simulation of quasi-stationary states, which we did in two ways: reactivation by inserting spontaneous infected individuals, or by the quasi-stationary method, where we store a list of active states to continue the simulation when the system visits the absorbing state. The system presents an absorbing phase transition where …
We present a modified diffusive epidemic process that has a finite threshold on scale-free graphs. The diffusive epidemic process describes the epidemic spreading in a non-sedentary population, and it is a reaction-diffusion process. In the diffusion stage, the individuals can jump between connected nodes, according to different diffusive rates for the infected and susceptible individuals. In the reaction stage, the contagion can happen if there is an infected individual sharing the same node, and infected individuals can spontaneously recover. Our main modification is to turn the number of in…
The explosive growth of Web 2.0, which was characterized by the creation of online social networks, has reignited the study of factors that could help us understand the growth and dynamism of these networks. Various generative network models have been proposed, including the Barabasi-Albert and Watts-Strogatz models. In this study, we revisit the problem from a perspective that seeks to compare results obtained from these generative models with those from real networks. To this end, we consider the dating network Skout Inc. An analysis is performed on the topological characteristics of the net…
The sampling of scale-free networks in Molecular Biology is usually achieved by growing networks from a seed using recursive algorithms with elementary moves which include the addition and deletion of nodes and bonds. These algorithms include the Barabasi-Albert algorithm. Later algorithms, such as the Duplication-Divergence algorithm, the Solé algorithm and the iSite algorithm, were inspired by biological processes underlying the evolution of protein networks, and the networks they produce differ essentially from networks grown by the Barabasi-Albert algorithm. In this paper the mean field an…
Within the context of agent-based Monte-Carlo simulations, we study the well-known majority-vote model (MVM) with noise applied to tax evasion on simple square lattices, Voronoi-Delaunay random lattices, Barabasi-Albert networks, and Erdös-Rényi random graphs. In the order to analyse and to control the fluctuations for tax evasion in the economics model proposed by Zaklan, MVM is applied in the neighborhod of the noise critical $q_{c}$. The Zaklan model had been studied recently using the equilibrium Ising model. Here we show that the Zaklan model is robust and can be reproduced also through t…
The efficiency of a large hierarchical organisation is simulated on Barabasi-Albert networks, when each needed link leads to a loss of information. The optimum is found at a finite network size, corresponding to about five hierarchical layers, provided a cost for building the network is included in our optimization.
Election results are determined by numerous social factors that affect the formation of opinion of the voters, including the network of interactions between them and the dynamics of opinion influence. In this work we study the result of proportional elections using an opinion dynamics model similar to simple opinion spreading over a complex network. Erdos-Renyi, Barabasi-Albert, regular lattices and randomly augmented lattices are considered as models of the underlying social networks. The model reproduces the power law behavior of number of candidates with a given number of votes found in rea…
This paper presents a comprehensive analysis of the degree statistics in models for growing networks where new nodes enter one at a time and attach to one earlier node according to a stochastic rule. The models with uniform attachment, linear attachment (the Barabási-Albert model), and generalized preferential attachment with initial attractiveness are successively considered. The main emphasis is on finite-size (i.e., finite-time) effects, which are shown to exhibit different behaviors in three regimes of the size-degree plane: stationary, finite-size scaling, large deviations.
When we represent logical, connective implications by directed edges, the resulting set of directed edges can be regarded as a complex network. In this article, we compose a network model that represents a deductive-logic-like structure composed solely of implications. The proposed network model grows like the BA model reported by Barabasi and Albert [Science 286, 509 (1999)]. Though the BA model references the whole of the existing network when a node is added, our model references only part of the existing network. In this view, our model is more realistic than the BA model. However, it also…
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting nodes. Using a renewal approach, we derive exact expressions of the occupation probability of the walker in each node and mean-field first-passage time between arbitrary two nodes. All the results are relevant to the spectral properties of the transition matrix in the absence of resetting. We demonstrate our results on circular networks, stochastic block mo…
Coarse graining model is a promising way to analyze and visualize large-scale networks. The coarse-grained networks are required to preserve the same statistical properties as well as the dynamic behaviors as the initial networks. Some methods have been proposed and found effective in undirected networks, while the study on coarse graining in directed networks lacks of consideration. In this paper, we proposed a Topology-aware Coarse Graining (TCG) method to coarse grain the directed networks. Performing the linear stability analysis of synchronization and numerical simulation of the Kuramoto …
