@inproceedings{11184,
abstract = {Let G be a graph on n nodes. In the stochastic population protocol model, a collection of n indistinguishable, resource-limited nodes collectively solve tasks via pairwise interactions. In each interaction, two randomly chosen neighbors first read each other’s states, and then update their local states. A rich line of research has established tight upper and lower bounds on the complexity of fundamental tasks, such as majority and leader election, in this model, when G is a clique. Specifically, in the clique, these tasks can be solved fast, i.e., in n polylog n pairwise interactions, with high probability, using at most polylog n states per node.
In this work, we consider the more general setting where G is an arbitrary regular graph, and present a technique for simulating protocols designed for fully-connected networks in any connected regular graph. Our main result is a simulation that is efficient on many interesting graph families: roughly, the simulation overhead is polylogarithmic in the number of nodes, and quadratic in the conductance of the graph. As a sample application, we show that, in any regular graph with conductance φ, both leader election and exact majority can be solved in φ^{-2} ⋅ n polylog n pairwise interactions, with high probability, using at most φ^{-2} ⋅ polylog n states per node. This shows that there are fast and space-efficient population protocols for leader election and exact majority on graphs with good expansion properties. We believe our results will prove generally useful, as they allow efficient technology transfer between the well-mixed (clique) case, and the under-explored spatial setting.},
author = {Alistarh, Dan-Adrian and Gelashvili, Rati and Rybicki, Joel},
booktitle = {25th International Conference on Principles of Distributed Systems},
editor = {Bramas, Quentin and Gramoli, Vincent and Milani, Alessia},
isbn = {9783959772198},
issn = {1868-8969},
location = {Strasbourg, France},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Fast graphical population protocols}},
doi = {10.4230/LIPIcs.OPODIS.2021.14},
volume = {217},
year = {2022},
}
@inproceedings{10854,
abstract = {Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner?
To address this question, we define the batch dynamic CONGEST model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labelled graph under batch changes. We investigate, when a batch of alpha edge label changes arrive, - how much time as a function of alpha we need to update an existing solution, and - how much information the nodes have to keep in local memory between batches in order to update the solution quickly.
Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. The diverse time complexity of our model spans from constant time, through time polynomial in alpha, and to alpha time, which we show to be enough for any task.},
author = {Foerster, Klaus-Tycho and Korhonen, Janne and Paz, Ami and Rybicki, Joel and Schmid, Stefan},
booktitle = {Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems},
isbn = {9781450380720},
location = {Virtual, Online},
pages = {71--72},
publisher = {Association for Computing Machinery},
title = {{Input-dynamic distributed algorithms for communication networks}},
doi = {10.1145/3410220.3453923},
year = {2021},
}
@article{10855,
abstract = {Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \beginitemize \item how much time as a function of α we need to update an existing solution, and \item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques.},
author = {Foerster, Klaus-Tycho and Korhonen, Janne and Paz, Ami and Rybicki, Joel and Schmid, Stefan},
issn = {2476-1249},
journal = {Proceedings of the ACM on Measurement and Analysis of Computing Systems},
keywords = {Computer Networks and Communications, Hardware and Architecture, Safety, Risk, Reliability and Quality, Computer Science (miscellaneous)},
number = {1},
pages = {1--33},
publisher = {Association for Computing Machinery},
title = {{Input-dynamic distributed algorithms for communication networks}},
doi = {10.1145/3447384},
volume = {5},
year = {2021},
}
@inproceedings{10218,
abstract = {Let G be a graph on n nodes. In the stochastic population protocol model, a collection of n indistinguishable, resource-limited nodes collectively solve tasks via pairwise interactions. In each interaction, two randomly chosen neighbors first read each other’s states, and then update their local states. A rich line of research has established tight upper and lower bounds on the complexity of fundamental tasks, such as majority and leader election, in this model, when G is a clique. Specifically, in the clique, these tasks can be solved fast, i.e., in n polylog n pairwise interactions, with high probability, using at most polylog n states per node. In this work, we consider the more general setting where G is an arbitrary graph, and present a technique for simulating protocols designed for fully-connected networks in any connected regular graph. Our main result is a simulation that is efficient on many interesting graph families: roughly, the simulation overhead is polylogarithmic in the number of nodes, and quadratic in the conductance of the graph. As an example, this implies that, in any regular graph with conductance φ, both leader election and exact majority can be solved in φ^{-2} ⋅ n polylog n pairwise interactions, with high probability, using at most φ^{-2} ⋅ polylog n states per node. This shows that there are fast and space-efficient population protocols for leader election and exact majority on graphs with good expansion properties.},
author = {Alistarh, Dan-Adrian and Gelashvili, Rati and Rybicki, Joel},
booktitle = {35th International Symposium on Distributed Computing},
isbn = {9-783-9597-7210-5},
issn = {1868-8969},
location = {Freiburg, Germany},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Brief announcement: Fast graphical population protocols}},
doi = {10.4230/LIPIcs.DISC.2021.43},
volume = {209},
year = {2021},
}
@inproceedings{10219,
abstract = {We show that any algorithm that solves the sinkless orientation problem in the supported LOCAL model requires Ω(log n) rounds, and this is tight. The supported LOCAL is at least as strong as the usual LOCAL model, and as a corollary this also gives a new, short and elementary proof that shows that the round complexity of the sinkless orientation problem in the deterministic LOCAL model is Ω(log n).},
author = {Korhonen, Janne and Paz, Ami and Rybicki, Joel and Schmid, Stefan and Suomela, Jukka},
booktitle = {35th International Symposium on Distributed Computing},
isbn = {9-783-9597-7210-5},
issn = {1868-8969},
location = {Freiburg, Germany},
publisher = {Schloss Dagstuhl - Leibniz Zentrum für Informatik},
title = {{Brief announcement: Sinkless orientation is hard also in the supported LOCAL model}},
doi = {10.4230/LIPIcs.DISC.2021.58},
volume = {209},
year = {2021},
}
@inproceedings{9678,
abstract = {We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for stable orientations and more generally for locally optimal semi-matchings. The prior work by Czygrinow et al. (DISC 2012) finds a stable orientation in O(Δ^5) rounds in graphs of maximum degree Δ, while we improve it to O(Δ^4) and also prove a lower bound of Ω(Δ). For the more general problem of locally optimal semi-matchings, the prior upper bound is O(S^5) and our new algorithm runs in O(C · S^4) rounds, which is an improvement for C = o(S); here C and S are the maximum degrees of customers and servers, respectively.},
author = {Brandt, Sebastian and Keller, Barbara and Rybicki, Joel and Suomela, Jukka and Uitto, Jara},
booktitle = {Annual ACM Symposium on Parallelism in Algorithms and Architectures},
isbn = {9781450380706},
location = { Virtual Event, United States},
pages = {129--139},
title = {{Efficient load-balancing through distributed token dropping}},
doi = {10.1145/3409964.3461785},
year = {2021},
}
@inproceedings{9823,
abstract = {Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes communicate by reading and writing to shared memory. In this work, we consider a natural generalisation of approximate agreement on arbitrary undirected connected graphs. Each process is given a vertex of the graph as input and, if non-faulty, must output a vertex such that
all the outputs are within distance 1 of one another, and
each output value lies on a shortest path between two input values.
From prior work, it is known that there is no wait-free algorithm among 𝑛≥3 processes for this problem on any cycle of length 𝑐≥4 , by reduction from 2-set agreement (Castañeda et al. 2018).
In this work, we investigate the solvability and complexity of this task on general graphs. We give a new, direct proof of the impossibility of approximate agreement on cycles of length 𝑐≥4 , via a generalisation of Sperner’s Lemma to convex polygons. We also extend the reduction from 2-set agreement to a larger class of graphs, showing that approximate agreement on these graphs is unsolvable. On the positive side, we present a wait-free algorithm for a class of graphs that properly contains the class of chordal graphs.},
author = {Alistarh, Dan-Adrian and Ellen, Faith and Rybicki, Joel},
booktitle = {Structural Information and Communication Complexity},
isbn = {9783030795269},
issn = {16113349},
location = {Wrocław, Poland},
pages = {87--105},
publisher = {Springer Nature},
title = {{Wait-free approximate agreement on graphs}},
doi = {10.1007/978-3-030-79527-6_6},
volume = {12810},
year = {2021},
}
@article{7224,
abstract = {Habitat loss is one of the key drivers of the ongoing decline of biodiversity. However, ecologists still argue about how fragmentation of habitat (independent of habitat loss) affects species richness. The recently proposed habitat amount hypothesis posits that species richness only depends on the total amount of habitat in a local landscape. In contrast, empirical studies report contrasting patterns: some find positive and others negative effects of fragmentation per se on species richness. To explain this apparent disparity, we devise a stochastic, spatially explicit model of competitive species communities in heterogeneous habitats. The model shows that habitat loss and fragmentation have complex effects on species diversity in competitive communities. When the total amount of habitat is large, fragmentation per se tends to increase species diversity, but if the total amount of habitat is small, the situation is reversed: fragmentation per se decreases species diversity.},
author = {Rybicki, Joel and Abrego, Nerea and Ovaskainen, Otso},
issn = {1461-023X},
journal = {Ecology Letters},
number = {3},
pages = {506--517},
publisher = {Wiley},
title = {{Habitat fragmentation and species diversity in competitive communities}},
doi = {10.1111/ele.13450},
volume = {23},
year = {2020},
}
@article{6972,
abstract = {We give fault-tolerant algorithms for establishing synchrony in distributed systems in which each of thennodes has its own clock. Our algorithms operate in a very strong fault model: we require self-stabilisation, i.e.,the initial state of the system may be arbitrary, and there can be up to f (ω + 1)f,
where ω is the clique number of G. In addition, we give the first Byzantine-tolerant algorithm for a
variant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact
variants of these and related tasks over a large class of combinatorial structures.},
author = {Nowak, Thomas and Rybicki, Joel},
booktitle = {33rd International Symposium on Distributed Computing},
keywords = {consensus, approximate agreement, Byzantine faults, chordal graphs, lattice agreement},
location = {Budapest, Hungary},
pages = {29:1----29:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Byzantine approximate agreement on graphs}},
doi = {10.4230/LIPICS.DISC.2019.29},
volume = {146},
year = {2019},
}
@inproceedings{6935,
abstract = {This paper investigates the power of preprocessing in the CONGEST model. Schmid and Suomela (ACM HotSDN 2013) introduced the SUPPORTED CONGEST model to study the application of distributed algorithms in Software-Defined Networks (SDNs). In this paper, we show that a large class of lower bounds in the CONGEST model still hold in the SUPPORTED model, highlighting the robustness of these bounds. This also raises the question how much does
preprocessing help in the CONGEST model.},
author = {Foerster, Klaus-Tycho and Korhonen, Janne and Rybicki, Joel and Schmid, Stefan},
booktitle = {Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing},
isbn = {9781450362177},
location = {Toronto, ON, Canada},
pages = {259--261},
publisher = {ACM},
title = {{Does preprocessing help under congestion?}},
doi = {10.1145/3293611.3331581},
year = {2019},
}
@article{6936,
abstract = {A key challenge for community ecology is to understand to what extent observational data can be used to infer the underlying community assembly processes. As different processes can lead to similar or even identical patterns, statistical analyses of non‐manipulative observational data never yield undisputable causal inference on the underlying processes. Still, most empirical studies in community ecology are based on observational data, and hence understanding under which circumstances such data can shed light on assembly processes is a central concern for community ecologists. We simulated a spatial agent‐based model that generates variation in metacommunity dynamics across multiple axes, including the four classic metacommunity paradigms as special cases. We further simulated a virtual ecologist who analysed snapshot data sampled from the simulations using eighteen output metrics derived from beta‐diversity and habitat variation indices, variation partitioning and joint species distribution modelling. Our results indicated two main axes of variation in the output metrics. The first axis of variation described whether the landscape has patchy or continuous variation, and thus was essentially independent of the properties of the species community. The second axis of variation related to the level of predictability of the metacommunity. The most predictable communities were niche‐based metacommunities inhabiting static landscapes with marked environmental heterogeneity, such as metacommunities following the species sorting paradigm or the mass effects paradigm. The most unpredictable communities were neutral‐based metacommunities inhabiting dynamics landscapes with little spatial heterogeneity, such as metacommunities following the neutral or patch sorting paradigms. The output metrics from joint species distribution modelling yielded generally the highest resolution to disentangle among the simulated scenarios. Yet, the different types of statistical approaches utilized in this study carried complementary information, and thus our results suggest that the most comprehensive evaluation of metacommunity structure can be obtained by combining them.
},
author = {Ovaskainen, Otso and Rybicki, Joel and Abrego, Nerea},
issn = {1600-0587},
journal = {Ecography},
number = {11},
pages = {1877--1886},
publisher = {Wiley},
title = {{What can observational data reveal about metacommunity processes?}},
doi = {10.1111/ecog.04444},
volume = {42},
year = {2019},
}
@article{76,
abstract = {Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given C>1. In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external “go” signal as input, then all correct nodes should agree on a round (in the not-too-distant future) in which to jointly output a “fire” signal. Moreover, no node should generate a “fire” signal without some correct node having previously received a “go” signal as input. We present a framework reducing both tasks to binary consensus at very small cost. For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f<n/3, asymptotically optimal stabilisation and response time O(f), and message size O(log f). As our framework does not restrict the type of consensus routines used, we also obtain efficient randomised solutions.},
author = {Lenzen, Christoph and Rybicki, Joel},
journal = {Distributed Computing},
publisher = {Springer},
title = {{Near-optimal self-stabilising counting and firing squads}},
doi = {10.1007/s00446-018-0342-6},
year = {2018},
}
@article{43,
abstract = {The initial amount of pathogens required to start an infection within a susceptible host is called the infective dose and is known to vary to a large extent between different pathogen species. We investigate the hypothesis that the differences in infective doses are explained by the mode of action in the underlying mechanism of pathogenesis: Pathogens with locally acting mechanisms tend to have smaller infective doses than pathogens with distantly acting mechanisms. While empirical evidence tends to support the hypothesis, a formal theoretical explanation has been lacking. We give simple analytical models to gain insight into this phenomenon and also investigate a stochastic, spatially explicit, mechanistic within-host model for toxin-dependent bacterial infections. The model shows that pathogens secreting locally acting toxins have smaller infective doses than pathogens secreting diffusive toxins, as hypothesized. While local pathogenetic mechanisms require smaller infective doses, pathogens with distantly acting toxins tend to spread faster and may cause more damage to the host. The proposed model can serve as a basis for the spatially explicit analysis of various virulence factors also in the context of other problems in infection dynamics.},
author = {Rybicki, Joel and Kisdi, Eva and Anttila, Jani},
journal = {PNAS},
number = {42},
pages = {10690 -- 10695},
publisher = {National Academy of Sciences},
title = {{Model of bacterial toxin-dependent pathogenesis explains infective dose}},
doi = {10.1073/pnas.1721061115},
volume = {115},
year = {2018},
}
@inproceedings{6932,
abstract = {LCLs or locally checkable labelling problems (e.g. maximal independent set, maximal matching, and vertex colouring) in the LOCAL model of computation are very well-understood in cycles (toroidal 1-dimensional grids): every problem has a complexity of O(1), Θ(log* n), or Θ(n), and the design of optimal algorithms can be fully automated. This work develops the complexity theory of LCL problems for toroidal 2-dimensional grids. The complexity classes are the same as in the 1-dimensional case: O(1), Θ(log* n), and Θ(n). However, given an LCL problem it is undecidable whether its complexity is Θ(log* n) or Θ(n) in 2-dimensional grids.
Nevertheless, if we correctly guess that the complexity of a problem is Θ(log* n), we can completely automate the design of optimal algorithms. For any problem we can find an algorithm that is of a normal form A' o Sk, where A' is a finite function, Sk is an algorithm for finding a maximal independent set in kth power of the grid, and k is a constant.
Finally, partially with the help of automated design tools, we classify the complexity of several concrete LCL problems related to colourings and orientations.},
author = {Brandt, Sebastian and Hirvonen, Juho and Korhonen, Janne H. and Lempiäinen, Tuomo and Östergård, Patric R.J. and Purcell, Christopher and Rybicki, Joel and Suomela, Jukka and Uznański, Przemysław},
isbn = {9781450349925},
location = {Washington, DC, United States},
pages = {101--110},
publisher = {ACM Press},
title = {{LCL problems on grids}},
doi = {10.1145/3087801.3087833},
year = {2017},
}