Relevant bibliographies by topics / Preferential attachment

Academic literature on the topic 'Preferential attachment'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 April 2022

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Preferential attachment.'

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 "Preferential attachment"

1

Tameirão, Cinthya Rocha, Sérgio Fernando Loureiro Rezende, and Luciana Pereira de Assis. "Ligação Preferencial e Aptidão na Evolução da Rede de Filmes Brasileiros." Organizações & Sociedade 28, no. 99 (December 2021): 888–916. http://dx.doi.org/10.1590/1984-92302021v28n9907pt.

Full text
Abstract:
Abstract This study analyzes the network evolution, specifically that of the Brazilian film network. It examines two generative mechanisms that lie behind the network evolution: preferential attachment and fitness. The starting point is that preferential attachment and fitness may compete to shape the network evolution. We built a novel dataset with 974 Brazilian feature films released between 1995 and 2017 and used PAFit, a brand-new statistical method, to estimate the joint effects of preferential attachment and fitness on the evolution of the Brazilian film network. This study concludes that the network evolution is shaped by both preferential attachment and fitness. However, in the presence of fitness, the effects of preferential attachment on the network evolution become weaker. This means that the node ability to form ties in the Brazilian film network is mainly explained by its fitness. Besides, the preferential attachment assumes a sub-linear form. Costs, communication and managerial capabilities, and node age explain why nodes are unable to accumulate ties at rates proportional to their degree. Finally, preferential attachment and fitness manifest themselves heterogeneously, depending on either the type or the duration of the network. Preferential attachment drives the cast network evolution, whereas fitness is the main generative mechanism of the crew network. Actors and actresses rely on their status, privilege, and power to obtain future contracts (preferential attachment), whereas technical members are selected on the basis of their talent, skills, and knowledge (fitness). Due to node age or exit, preferential attachment becomes stronger in shorter networks.
APA, Harvard, Vancouver, ISO, and other styles
2

Janson, Svante, Subhabrata Sen, and Joel Spencer. "Preferential attachment when stable." Advances in Applied Probability 51, no. 4 (November 15, 2019): 1067–108. http://dx.doi.org/10.1017/apr.2019.42.

Full text
Abstract:
AbstractWe study an urn process with two urns, initialized with a ball each. Balls are added sequentially, the urn being chosen independently with probability proportional to the $\alpha$th power $(\alpha >1)$ of the existing number of balls. We study the (rare) event that the urn compositions are balanced after the addition of $2n-2$ new balls. We derive precise asymptotics of the probability of this event by embedding the process in continuous time. Quite surprisingly, fine control of this probability may be leveraged to derive a lower-tail large deviation principle (LDP) for $L = \sum_{i=1}^{n} ({S_i^2}/{i^2})$, where $\{S_n \colon n \geq 0\}$ is a simple symmetric random walk started at zero. We provide an alternative proof of the LDP via coupling to Brownian motion, and subsequent derivation of the LDP for a continuous-time analog of L. Finally, we turn our attention back to the urn process conditioned to be balanced, and provide a functional limit law describing the trajectory of the urn process.
APA, Harvard, Vancouver, ISO, and other styles
3

Haslegrave, John, and Jonathan Jordan. "Preferential attachment with choice." Random Structures & Algorithms 48, no. 4 (November 28, 2015): 751–66. http://dx.doi.org/10.1002/rsa.20616.

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

Chen, Chen. "The origin of preferential attachment and the generalized preferential attachment for weighted networks." Physica A: Statistical Mechanics and its Applications 377, no. 2 (April 2007): 709–16. http://dx.doi.org/10.1016/j.physa.2006.11.082.

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

Wu, Yan, Tom Z. J. Fu, and Dah Ming Chiu. "Generalized preferential attachment considering aging." Journal of Informetrics 8, no. 3 (July 2014): 650–58. http://dx.doi.org/10.1016/j.joi.2014.06.002.

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

ANTUNOVIĆ, TONĆI, ELCHANAN MOSSEL, and MIKLÓS Z. RÁCZ. "Coexistence in Preferential Attachment Networks." Combinatorics, Probability and Computing 25, no. 6 (February 9, 2016): 797–822. http://dx.doi.org/10.1017/s0963548315000383.

Full text
Abstract:
We introduce a new model of competition on growing networks. This extends the preferential attachment model, with the key property that node choices evolve simultaneously with the network. When a new node joins the network, it chooses neighbours by preferential attachment, and selects its type based on the number of initial neighbours of each type. The model is analysed in detail, and in particular, we determine the possible proportions of the various types in the limit of large networks. An important qualitative feature we find is that, in contrast to many current theoretical models, often several competitors will coexist. This matches empirical observations in many real-world networks.
APA, Harvard, Vancouver, ISO, and other styles
7

