On April Thursday 22 at 14:30, prof. Clara Stegehuis (Twente University) will give a virtual seminar “in Florence”, to which you are all invited. You can find title and abstract below.
Title: Optimal constrained and unconstrained subgraph structures
Abstract:
Subgraphs contain important information about network structures and their functions. We investigate the presence of subgraphs in a random graph model with infinite-variance degrees. We introduce an optimization problem which identifies the dominant structure of any given subgraph. The unique optimizer describes the degrees of the vertices that together span the most likely subgraph and allows us to count and characterize the asymptotic number of subgraphs in a simple manner.
We then show that this optimization problem easily extends to investigating other random network structures, such as clustering, which expresses the probability that two neighbors of a vertex are connected. The optimization problem is able to find the behavior of network subgraphs in a wide class of random graph models.
The seminar will be on Zoom. You can find the information to join below.
If you know of someone who might be interested and is not subscribed to the random mailing list, please do not hesitate to forward this announcement to them.