arXiv subjects

Hernan A. Makse

Publications and source records attributed to Hernan A. Makse.

At least 55 records · Page 3Linked to original sources

arXiv2014

Cavity method for force transmission in jammed disordered packings of hard particles

The force distribution of jammed disordered packings has always been considered a central object in the physics of granular materials. However, many of its features are poorly understood. In particular, analytic relations to other key macroscopic properties of jammed matter, such as the contact network and its coordination number, are still lacking. Here we develop a mean-field theory for this problem, based on the consideration of the contact network as a random graph where the force transmission becomes a constraint optimization problem. We can thus use the cavity method developed in the last decades within the statistical physics of spin glasses and hard computer science problems. This method allows us to compute the force distribution $\text P(f)$ for random packings of hard particles of any shape, with or without friction. We find a new signature of jamming in the small force behavior $\text P(f) \sim f^θ$, whose exponent has attracted recent active interest: we find a finite value for $\text P(f=0)$, along with $θ=0$. Furthermore, we relate the force distribution to a lower bound of the average coordination number $\, {\bar z}_{\rm c}^{\rm min}(μ)$ of jammed packings of frictional spheres with coefficient $μ$. This bridges the gap between the two known isostatic limits $\, {\bar z}_{\rm c}(μ=0)=2D$ (in dimension $D$) and $\, {\bar z}_{\rm c}(μ\to \infty)=D+1$ by extending the naive Maxwell's counting argument to frictional spheres. The theoretical framework describes different types of systems, such as non-spherical objects in arbitrary dimensions, providing a common mean-field scenario to investigate force transmission, contact networks and coordination numbers of jammed disordered packings.

cond-mat.dis-nn↗

arXiv2014

Statistical theory of correlations in random packings of hard particles

A random packing of hard particles represents a fundamental model for granular matter. Despite its importance, analytical modeling of random packings remains difficult due to the existence of strong correlations which preclude the development of a simple theory. Here, we take inspiration from liquid theories for the $n$-particle angular correlation function to develop a formalism of random packings of hard particles from the bottom-up. A progressive expansion into a shell of particles converges in the large layer limit under a Kirkwood-like approximation of higher-order correlations. We apply the formalism to hard disks and predict the density of two-dimensional random close packing (RCP), $ϕ_{\rm rcp} = 0.85\pm0.01$, and random loose packing (RLP), $ϕ_{\rm rlp} = 0.67\pm0.01$. Our theory also predicts a phase diagram and angular correlation functions that are in good agreement with experimental and numerical data.

cond-mat.soft↗

arXiv2013

Spreading dynamics in complex networks

Searching for influential spreaders in complex networks is an issue of great significance for applications across various domains, ranging from the epidemic control, innovation diffusion, viral marketing, social movement to idea propagation. In this paper, we first display some of the most important theoretical models that describe spreading processes, and then discuss the problem of locating both the individual and multiple influential spreaders respectively. Recent approaches in these two topics are presented. For the identification of privileged single spreaders, we summarize several widely used centralities, such as degree, betweenness centrality, PageRank, k-shell, etc. We investigate the empirical diffusion data in a large scale online social community -- LiveJournal. With this extensive dataset, we find that various measures can convey very distinct information of nodes. Of all the users in LiveJournal social network, only a small fraction of them involve in spreading. For the spreading processes in LiveJournal, while degree can locate nodes participating in information diffusion with higher probability, k-shell is more effective in finding nodes with large influence. Our results should provide useful information for designing efficient spreading strategies in reality.

physics.soc-ph↗

arXiv2013

Calculation of the Voronoi boundary for lens-shaped particles and spherocylinders

We have recently developed a mean-field theory to estimate the packing fraction of non-spherical particles [A. Baule et al., Nature Commun. (2013)]. The central quantity in this framework is the Voronoi excluded volume, which generalizes the standard hard-core excluded volume appearing in Onsager's theory. The Voronoi excluded volume is defined from an exclusion condition for the Voronoi boundary between two particles, which is usually not tractable analytically. Here, we show how the technical difficulties in calculating the Voronoi boundary can be overcome for lens-shaped particles and spherocylinders, two standard prolate and oblate shapes with rotational symmetry. By decomposing these shapes into unions and intersections of spheres analytical expressions can be obtained.

cond-mat.soft↗

arXiv2013

Mean-field theory of random close packings of axisymmetric particles