de Blasio, B. F., A. Svensson, and F. Liljeros. "Preferential attachment in sexual networks." Proceedings of the National Academy of Sciences 104, no. 26 (June 19, 2007): 10762–67. http://dx.doi.org/10.1073/pnas.0611337104.

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

Garavaglia, Alessandro, and Clara Stegehuis. "Subgraphs in preferential attachment models." Advances in Applied Probability 51, no. 03 (September 2019): 898–926. http://dx.doi.org/10.1017/apr.2019.36.

Full text
Abstract:
AbstractWe consider subgraph counts in general preferential attachment models with power-law degree exponent $\tau > 2$ . For all subgraphs H, we find the scaling of the expected number of subgraphs as a power of the number of vertices. We prove our results on the expected number of subgraphs by defining an optimization problem that finds the optimal subgraph structure in terms of the indices of the vertices that together span it and by using the representation of the preferential attachment model as a Pólya urn model.
APA, Harvard, Vancouver, ISO, and other styles
9

Lim, Chjan, and Weituo Zhang. "Relevance and Importance Preferential Attachment." Complex Systems 28, no. 3 (October 15, 2019): 333–56. http://dx.doi.org/10.25088/complexsystems.28.3.333.

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

Lehmann, S., A. D. Jackson, and B. Lautrup. "Life, death and preferential attachment." Europhysics Letters (EPL) 69, no. 2 (January 2005): 298–303. http://dx.doi.org/10.1209/epl/i2004-10331-2.

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

Dissertations / Theses on the topic "Preferential attachment"

1

Mönch, Christian. "Distances in preferential attachment networks." Thesis, University of Bath, 2013. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607617.

Full text
Abstract:
Preferential attachment networks with power law degree sequence undergo a phase transition when the power law exponent τ changes. For τ > 3 typical distances in the network are logarithmic in the size of the network and for 2 < τ < 3 they are doubly logarithmic. In this thesis, we identify the correct scaling constant for τ ∈ (2, 3) and discover a surprising dichotomy between preferential attachment networks and networks without preferential attachment. This contradicts previous conjectures of universality. Moreover, using a model recently introduced by Dereich and Mörters, we study the critical behaviour at τ = 3, and establish novel results for the scale of the typical distances under lower order perturbations of the attachment function.
APA, Harvard, Vancouver, ISO, and other styles
2

Peterson, Nicholas Richard. "On Random k-Out Graphs with Preferential Attachment." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1370527839.

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

Hébert-Dufresne, Laurent. "On the growth and structure of social systems following preferential attachment." Doctoral thesis, Université Laval, 2014. http://hdl.handle.net/20.500.11794/25331.

