Zobrazeno 1 - 10
of 144
pro vyhledávání: '"Stegehuis, Clara"'
Autor:
Stegehuis, Clara, Weedage, Lotte
Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edge set by performing as few queries as possible. An algorithm for graph
Externí odkaz:
http://arxiv.org/abs/2407.18591
Geometric scale-free random graphs are popular models for networks that exhibit as heavy-tailed degree distributions, small-worldness and high clustering. In these models, vertices have weights that cause the heavy-tailed degrees and are embedded in
Externí odkaz:
http://arxiv.org/abs/2404.14972
Autor:
Kraakman, Yanna J., Stegehuis, Clara
Many complex systems show non-pairwise interactions, which can be captured by hypergraphs. In this work, we establish configuration models in which both the vertex and the hyperarc degrees are preserved for different classes of directed hypergraphs (
Externí odkaz:
http://arxiv.org/abs/2402.06466
We investigate the number of maximal cliques, i.e., cliques that are not contained in any larger clique, in three network models: Erd\H{o}s-R\'enyi random graphs, inhomogeneous random graphs (also called Chung-Lu graphs), and geometric inhomogeneous
Externí odkaz:
http://arxiv.org/abs/2309.02990
Autor:
Sönmez, Ercan, Stegehuis, Clara
Publikováno v:
Journal of Statistical Physics, 2024
We study the distances of edges within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson point process, and far-away points are less likely to be connected than nearby points. We obtain the sc
Externí odkaz:
http://arxiv.org/abs/2308.07168
Autor:
Stegehuis, Clara, Weedage, Lotte
Publikováno v:
PLOS ONE 2024 19(2): e0299396
With more and more demand from devices to use wireless communication networks, there has been an increased interest in resource sharing among operators, to give a better link quality. However, in the analysis of the benefits of resource sharing among
Externí odkaz:
http://arxiv.org/abs/2304.11881
Autor:
Stegehuis, Clara, Zwart, Bert
We provide large deviations estimates for the upper tail of the number of triangles in scale-free inhomogeneous random graphs where the degrees have power law tails with index $-\alpha, \alpha \in (1,2)$. We show that upper tail probabilities for tri
Externí odkaz:
http://arxiv.org/abs/2303.09198
We consider the problem of detecting whether a power-law inhomogeneous random graph contains a geometric community, and we frame this as an hypothesis testing problem. More precisely, we assume that we are given a sample from an unknown distribution
Externí odkaz:
http://arxiv.org/abs/2303.02965
Publikováno v:
IEEE Transactions on Network and Service Management, 2024
Cellular networks have become one of the critical infrastructures, as many services depend increasingly on wireless connectivity. Therefore, it is important to quantify the resilience of existing cellular network infrastructures against potential ris
Externí odkaz:
http://arxiv.org/abs/2301.03250
Autor:
Stegehuis, Clara, Zwart, Bert
We develop tail estimates for the number of edges in a Chung-Lu random graph with regularly varying weight distribution. Our results show that the most likely way to have an unusually large number of edges is through the presence of one or more hubs,
Externí odkaz:
http://arxiv.org/abs/2212.05907