arXiv subjects

András Tóbiás

Publications and source records attributed to András Tóbiás.

23 records · Page 2Linked to original sources

arXiv2020

Invasion and fixation of microbial dormancy traits under competitive pressure

Microbial dormancy is an evolutionary trait that has emerged independently at various positions across the tree of life. It describes the ability of a microorganism to switch to a metabolically inactive state that can withstand unfavorable conditions. However, maintaining such a trait requires additional resources that could otherwise be used to increase e.g. reproductive rates. In this paper, we aim for gaining a basic understanding under which conditions maintaining a seed bank of dormant individuals provides a "fitness advantage" when facing resource limitations and competition for resources among individuals (in an otherwise stable environment). In particular, we wish to understand when an individual with a "dormancy trait" can invade a resident population lacking this trait despite having a lower reproduction rate than the residents. To this end, we follow a stochastic individual-based approach employing birth-and-death processes, where dormancy is triggered by competitive pressure for resources. In the large-population limit, we identify a necessary and sufficient condition under which a complete invasion of mutants has a positive probability. Further, we explicitly determine the limiting probability of invasion and the asymptotic time to fixation of mutants in the case of a successful invasion. In the proofs, we observe the three classical phases of invasion dynamics in the guise of Coron et al. (2017, 2019).

math.PR↗

arXiv2020

Signal to interference ratio percolation for Cox point processes

We study the signal-to-interference ratio (SINR) percolation model for a stationary Cox point process in two or higher dimensions, in case of a bounded and integrable path-loss function. We show that if this function has compact support or if the stationary intensity measure evaluated at a unit box has some exponential moments, then the SINR graph has an infinite connected component in case the spatial density of points is large enough and the interferences are sufficiently reduced (without vanishing). This holds under suitable stabilization and connectivity assumptions on the intensity measure. We also provide estimates on the critical interference cancellation factor.

math.PR↗

arXiv2019

Lower large deviations for geometric functionals

This work develops a methodology for analyzing large-deviation lower tails associated with geometric functionals computed on a homogeneous Poisson point process. The technique applies to characteristics expressed in terms of stabilizing score functions exhibiting suitable monotonicity properties. We apply our results to clique counts in the random geometric graph, intrinsic volumes of Poisson-Voronoi cells, as well as power-weighted edge lengths in the random geometric, $k$-nearest neighbor and relative neighborhood graph.

math.PR↗

arXiv2019

Routeing properties in a Gibbsian model for highly dense multihop networks

We investigate a probabilistic model for routeing in a multihop ad-hoc communication network, where each user sends a message to the base station. Messages travel in hops via other users, used as relays. Their trajectories are chosen at random according to a Gibbs distribution, which favours trajectories with low interference, measured in terms of signal-to-interference ratio. This model was introduced in our earlier paper [KT18], where we expressed, in the limit of a high density of users, the typical distribution of the family of trajectories in terms of a law of large numbers. In the present work, we derive its qualitative properties. We analytically identify the emerging typical scenarios in three extreme regimes. We analyse the typical number of hops and the typical length of a hop, and the deviation of the trajectory from the straight line, (1) in the limit of a large communication area and large distances, and (2) in the limit of a strong interference weight. In both regimes, the typical trajectory approaches a straight line quickly, in regime (1) with equal hop lengths. Interestingly, in regime (1), the typical length of a hop diverges logarithmically in the distance of the transmitter to the base station. We further analyse (3) local and global repulsive effects of a densely populated subarea on the trajectories.

math.OC↗

arXiv2018

A Gibbsian model for message routeing in highly dense multihop networks

We investigate a probabilistic model for routeing of messages in relay-augmented multihop ad-hoc networks, where each transmitter sends one message to the origin. Given the (random) transmitter locations, we weight the family of random, uniformly distributed message trajectories by an exponential probability weight, favouring trajectories with low interference (measured in terms of signal-to-interference ratio) and trajectory families with little congestion (measured in terms of the number of pairs of hops using the same relay). Under the resulting Gibbs measure, the system targets the best compromise between entropy, interference and congestion for a common welfare, instead of an optimization of the individual trajectories. In the limit of high spatial density of users, we describe the totality of all the message trajectories in terms of empirical measures. Employing large deviations arguments, we derive a characteristic variational formula for the limiting free energy and analyse the minimizer(s) of the formula, which describe the most likely shapes of the trajectory flow. The empirical measures of the message trajectories well describe the interference, but not the congestion; the latter requires introducing an additional empirical measure. Our results remain valid under replacing the two penalization terms by more general functionals of these two empirical measures.

math.PR↗