arXiv subjects

Jose J. Ramasco

Publications and source records attributed to Jose J. Ramasco.

47 records · Page 3Linked to original sources

arXiv2008

Prominence and control: The weighted rich-club effect

Complex systems are often characterized by large-scale hierarchical organizations. Whether the prominent elements, at the top of the hierarchy, share and control resources or avoid one another lies at the heart of a system's global organization and functioning. Inspired by network perspectives, we propose a new general framework for studying the tendency of prominent elements to form clubs with exclusive control over the majority of a system's resources. We explore associations between prominence and control in the fields of transportation, scientific collaboration, and online communication.

physics.soc-ph↗

arXiv2008

Human dynamics revealed through Web analytics

When the World Wide Web was first conceived as a way to facilitate the sharing of scientific information at the CERN (European Center for Nuclear Research) few could have imagined the role it would come to play in the following decades. Since then, the increasing ubiquity of Internet access and the frequency with which people interact with it raise the possibility of using the Web to better observe, understand, and monitor several aspects of human social behavior. Web sites with large numbers of frequently returning users are ideal for this task. If these sites belong to companies or universities, their usage patterns can furnish information about the working habits of entire populations. In this work, we analyze the properly anonymized logs detailing the access history to Emory University's Web site. Emory is a medium size university located in Atlanta, Georgia. We find interesting structure in the activity patterns of the domain and study in a systematic way the main forces behind the dynamics of the traffic. In particular, we show that both linear preferential linking and priority based queuing are essential ingredients to understand the way users navigate the Web.

cs.HC↗

arXiv2007

Inversion method for content-based networks

In this paper, we generalize a recently introduced Expectation Maximization (EM) method for graphs and apply it to content-based networks. The EM method provides a classification of the nodes of a graph, and allows to infer relations between the different classes. Content-based networks are ideal models for graphs displaying any kind of community or/and multipartite structure. We show both numerically and analytically that the generalized EM method is able to recover the process that led to the generation of such networks. We also investigate the conditions under which our generalized EM method can recover the underlying contents-based structure in the presence of randomness in the connections. Two entropies, Sq and Sc, are defined to measure the quality of the node classification and to what extent the connectivity of a given network is content-based. Sq and Sc are also useful in determining the number of classes for which the classification is optimal.

physics.soc-ph↗

arXiv2007

Transport on weighted Networks: when correlations are independent of degree

Most real-world networks are weighted graphs with the weight of the edges reflecting the relative importance of the connections. In this work, we study non degree dependent correlations between edge weights, generalizing thus the correlations beyond the degree dependent case. We propose a simple method to introduce weight-weight correlations in topologically uncorrelated graphs. This allows us to test different measures to discriminate between the different correlation types and to quantify their intensity. We also discuss here the effect of weight correlations on the transport properties of the networks, showing that positive correlations dramatically improve transport. Finally, we give two examples of real-world networks (social and transport graphs) in which weight-weight correlations are present.

cond-mat.stat-mech↗

arXiv2006

Social inertia and diversity in collaboration networks

Random graphs are useful tools to study social interactions. In particular, the use of weighted random graphs allows to handle a high level of information concerning which agents interact and in which degree the interactions take place. Taking advantage of this representation, we recently defined a magnitude, the Social Inertia, that measures the eagerness of agents to keep ties with previous partners. To study this magnitude, we used collaboration networks that are specially appropriate to obtain valid statistical results due to the large size of publically available databases. In this work, I study the Social Inertia in two of these empirical networks, IMDB movie database and condmat. More specifically, I focus on how the Inertia relates to other properties of the graphs, and show that the Inertia provides information on how the weight of neighboring edges correlates. A social interpretation of this effect is also offered.

physics.soc-ph↗

arXiv2006

Sticky grains do not change the universality class of isotropic sandpiles