Full text
Abstract:
L’inégalité est une caractéristique notoire des systèmes sociaux. Dans cette thèse, nous nous attarderons à la distribution et à la structure de la répartition de leurs ressources et activités. Dans ce contexte, leurs extrêmes iniquités tendent à suivre une propriété universelle, l’indépendance d’échelle, qui se manifeste par l’absence d’échelle caractéristique. En physique, les organisations indépendantes d’échelle sont bien connues en théorie des transitions de phase dans laquelle on les observe à des points critiques précis. Ceci suggère que des mécanismes bien définis sont potentiellement responsables de l’indépendance d’échelle des systèmes sociaux. Cette analogie est donc au coeur de cette thèse, dont le but est d’aborder ce problème de nature multidisciplinaire avec les outils de la physique statistique. En premier lieu, nous montrons qu’un système dont la distribution de ressource croît vers l’indépendance d’échelle se trouve assujetti à deux contraintes temporelles particulières. La première est l’attachement préférentiel, impliquant que les riches s’enrichissent. La seconde est une forme générale de comportement d’échelle à délai entre la croissance de la population et celle de la ressource. Ces contraintes dictent un comportement si précis qu’une description instantanée d’une distribution est suffisante pour reconstruire son évolution temporelle et prédire ses états futurs. Nous validons notre approche au moyen de diverses sphères d’activités humaines dont les activités des utilisateurs d’une page web, des relations sexuelles dans une agence d’escorte, ainsi que la productivité d’artistes et de scientifiques. En second lieu, nous élargissons notre théorie pour considérer la structure résultante de ces activités. Nous appliquons ainsi nos travaux à la théorie des réseaux complexes pour décrire la structure des connexions propre aux systèmes sociaux. Nous proposons qu’une importante classe de systèmes complexes peut être modélisée par une construction hiérarchique de niveaux d’organisation suivant notre théorie d’attachement préférentiel. Nous montrons comment les réseaux complexes peuvent être interprétés comme une projection de ce modèle de laquelle émerge naturellement non seulement leur indépendance d’échelle, mais aussi leur modularité, leur structure hiérarchique, leurs caractéristiques fractales et leur navigabilité. Nos résultats suggèrent que les réseaux sociaux peuvent être relativement simples, et que leur complexité apparente est largement une réflexion de la structure hiérarchique complexe de notre monde.
Social systems are notoriously unfair. In this thesis, we focus on the distribution and structure of shared resources and activities. Through this lens, their extreme inequalities tend to roughly follow a universal pattern known as scale independence which manifests itself through the absence of a characteristic scale. In physical systems, scale-independent organizations are known to occur at critical points in phase transition theory. The position of this critical behaviour being very specific, it is reasonable to expect that the distribution of a social resource might also imply specific mechanisms. This analogy is the basis of this work, whose goal is to apply tools of statistical physics to varied social activities. As a first step, we show that a system whose resource distribution is growing towards scale independence is subject to two constraints. The first is the well-known preferential attachment principle, a mathematical principle roughly stating that the rich get richer. The second is a new general form of delayed temporal scaling between the population size and the amount of available resource. These constraints pave a precise evolution path, such that even an instantaneous snapshot of a distribution is enough to reconstruct its temporal evolution and predict its future states. We validate our approach on diverse spheres of human activities ranging from scientific and artistic productivity, to sexual relations and online traffic. We then broaden our framework to not only focus on resource distribution, but to also consider the resulting structure. We thus apply our framework to the theory of complex networks which describes the connectivity structure of social, technological or biological systems. In so doing, we propose that an important class of complex systems can be modelled as a construction of potentially infinitely many levels of organization all following the same universal growth principle known as preferential attachment. We show how real complex networks can be interpreted as a projection of our model, from which naturally emerge not only their scale independence, but also their clustering or modularity, their hierarchy, their fractality and their navigability. Our results suggest that social networks can be quite simple, and that the apparent complexity of their structure is largely a reflection of the complex hierarchical nature of our world.
APA, Harvard, Vancouver, ISO, and other styles
4

Chin-Lee, Jao-ke. "How to Win Ratings and Influence Reviewers: Preferential Attachment in Rating Systems." Thesis, Harvard University, 2015. http://nrs.harvard.edu/urn-3:HUL.InstRepos:14398548.

Full text
Abstract:
In this paper we introduce the concept of preferential attachment in the context of recommendation and rating systems. We present several models incorporating different qualities that may manifest in such systems, such as inherent bias, and examine the resulting degree distributions (i.e. ratings) as snapshots and through time. We then take preliminary steps towards testing real-world feasibility with the Yelp Academic Dataset.
APA, Harvard, Vancouver, ISO, and other styles
5

Youssef, Bassant El Sayed. "Models for the Generation of Heterogeneous Complex Networks." Diss., Virginia Tech, 2015. http://hdl.handle.net/10919/54009.

