Relevant bibliographies by topics / Barabási-Albert Model

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Barabási-Albert Model'

Author: Grafiati
Published: 5 June 2025
Last updated: 2 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Barabási-Albert Model.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Barabási-Albert Model"

1

BONNEKOH, JOHANNES. "MONTE CARLO SIMULATIONS OF THE ISING AND THE SZNAJD MODEL ON GROWING BARABÁSI–ALBERT NETWORKS." International Journal of Modern Physics C 14, no. 09 (2003): 1231–35. http://dx.doi.org/10.1142/s0129183103005364.

Full text
Abstract:
The Ising model on growing Barabási–Albert networks shows the same ferromagnetic behavior as on static Barabási–Albert networks. Sznajd models on growing Barabási–Albert networks show an hysteresis-like behavior. A nearly full consensus builds up and the winning opinion depends on history. On slow growing Barabási–Albert networks a full consensus builds up. At five opinions in the Sznajd model with limited persuasion on growing Barabási–Albert networks, all odd opinions win and all even opinions loose supporters.
APA, Harvard, Vancouver, ISO, and other styles
2

Held, Pascal, Alexander Dockhorn, and Rudolf Kruse. "On Merging and Dividing Social Graphs." Journal of Artificial Intelligence and Soft Computing Research 5, no. 1 (2015): 23–49. http://dx.doi.org/10.1515/jaiscr-2015-0017.

Full text
Abstract:
Abstract Modeling social interaction can be based on graphs. However most models lack the flexibility of including larger changes over time. The Barabási-Albert-model is a generative model which already offers mechanisms for adding nodes. We will extent this by presenting four methods for merging and five for dividing graphs based on the Barabási- Albert-model. Our algorithms were motivated by different real world scenarios and focus on preserving graph properties derived from these scenarios. With little alterations in the parameter estimation those algorithms can be used for other graph mode
APA, Harvard, Vancouver, ISO, and other styles
3

LIMA, F. W. S. "SIMULATION OF MAJORITY RULE DISTURBED BY POWER-LAW NOISE ON DIRECTED AND UNDIRECTED BARABÁSI–ALBERT NETWORKS." International Journal of Modern Physics C 19, no. 07 (2008): 1063–67. http://dx.doi.org/10.1142/s0129183108012686.

Full text
Abstract:
On directed and undirected Barabási–Albert networks the Ising model with spin S = 1/2 in the presence of a kind of noise is now studied through Monte Carlo simulations. The noise spectrum P(n) follows a power law, where P(n) is the probability of flipping randomly select n spins at each time step. The noise spectrum P(n) is introduced to mimic the self-organized criticality as a model influence of a complex environment. In this model, different from the square lattice, the order-disorder phase transition of the order parameter is not observed. For directed Barabási–Albert networks the magnetis
APA, Harvard, Vancouver, ISO, and other styles
4

LIMA, F. W. S. "ISING MODEL SPIN S = 1 ON DIRECTED BARABÁSI–ALBERT NETWORKS." International Journal of Modern Physics C 17, no. 09 (2006): 1267–72. http://dx.doi.org/10.1142/s0129183106009679.

Full text
Abstract:
On directed Barabási–Albert networks with two and seven neighbours selected by each added site, the Ising model with spin S = 1/2 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 Ising model spin S = 1 is now studied through Monte Carlo simulations. However, in this model, the order-disorder phase transition is well defined in this system. We have obtained a first-order
APA, Harvard, Vancouver, ISO, and other styles
5

Lima, F. Welington S., and J. A. Plascak. "Kinetic Models of Discrete Opinion Dynamics on Directed Barabási–Albert Networks." Entropy 21, no. 10 (2019): 942. http://dx.doi.org/10.3390/e21100942.

Full text
Abstract:
Kinetic models of discrete opinion dynamics are studied on directed Barabási–Albert networks by using extensive Monte Carlo simulations. A continuous phase transition has been found in this system. The critical values of the noise parameter are obtained for several values of the connectivity of these directed networks. In addition, the ratio of the critical exponents of the order parameter and the corresponding susceptibility to the correlation length have also been computed. It is noticed that the kinetic model and the majority-vote model on these directed Barabási–Albert networks are in the
APA, Harvard, Vancouver, ISO, and other styles
6

Zhu, Lei, Lei Wang, Xiang Zheng, and Yuzhang Xu. "The Barabási and Albert scale-free network model." Journal of Intelligent & Fuzzy Systems 35, no. 1 (2018): 123–32. http://dx.doi.org/10.3233/jifs-169573.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

