J. Komjáthy
16 records found
1
Authored
A k-truncated resolving set of a graph is a subset S⊆V of its vertex set such that the vector (dk(s,v))s∈S is distinct for each vertex v∈V where dk(x,y)=min{d(x,y),k+1} is the graph distance truncated at k+1. We think of elements of a k-trunca ...
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of communities and individuals, where these communities may overlap. We generalize the model, allowing for arbitrary community structures within the communities. In our new m ...
The “random intersection graph with communities” (RIGC) models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own internal structure described by a (small) graph, while groups may overlap. The group membershi ...
Contributed
k(n)-cores in the scale-free configuration model
Understanding the structure of a commonly used null model for scale-free networks
Explosion of Branching Processes
Finding sufficient conditions for infinitely large branching processes
On Whole-Graph Embeddings from Node Feature Distributions
Triangle Count reveals Communities and improves Graph Neural Networks
We construct a graph G = (V,E) for a given set of sensors of size m: {s1, s2, ..., sm} and a range k > 0. We want that each node v ∈ V has a unique c ...