arXiv subjects

Julian Sienkiewicz

Publications and source records attributed to Julian Sienkiewicz.

40 records · Page 3Linked to original sources

arXiv2005

Statistical analysis of 22 public transport networks in Poland

Public transport systems in 22 Polish cities have been analyzed. Sizes of these networks range from N=152 to N=2881. Depending on the assumed definition of network topology the degree distribution can follow a power law or can be described by an exponential function. Distributions of paths in all considered networks are given by asymmetric, unimodal functions. Clustering, assortativity and betweenness are studied. All considered networks exhibit small world behavior and are hierarchically organized. A transition between dissortative small networks N<=500 and assortative large networks N>=500 is observed.

physics.soc-ph↗

arXiv2005

Public transport systems in Poland: from Bialystok to Zielona Gora by bus and tram using universal statistics of complex networks

We have examined a topology of 21 public transport networks in Poland. Our data exhibit several universal features in considered systems when they are analyzed from the point of view of evolving networks. Depending on the assumed definition of a network topology the degree distribution can follow a power law p(k) ~ k^(-γ) or can be described by an exponential function p(k) exp(-αk). In the first case one observes that mean distances between two nodes are a linear function of logarithms of their degrees product.

physics.soc-ph↗

arXiv2004

Transition to hexagonal pattern under the variation of intrinsic length scales of a reaction diffusion system

The intrinsic length scales of a reaction diffusion system (Gierer-Meinhardt model)is varied by quasi-statically changing the diffusion constant of the activator and a transition from rolls to hexagon is detected. The transition is hysteretic or first order like. From stability analysis, we also analytically show the possibility of such transitions.

nlin.PS↗

arXiv2002

Higher order clustering coefficients in Barabasi-Albert networks

Higher order clustering coefficients $C(x)$ are introduced for random networks. The coefficients express probabilities that the shortest distance between any two nearest neighbours of a certain vertex $i$ equals $x$, when one neglects all paths crossing the node $i$. Using $C(x)$ we found that in the Barabási-Albert (BA) model the average shortest path length in a node's neighbourhood is smaller than the equivalent quantity of the whole network and the remainder depends only on the network parameter $m$. Our results show that small values of the standard clustering coefficient in large BA networks are due to random character of the nearest neighbourhood of vertices in such networks.

cond-mat.dis-nn↗