Searcharxiv⌕ Search

arXiv subjects

Dávid Deritei

Publications and source records attributed to Dávid Deritei.

3 recordsLinked to original sources

Parity and time-reversal elucidate both decision-making in empirical models and attractor scaling in critical Boolean networks

We present new applications of parity inversion and time-reversal to the emergence of complex behavior from simple dynamical rules in stochastic discrete models. Our parity-based encoding of causal relationships and time-reversal construction efficiently reveal discrete analogs of stable and unstable manifolds. We demonstrate their predictive power by studying decision-making in systems biology and statistical physics models. These applications underpin a novel attractor identification algorithm implemented for Boolean networks under stochastic dynamics. Its speed enables resolving a longstanding open question of how attractor count in critical random Boolean networks scales with network size, and whether the scaling matches biological observations. Via 80-fold improvement in probed network size ($N=16,384$), we find the surprisingly low scaling exponent of $0.12\pm 0.05$ -- approximately one tenth the analytical upper bound. We demonstrate a general principle: a system's relationship to its time-reversal and state-space inversion constrains its repertoire of emergent behaviors.

nlin.AO↗

Quantifying Life Quality as Walkability on Urban Networks: The Case of Budapest

Life quality in cities is deeply related to the mobility options, and how easily one can access different services and attractions. The pedestrian infrastructure network provides the backbone for social life in cities. While there are many approaches to quantify life quality, most do not take specifically into account the walkability of the city, and rather offer a city-wide measure. Here we develop a data-driven, network-based method to quantify the liveability of a city. We introduce a life quality index (LQI) based on pedestrian accessibility to amenities and services, safety and environmental variables. Our computational approach outlines novel ways to measure life quality in a more granular scale, that can become valuable for urban planners, city officials and stakeholders. We apply data-driven methods to Budapest, but as having an emphasis on the online and easily available quantitative data, the methods can be generalized and applied to any city.

physics.soc-ph↗

Stochastic graph Voronoi tessellation reveals community structure

Given a network, the statistical ensemble of its graph-Voronoi diagrams with randomly chosen cell centers exhibits properties convertible into information on the network's large scale structures. We define a node-pair level measure called {\it Voronoi cohesion} which describes the probability for sharing the same Voronoi cell, when randomly choosing $g$ centers in the network. This measure provides information based on the global context (the network in its entirety) a type of information that is not carried by other similarity measures. We explore the mathematical background of this phenomenon and several of its potential applications. A special focus is laid on the possibilities and limitations pertaining to the exploitation of the phenomenon for community detection purposes.

physics.soc-ph↗