JACOBMEIER, DIRK. "MULTIDIMENSIONAL CONSENSUS MODEL ON A BARABÁSI–ALBERT NETWORK." International Journal of Modern Physics C 16, no. 04 (2005): 633–46. http://dx.doi.org/10.1142/s0129183105007388.

Full text
Abstract:
A Consensus Model according to Deffuant on a directed Barabási–Albert network was simulated. Agents have opinions on different subjects. A multi-component subject vector was used. The opinions are discrete. The analysis concerns distribution and clusters of agents which are in agreement with the opinions of the subjects. Remarkable results shown that there mostly exists no absolute consensus. It depends on the ratio of number of agents to the number of subjects, whether the communication ends in a consensus or a pluralism. Mostly a second robust cluster remains, in its size depending on the nu
APA, Harvard, Vancouver, ISO, and other styles
8

LIMA, F. W. S. "MAJORITY-VOTE ON DIRECTED BARABÁSI–ALBERT NETWORKS." International Journal of Modern Physics C 17, no. 09 (2006): 1257–65. http://dx.doi.org/10.1142/s0129183106008972.

Full text
Abstract:
On directed Barabási–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
APA, Harvard, Vancouver, ISO, and other styles
9

SCHNEGG, MICHAEL, and DIETRICH STAUFFER. "DYNAMICS OF NETWORKS AND OPINIONS." International Journal of Bifurcation and Chaos 17, no. 07 (2007): 2399–409. http://dx.doi.org/10.1142/s0218127407018476.

Full text
Abstract:
Social relations between people seldom follow regular lattice structures. In the Barabási–Albert model nodes link to the existing network structure with a probability proportional to the number of nodes previously attached. Here, we present an anthropologically motivated interpolation between Erdös–Rényi and Barabási–Albert rules, where people also prefer to help those who helped them in the past and explore some of its properties. The second part of the paper tackles the question how opinions spread through social networks. We restrict our analysis to one end of the spectrum: scale-free netwo
APA, Harvard, Vancouver, ISO, and other styles
10

Jordan, Jonathan, and Andrew R. Wade. "Phase Transitions for Random Geometric Preferential Attachment Graphs." Advances in Applied Probability 47, no. 2 (2015): 565–88. http://dx.doi.org/10.1239/aap/1435236988.

Full text
Abstract:
Vertices arrive sequentially in space and are joined to existing vertices at random according to a preferential rule combining degree and spatial proximity. We investigate phase transitions in the resulting graph as the relative strengths of these two components of the attachment rule are varied.Previous work of one of the authors showed that when the geometric component is weak, the limiting degree sequence mimics the standard Barabási-Albert preferential attachment model. We show that at the other extreme, in the case of a sufficiently strong geometric component, the limiting degree sequence
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Barabási-Albert Model"

1

Araújo, Maycon de Sousa. "Mudança de opinião em redes complexas: aproximação de campo médio para o modelo Sznajd." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/43/43134/tde-30092011-144321/.

Full text
Abstract:
Esta dissertação discutirá, com uma abordagem predominantemente analítica, aspectos em aberto do Modelo Sznajd e de algumas de suas variantes. Apresentaremos uma equação mestra que descreve a evolução de opiniões para o modelo e estudaremos seus estados estacionários numa aproximação de campo médio. Mostraremos que esta simples abordagem é suficientemente para descrever seu comportamento qualitativo. A introdução de ruído à dinâmica do modelo também é analisada. Observa-se, neste caso, a existência de uma transição de fase entre um estado onde há um candidato majoritário (estado ordenado) e um
APA, Harvard, Vancouver, ISO, and other styles
2

Ferreira, Ricardo Melo. "Soluções analíticas para o modelo de Barabási-Albert de crescimento de redes." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/150235.

Full text
Abstract:
Redes Complexas podem ser utilizadas para estudar uma variedade de assuntos, desde problemas tecnológicos a de saúde pública. Um dos modelos de redes complexas mais famoso é o modelo de Barabási-Albert, proposto inicialmente para reproduzir propriedades da rede mundial de computadores. Este modelo constrói redes através da sucessiva adição de nós, seguindo o princípio da adesão preferencial. Este princípio afirma que a probabilidade de um nó receber um vizinho é proporcional ao número de vizinhos que esse nó já possui. O principal resultado deste modelo é uma distribuição de grau que segue uma
APA, Harvard, Vancouver, ISO, and other styles
3

