Node copying is an important mechanism for network formation, yet most models assume uniform copying rules. Motivated by observations of heterogeneous triadic closure in real networks, we introduce the concept of a hidden network model—a generative two-layer model in which an observed network evolves according to the structure of an underlying hidden layer—and apply the framework to a model of heterogeneous copying. Framed in a social context, these two layers represent a node’s inner social circle, and wider social circle, such that the model can bias copying probabilities towards, or against, a node’s inner circle of friends. Comparing the case of extreme inner circle bias to an equivalent model with uniform copying, we find that heteroge...
| openaire: EC/H2020/654024/EU//SoBigDataIn a social network individuals or nodes connect to other n...
Many real-world networks display a community structure. We study two random graph models that create...
We consider a procedure for generating clustered networks previously reported by Newman (M.E.J. Newm...
Node copying is an important mechanism for network formation, yet most models assume uniform copying...
We introduce a growing network model, the copying model, in which a new node attaches to a randomly ...
We introduce a minimal generative model for densifying networks in which a new node attaches to a ra...
Complex systems as networks always exhibit strong regularities, implying underlying mechanisms gover...
R.K.D. and S.F. gratefully acknowledge MULTIPLEX, Grant No. 317532 of the European Commission
The S1 model has been central in the development of the field of network geometry. It places nodes i...
In this paper we study how the network of agents adopting a particular technology relates to the str...
Recently, graph matching algorithms have been successfully applied to the problem of network de-ano...
The configuration model generates random graphs with any given degree distribution, and thus serves ...
There has been an increased interest in applying machine learning techniques on relational structure...
Many directed real world networks, such as the WWW, genetic regulation networks and economic network...
We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in com...
| openaire: EC/H2020/654024/EU//SoBigDataIn a social network individuals or nodes connect to other n...
Many real-world networks display a community structure. We study two random graph models that create...
We consider a procedure for generating clustered networks previously reported by Newman (M.E.J. Newm...
Node copying is an important mechanism for network formation, yet most models assume uniform copying...
We introduce a growing network model, the copying model, in which a new node attaches to a randomly ...
We introduce a minimal generative model for densifying networks in which a new node attaches to a ra...
Complex systems as networks always exhibit strong regularities, implying underlying mechanisms gover...
R.K.D. and S.F. gratefully acknowledge MULTIPLEX, Grant No. 317532 of the European Commission
The S1 model has been central in the development of the field of network geometry. It places nodes i...
In this paper we study how the network of agents adopting a particular technology relates to the str...
Recently, graph matching algorithms have been successfully applied to the problem of network de-ano...
The configuration model generates random graphs with any given degree distribution, and thus serves ...
There has been an increased interest in applying machine learning techniques on relational structure...
Many directed real world networks, such as the WWW, genetic regulation networks and economic network...
We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in com...
| openaire: EC/H2020/654024/EU//SoBigDataIn a social network individuals or nodes connect to other n...
Many real-world networks display a community structure. We study two random graph models that create...
We consider a procedure for generating clustered networks previously reported by Newman (M.E.J. Newm...