Finding the optimal random packing of non-spherical particles is an open problem with great significance in a broad range of scientific and engineering fields. So far, this search has been performed only empirically on a case-by-case basis, in particular, for shapes like dimers, spherocylinders and ellipsoids of revolution. Here, we present a mean-field formalism to estimate the packing density of axisymmetric non-spherical particles. We derive an analytic continuation from the sphere that provides a phase diagram predicting that, for the same coordination number, the density of monodisperse random packings follows the sequence of increasing packing fractions: spheres < oblate ellipsoids < prolate ellipsoids < dimers < spherocylinders. We find the maximal packing densities of 73.1% for spherocylinders and 70.7% for dimers, in good agreement with the largest densities found in simulations. Moreover, we find a packing density of 73.6% for lens-shaped particles, representing the densest random packing of the axisymmetric objects studied so far.

cond-mat.soft↗

arXiv2013

IMDB network revisited: unveiling fractal and modular properties from a typical small-world network

We study a subset of the movie collaboration network, imdb.com, where only adult movies are included. We show that there are many benefits in using such a network, which can serve as a prototype for studying social interactions. We find that the strength of links, i.e., how many times two actors have collaborated with each other, is an important factor that can significantly influence the network topology. We see that when we link all actors in the same movie with each other, the network becomes small-world, lacking a proper modular structure. On the other hand, by imposing a threshold on the minimum number of links two actors should have to be in our studied subset, the network topology becomes naturally fractal. This occurs due to a large number of meaningless links, namely, links connecting actors that did not actually interact. We focus our analysis on the fractal and modular properties of this resulting network, and show that the renormalization group analysis can characterize the self-similar structure of these networks.

physics.soc-ph↗

arXiv2013

Origins of power-law degree distribution in the heterogeneity of human activity in social networks

The probability distribution of number of ties of an individual in a social network follows a scale-free power-law. However, how this distribution arises has not been conclusively demonstrated in direct analyses of people's actions in social networks. Here, we perform a causal inference analysis and find an underlying cause for this phenomenon. Our analysis indicates that heavy-tailed degree distribution is causally determined by similarly skewed distribution of human activity. Specifically, the degree of an individual is entirely random - following a "maximum entropy attachment" model - except for its mean value which depends deterministically on the volume of the users' activity. This relation cannot be explained by interactive models, like preferential attachment, since the observed actions are not likely to be caused by interactions with other people.

physics.soc-ph↗

arXiv2013

The evolutionary dynamics of protein-protein interaction networks inferred from the reconstruction of ancient networks

Cellular functions are based on the complex interplay of proteins, therefore the structure and dynamics of these protein-protein interaction (PPI) networks are the key to the functional understanding of cells. In the last years, large-scale PPI networks of several model organisms were investigated. Methodological improvements now allow the analysis of PPI networks of multiple organisms simultaneously as well as the direct modeling of ancestral networks. This provides the opportunity to challenge existing assumptions on network evolution. We utilized present-day PPI networks from integrated datasets of seven model organisms and developed a theoretical and bioinformatic framework for studying the evolutionary dynamics of PPI networks. A novel filtering approach using percolation analysis was developed to remove low confidence interactions based on topological constraints. We then reconstructed the ancient PPI networks of different ancestors, for which the ancestral proteomes, as well as the ancestral interactions, were inferred. Ancestral proteins were reconstructed using orthologous groups on different evolutionary levels. A stochastic approach, using the duplication-divergence model, was developed for estimating the probabilities of ancient interactions from today's PPI networks. The growth rates for nodes, edges, sizes and modularities of the networks indicate multiplicative growth and are consistent with the results from independent static analysis. Our results support the duplication-divergence model of evolution and indicate fractality and multiplicative growth as general properties of the PPI network structure and dynamics.

q-bio.MN↗

arXiv2012

The conundrum of functional brain networks: small-world efficiency or fractal modularity

The human brain has been studied at multiple scales, from neurons, circuits, areas with well defined anatomical and functional boundaries, to large-scale functional networks which mediate coherent cognition. In a recent work, we addressed the problem of the hierarchical organization in the brain through network analysis. Our analysis identified functional brain modules of fractal structure that were inter-connected in a small-world topology. Here, we provide more details on the use of network science tools to elaborate on this behavior. We indicate the importance of using percolation theory to highlight the modular character of the functional brain network. These modules present a fractal, self-similar topology, identified through fractal network methods. When we lower the threshold of correlations to include weaker ties, the network as a whole assumes a small-world character. These weak ties are organized precisely as predicted by theory maximizing information transfer with minimal wiring costs.

physics.bio-ph↗

