On the average squared radius of gyration of a family of embeddings of subdivision graphs

Abstract

Suppose we have an embedding of a graph G created by subdividing the edges of a simpler graph G'. The edges of G can be divided into subsets which join pairs of ``junction'' vertices in G'. The displacement vectors of the edges in each subset sum to the displacement between junctions. We can construct a family of embeddings of G with the same junction positions by rearranging the displacements in each group. In this paper, we show that the average (squared) radius of gyration of these embeddings is given by a simple formula involving a weighted (squared) radius of gyration of the positions of the junctions and the sum of the squares of the lengths of the edges of G and G'. This ensemble of graph embeddings arises naturally in polymer science.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…