2,052,842 research outputs found
Structural properties of crumpled cream layers
The cream layer is a complex heterogeneous material of biological origin
which forms spontaneously at the air-milk interface. Here, it is studied the
crumpling of a single cream layer packing under its own weight at room
temperature in three-dimensional space. The structure obtained in these
circumstances has low volume fraction and anomalous fractal dimensions. Direct
means and noninvasive NMR imaging technique are used to investigate the
internal and external structure of these systems.Comment: 9 pages, 4 figures, accepted in J. Phys. D: Appl. Phy
Structural Properties of Self-Attracting Walks
Self-attracting walks (SATW) with attractive interaction u > 0 display a
swelling-collapse transition at a critical u_{\mathrm{c}} for dimensions d >=
2, analogous to the \Theta transition of polymers. We are interested in the
structure of the clusters generated by SATW below u_{\mathrm{c}} (swollen
walk), above u_{\mathrm{c}} (collapsed walk), and at u_{\mathrm{c}}, which can
be characterized by the fractal dimensions of the clusters d_{\mathrm{f}} and
their interface d_{\mathrm{I}}. Using scaling arguments and Monte Carlo
simulations, we find that for u<u_{\mathrm{c}}, the structures are in the
universality class of clusters generated by simple random walks. For
u>u_{\mathrm{c}}, the clusters are compact, i.e. d_{\mathrm{f}}=d and
d_{\mathrm{I}}=d-1. At u_{\mathrm{c}}, the SATW is in a new universality class.
The clusters are compact in both d=2 and d=3, but their interface is fractal:
d_{\mathrm{I}}=1.50\pm0.01 and 2.73\pm0.03 in d=2 and d=3, respectively. In
d=1, where the walk is collapsed for all u and no swelling-collapse transition
exists, we derive analytical expressions for the average number of visited
sites and the mean time to visit S sites.Comment: 15 pages, 8 postscript figures, submitted to Phys. Rev.
Predicting Graph Categories from Structural Properties
Complex networks are often categorized according to the underlying phenomena that they represent such as molecular interactions, re-tweets, and brain activity. In this work, we investigate the problem of predicting the category (domain) of arbitrary networks. This includes complex networks from different domains as well as synthetically generated graphs from five different network models. A classification accuracy of 96.6% is achieved using a random forest classifier with both real and synthetic networks. This work makes two important findings. First, our results indicate that complex networks from various domains have distinct structural properties that allow us to predict with high accuracy the category of a new previously unseen network. Second, synthetic graphs are trivial to classify as the classification model can predict with near-certainty the network model used to generate it. Overall, the results demonstrate that networks drawn from different domains (and network models) are trivial to distinguish using only a handful of simple structural properties
- …