arXiv subjects

Gourab Ghoshal

Publications and source records attributed to Gourab Ghoshal.

58 records · Page 4Linked to original sources

arXiv2007

Growing distributed networks with arbitrary degree distributions

We consider distributed networks, such as peer-to-peer networks, whose structure can be manipulated by adjusting the rules by which vertices enter and leave the network. We focus in particular on degree distributions and show that, with some mild constraints, it is possible by a suitable choice of rules to arrange for the network to have any degree distribution we desire. We also describe a mechanism based on biased random walks by which appropriate rules could be implemented in practice. As an example application, we describe and simulate the construction of a peer-to-peer network optimized to minimize search times and bandwidth requirements.

physics.soc-ph↗

arXiv2006

Exact solutions for models of evolving networks with addition and deletion of nodes

There has been considerable recent interest in the properties of networks, such as citation networks and the worldwide web, that grow by the addition of vertices, and a number of simple solvable models of network growth have been studied. In the real world, however, many networks, including the web, not only add vertices but also lose them. Here we formulate models of the time evolution of such networks and give exact solutions for a number of cases of particular interest. For the case of net growth and so-called preferential attachment -- in which newly appearing vertices attach to previously existing ones in proportion to vertex degree -- we show that the resulting networks have power-law degree distributions, but with an exponent that diverges as the growth rate vanishes. We conjecture that the low exponent values observed in real-world networks are thus the result of vigorous growth in which the rate of addition of vertices far exceeds the rate of removal. Were growth to slow in the future, for instance in a more mature future version of the web, we would expect to see exponents increase, potentially without bound.

cond-mat.stat-mech↗

arXiv2005

Dynamics of networking agents competing for high centrality and low degree

We model a system of networking agents that seek to optimize their centrality in the network while keeping their cost, the number of connections they are participating in, low. Unlike other game-theory based models for network evolution, the success of the agents is related only to their position in the network. The agents use strategies based on local information to improve their chance of success. Both the evolution of strategies and network structure are investigated. We find a dramatic time evolution with cascades of strategy change accompanied by a change in network structure. On average the network self-organizes to a state close to the transition between a fragmented state and a state with a giant component. Furthermore, with increasing system size both the average degree and the level of fragmentation decreases. We also observe that the network keeps on actively evolving, although it does not have to, thus suggesting a Red Queen-like situation where agents have to keep on networking and responding to the moves of the others in order to stay successful.

q-bio.PE↗

arXiv2005

Attractiveness and activity in Internet communities

Datasets of online communication often take the form of contact sequences -- ordered lists contacts (where a contact is defined as a triple of a sender, a recipient and a time). We propose measures of attractiveness and activity for such data sets and analyze these quantities for anonymized contact sequences from an Internet dating community. For this data set the attractiveness and activity measures show broad power-law like distributions. Our attractiveness and activity measures are more strongly correlated in the real-world data than in our reference model. Effects that indirectly can make active users more attractive are discussed.

physics.soc-ph↗