Full text
Abstract:
Complex networks are composed of a large number of interacting nodes. Examples of complex networks include the topology of the Internet, connections between websites or web pages in the World Wide Web (WWW), and connections between participants in social networks.Due to their ubiquity, modeling complex networks is importantfor answering many research questions that cannot be answered without a mathematical model. For example, mathematical models of complex networks can be used to find the most vulnerable nodes to protect during a virus attack in theInternet, to predict connections between websites in the WWW, or to find members of different communities insocial networks. Researchers have analyzed complex networksand concluded that they are distinguished from other networks by four specific statistical properties. These four statistical properties are commonly known in this field as: (i) thesmall world effect,(ii) high average clustering coefficient, (iii) scale-free power law degree distribution, and (iv) emergence of community structure. These four statistical properties are further described later in this dissertation. Mostmodels used to generate complex networks attempt to produce networks with these statistical properties. Additionally, most of these network models generate homogeneous complex networks where all the networknodes are considered to have the same properties. Homogenous complex networks neglect the heterogeneous nature ofthe nodes in many complexnetworks. Moreover, somemodels proposed for generating heterogeneous complexnetworks are not general as they make specific assumptions about the properties of the network.Including heterogeneity in the connection algorithm of a modelwould makeitmore suitable for generating the subset of complex networks that exhibit selective linking.Additionally, all modelsproposed, to date, for generating heterogeneous complex networks do not preserve all four of the statistical properties of complexnetworks stated above. Thus, formulation of a model for the generation of general heterogeneous complex networkswith characteristics that resemble as much as possible the statistical properties common to the real-world networks that have received attention from the research community is still an open research question. In this work, we propose two new types of models to generate heterogeneous complex networks. First, we introduce the Integrated Attribute Similarity Model (IASM). IASM uses preferential attachment(PA) to connect nodes based on a similarity measure for node attributes combined with a node's structural popularity measure. IASM integrates the attribute similarity measure and a structural popularity measure in the computation of the connection function used to determine connectionsbetween each arriving (newly created) node and the existing(previously created or old) network nodes. IASM is also the first model known to assign an attribute vector having more than one element to each node, thus allowing different attributes per node in the generated complex network. Networks generated using IASM have a power law degree distribution and preserve the small world phenomenon. IASM models are enhanced to increase their clustering coefficient using a triad formation step (TFS). In a TFS, a node connects to the neighbor of the node to which it was previously connected through preferential attachment, thus forming a triad. The TFS increases the number of triads that are formed in the generated network which increases the network's average clustering coefficient. We also introduce a second novel model,the Settling Node Adaptive Model (SNAM). SNAM reflects the heterogeneous nature of connectionstandard requirements for nodes. The connectionstandard requirements for a noderefers to the values of attribute similarity and/or structural popularityof old node ythat node new xwould find acceptable in order to connect to node y.SNAM is novel in that such a node connection criterion is not included in any previous model for the generation of complex networks. SNAM is shown to be successful in preserving the power law degree distribution, the small world phenomenon, and the high clustering coefficient of complex networks. Next,we implement a modification to the IASM and SNAM models that results in the emergence of community structure.Nodes are classified into classes according to their attribute values. The connection algorithm is modified to include the class similarity values between network nodes. This community structure model preservesthe PL degree distribution, small world property, and does not affect average clustering coefficient values expected from both IASM and SNAM. Additionally, the model exhibits the presence of community structure having most of the connections made between nodes belonging to the same class with only a small percent of the connections made between nodes of different classes. We perform a mathematical analysis of IASM and SNAM to study the degree distribution for networks generated by both models. This mathematical analysis shows that networks generated by both models have a power law degree distribution. Finally, we completed a case study to illustrate the potential value of our research on the modeling of heterogeneous complex networks. This case study was performed on a Facebook dataset. The case study shows that SNAM, with some modifications to the connection algorithm, is capable of generating a network with almost the same characteristics as found for the original dataset. The case study providesinsight on how the flexibility of SNAM's connection algorithm can be an advantagethat makes SNAM capable of generating networks with different statistical properties. Ideas for future research areas includestudyingthe effect of using eigenvector centrality, instead of degree centrality, on the emergence of community structure in IASM; usingthe nodeindex as an indication for its order of arrival to the network and distributing added connections fairly among networknodes along the life of the generated network; experimenting with the nature of attributesto generatea more comprehensive model; and usingtime sensitive attributes in the models, where the attribute can change its value with time,
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
6

Maia, Rodrigo Filev. "Uma arquitetura de controle de qualidade de serviço aplicada a redes heterogêneas e serviços convergentes." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-16082010-130303/.

Full text
Abstract:
Um dos objetivos das próximas gerações dos sistemas de comunicação é permitir que os usuários acessem e distribuam um ou mais serviços a qualquer hora, em qualquer lugar, independentemente do tipo de terminal (telefone convencional, telefone celular, assistentes pessoais digitais, notebooks, dentre outros) ou da tecnologia da rede de acesso utilizados. Esse cenário é denominado convergência de serviços utilizando-se redes heterogêneas, e em tal realidade, as arquiteturas de qualidade de serviço existentes em cada uma das tecnologias dos sistemas de comunicação não oferecem mecanismos de interoperabilidade e em diversos casos não há controle sob os fluxos de dados uma vez admitido na infraestrutura do sistema de comunicação, assim como questões de handover heterogêneo não são tratadas. A tese propõe uma arquitetura para controle de Qualidade de Serviço para um ambiente heterogêneo composto de backbones IP e redes de acesso de diversas tecnologias, sendo tal arquitetura composta de agentes autônomos e distribuídos nos equipamentos de um sistema de comunicação; assim como.controles baseados no comportamento de uma região de um sistema de comunicação e apoiados na teoria e princípios de sistemas complexos. Os agentes da arquitetura proposta utilizando o princípio de preferential attachment mostraram-se eficientes na determinação do caminho de melhor condição de qualidade de serviços. Os componentes da arquitetura proposta estão localizados em cada equipamento de comunicação, desde o dispositivo do usuário até o provedor de serviços. As medições realizadas pelos agentes e utilizando um algoritmo baseado no conceito de preferential attachment permitiram ao agente alterar o caminho de um fluxo de dados durante sua transmissão para outros caminhos que apresentaram condições mais adequadas de acordo com os parâmetros de QoS. A decisão é baseada no contrato de qualidade de serviço especificado entre usuário e provedor de serviço e, considerando sob controle todos os elementos envolvidos na comunicação; tem-se controle distribuído de qualidade de serviço fim a fim.
One of the targets of the next generation communication systems is to provide access to any service, to any user, anytime, anywhere, regardless the access network technology or type of user device (mobile phone, PDA, personal computer, and so on). This scenario is called convergence of services by heterogeneous networks, and in such scenario quality of service mechanisms presented in legacy communication systems do not provide mechanisms for interoperability between communication systems nor control data flows after control admission in the border of the communication systems. The heterogeneous handover is also not handled by such QoS architectures. This thesis proposes a QoS control architecture for an heterogeneous communication systems composed by IP backbones and several access networks for several kind of technologies. This architecture is composed by a multiagent system and has controls based on the local behavior of the communication system and supported by complex systems theory. The agent decision algorithm is based on preferential attachment concept and the experimentation results indicate that agents could identify a better path to handle a data flow according to QoS parameters. The agents decided to change the path used to transmit the flow data autonomously and according to quality of service contract between user and service provider. The measurements in the test based on preferential attachment algorithm was useful in order agent change flow data path during data flow transmission to other paths with better conditions according to QoS requisites. The agent decision is based on the parameter values defined between end user and service provider. Considering the control elements from proposed architecture it was achieved end-to-end distributed control.
APA, Harvard, Vancouver, ISO, and other styles
7

