Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Penschuck, Manuel"'
Autor:
Geis, Lukas, Allendorf, Daniel, Bläsius, Thomas, Leonhardt, Alexander, Meyer, Ulrich, Penschuck, Manuel, Tran, Hung
We consider a maximum entropy edge weight model for shortest path networks that allows for negative weights. Given a graph $G$ and possible weights $\mathcal{W}$ typically consisting of positive and negative values, the model selects edge weights $w
Externí odkaz:
http://arxiv.org/abs/2410.22717
A graph is called a $(k,\rho)$-graph iff every node can reach $\rho$ of its nearest neighbors in at most k hops. This property proved useful in the analysis and design of parallel shortest-path algorithms. Any graph can be transformed into a $(k,\rho
Externí odkaz:
http://arxiv.org/abs/2402.07771
Autor:
Penschuck, Manuel
Shuffling is the process of rearranging a sequence of elements into a random order such that any permutation occurs with equal probability. It is an important building block in a plethora of techniques used in virtually all scientific areas. Conseque
Externí odkaz:
http://arxiv.org/abs/2302.03317
Preferential attachment lies at the heart of many network models aiming to replicate features of real world networks. To simulate the attachment process, conduct statistical tests, or obtain input data for benchmarks, efficient algorithms are require
Externí odkaz:
http://arxiv.org/abs/2211.06884
Autor:
Angriman, Eugenio, van der Grinten, Alexander, Hamann, Michael, Meyerhenke, Henning, Penschuck, Manuel
The abundance of massive network data in a plethora of applications makes scalable analysis algorithms and software tools necessary to generate knowledge from such data in reasonable time. Addressing scalability as well as other requirements such as
Externí odkaz:
http://arxiv.org/abs/2209.13355
Publikováno v:
Journal of Parallel and Distributed Computing, Volume 174, 2023, Pages 118-129
The uniform sampling of simple graphs matching a prescribed degree sequence is an important tool in network science, e.g. to construct graph generators or null-models. Here, the Edge Switching Markov Chain (ES-MC) is a common choice. Given an arbitra
Externí odkaz:
http://arxiv.org/abs/2111.03005
We consider the following common network analysis problem: given a degree sequence $\mathbf{d} = (d_1, \dots, d_n) \in \mathbb N^n$ return a uniform sample from the ensemble of all simple graphs with matching degrees. In practice, the problem is typi
Externí odkaz:
http://arxiv.org/abs/2110.15015
The group testing problem asks for efficient pooling schemes and algorithms that allow to screen moderately large numbers of samples for rare infections. The goal is to accurately identify the infected samples while conducting the least possible numb
Externí odkaz:
http://arxiv.org/abs/2105.07882
Autor:
Berenbrink, Petra, Hammer, David, Kaaser, Dominik, Meyer, Ulrich, Penschuck, Manuel, Tran, Hung
We consider the problem of efficiently simulating population protocols. In the population model, we are given a distributed system of $n$ agents modeled as identical finite-state machines. In each time step, a pair of agents is selected uniformly at
Externí odkaz:
http://arxiv.org/abs/2005.03584
Autor:
Gebhard, Oliver, Hahn-Klimroth, Max, Parczyk, Olaf, Penschuck, Manuel, Rolvien, Maurice, Scarlett, Jonathan, Tan, Nelvin
Recent advances in noiseless non-adaptive group testing have led to a precise asymptotic characterization of the number of tests required for high-probability recovery in the sublinear regime $k = n^{\theta}$ (with $\theta \in (0,1)$), with $n$ indiv
Externí odkaz:
http://arxiv.org/abs/2004.11860