Entity

Time filter

Source Type

Budapest, Hungary

Trademark
Petabyte Corporation | Date: 1998-07-30

Customized data products, namely CD (read only), CD (read/write), enhanced CD and digital versatile display (DVD) storage devices on which customer-selected data, including sounds, images and text, are embedded.


Trademark
Petabyte Corporation | Date: 1998-07-30

Customized data products, namely CD (read only), CD (read/write), enhanced CD and digital versatile display (DVD) storage devices on which customer-selected data, including sounds, images and text, are embedded.


Gulyas L.,PetaByte Ltd | Gulyas L.,AITIA International Inc. | Gulyas L.,Eotvos Lorand University | Kampis G.,PetaByte Ltd | And 2 more authors.
European Physical Journal: Special Topics | Year: 2013

We develop and analyze an agent-based model for the study of information propagation in dynamic contact networks. We represent information as a state of a node in a network that can be probabilistically transferred to an adjacent node within a single time step. The model is based on a closed (yet sufficiently large) population that can support processes of link generation and annihilation using different contact regimes. Our study is confined to the case of homogeneous contacts, where each agent establishes and breaks contacts in the same way. We consider information to be available for spreading in a fixed time window (i.e. finite memory). We find, surprisingly, that information transmission (measured as the proportion of informed nodes after a fixed number of time steps) is identical for dynamic preferential and random networks, but radically different for the associate mixing contact regime. We also find that the probability of transmission is, similarly counterintuitively, not a main driver of the process as opposed the the main network par maters determining contact lifetime and the turnover rate on connections. We discuss the explanation and the significance of these results in the light of the fundamental difference between dynamic and static (cumulative) networks. © 2013 EDP Sciences and Springer. Source


Gulyas L.,PetaByte Ltd | Gulyas L.,AITIA International Inc. | Gulyas L.,Eotvos Lorand University | Kampis G.,PetaByte Ltd | And 4 more authors.
European Physical Journal: Special Topics | Year: 2013

Inspecting the dynamics of networks opens a new dimension in understanding the interactions among the components of complex systems. Our goal is to understand the baseline properties expected from elementary random changes over time, in order to be able to assess the various effects found in longitudinal data. We created elementary dynamic models from classic random and preferential networks. Focusing on edge dynamics, we defined several processes for changing networks of a fixed size. We applied simple rules, including random, preferential and assortative modifications of existing edges - or a combination of these. Starting from initial Erdos-Rényi networks, we examined various basic network properties (e.g., density, clustering, average path length, number of components, degree distribution, etc.) of both snapshot and cumulative networks (for various lengths of aggregation time windows). Our results provide a baseline for changes to be expected in dynamic networks. We found universalities in the dynamic behavior of most network statistics. Furthermore, our findings suggest that certain network properties have a strong, non-trivial dependence on the length of the sampling window. © 2013 EDP Sciences and Springer. Source

Discover hidden collaborations