English
Related papers

Related papers: Spatial preferential attachment networks: Power la…

200 papers

Consider growing a network, in which every new connection is made between two disconnected nodes. At least one node is chosen randomly from a subset consisting of $g$ fraction of the entire population in the smallest clusters. Here we show…

Statistical Mechanics · Physics 2016-01-20 Y. S. Cho , J. S. Lee , H. J. Herrmann , B. Kahng

We analyze Axelrod's model of social interactions on coevolving complex networks. We introduce four extensions with different mechanisms of edge rewiring. The models are intended to catch two kinds of interactions - preferential attachment,…

Physics and Society · Physics 2018-05-03 Tomasz Raducha , Tomasz Gubiec

We study the effects of spatial constraints on the structural properties of networks embedded in one or two dimensional space. When nodes are embedded in space, they have a well defined Euclidean distance $r$ between any pair. We assume…

Physics and Society · Physics 2009-11-13 Kosmas Kosmidis , Shlomo Havlin , Armin Bunde

Unlike the well-studied models of growing networks, where the dominant dynamics consist of insertions of new nodes and connections, and rewiring of existing links, we study {\em ad hoc} networks, where one also has to contend with rapid and…

Disordered Systems and Neural Networks · Physics 2009-11-10 Nima Sarshar , Vwani Roychowdhury

We provide a local probabilistic description of the limiting statistics of large preferential attachment trees in terms of the ordinary degree (number of neighbors) but augmented with information on leafdegree (number of neighbors that are…

Statistical Mechanics · Physics 2026-02-03 Harrison Hartle , P. L. Krapivsky

In this paper, a random graph process ${G(t)}_{t\geq 1}$ is studied and its degree sequence is analyzed. Let $(W_t)_{t\geq 1}$ be an i.i.d. sequence. The graph process is defined so that, at each integer time $t$, a new vertex, with $W_t$…

Probability · Mathematics 2020-06-05 Maria Deijfen , Henri van den Esker , Remco van der Hofstad , Gerard Hooghiemstra

Many real-world networks exhibit scale-free feature, have a small diameter and a high clustering tendency. We have studied the properties of a growing network, which has all these features, in which an incoming node is connected to its…

Statistical Mechanics · Physics 2009-11-10 Parongama Sen , S. S. Manna

Several fundamental properties of real complex networks, such as the small-world effect, the scale-free degree distribution, and recently discovered topological fractal structure, have presented the possibility of a unique growth mechanism…

Data Analysis, Statistics and Probability · Physics 2009-11-13 Liuhua Zou , Wenjiang Pei , Tao Li , Zhenya He , Yiuming Cheung

In the study of ad hoc sensor networks, clustering plays an important role in energy conservation therefore analyzing the mechanics of such topology can be helpful to make logistic decisions .Using the theory of complex network the…

Networking and Internet Architecture · Computer Science 2014-10-30 Chiranjib Patra , Samiran Chattopadhyay , Matangini Chattopadhyay , Parama Bhaumik

We investigate several geometric models of network which simultaneously have some nice global properties, that the small diameter property, the small-community phenomenon, which is defined to capture the common experience that (almost)…

Probability · Mathematics 2011-07-29 Angsheng Li , Pan Peng

In this paper, we study the clustering properties of the Spatial Preferential Attachment (SPA) model introduced by Aiello et al. in 2009. This model naturally combines geometry and preferential attachment using the notion of spheres of…

Social and Information Networks · Computer Science 2018-02-15 Lenar Iskhakov , Bogumil Kaminski , Maksim Mironov , Liudmila Ostroumova Prokhorenkova , Pawel Pralat

We introduce a minimal extended evolving model for small-world networks which is controlled by a parameter. In this model the network growth is determined by the attachment of new nodes to already existing nodes that are geographically…

Statistical Mechanics · Physics 2007-05-23 Zhongzhi Zhang , Lili Rong , Francesc Comellas

We are interested in the probability that two randomly selected neighbors of a random vertex of degree (at least) $k$ are adjacent. We evaluate this probability for a power law random intersection graph, where each vertex is prescribed a…

Social and Information Networks · Computer Science 2018-01-08 Mindaugas Bloznelis , Justinas Petuchovas

In spite of its relevance to the origin of complex networks, the interplay between form and function and its role during network formation remains largely unexplored. While recent studies introduce dynamics by considering rewiring processes…

Physics and Society · Physics 2008-07-18 J. Poncela , J. Gomez-Gardenes , L. M. Floria , A. Sanchez , Y. Moreno

We characterize the tail behavior of the distribution of the PageRank of a uniformly chosen vertex in a directed preferential attachment graph and show that it decays as a power law with an explicit exponent that is described in terms of…

Probability · Mathematics 2021-10-20 Sayan Banerjee , Mariana Olvera-Cravioto

We consider a preferential attachment model that incorporates an anomaly. Our goal is to understand the evolution of the network before and after the occurrence of the anomaly by studying the influence of the anomaly on the structural…

Physics and Society · Physics 2025-05-07 Qiu Liang , Remco van der Hofstad , Nelly Litvak

Paper proposes a model of large networks based on a random preferential attachment graph with addition of complete subgraphs (cliques). The proposed model refers to models of random graphs following the nonlinear preferential attachment…

Social and Information Networks · Computer Science 2019-04-05 E. B. Yudin

In the coevolution of network structures and opinion formation, we investigate the effects of a mixed population with distinctive relinking preferences on both the convergence time and the network structures. It has been found that a…

Physics and Society · Physics 2015-05-14 Li-Xin Zhong , Fei Ren , Tian Qiu , Jiang-Rong Xu , Bi-Hui Chen

Many real-world scale-free networks, such as neural networks and online communication networks, consist of a fixed number of nodes but exhibit dynamic edge fluctuations. However, traditional models frequently overlook scenarios where the…

Social and Information Networks · Computer Science 2026-04-02 Yichao Yao , Minyu Feng , Matjaž Perc , Jürgen Kurths

Preferential attachment networks with power law exponent $\tau>3$ are known to exhibit a phase transition. There is a value $\rho_{\rm c}>0$ such that, for small edge densities $\rho\leq \rho_c$ every component of the graph comprises an…

Probability · Mathematics 2018-06-13 Maren Eckhoff , Peter Morters , Marcel Ortgiese