We revisit the sandpile model with ``sticky'' grains introduced by Mohanty and Dhar [Phys. Rev. Lett. {\bf 89}, 104303 (2002)] whose scaling properties were claimed to be in the universality class of directed percolation for both isotropic and directed models. Simulations in the so-called fixed-energy ensemble show that this conclusion is not valid for isotropic sandpiles and that this model shares the same critical properties of other stochastic sandpiles, such as the Manna model. %as expected from the existence of an extra %conservation-law, absent in directed percolation. These results are strengthened by the analysis of the Langevin equations proposed by the same authors to account for this problem which we show to converge, upon coarse-graining, to the well-established set of Langevin equations for the Manna class. Therefore, the presence of a conservation law keeps isotropic sandpiles, with or without stickiness, away from the directed percolation class.

cond-mat.stat-mech↗

arXiv2006

Glassy dynamics, aging and thermally activated avalanches in interface pinning at finite temperatures

We study numerically the out-of-equilibrium dynamics of interfaces at finite temperatures when driven well below the zero-temperature depinning threshold. We go further than previous analysis by including the most relevant non-equilibrium correction to the elastic Hamiltonian. We find that the relaxation dynamics towards the steady-state shows glassy behavior, aging and violation of the fluctuation-dissipation theorem. The interface roughness exponent alpha approx 0.7 is found to be robust to temperature changes. We also study the instantaneous velocity signal in the low temperature regime and find long-range temporal correlations. We argue 1/f-noise arises from the merging of local thermally-activated avalanches of depinning events.

cond-mat.stat-mech↗

arXiv2005

Social inertia in collaboration networks

This work is a study of the properties of collaboration networks employing the formalism of weighted graphs to represent their one-mode projection. The weight of the edges is directly the number of times that a partnership has been repeated. This representation allows us to define the concept of "social inertia" that measures the tendency of authors to keep on collaborating with previous partners. We use a collection of empirical datasets to analyze several aspects of the social inertia: 1) its probability distribution, 2) its correlation with other properties, and 3) the correlations of the inertia between neighbors in the network. We also contrast these empirical results with the predictions of a recently proposed theoretical model for the growth of collaboration networks.

physics.soc-ph↗

arXiv2004

Ageing in the critical contact process: a Monte Carlo study

The long-time dynamics of the critical contact process which is brought suddenly out of an uncorrelated initial state undergoes ageing in close analogy with quenched magnetic systems. In particular, we show through Monte Carlo simulations in one and two dimensions and through mean-field theory that time-translation invariance is broken and that dynamical scaling holds. We find that the autocorrelation and autoresponse exponents lambda_{Gamma} and lambda_R are equal but, in contrast to systems relaxing to equilibrium, the ageing exponents a and b are distinct. A recent proposal to define a non-equilibrium temperature through the short-time limit of the fluctuation-dissipation ratio is therefore not applicable.

cond-mat.stat-mech↗

arXiv2004

Self-organization of collaboration networks

We study collaboration networks in terms of evolving, self-organizing bipartite graph models. We propose a model of a growing network, which combines preferential edge attachment with the bipartite structure, generic for collaboration networks. The model depends exclusively on basic properties of the network, such as the total number of collaborators and acts of collaboration, the mean size of collaborations, etc. The simplest model defined within this framework already allows us to describe many of the main topological characteristics (degree distribution, clustering coefficient, etc.) of one-mode projections of several real collaboration networks, without parameter fitting. We explain the observed dependence of the local clustering on degree and the degree--degree correlations in terms of the ``aging'' of collaborators and their physical impossibility to participate in an unlimited number of collaborations.

cond-mat.stat-mech↗

arXiv1999

Comment on "Macrospopic Equation for the Roughness of Growing Interfaces in Quenched Disorder"

We comment on a recent Letter by Braunstein and Buceta [PRL vol.81, 630 (1998)], in which a novel equation has been proposed to describe the dynamics of interfaces in the presence of quenched disorder. We argue that the ansatz Braunstein and Buceta presented is just an effective description of the very short times regime and has no significance for the macroscopic (large scale) behaviour of the interface. We calculate an expression for the short time behaviour of the interface that is valid for any q (and not only at q_c).

cond-mat.stat-mech↗