arXiv2012

A small-world of weak ties provides optimal global integration of self-similar modules in functional brain networks

The human brain is organized in functional modules. Such an organization presents a basic conundrum: modules ought to be sufficiently independent to guarantee functional specialization and sufficiently connected to bind multiple processors for efficient information transfer. It is commonly accepted that small-world architecture of short lengths and large local clustering may solve this problem. However, there is intrinsic tension between shortcuts generating small-worlds and the persistence of modularity; a global property unrelated to local clustering. Here, we present a possible solution to this puzzle. We first show that a modified percolation theory can define a set of hierarchically organized modules made of strong links in functional brain networks. These modules are "large-world" self-similar structures and, therefore, are far from being small-world. However, incorporating weaker ties to the network converts it into a small-world preserving an underlying backbone of well-defined modules. Remarkably, weak ties are precisely organized as predicted by theory maximizing information transfer with minimal wiring cost. This trade-off architecture is reminiscent of the "strength of weak ties" crucial concept of social networks. Such a design suggests a natural solution to the paradox of efficient information flow in the highly modular structure of the brain.

physics.bio-ph↗

arXiv2012

Communication activity in a social network: relation between long-term correlations and inter-event clustering

The timing patterns of human communication in social networks is not random. On the contrary, communication is dominated by emergent statistical laws such as non-trivial correlations and clustering. Recently, we found long-term correlations in the user's activity in social communities. Here, we extend this work to study collective behavior of the whole community. The goal is to understand the origin of clustering and long-term persistence. At the individual level, we find that the correlations in activity are a byproduct of the clustering expressed in the power-law distribution of inter-event times of single users. On the contrary, the activity of the whole community presents long-term correlations that are a true emergent property of the system, i.e. they are not related to the distribution of inter-event times. This result suggests the existence of collective behavior, possible arising from nontrivial communication patterns through the embedding social network.

physics.soc-ph↗

arXiv2011

How people interact in evolving online affiliation networks

The study of human interactions is of central importance for understanding the behavior of individuals, groups and societies. Here, we observe the formation and evolution of networks by monitoring the addition of all new links and we analyze quantitatively the tendencies used to create ties in these evolving online affiliation networks. We first show that an accurate estimation of these probabilistic tendencies can only be achieved by following the time evolution of the network. For example, actions that are attributed to the usual friend of a friend mechanism through a static snapshot of the network are overestimated by a factor of two. A detailed analysis of the dynamic network evolution shows that half of those triangles were generated through other mechanisms, in spite of the characteristic static pattern. We start by characterizing every single link when the tie was established in the network. This allows us to describe the probabilistic tendencies of tie formation and extract sociological conclusions as follows. The tendencies to add new links differ significantly from what we would expect if they were not affected by the individuals' structural position in the network, i.e., from random link formation. We also find significant differences in behavioral traits among individuals according to their degree of activity, gender, age, popularity and other attributes. For instance, in the particular datasets analyzed here, we find that women reciprocate connections three times as much as men and this difference increases with age. Men tend to connect with the most popular people more often than women across all ages. On the other hand, triangular ties tendencies are similar and independent of gender. Our findings can be useful to build models of realistic social network structures and discover the underlying laws that govern establishment of ties in evolving social networks.

physics.soc-ph↗

arXiv2011

Identification of influential spreaders in complex networks

Networks portray a multitude of interactions through which people meet, ideas are spread, and infectious diseases propagate within a society. Identifying the most efficient "spreaders" in a network is an important step to optimize the use of available resources and ensure the more efficient spread of information. Here we show that, in contrast to common belief, the most influential spreaders in a social network do not correspond to the best connected people or to the most central people (high betweenness centrality). Instead, we find: (i) The most efficient spreaders are those located within the core of the network as identified by the k-shell decomposition analysis. (ii) When multiple spreaders are considered simultaneously, the distance between them becomes the crucial parameter that determines the extend of the spreading. Furthermore, we find that-- in the case of infections that do not confer immunity on recovered individuals-- the infection persists in the high k-shell layers of the network under conditions where hubs may not be able to preserve the infection. Our analysis provides a plausible route for an optimal design of efficient dissemination strategies.

physics.soc-ph↗

arXiv2011

Communication activity in social networks: growth and correlations

We investigate the timing of messages sent in two online communities with respect to growth fluctuations and long-term correlations. We find that the timing of sending and receiving messages comprises pronounced long-term persistence. Considering the activity of the community members as growing entities, i.e. the cumulative number of messages sent (or received) by the individuals, we identify non-trivial scaling in the growth fluctuations which we relate to the long-term correlations. We find a connection between the scaling exponents of the growth and the long-term correlations which is supported by numerical simulations based on peaks over threshold. In addition, we find that the activity on directed links between pairs of members exhibits long-term correlations, indicating that communication activity with the most liked partners may be responsible for the long-term persistence in the timing of messages. Finally, we show that the number of messages, $M$, and the number of communication partners, $K$, of the individual members are correlated following a power-law, $K\sim M^λ$, with exponent $λ\approx 3/4$.

physics.soc-ph↗

arXiv2010

Jamming I: A volume function for jammed matter

We introduce a "Hamiltonian"-like function, called the volume function, indispensable to describe the ensemble of jammed matter such as granular materials and emulsions from a geometrical point of view. The volume function represents the available volume of each particle in the jammed systems. At the microscopic level, we show that the volume function is the Voronoi volume associated to each particle and in turn we provide an analytical formula for the Voronoi volume in terms of the contact network, valid for any dimension. We then develop a statistical theory for the probability distribution of the volumes in 3d to calculate an average volume function coarse-grained at a mesoscopic level. The salient result is the discovery of a mesoscopic volume function inversely proportional to the coordination number. Our analysis is the first step toward the calculation of macroscopic observables and equations of state using the statistical mechanics of jammed matter, when supplemented by the condition of mechanical equilibrium of jamming that properly defines jammed matter at the ensemble level.

cond-mat.soft↗

arXiv2010

Jamming II: Edwards' statistical mechanics of random packings of hard spheres

The problem of finding the most efficient way to pack spheres has an illustrious history, dating back to the crystalline arrays conjectured by Kepler and the random geometries explored by Bernal in the 60's. This problem finds applications spanning from the mathematician's pencil, the processing of granular materials, the jamming and glass transitions, all the way to fruit packing in every grocery. There are presently numerous experiments showing that the loosest way to pack spheres gives a density of ~55% (RLP) while filling all the loose voids results in a maximum density of ~63-64% (RCP). While those values seem robustly true, to this date there is no physical explanation or theoretical prediction for them. Here we show that random packings of monodisperse hard spheres in 3d can pack between the densities 4/(4 + 2 \sqrt 3) or 53.6% and 6/(6 + 2 \sqrt 3) or 63.4%, defining RLP and RCP, respectively. The reason for these limits arises from a statistical picture of jammed states in which the RCP can be interpreted as the ground state of the ensemble of jammed matter with zero compactivity, while the RLP arises in the infinite compactivity limit. We combine an extended statistical mechanics approach 'a la Edwards' (where the role traditionally played by the energy and temperature in thermal systems is substituted by the volume and compactivity) with a constraint on mechanical stability imposed by the isostatic condition. Ultimately, our results lead to a phase diagram that provides a unifying view of the disordered hard sphere packing problem.

cond-mat.soft↗

arXiv2010

Distribution of volumes and coordination number in jammed matter: mesoscopic ensemble

We investigate the distribution of the volume and coordination number associated to each particle in a jammed packing of monodisperse hard sphere using the mesoscopic ensemble developed in Nature 453, 606 (2008). Theory predicts an exponential distribution of the orientational volumes for random close packings and random loose packings. A comparison with computer generated packings reveals deviations from the theoretical prediction in the volume distribution, which can be better modeled by a compressed exponential function. On the other hand, the average of the volumes is well reproduced by the theory leading to good predictions of the limiting densities of RCP and RLP. We discuss a more exact theory to capture the volume distribution in its entire range. The available data suggests a plausible order/disorder transition defining random close packings. Finally, we consider an extended ensemble to calculate the coordination number distribution which is shown to be of an exponential and inverse exponential form for coordinations larger and smaller than the average, respectively, in reasonable agreement with the simulated data.

cond-mat.soft↗

arXiv2010

Model of random packings of different size balls

We develop a model to describe the properties of random assemblies of polydisperse hard spheres. We show that the key features to describe the system are (i) the dependence between the free volume of a sphere and the various coordination numbers between the species, and (ii) the dependence of the coordination numbers with the concentration of species; quantities that are calculated analytically. The model predicts the density of random close packing and random loose packing of polydisperse systems for a given distribution of ball size and describes packings for any interparticle friction coefficient. The formalism allows to determine the optimal packing over different distributions and may help to treat packing problems of non-spherical particles which are notoriously difficult to solve.

cond-mat.dis-nn↗