Dabkowski, Matthew Francis. "Using Network Science to Estimate the Cost of Architectural Growth." Diss., The University of Arizona, 2016. http://hdl.handle.net/10150/612431.

Full text
Abstract:
Between 1997 and 2009, 47 major defense acquisition programs experienced cost overruns of at least 15% or 30% over their current or original baseline estimates, respectively (GAO, 2011, p. 1). Known formally as a Nunn-McCurdy breach (GAO, 2011, p. 1), the reasons for this excessive growth are myriad, although nearly 70% of the cases identified engineering and design issues as a contributing factor (GAO, 2011, p. 5). Accordingly, Congress legislatively acknowledged the need for change in 2009 with the passage of the Weapon Systems Acquisition Reform Act (WSARA, 2009), which mandated additional rigor and accountability in early life cycle (or Pre-Milestone A) cost estimation. Consistent with this effort, the Department of Defense has recently required more system specification earlier in the life cycle, notably the submission of detailed architectural models, and this has created opportunities for new approaches. In this dissertation, I describe my effort to transform one such model (or view), namely the SV-3, into computational knowledge that can be leveraged in Pre-Milestone A cost estimation and risk analysis. The principal contribution of my work is Algorithm 3-a novel, network science-based method for estimating the cost of unforeseen architectural growth in defense programs. Specifically, using number theory, network science, simulation, and statistical analysis, I simultaneously find the best fitting probability mass functions and strengths of preferential attachment for an incoming subsystem's interfaces, and I apply blockmodeling to find the SV-3's globally optimal macrostructure. Leveraging these inputs, I use Monte Carlo simulation and the Constructive Systems Engineering Cost Model to estimate the systems engineering effort required to connect a new subsystem to the existing architecture. This effort is chronicled by the five articles given in Appendices A through C, and it is summarized in Chapter 2.In addition to Algorithm 3, there are several important, tangential outcomes of this work, including: an explicit connection between Model Based System Engineering and parametric cost modeling, a general procedure for organizations to improve the measurement reliability of their early life cycle cost estimates, and several exact and heuristic methods for the blockmodeling of one-, two-, and mixed-mode networks. More generally, this research highlights the benefits of applying network science to systems engineering, and it reinforces the value of viewing architectural models as computational objects.
APA, Harvard, Vancouver, ISO, and other styles
8

Zheng, Huanyang. "SOCIAL NETWORK ARCHITECTURES AND APPLICATIONS." Diss., Temple University Libraries, 2017. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/470889.

