Optimizing constrained and unconstrained network structures   - VVSOR - VVSOR

Vereniging voor Statistiek en Operations Research
24 October 2018

Optimizing constrained and unconstrained network structures  

On Wednesday October 24, the Groningen Stochastics Seminar will host another talk.  All are welcome to attend.

Clara Stegehuis (Eindhoven)

Optimizing constrained and unconstrained network structures  

When:  Wednesday October 24,  15:00 – 16:00
Where: University of Groningen, Zernike Campus, Room 5111.0006 (Nijenborgh 4)

Abstract:
Subgraphs contain important information about network structures and their functions. We investigate the presence of subgraphs in inhomogeneous random graphs 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 count and characterize all subgraphs.

We then show that this optimization problem easily extends to other 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 clustering in a wide class of random graph models.

More details and future talks can be found on the seminar’s website:
http://www.math.rug.nl/stat/ Stoch/Sem