Related papers: A Directed, Bi-Populated Preferential Attachment M…
In this contribution we introduce local attachment as an universal network-joining protocol for peer-to-peer networks, social networks, or other kinds of networks. Based on this protocol nodes in a finite-size network dynamically create…
This paper expands the degree-based consideration of the preferential attachment growth process and applies five different connectivity criteria (node degree, clustering coefficient, betweenness centrality, closeness centrality, and…
Inspired by empirical data on real world complex networks, the last few years have seen an explosion in proposed generative models to understand and explain observed properties of real world networks, including power law degree distribution…
In this paper, we analyze assortativity of preferential attachment models. We deal with a wide class of preferential attachment models (PA-class). It was previously shown that the degree distribution in all models of the PA-class follows a…
One reports computational study revealing a set of general requirements, fulfilling of which would allow employing changes in ambient conditions to regulate accomplishing the collective outcome of emerging active network patterns in an…
Homophily and social influence are two key concepts of social network analysis. Distinguishing between these phenomena is difficult, and approaches to disambiguate the two have been primarily limited to longitudinal data analyses. In this…
Understanding how social behavior influences epidemic dynamics has become a central focus in mathematical epidemiology. In particular, \textit{behavioral homophily} (the tendency of individuals to associate with similar others) and…
In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…
This article introduces a regularization and selection methods for directed networks with nodal homophily and nodal effects. The proposed approach not only preserves the statistical efficiency of the resulting estimator, but also ensures…
We study an evolving spatial network in which sequentially arriving vertices are joined to existing vertices at random according to a rule that combines preference according to degree with preference according to spatial proximity. We…
Schelling segregation is a well-established model used to investigate the dynamics of segregation in agent-based models. Since we consider segregation to be key for the development of political polarisation, we are interested in what…
Under preferential attachment (PA) network growth models late arrivals are at a disadvantage with regard to their final degrees. Previous extensions of PA have addressed this deficiency by either adding the notion of node fitness to PA,…
We introduce a model for directed spatial networks. Starting from an age-based preferential attachment model in which all arcs point from younger to older vertices, we add \emph{reciprocal} connections whose probabilities depend on the age…
We consider a general class of preferential attachment schemes evolving by a reinforcement rule with respect to certain sublinear weights. In these schemes, which grow a random network, the sequence of degree distributions is an object of…
Uncovering factors underlying the network formation is a long-standing challenge for data mining and network analysis. In particular, the microscopic organizing principles of directed networks are less understood than those of undirected…
The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree…
We investigate the degree sequences of geometric preferential attachment graphs in general compact metric spaces. We show that, under certain conditions on the attractiveness function, the behaviour of the degree sequence is similar to that…
We study a simple model of dynamic networks, characterized by a set preferred degree, $\kappa$. Each node with degree $k$ attempts to maintain its $\kappa$ and will add (cut) a link with probability $w(k;\kappa)$ ($1-w(k;\kappa)$). As a…
"Rich-get-richer" and "homophily" are two important phenomena in evolving social networks. "Rich-get-richer" means people with higher followings are more likely to attract new fans, and "homophily" means people prefer to bond with others of…
For $0<\alpha<1,$ and $\theta>-\alpha,$ let $(S^{-\alpha}_{\alpha,\theta+r})_{\{r\ge 0\}}$ denote an increasing(decreasing) sequence of variables forming a time inhomogeneous Markov chain whose marginal distributions are equivalent to…