Full text
Abstract:
Computer and Information Science
Ph.D.
Rather than being randomly wired together, the components of complex network systems are recently reported to represent a scale-free architecture, in which the node degree distribution follows power-law. While social networks are scale-free, it is natural to utilize their structural properties in some social network applications. As a result, this dissertation explores social network architectures, and in turn, leverages these architectures to facilitate some influence and information propagation applications. Social network architectures are analyzed in two different aspects. The first aspect focuses on the node degree snowballing effects (i.e., degree growth effects) in social networks, which is based on an age-sensitive preferential attachment model. The impact of the initial links is explored, in terms of accelerating the node degree snowballing effects. The second aspect focuses on Nested Scale-Free Architectures (NSFAs) for social networks. The scale-free architecture is a classic concept, which means that the node degree distribution follows the power-law distribution. `Nested' indicates that the scale-free architecture is preserved when low-degree nodes and their associated connections are iteratively removed. NSFA has a bounded hierarchy. Based on the social network structure, this dissertation explores two influence propagation applications for the Social Influence Maximization Problem (SIMP). The first application is a friend recommendation strategy with the perspective of social influence maximization. For the system provider, the objective is to recommend a fixed number of new friends to a given user, such that the given user can maximize his/her social influence through making new friends. This problem is proved to be NP-hard by reduction from the SIMP. A greedy friend recommendation algorithm with an approximation ratio of $1-e^{-1}$ is proposed. The second application studies the SIMP with the crowd influence, which is NP-hard, monotone, non-submodular, and inapproximable in general graphs. However, since user connections in Online Social Networks (OSNs) are not random, approximations can be obtained by leveraging the structural properties of OSNs. The modularity, denoted by $\Delta$, is proposed to measure to what degree this problem violates the submodularity. Two approximation algorithms are proposed with ratios of $\frac{1}{\Delta+2}$ and $1-e^{-1/(\Delta+1)}$, respectively. Beside the influence propagation applications, this dissertation further explores three different information propagation applications. The first application is a social network quarantine strategy, which can eliminate epidemic outbreaks with minimal isolation costs. This problem is NP-hard. An approximation algorithm with a ratio of 2 is proposed through utilizing the problem properties of feasibility and minimality. The second application is a rating prediction scheme, called DynFluid, based on the fluid dynamics. DynFluid analogizes the rating reference among the users in OSNs to the fluid flow among containers. The third application is an information cascade prediction framework: given the social current cascade and social topology, the number of propagated users at a future time slot is predicted. To reduce prediction time complexities, the spatiotemporal cascade information (a larger size of data) is decomposed to user characteristics (a smaller size of data) for subsequent predictions. All these three applications are based on the social network structure.
Temple University--Theses
APA, Harvard, Vancouver, ISO, and other styles
9

Luo, Hongwei, and Hongwei luo@rmit edu au. "Modelling and simulation of large-scale complex networks." RMIT University. Mathematical and Geospatial Sciences, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080506.142224.

Full text
Abstract:
Real-world large-scale complex networks such as the Internet, social networks and biological networks have increasingly attracted the interest of researchers from many areas. Accurate modelling of the statistical regularities of these large-scale networks is critical to understand their global evolving structures and local dynamical patterns. Traditionally, the Erdos and Renyi random graph model has helped the investigation of various homogeneous networks. During the past decade, a special computational methodology has emerged to study complex networks, the outcome of which is identified by two models: the Watts and Strogatz small-world model and the Barabasi-Albert scale-free model. At the core of the complex network modelling process is the extraction of characteristics of real-world networks. I have developed computer simulation algorithms for study of the properties of current theoretical models as well as for the measurement of two real-world complex networks, which lead to the isolation of three complex network modelling essentials. The main contribution of the thesis is the introduction and study of a new General Two-Stage growth model (GTS Model), which aims to describe and analyze many common-featured real-world complex networks. The tools we use to create the model and later perform many measurements on it consist of computer simulations, numerical analysis and mathematical derivations. In particular, two major cases of this GTS model have been studied. One is named the U-P model, which employs a new functional form of the network growth rule: a linear combination of preferential attachment and uniform attachment. The degree distribution of the model is first studied by computer simulation, while the exact solution is also obtained analytically. Two other important properties of complex networks: the characteristic path length and the clustering coefficient are also extensively investigated, obtaining either analytically derived solutions or numerical results by computer simulations. Furthermore, I demonstrate that the hub-hub interaction behaves in effect as the link between a network's topology and resilience property. The other is called the Hybrid model, which incorporates two stages of growth and studies the transition behaviour between the Erdos and Renyi random graph model and the Barabasi-Albert scale-free model. The Hybrid model is measured by extensive numerical simulations focusing on its degree distribution, characteristic path length and clustering coefficient. Although either of the two cases serves as a new approach to modelling real-world large-scale complex networks, perhaps more importantly, the general two-stage model provides a new theoretical framework for complex network modelling, which can be extended in many ways besides the two studied in this thesis.
APA, Harvard, Vancouver, ISO, and other styles
10

Santos, Bruno Vitorio dos. "Múltiplos assuntos no modelo de opiniões contínuas e ações discretas (CODA)." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/100/100132/tde-11122013-163456/.

Full text
Abstract:
Entendimento de processos que levem ao surgimento de opiniões extremas é valioso na prevenção de atos de violência. Os modelos são ferramentas úteis para identificar possíveis padrões relacionados a estes processos. No entanto, modelos discretos ou contínuos com confiança limitada não se mostram adequados para estudar dinâmicas caracterizadas pela divergência de opiniões. É proposta uma extensão cultural do modelo de Opiniões Contínuas e Ações Discretas (CODA) com múltiplos assuntos alternados por um mecanismo de ligação preferencial. Os agentes são influenciados não só em suas opiniões, mas também nas importâncias que atribuem aos diferentes assuntos. As principais características do modelo são o surgimento de preferências e consensos locais, aos quais estão associadas as opiniões mais extremas. Há, em contrapartida, persistência de opiniões brandas nos temas menos preferidos. O estudo do espaço paramétrico do modelo revelou que modificações diminuindo a localidade das interações aumentam maiorias e amenizam opiniões. Duas estratégias distintas de debate foram testadas. Zelotes têm poder de conversão aumentado quando dispersos. Evitadores minimizam o número de interações indesejável se agrupados. Foram esboçadas abordagens para inserção de efeitos da mídia na dinâmica
Understanding processes leading to extremism is invaluable to prevent violence outbursts. Models are useful tools that allow for identifying patterns related to those processes. Nevertheless, discrete models and bounded-confidence continuous models are unfit for studying diversion-based dynamics. We present a cultural extension of CODA model, with multiple subjects selected through a preferential attachment rule. Agents are influenced in their opinions and relevance attributed to different subjects. The most notable results of the dynamics are the establishment of local subject preferences and consensus, associated with more extreme opinions. On the other hand, there is persistence of immature undeveloped opinion in the locally less regarded subjects. The study of parametric space has shown that settings reducing the locality of interactions both increase the majority size and make opinions less extreme. Two distinct debate strategies were simulated. Zealots increase conversions when spread throughout the network. In contrast, subject avoiders decrease the number of unwanted interactions by grouping together. Some ideas for introducing media influence to the model were outlined
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Preferential attachment"

1

Newman, Mark. Models of network formation. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198805090.003.0013.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
2

Coolen, A. C. C., A. Annibale, and E. S. Roberts. Network growth algorithms. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0008.

Full text
Abstract:
Growth processes are a fundamentally different approach compared to probability-driven exponential models covered in earlier chapters. This chapter studies how growth rules can be designed to mimic processes observed in the real world, and how the process can be mathematically analyzed in order to obtain information about the likely topological properties of the resulting networks. The configuration (stub joining) model is described, including a careful discussion of how bias can be introduced if backtracking is used instead of restarting if stubs join to form a self or double link. The second class of models looked at is preferential attachment. The simplest variants of this are analyzed with a master equation approach, in order to introduce this technique as a way of obtaining analytical information about the expected properties of the generated graphs. Extensive references are provided to the numerous variants and extensions of both of these models.
APA, Harvard, Vancouver, ISO, and other styles
3

Coolen, Ton, Alessia Annibale, and Ekaterina Roberts. Generating Random Networks and Graphs. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.001.0001.

Full text
Abstract:
This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of random graph generation. This book is aimed at the graduate student or advanced undergraduate. It includes many worked examples, numerical simulations and exercises making it suitable for use in teaching. Explicit pseudocode algorithms are included to make the ideas easy to apply. Datasets are becoming increasingly large and network applications wider and more sophisticated. Testing hypotheses against properly specified control cases (null models) is at the heart of the ‘scientific method’. Knowledge on how to generate controlled and unbiased random graph ensembles is vital for anybody wishing to apply network science in their research.
APA, Harvard, Vancouver, ISO, and other styles
4

Marandiuc, Natalia. Human and Divine Love Cocreating the Self. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190674502.003.0005.

Full text
Abstract:
In conversation with Kierkegaard, the chapter argues that human and divine loves interweave to cocreate the self. Referring to Plato’s thought that love is a union between need and desire, the chapter suggests that underneath the gospel commandment to love one’s neighbor as oneself, which channels human desire, lies a powerful need for love. It is argued that Kierkegaard’s bilayered theological anthropology corresponds to his theology of love whereby universal love for human beings forms a ground from which preferential loves grow and gives birth to human subjectivity through the Spirit’s mediation. The chapter distinguishes between universal neighbor love, which Kierkegaard counts as Kantian duty, and particular love attachments, which home the self and anchor its freedom. Kierkegaard inherits from Scotus the framework of dovetailing human and divine loves and uses it to portray one’s love for God as a letter sent with a forwarding address to another human being.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Preferential attachment"

1

Berger, N., C. Borgs, J. T. Chayes, R. M. D’Souza, and R. D. Kleinberg. "Competition-Induced Preferential Attachment." In Automata, Languages and Programming, 208–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27836-8_20.

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

Avin, Chen, and Yuri Lotker. "De-evolution of Preferential Attachment Trees." In Complex Networks & Their Applications IX, 508–19. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-65351-4_41.

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

Jacob, Emmanuel, and Peter Mörters. "Robustness of Spatial Preferential Attachment Networks." In Lecture Notes in Computer Science, 3–14. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26784-5_1.

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

Krot, Alexander, and Liudmila Ostroumova Prokhorenkova. "Assortativity in Generalized Preferential Attachment Models." In Lecture Notes in Computer Science, 9–21. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49787-7_2.

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

Nahum, Yinon. "Rich-Clubs in Preferential Attachment Networks." In Studies in Computational Intelligence, 67–79. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-05414-4_6.

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

Poncela Casasnovas, Julia. "Complex Networks from Evolutionary Preferential Attachment." In Evolutionary Games in Complex Topologies, 117–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30117-9_7.

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

Swarup, Samarth, and Les Gasser. "Noisy Preferential Attachment and Language Evolution." In From Animals to Animats 9, 765–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11840541_63.

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

Sidorov, Sergei, Sergei Mironov, Igor Malinskii, and Dmitry Kadomtsev. "Local Degree Asymmetry for Preferential Attachment Model." In Complex Networks & Their Applications IX, 450–61. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-65351-4_36.

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

Abdullah, Mohammed Amin, Michel Bode, and Nikolaos Fountoulakis. "Local Majority Dynamics on Preferential Attachment Graphs." In Lecture Notes in Computer Science, 95–106. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26784-5_8.

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

Doerr, Benjamin, Mahmoud Fouz, and Tobias Friedrich. "Asynchronous Rumor Spreading in Preferential Attachment Graphs." In Algorithm Theory – SWAT 2012, 307–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31155-0_27.

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

Conference papers on the topic "Preferential attachment"

1

Avin, Chen, Zvi Lotker, Yinon Nahum, and David Peleg. "Random preferential attachment hypergraph." In ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3341161.3342867.

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

Devlin, David, and Barry O'Sullivan. "Preferential Attachment in Constraint Networks." In 2009 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2009. http://dx.doi.org/10.1109/ictai.2009.91.

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

Luczak, Tomasz, Abram Magner, and Wojciech Szpankowski. "Compression of Preferential Attachment Graphs." In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849739.

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

Kunegis, Jérôme, Marcel Blattner, and Christine Moser. "Preferential attachment in online networks." In the 5th Annual ACM Web Science Conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2464464.2464514.

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

Avin, Chen, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, and David Peleg. "Preferential Attachment as a Unique Equilibrium." In the 2018 World Wide Web Conference. New York, New York, USA: ACM Press, 2018. http://dx.doi.org/10.1145/3178876.3186122.

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

Zhizhong, Yang, and Zhao Qinggui. "The Stability of p Preferential Attachment Networks." In 2010 International Conference on Intelligent System Design and Engineering Application (ISDEA). IEEE, 2010. http://dx.doi.org/10.1109/isdea.2010.217.

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

Zadorozhnyi, Vladimir N. "Preferential attachment random graphs with vertices losses." In 2017 International Siberian Conference on Control and Communications (SIBCON). IEEE, 2017. http://dx.doi.org/10.1109/sibcon.2017.7998456.

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

Oliva, Gabriele, and Stefano Panzieri. "Modeling real networks with deterministic preferential attachment." In Automation (MED 2011). IEEE, 2011. http://dx.doi.org/10.1109/med.2011.5983122.

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

Atwood, James, Bruno Ribeiro, and Don Towsley. "Efficient network generation under general preferential attachment." In the 23rd International Conference. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2567948.2579357.

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

Manchanda, Saurav, Pranjul Yadav, Khoa Doan, and S. Sathiya Keerthi. "Targeted display advertising: the case of preferential attachment." In 2019 IEEE International Conference on Big Data (Big Data). IEEE, 2019. http://dx.doi.org/10.1109/bigdata47090.2019.9006184.

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

Reports on the topic "Preferential attachment"

1

Perumalla, Kalyan S., and Maksudul Alam. Generating Billion-Edge Scale-Free Networks in Seconds: Performance Study of a Novel GPU-based Preferential Attachment Model. Office of Scientific and Technical Information (OSTI), October 2017. http://dx.doi.org/10.2172/1399438.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Preferential attachment' for particular source types:
Journal articles Dissertations / Theses
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