arXiv subjects

Anna Manka-Krason

Publications and source records attributed to Anna Manka-Krason.

4 recordsLinked to original sources

arXiv2009

Assortativity in random line graphs

We investigate the degree-degree correlations in the Erdos-Renyi networks, the growing exponential networks and the scale-free networks. We demonstrate that these correlations are the largest for the exponential networks. We calculate also these correlations in the line graphs, formed from the considered networks. Theoretical and numerical results indicate that all the line graphs are assortative, i.e. the degree-degree correlation is positive.

cond-mat.dis-nn↗

arXiv2009

Clustering in random line graphs

We investigate the degree distribution $P(k)$ and the clustering coefficient $C$ of the line graphs constructed on the Erdös-Rényi networks, the exponential and the scale-free growing networks. We show that the character of the degree distribution in these graphs remains Poissonian, exponential and power law, respectively, i.e. the same as in the original networks. When the mean degree $ $ increases, the obtained clustering coefficient $C$ tends to 0.50 for the transformed Erdös-Rényi networks, to 0.53 for the transformed exponential networks and to 0.61 for the transformed scale-free networks. These results are close to theoretical values, obtained with the model assumption that the degree-degree correlations in the initial networks are negligible.

physics.comp-ph↗

arXiv2009

Frustration and collectivity in spatial networks

In random networks decorated with Ising spins, an increase of the density of frustrations reduces the transition temperature of the spin-glass ordering. This result is in contradiction to the Bethe theory. Here we investigate if this effect depends on the small-world property of the network. The results on the specific heat and the spin susceptibility indicate that the effect appears also in spatial networks.

cond-mat.dis-nn↗

arXiv2008

Magnetism of frustrated regular networks

We consider a regular random network where each node has exactly three neighbours. Ising spins at the network nodes interact antiferromagnetically along the links. The clustering coefficient $C$ is tuned from zero to 1/3 by adding new links. At the same time, the density of geometrically frustrated links increases. We calculate the magnetic specific heat, the spin susceptibility and the Edwards-Anderson order parameter $q$ by means of the heat-bath Monte Carlo simulations. The aim is the transition temperature $T_x$ dependence on the clustering coefficient $C$. The results are compared with the predictions of the Bethe approximation. At C=0, the network is bipartite and the low temperature phase is antiferromagnetic. When $C$ increases, the critical temperature falls down towards the values which are close to the theoretical predictions for the spin-glass phase.

cond-mat.dis-nn↗