Urrutia, Espindola Javiera Francisca. "Popularidad local en grafos del tipo Barabási-Albert: implicancias en el modelo multipartito number-in-hand." Tesis, Universidad de Chile, 2013. http://www.repositorio.uchile.cl/handle/2250/114676.

Full text
Abstract:
Ingeniera Civil Matemático<br>La presente memoria tiene como objetivo el estudio del problema de reconstrucción de redes en sistemas distribuidos que utilizan mensajes pequeños. Esto resulta de gran interés en la actualidad debido a la existencia de redes de gran tamaño, tales como la World Wide Web y las redes sociales, que no necesariamente se encuentran almacenadas en su totalidad en un solo lugar. Debido a esto surge el interés de estudiar aspectos particulares de la topología de las redes de este tipo, coloquialmente denominadas Small World Networks. En primer lugar se elabora un protoco
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Barabási-Albert Model"

1

Smeliansky, Ruslan. "Network Powered by Computing: Next Generation of Computational Infrastructure." In Edge Computing - Technology, Management and Integration [Working Title]. IntechOpen, 2023. http://dx.doi.org/10.5772/intechopen.110178.

Full text
Abstract:
This paper is an extended version of my talk on the MoNeTec-2022. It gives a detailed presentation of the concept Network Powered by Computing (NPC). The main differences from the previously published one are that the functional architecture of the NPC is presented, the main problems on the way to its implementation are formulated, the mathematical statements of the problems of control and management of the resources in the NPC environment by methods of multi-agent optimization are given, the existence of a solution to these problems is justified, and the relationship between the problem of co
APA, Harvard, Vancouver, ISO, and other styles
2

"EL MODELO BARABÁSI–ALBERT." In Ciencia de redes. ITESO, 2022. http://dx.doi.org/10.2307/j.ctv2xqndq1.9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Barabási-Albert Model"

1

Park, Himchan, and Min-Soo Kim. "LineageBA: A Fast, Exact and Scalable Graph Generation for the Barabási-Albert Model." In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 2021. http://dx.doi.org/10.1109/icde51399.2021.00053.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jaiswal, Shailesh Kumar, Manjish Pal, Mridul Sahu, Prashant Sahu, and Amal Dev. "EvoCut: A new Generalization of Albert-Barabási Model for Evolution of Complex Networks." In 2018 22nd Conference of Open Innovations Association (FRUCT). IEEE, 2018. http://dx.doi.org/10.23919/fruct.2018.8468280.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Abrahão, Felipe S., Klaus Wehmuth, and Artur Ziviani. "Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3149.

Full text
Abstract:
We study emergent information in populations of randomly generated networked computable systems that follow a Susceptible-Infected-Susceptible contagion (or infection) model of imitation of the fittest neighbor. These networks have a scale-free degree distribution in the form of a power-law following the Barabási-Albert model. We show that there is a lower bound for the stationary prevalence (or average density of infected nodes) that triggers an unlimited increase of the expected emergent algorithmic complexity (or information) of a node as the population size grows.
APA, Harvard, Vancouver, ISO, and other styles
4

Oliveira Junior, Laércio, Florian Stelzer, and Liang Zhao. "Clustered Echo State Networks for Signal Observation and Frequency Filtering." In Symposium on Knowledge Discovery, Mining and Learning. Sociedade Brasileira de Computação, 2020. http://dx.doi.org/10.5753/kdmile.2020.11955.

Full text
Abstract:
Echo State Networks (ESNs) are recurrent neural networks that map an input signal to a high-dimensional dynamical system, called reservoir, and possess adaptive output weights. The output weights are trained such that the ESN’s output signal fits the desired target signal. Classical reservoirs are sparse and randomly connected networks. In this article, we investigate the effect of different network topologies on the performance of ESNs. Specifically, we use two types of networks to construct clustered reservoirs of ESN: the clustered Erdös–Rényi and the clustered Barabási-Albert network model
APA, Harvard, Vancouver, ISO, and other styles
5

Bhat, Smruthi, V. Ragha Sai, Sona Mundody, and Ram Mohana Reddy Guddeti. "Leveraging SIR and Barabási-Albert Models for Epidemic Modelling." In 2024 35th Conference of Open Innovations Association (FRUCT). IEEE, 2024. http://dx.doi.org/10.23919/fruct61870.2024.10516420.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Barabási-Albert Model' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography