Recent studies have revealed the importance of centrality measures to analyze various spatial factors affecting human life in cities. Here we show how it is possible to extract the backbone of a city by deriving spanning trees based on edge betweenness and edge information. By using as sample...

We present a novel model to simulate real social networks of complex interactions, based in a system of colliding particles (agents). The network is build by keeping track of the collisions and evolves in time with correlations which emerge due to the mobility of the agents. Therefore,...

We study the primary DNA structure of four of the most completely sequenced human chromosomes (including chromosome 19 which is the most dense in coding), using non-extensive statistics. We show that the exponents governing the spatial decay of the coding size distributions vary between 5.2 ≤r...

The hypothesis that meanings originate from discrimination tasks, in which an individual attempts to categorize N objects using a set of M sensory channels, is examined within a quantitative statistical perspective. Failure in discrimination triggers the refinement of a randomly-chosen sensory...

Complex network theory is used to investigate the structure of meaningful concepts in written texts of individual authors. Networks have been constructed after a two phase filtering, where words with less meaning contents are eliminated and all remaining words are set to their canonical form,...

We analyze web-downloaded data on people sharing their music library. By attributing to each music group usual music genres (Rock, Pop ...), and analysing correlations between music groups of different genres with percolation-idea based methods, we probe the reality of these subdivisions and...

We study the property of certain complex networks of being both sparse and highly connected, which is known as “good expansion” (GE). A network has GE properties if every subset S of nodes (up to 50% of the nodes) has a neighborhood that is larger than some “expansion factor” φ...

We propose a model of an underlying mechanism responsible for the formation of assortative mixing in networks between “similar” nodes or vertices based on generic vertex properties. Existing models focus on a particular type of assortative mixing, such as mixing by vertex degree, or present...

Using the Sznajd-Weron model as a starting point, we analyzed the effect on the statistical properties of this model under changes in the connectivity of the network and under the introduction of memory to the units, as well as by introducing a communication error that influences the way a unit...

A simple model of opinion formation dynamics in which binary-state agents make up their opinions due to the influence of agents in a local neighborhood is studied using different network topologies. Each agent uses two different strategies, the Sznajd rule with a probability q and the Galam...