Large networks call for approaches which allow to represent their relevant properties. One relevant approach can consider the decomposition of the defined networks in significant subgraphs as k-cores. So it is possible to identify the nodes which can have an important role on the network. In...

One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland score of a node in a digraph is the difference between its outdegree (i.e. its number of outgoing arcs) and its indegree (i.e. its number of ingoing arcs). In the ranking by Copeland score, a node...

We present an analytical solution for the connectivity of a network model with a "non-simultaneous" linking scheme. Despite its simplicity, this model exhibits node-space correlations in the link distribution, and anomalous fluctuations behavior of the time series of the connectivity variable,...

This paper extends the existing literature on strategic R&D alliances by presenting a model of innovation networks with endogenous absorptive capacity. The networks emerge as a result of bilateral cooperation over time between firms occupying different locations in the knowledge space. Social...

Understanding the process of software adoption is of paramount importance to software start-ups. We study a monopolistic seller's optimal consumer network structure formation (seeding, segmentation, sequencing, and pricing strategies) under network effects. We demonstrate the importance of...

This paper examines the informativeness of consumer information networks and their effect on price competition between firms. Under the proposed information mechanism, consumers share their initial information with the members of their network and as such become better informed. The main result...

One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland score of a node in a digraph is the difference between its outdegree (i.e. its number of outgoing arcs) and its indegree (i.e. its number of ingoing arcs). In the ranking by Copeland score, a node...