Preprint
Article

This version is not peer-reviewed.

Radius of Gyration of Gaussian Bridged Rings: Derivations and Finite-Chain Corrections

Submitted:

22 September 2026

Posted:

22 September 2026

You are already at the latest version

Abstract
We examine the mean-square radius of gyration of ideal Gaussian bridged rings formed by chains joining two freely fluctuating junctions. Six complementary derivations connect chain covariances, the parallel-axis theorem, electrical resistance, closure of a Gaussian star, normal modes, and counts of spanning trees and forests. For equal continuum bridges with uniform contour mass, the mean-square size equals that of a free linear chain of one bridge length, independently of the number of bridges. This known independence follows from a cancellation between the contribution of junction separation and the center-of-mass correction associated with bridge fluctuations. Correcting an intermediate expression in the electrical-resistance derivation preserves the final size and contraction formulas reported by Zhu and co-workers. We also derive expressions for unequal bridge lengths, different mass distributions, and finite Gaussian chains. At fixed total contour length and common segment properties, equal bridge lengths locally minimize the contraction factor when more than two bridges are present. For finite chains, suitable junction masses can make the size independent of bridge number while the contraction factor retains a finite-chain correction. The mass distribution and linear reference are specified throughout. All results concern equilibrium Gaussian chains with unrestricted crossing.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

Joining the ends of a polymer changes its dimensions without changing its contour length. The dependence of molecular size on branching and ring closure is a classical problem in polymer statistics [1]. For Gaussian chains, the problem can be treated exactly because the connectivity imposes linear constraints on the segment vectors. The resulting correlations determine the mean-square radius of gyration.
We consider Gaussian bridged rings: f Gaussian chains joining two common junctions. This is the Gaussian-chain model of the bridged polycyclic rings studied by Zhu et al. [2], hereafter Paper I. Each complete chain between the junctions is called a bridge. The family includes the linear-chain limit f = 1 , a ring for f = 2 , and a theta-shaped chain for f = 3 . For general f, there are f − 1 independent rings. The chains are allowed to pass through one another, and no knot type is prescribed. The model therefore describes the effect of connectivity within Gaussian chain statistics; excluded volume and restrictions on chain crossing are not included.
For equal bridges, each containing N statistical segments of mean-square length b 2 , Paper I obtained
R g 2 = N b 2 6 , g = R g 2 R g , linear , f N 2 = 1 f .
Here R g 2 = S g 2 denotes the mean-square radius of gyration, and g compares the network with a free linear chain of the same total contour length. These are Equations (14) and (15) of Paper I. At fixed bridge length, the mean-square size is independent of the number of bridges. This result is less evident than the reduction of the junction separation: adding bridges also changes the fluctuations of the center of mass. Both effects must be included.
Paper I used two routes to the Gaussian size. Its resistor-network calculation evaluates pair distances and their contour integrals in Equations (4)–(15). Its graph-theoretical calculation uses the inverse eigenvalues of a finite connectivity matrix, with the bead count and linear reference specified in Equations (16)–(18). The latter spectra were evaluated numerically in Paper I. Here the resistance calculation is given in full, the continuum spectrum is found analytically, and the finite inverse-eigenvalue sum is evaluated through discrete covariances and forest counts. The continuum and finite formulas are kept distinct.
Equation (12) of Paper I contains a typographical error. For two points on the same bridge, the alternate route passes through the other f − 1 bridges in parallel. Both occurrences of 1 / ( f − 2 ) in that equation must therefore be replaced by 1 / ( f − 1 ) . Let u ∈ [ 0 , 1 ] be the contour separation of the two points divided by the bridge length N, and let H I ( u ) denote their mean-square spatial separation. The corrected equation is
H I ( u ) N b 2 = u [ 1 − u + 1 / ( f − 1 ) ] 1 + 1 / ( f − 1 ) = u − f − 1 f u 2 , f > 1 .
The two routes have resistances u and 1 − u + 1 / ( f − 1 ) when the resistance of a complete bridge is set to unity; the fraction above is their parallel combination. The count f − 2 instead applies to the remaining complete bridges when the two points lie on different bridges. The error is confined to the intermediate expression: the evaluated pair integrals and final size formulas reported in Paper I remain valid. Section 4 derives this corrected expression in Equation (22) and carries out both integrations in full.
Uehara and Deguchi [3] studied this architecture as a multi-theta chain. They derived pair and scattering functions for equal Gaussian walks and established independence of the mean-square size from the number of walks at fixed walk length. Comparisons between discrete formulas require the same convention for the mass assigned to shared junctions. We examine this point explicitly in Section 6.4. General Gaussian-network theory relates pair distances and molecular size to the graph Laplacian [4]. The finite equal-subdivision theorem of Cantarella et al. [5] includes the present two-junction graph; their work also gives its leading finite-chain correction. These established results are the starting point of the present analysis.
The contribution of the present analysis is to explain the physical cancellation behind the established size law, correct its original resistance derivation, and make the length and mass conventions explicit. The equal-bridge continuum law and finite equal-subdivision formula are recovered results. The calculations for unequal bridge properties and junction weights give explicit consequences for the two-junction network, including its response to weak length inequality. These are presented with their derivations and assumptions; no priority claim is made for a new general network theorem. The central distinction is between changing the Gaussian spring statistics and changing the mass distribution used to measure size.
The present scope is equilibrium size within the ideal Gaussian chain model. The excluded-volume treatment, Flory estimate, mean span, and pore partitioning discussed in Paper I concern different physical assumptions or observables and are not developed here. No simulation results or numerical estimates are needed for the analytical statements below.
We first define the model and the observable in Section 2, then develop six complementary derivations of the equal-bridge result. The covariance calculation in Section 3 separates junction motion from fluctuations within each bridge and identifies the cancellation responsible for independence from bridge number. The parallel-axis derivation in Section 3.5 expresses this cancellation through the sizes of individual bridges and the dispersion of their centers. The electrical-resistance calculation in Section 4 evaluates the mean-square distances between pairs of points. After correcting the intermediate expression in Section 4.2, the pair integrations recover Equations (14) and (15) of Paper I. We then extend the analysis to unequal bridges and different mass distributions in Section 5, and to finite bead chains in Section 6. Three further derivations are presented in the appendices. Appendix A constructs the network by closing the ends of a Gaussian star and calculates the fluctuations removed by the closure constraints. Appendix B obtains the size by summing the equilibrium variances of the normal modes. Appendix C uses counts of spanning trees and forests to obtain the exact finite-chain size and its long-chain limit. These six approaches describe the same Gaussian equilibrium measure and emphasize different aspects of the calculation. Their common basis in the connectivity operator is explained in Section 4.

2. The Gaussian Chain Model

2.1. Continuum Gaussian Network

Let the junctions be A and B. Bridge e = 1 , … , f is described by r e ( s ) ∈ R 3 , with 0 ≤ s ≤ N , r e ( 0 ) = r A , and r e ( N ) = r B . Contour coordinate s counts statistical segments. The Gaussian chain weight is specified by the quadratic energy
H k B T = 3 2 b 2 ∑ e = 1 f ∫ 0 N d r e d s 2 d s .
Equation (2) is the usual continuum notation for a chain of Gaussian springs. It is understood through that discrete model; an individual continuum chain need not have an ordinary tangent at every point. Here k B is Boltzmann’s constant and T is temperature. Bending stiffness and finite extensibility are absent. No external force is applied to the junctions, so their separation fluctuates in thermal equilibrium.
The contour mass density is the same on every bridge. The junctions have no additional point mass in this continuum model. We write
L = f N , q = N b 2 , R = r B − r A , x = s / N .
L is total contour length in segment units, whereas q has units of length squared. We may set r A = 0 when calculating relative positions. For the normal-mode calculation it is more convenient to set the center of mass to zero. Translating the whole molecule changes neither pair distances nor its radius of gyration.
Figure 1. Connectivity and normalized electrical resistances. (a) Four equal paths share two junctions; the drawing specifies connectivity, not a spatial constraint. (b) Two points on one bridge leave f − 1 complete bridges in the alternate route. Here 0 ≤ x ≤ y ≤ 1 and u = y − x . (c) Points on different bridges leave f − 2 complete bridges between A and B. All resistances are divided by N. In (c), f > 2 is understood; for f = 2 the central edge is absent, represented by h 5 → ∞ .
Figure 1. Connectivity and normalized electrical resistances. (a) Four equal paths share two junctions; the drawing specifies connectivity, not a spatial constraint. (b) Two points on one bridge leave f − 1 complete bridges in the alternate route. Here 0 ≤ x ≤ y ≤ 1 and u = y − x . (c) Points on different bridges leave f − 2 complete bridges between A and B. All resistances are divided by N. In (c), f > 2 is understood; for f = 2 the central edge is absent, represented by h 5 → ∞ .
Preprints 234520 g001

2.2. The Observable and Its Reference Chain

For a single conformation,
r cm = 1 L ∑ e ∫ 0 N r e ( s ) d s ,
S g 2 = 1 L ∑ e ∫ 0 N | r e ( s ) − r cm | 2 d s
= 1 2 L 2 ∑ e , e ′ ∫ 0 N ∫ 0 N | r e ( s ) − r e ′ ( t ) | 2 d s d t .
The factor 1 / 2 compensates for ordered pairs. Ensemble averaging gives R g 2 . The free continuum linear chain of contour length L has R g , linear , L 2 = L b 2 / 6 . The contraction factor g compares equal total contour mass and the same b.
The statement of f-independence in Equation (1) holds at fixed bridge length N. At fixed total contour length L it reads R g 2 = L b 2 / ( 6 f ) . Furthermore, N b 2 / 6 is the radius squared of a free linear chain of length N; it is not, for f > 1 , the gyration of one constrained bridge about that bridge’s own center of mass.
The exact finite model has N springs per bridge and n = f ( N − 1 ) + 2 equal-mass beads, with each junction counted once. We reserve n for that bead count and L for continuum contour length. The difference is essential for finite-chain corrections (Section 6).
Throughout the continuum calculation, the freely fluctuating junction separation, uniform contour mass on each homogeneous bridge, and absence of additional junction point masses are part of the model. Neither Gaussian statistics nor a specified connectivity imposes a knot type. The results are therefore reference results for connectivity in a phantom Gaussian network, rather than exact statements about every polymer with the same chemical connectivity.

3. Junction Motion and Bridge Fluctuations

3.1. Distribution of the Junction Separation

An unconstrained Gaussian chain of N segments has endpoint density
G N ( R ) = 3 2 π q 3 / 2 exp − 3 R 2 2 q .
The bridges have common endpoints, so their endpoint weights multiply. After normalization,
p ( R ) = 3 f 2 π q 3 / 2 exp − 3 f R 2 2 q , R α R β = q 3 f δ α β , R 2 = q f .
The mean-square junction separation is reduced by a factor f relative to the end-to-end distance of one free chain. Each bridge contributes the same quadratic energy for stretching the separation.

3.2. Path Decomposition and Integrated Covariance

For a prescribed R , the mean position at contour fraction x is x R . We separate this mean path from its fluctuations:
r e ( N x ) = x R + η e ( x ) , 0 ≤ x ≤ 1 ,
where η e ( 0 ) = η e ( 1 ) = 0 . Such a Gaussian path with both endpoints fixed is called a Brownian bridge [6].
Its covariance follows directly from the free-chain covariance. Let W e ( x ) be a free Gaussian path starting at the origin, with
W e ( x ) · W e ( y ) = q min ( x , y ) .
Subtracting the part proportional to its endpoint gives η e ( x ) = W e ( x ) − x W e ( 1 ) . Hence
η e ( x ) · η e ( y ) = q [ min ( x , y ) − y x − x y + x y ] = q [ min ( x , y ) − x y ] , η e ( x ) · W e ( 1 ) = q ( x − x ) = 0 .
The same cancellation holds for every Cartesian covariance. Since the variables are jointly Gaussian, the bridge fluctuation is independent of the endpoint. Imposing common endpoints therefore changes only their distribution. The bridge fluctuations remain independent of R and of one another, so
η e ( x ) · η e ′ ( y ) = δ e e ′ q [ min ( x , y ) − x y ] .
For one Cartesian component, the right-hand side is divided by three.
Define the bridge-average fluctuation J e = ∫ 0 1 η e ( x ) d x . The elementary integrals needed below are
∫ 0 1 x 2 d x = 1 3 , ∫ 0 1 x ( 1 − x ) d x = 1 6 .
∫ 0 1 ∫ 0 1 [ min ( x , y ) − x y ] d x d y = 2 ∫ 0 1 ∫ 0 x y ( 1 − x ) d y d x = ∫ 0 1 x 2 ( 1 − x ) d x = 1 12 .
Consequently,
J e 2 = q 12 , J e · J e ′ = 0 ( e ≠ e ′ ) , r cm = R 2 + 1 f ∑ e J e .

3.3. Subtracting the Center-of-Mass Contribution

Using S g 2 = r 2 ¯ − r cm 2 , where the overbar denotes a contour-mass average, gives
r 2 ¯ = ∫ 0 1 x 2 R 2 + q x ( 1 − x ) d x = R 2 3 + q 6 , r cm 2 = R 2 4 + 1 f 2 ∑ e J e 2 = R 2 4 + q 12 f .
Subtracting and substituting Equation (7),
R g 2 = R 2 12 + q 6 − q 12 f = q 12 f + q 6 − q 12 f = q 6 .
The junction separation contributes q / ( 12 f ) to the mean-square size. The subtraction of the fluctuating center of mass removes the same amount. The remaining term, q / 6 , comes from the fluctuations along the bridges.
Keeping the endpoints fixed instead of averaging them gives the useful conditional formula
S g 2 ∣ R = R 2 12 + q ( 2 f − 1 ) 12 f .
Thus a network whose junctions are externally held at a prescribed separation does not in general obey Equation (1). The equilibrium distribution of R is part of the result’s assumptions.

3.4. Pointwise Pair Distances

Both contour fractions in this subsection are measured from A. For two points on the same bridge, let u = | x − y | . Equation (9) gives
| η e ( x ) − η e ( y ) | 2 = q ( u − u 2 ) .
The common endpoint contribution adds q ( x − y ) 2 / f , so
H I ( x , y ) ≡ | r e ( N x ) − r e ( N y ) | 2 = q u − f − 1 f u 2 .
For points on distinct bridges the fluctuation covariance is zero:
H II ( x , y ) ≡ | r e ( N x ) − r e ′ ( N y ) | 2 = q x ( 1 − x ) + y ( 1 − y ) + ( x − y ) 2 f , e ≠ e ′ .
These pair distances will also follow from the electrical calculation in Section 4. At x = 0 , y = 1 , both give the junction separation q / f . At x = y = 0 or x = y = 1 , the two points are at the same junction and the distance vanishes.

3.5. Physical Interpretation from the Parallel-Axis Theorem

The parallel-axis identity separates the size of each bridge from the dispersion of the bridge centers. Let c e = ∫ 0 1 r e ( N x ) d x and S e 2 = ∫ 0 1 | r e ( N x ) − c e | 2 d x . For equal bridge masses, the following holds for each conformation:
S g 2 = 1 f ∑ e S e 2 + 1 2 f 2 ∑ e , e ′ | c e − c e ′ | 2 .
To obtain it, expand r e − r cm = ( r e − c e ) + ( c e − r cm ) . The cross term integrates to zero on each bridge, and the usual pair identity converts the variance of the c e into the last term.
Since c e = R / 2 + J e , the internal size of one bridge is
S e 2 = R 2 3 + q 6 − R 2 4 + q 12 = R 2 12 + q 12 = q ( f + 1 ) 12 f .
For two different bridges,
| c e − c e ′ | 2 = | J e − J e ′ | 2 = q 6 .
There are f ( f − 1 ) ordered distinct pairs of bridge centers. Hence
R g 2 = q ( f + 1 ) 12 f ︸ mean internal size + q ( f − 1 ) 12 f ︸ dispersion of centers = q 6 .
As f grows at fixed N, each constrained bridge becomes smaller about its own center while the center-dispersion contribution grows by the same amount. The two changes cancel. The size of the whole network thus equals that of a free chain of length N, even though each bridge within the network is smaller than that free chain for f > 1 .

4. Electrical Resistance and the Correction to Paper I

4.1. Why Electrical Resistance Is a Mean-Square Distance

First consider a finite network of identical Gaussian springs. Let E be the set of springs, with each spring counted once. The Boltzmann weight is
exp − 3 2 b 2 ∑ { i , j } ∈ E | r i − r j | 2 .
After removing overall translation, fixing a pair separation and integrating the other coordinates produces a Gaussian effective energy. Its quadratic coefficient is obtained by minimizing the original quadratic form over the internal coordinates. This is the same minimization as that of electrical dissipation at fixed terminal voltage. Replace every spring by a unit resistance and let R eff ( i , j ) be the resistance between beads i and j. For a prescribed separation d = r i − r j , the minimum of the spring sum in Equation (19) is | d | 2 / R eff ( i , j ) . Completing the square in the internal coordinates leaves an integral independent of d . Thus
p ( d ) ∝ exp − 3 | d | 2 2 b 2 R eff ( i , j ) .
Its second moment is
| r i − r j | 2 = b 2 R eff ( i , j ) .
The matrix form will be useful below. Define the connectivity matrix K by taking K i i to be the number of springs attached to bead i and K i j to be minus the number joining i to j for i ≠ j . It is the graph Laplacian. With the center of mass fixed, the covariance of one Cartesian coordinate is b 2 K + / 3 , where K + inverts K on vectors whose components sum to zero and is zero on the constant vector. This is the Moore–Penrose inverse. Therefore
R eff ( i , j ) = ( e i − e j ) T K + ( e i − e j ) ,
where e i is the vector with component i equal to one and all other components zero. Summing the coordinate variances again gives Equation (20) [7,8].
For n equal-mass beads, this also shows directly why the resistance and spectral calculations agree. Expanding the quadratic form gives R eff ( i , j ) = K i i + + K j j + − 2 K i j + . Every row of K + sums to zero, so
∑ i < j R eff ( i , j ) = ( n − 1 ) tr K + − 2 ∑ i < j K i j + = n tr K + .
The pair definition of gyration therefore gives
R g 2 = b 2 n 2 ∑ i < j R eff ( i , j ) = b 2 n tr K + = b 2 n ∑ p = 1 n − 1 λ p − 1 .
The sum here is over unordered bead pairs. The covariance is the inverse of the same quadratic form whose eigenvalues enter the final expression. Appendix C expresses this trace through the coefficients of the characteristic polynomial and hence through spanning trees and forests. These are different ways of evaluating one Gaussian expectation.
A chain occupying a fraction u of one bridge has N u unit resistances in series and hence resistance N u . Dividing all resistances by N therefore converts effective resistance into mean-square distance in units of q = N b 2 . The familiar series and parallel laws apply to the reduced network. A general Wheatstone network additionally requires a node-equation or delta–star reduction; it is not always reducible by series and parallel operations alone.

4.2. Points on the Same Bridge: The Corrected Denominator

Use Figure 1b. Let u be the fractional contour separation of the two points on their bridge, with 0 ≤ u ≤ 1 . One route between them is the direct subchain, of normalized resistance u. The other consists of the remaining portions of that same bridge, of combined resistance 1 − u , and all the other bridges between A and B. Those f − 1 bridges in parallel have resistance 1 / ( f − 1 ) . For f > 1 ,
H I q = 1 u + 1 1 − u + 1 / ( f − 1 ) − 1
= u [ 1 − u + 1 / ( f − 1 ) ] 1 + 1 / ( f − 1 ) = u − f − 1 f u 2 .
The last expression also covers f = 1 , when there is no alternate route and H I = q u . Endpoints with zero subchain resistance are understood by continuity.
Equation (22) recovers the corrected form of Equation (12) of Paper I displayed in the Introduction. The two occurrences of 1 / ( f − 2 ) in the original equation should be 1 / ( f − 1 ) . For f = 2 , the correct ring result is q ( u − u 2 / 2 ) . The printed 1 / ( f − 2 ) expression is undefined at f = 2 as written; its limit after simplification is the incorrect result q u . The alternate path around the ring must be retained.

4.3. Points on Different Bridges

Use the labels of Figure 1c. Points a and b have contour fractions x and y from A. For f > 2 the normalized resistances are
h 1 = x , h 3 = 1 − x , h 2 = y , h 4 = 1 − y , h 5 = m = 1 f − 2 .
The two-terminal resistance is
H II q = h 5 ( h 1 + h 2 ) ( h 3 + h 4 ) + h 1 h 2 ( h 3 + h 4 ) + h 3 h 4 ( h 1 + h 2 ) h 5 ( h 1 + h 2 + h 3 + h 4 ) + ( h 1 + h 3 ) ( h 2 + h 4 ) .
Appendix D derives this formula, including its limiting cases. Substitution and simplification recover
H II q = x ( 1 − x ) + y ( 1 − y ) + ( x − y ) 2 f ,
in agreement with Equation (15). For f = 2 , there are no remaining full bridges; taking m → ∞ in Equation (24) gives the two routes around the ring. There is no different-bridge pair when f = 1 .

4.4. The Two Pair Integrals

Define the ordered contour-pair integrals for one chosen bridge, or one chosen ordered pair of different bridges, by
Σ I = N 2 ∫ 0 1 ∫ 0 1 H I ( x , y ) d x d y , Σ II = N 2 ∫ 0 1 ∫ 0 1 H II ( x , y ) d x d y .
They have the scaling N 3 b 2 ; division by the squared total contour mass in Equation (4) restores units of length squared.
For any function of u = | x − y | , the square integral is 2 ∫ 0 1 ( 1 − u ) ( … ) d u . Thus
Σ I N 3 b 2 = 2 ∫ 0 1 ( 1 − u ) u − f − 1 f u 2 d u
= 2 1 2 − 1 3 − f − 1 f 1 3 − 1 4 = f + 1 6 f .
For distinct bridges,
Σ II N 3 b 2 = ∫ 0 1 ∫ 0 1 x ( 1 − x ) + y ( 1 − y ) + ( x − y ) 2 f d x d y
= 1 6 + 1 6 + 1 f 1 3 + 1 3 − 2 · 1 4 = 2 f + 1 6 f .
These are the evaluated same- and different-bridge integrals used in Paper I. Appendix E reproduces the different-bridge integral in that paper’s oppositely oriented coordinates, including the Jacobian and the integration domain.

4.5. Recovering Equations (14) and (15) of Paper I

There are f same-bridge terms and f ( f − 1 ) ordered different-bridge terms. The explicit assembly is
R g 2 = f Σ I + f ( f − 1 ) Σ II 2 ( f N ) 2
= N b 2 12 f 2 ( f + 1 ) + ( f − 1 ) ( 2 f + 1 )
= N b 2 12 f 2 ( 2 f 2 ) = N b 2 6 .
For f = 1 the distinct-bridge contribution is omitted and the same result follows from Σ I . Division by the continuum reference chain of length f N gives
g = N b 2 / 6 f N b 2 / 6 = 1 f .
The correction is therefore local to the same-bridge intermediate expression; the final formulas being recovered are unchanged.

5. Unequal Bridges and Mass Weighting

5.1. Common Statistical Segment Length

Now let bridge e contain N e > 0 segment units, let b be common, and write L = ∑ e N e . Assume the same mass per statistical segment, so the bridge mass fractions are w e = N e / L . Multiplying endpoint propagators gives
Q R ≡ R 2 = b 2 ∑ e N e − 1 .
The independent bridge fluctuations have J e 2 = N e b 2 / 12 . Because every mean path is x R when expressed in its own fractional coordinate,
r 2 ¯ = Q R 3 + b 2 6 L ∑ e N e 2 , r cm 2 = Q R 4 + b 2 12 L 2 ∑ e N e 3 .
Consequently,
R g 2 = b 2 12 ∑ e N e − 1 + b 2 6 L ∑ e N e 2 − b 2 12 L 2 ∑ e N e 3 .
This formula has been obtained directly from the bridge covariance. It is consistent with the general covariance and resistance description of Gaussian networks [4]; no equal-subdivision theorem is needed for the unequal lengths used here. Its contraction factor, with the same uniform segment mass and common b, is
g = 1 2 L ∑ e N e − 1 + ∑ e N e 2 L 2 − ∑ e N e 3 2 L 3 .
It reduces to 1 / f when all N e are equal. For f = 1 , it gives R g 2 = N 1 b 2 / 6 . For f = 2 , writing a = N 1 , c = N 2 gives
R g 2 b 2 = a c 12 ( a + c ) + a 2 + c 2 6 ( a + c ) − a 3 + c 3 12 ( a + c ) 2 = a + c 12 .
Thus splitting a uniform ring into two arbitrarily labeled arcs does not change its size. For f ≥ 3 the individual bridge lengths generally matter.

5.2. Small Differences Between Bridge Lengths

Equation (36) gives the response to a redistribution of contour length without requiring a separate model. Keep f and L fixed and write
N e = L f ( 1 + ε e ) , ∑ e ε e = 0 , ρ = max e | ε e | ≪ 1 .
Let S k = ∑ e ε e k . The three terms in Equation (36) can be expanded separately:
1 2 L ∑ e N e − 1 = 1 2 f ( f + S 2 − S 3 + O ( ρ 4 ) ) = 1 2 f 2 − S 2 − S 3 2 f 3 + O ( ρ 4 ) , ∑ e N e 2 L 2 = f + S 2 f 2 , ∑ e N e 3 2 L 3 = f + 3 S 2 + S 3 2 f 3 .
The terms linear in the length changes vanish because total length is fixed, and the cubic terms cancel. Thus
g = 1 f + f − 2 f 3 ∑ e ε e 2 + O ( ρ 4 ) .
For f > 2 , equal lengths give a strict local minimum of g under small redistributions of contour length. This is a local statement, not a claim about all possible length distributions. For f = 2 , the exact ring result makes g = 1 / 2 for every division into two arcs.

5.3. Different Gaussian Variances and Masses

We can also allow the statistical segment length and the mass per segment to differ between bridges. Suppose bridge e is homogeneous along its own contour but has free end-to-end variance q e = N e b e 2 and mass fraction w e > 0 , with ∑ e w e = 1 . Uniform mass density within each bridge is assumed; w e need not equal N e / ∑ N e . Then
Q R = ∑ e q e − 1 − 1 , J e 2 = q e 12 ,
where J e = ∫ 0 1 η e ( x ) d x and the fluctuation covariance is q e [ min ( x , y ) − x y ] on bridge e. There are no additional junction point masses in this continuum observable. With A at the origin,
r cm = ∑ e w e ∫ 0 1 r e ( N e x ) d x = R 2 + ∑ e w e J e .
Independence of the bridge fluctuations and of R gives
r 2 ¯ = Q R 3 + 1 6 ∑ e w e q e , r cm 2 = Q R 4 + 1 12 ∑ e w e 2 q e .
The first average weights each bridge once; the second squares its weight because the center of mass is an average of the positions. Subtracting yields
R g 2 = Q R 12 + 1 6 ∑ e w e q e − 1 12 ∑ e w e 2 q e .
The first term is set by the junction separation. The second is the mass average of the bridge fluctuations, and the last subtracts their contribution to the motion of the center of mass. Using w e = N e / L and common b recovers Equation (35). When the segment lengths or segment masses differ, a contraction factor is defined only after specifying the linear reference, its mass distribution, and its segment variances.
For equal q e = q but arbitrary bridge mass fractions, the same result has the particularly simple form
R g 2 = q 6 − q 12 ∑ e w e − 1 f 2 .
Changing the mass weighting at fixed spring statistics therefore has a different effect from redistributing contour length with a common mass per segment. In the former case, the configuration measure is unchanged; only the observable and its center of mass are changed.
If the Gaussian segment variance varies within a bridge, its conditional mean need not be linear in the original contour coordinate, and its covariance must be obtained with that varying variance. Variation of mass density alone leaves the configurational covariance unchanged but changes the contour averages. In either case the actual mass distribution must be used in the definition of the observable. The chains remain Gaussian and are allowed to cross.

6. Exact Finite Bead-Spring Chains

6.1. Closed Formula and Bead-Count Convention

Let N ≥ 1 be an integer and f ≥ 1 . Every bridge has N identical Gaussian springs. There are N − 1 interior beads per bridge and two shared junction beads, all with the same mass:
n = f ( N − 1 ) + 2 .
The f N springs and the n beads are different counts. In particular, a linear reference with the same total mass and the same mass per bead has n beads and n − 1 springs. This is the convention of Equations (16)–(18) of Paper I, with its N t equal to our n. The formula below is an analytical evaluation of the static spectral sum used for the finite-chain comparison in Figure 3 of that paper. The derivation uses the finite Gaussian measure directly and requires no numerical eigenvalues.
The finite corrections describe discrete mass averaging and the counting of shared junctions within this specified Gaussian spring model. They do not include the bending stiffness, finite extensibility, or excluded-volume effects that can also matter for short real chains.
The exact mean-square size is
R g 2 ( N , f ) b 2 = N 4 f − N ( N 2 − 1 ) 12 n 2 + ( f − 1 ) ( N 2 − 1 ) ( 2 n − N ) 12 n 2 = N 4 f + ( N 2 − 1 ) [ 2 ( f − 1 ) n − f N ] 12 n 2 .
This compact expression is equivalent to the expanded formula
R g 2 ( N , f ) b 2 = P ( N , f ) 6 f n 2 , P ( N , f ) = N 3 f 3 − N 2 f ( f 2 − 4 ) − N ( f 3 − 3 f 2 + 6 f − 6 ) + f ( f − 1 ) ( f − 2 ) .
The covariance derivation below establishes this expression directly. Appendix C gives a derivation by counting forests. It is also the two-junction specialization of Theorem 2 of Cantarella et al. [5]. Appendix F shows that reduction and distinguishes the theorem from a misprint in the polynomial displayed in their multi-theta example.

6.2. Derivation from Discrete Bridge Covariances

Index interior beads on a bridge by j = 1 , … , N − 1 . With A fixed at the origin and B at R ,
r e , j = j N R + η e , j , η e , j · η e ′ , k = δ e e ′ b 2 min ( j , k ) − j k N , R 2 = N b 2 f .
The endpoint weight is unchanged by counting junction mass in the observable; the mass affects the center of mass, not this configurational Gaussian measure.
The coefficient of R in the sum over all bead positions is 1 + f ∑ j = 1 N − 1 j / N = 1 + f ( N − 1 ) / 2 = n / 2 . Hence
r cm = R 2 + 1 n ∑ e ∑ j = 1 N − 1 η e , j .
The required finite sums are
∑ j = 1 N − 1 j 2 N 2 = ( N − 1 ) ( 2 N − 1 ) 6 N , ∑ j = 1 N − 1 j − j 2 N = N 2 − 1 6 , ∑ j , k = 1 N − 1 min ( j , k ) − j k N = N ( N 2 − 1 ) 12 .
For the last identity, ∑ j , k min ( j , k ) = ∑ r = 1 N − 1 ( N − r ) 2 = N ( N − 1 ) ( 2 N − 1 ) / 6 , and N − 1 ( ∑ j j ) 2 = N ( N − 1 ) 2 / 4 ; their difference gives the stated result.
Including B once in the squared-position sum and A once with zero position,
1 n ∑ i r i 2 = R 2 n 1 + f ( N − 1 ) ( 2 N − 1 ) 6 N + f b 2 ( N 2 − 1 ) 6 n , r cm 2 = R 2 4 + f b 2 N ( N 2 − 1 ) 12 n 2 .
Subtracting yields
R g 2 b 2 = N f 1 n 1 + f ( N − 1 ) ( 2 N − 1 ) 6 N − 1 4 + f ( N 2 − 1 ) 6 n − f N ( N 2 − 1 ) 12 n 2 .
Substitution of n = f ( N − 1 ) + 2 reduces Equation (47) to Equation (43). This proves the finite result without a spectral sum or a combinatorial enumeration.

6.3. Contraction Factor and Limiting Cases

A free linear chain of n equal-mass beads has pair distances b 2 | i − j | . Its exact radius is
R g , linear , n 2 = b 2 n 2 ∑ k = 1 n − 1 ( n − k ) k = b 2 ( n 2 − 1 ) 6 n .
Thus
g ( N , f ) = P ( N , f ) f ( n − 1 ) n ( n + 1 ) .
Subtracting the continuum contraction factor and factoring the numerator gives
g ( N , f ) − 1 f = ( N − 1 ) ( f − 1 ) ( f − 2 ) ( 2 n − 1 ) f ( n − 1 ) n ( n + 1 ) .
For f > 2 and N > 1 , every factor on the right-hand side is positive. Thus the finite-chain contraction factor lies strictly above 1 / f . At N = 1 it equals 1 / f , and it returns to that value as N → ∞ . Its dependence on the integer subdivision number therefore cannot be monotone over the full range N ≥ 1 . This conclusion follows from the exact factorization, without a plot or an eigenvalue calculation.
The remaining limiting cases are:
  • For f = 1 , the graph is a linear chain with n = N + 1 : R g 2 = b 2 N ( N + 2 ) / [ 6 ( N + 1 ) ] and g = 1 .
  • For f = 2 , the graph is a ring with n = 2 N : R g 2 = b 2 ( 4 N 2 − 1 ) / ( 24 N ) and g = 1 / 2 for every N. The N = 1 case is the two-vertex multigraph with two parallel springs.
  • For N = 1 , there are only two beads joined by f parallel springs: R 2 = b 2 / f , R g 2 = b 2 / ( 4 f ) , and g = 1 / f .
The continuum ring value is consistent with the classical Gaussian-ring result [9].
At fixed f, expansion of the exact formulas gives
R g 2 ( N , f ) N b 2 = 1 6 1 + ( f − 2 ) 2 f 2 N + O ( N − 2 ) , g ( N , f ) = 1 f + 2 ( f − 1 ) ( f − 2 ) f 3 N + O ( N − 2 ) .
The leading correction to the mean-square size vanishes for the ring, whereas the correction to g vanishes for both the linear chain and the ring. These statements use equal bead masses, with each shared junction counted once.

6.4. Junction Masses and the Meaning of Exact Independence

The equal-bead result uses a particular mass distribution. To separate that choice from the configuration measure, assign mass one to every interior bead and masses μ A , μ B ≥ 0 to the junctions. The total mass and the coefficient of R in the center of mass are
M = f ( N − 1 ) + μ A + μ B > 0 , c R = μ B + f ( N − 1 ) / 2 M .
The Gaussian measure and R 2 = N b 2 / f are unchanged. The mass-weighted squared-position average and center-of-mass variance follow from the same finite sums as above:
r 2 ¯ = N b 2 f M μ B + f ( N − 1 ) ( 2 N − 1 ) 6 N + f b 2 ( N 2 − 1 ) 6 M ,
r cm 2 = N b 2 f c R 2 + f b 2 N ( N 2 − 1 ) 12 M 2 .
Their difference is
R g 2 b 2 = N f μ B + f ( N − 1 ) ( 2 N − 1 ) / ( 6 N ) M − c R 2 + f ( N 2 − 1 ) 6 M − f N ( N 2 − 1 ) 12 M 2 .
Setting both junction masses to one recovers Equation (43). Here mass changes the gyration observable, not the spring energy or the endpoint distribution.
An instructive alternative counts the positions j = 1 , … , N once for each bridge. Then A is unweighted and the common endpoint B has weight f: μ A = 0 , μ B = f , and M = f N . The weighted center of mass has c R = ( N + 1 ) / ( 2 N ) . Explicitly,
r 2 ¯ = b 2 ( N + 1 ) ( 2 N + 1 ) 6 f N + b 2 ( N 2 − 1 ) 6 N , r cm 2 = b 2 ( N + 1 ) 2 4 f N + b 2 ( N 2 − 1 ) 12 f N .
The numerator of the difference between the terms proportional to 1 / f is
2 ( N + 1 ) ( 2 N + 1 ) − 3 ( N + 1 ) 2 − ( N 2 − 1 ) = 0 .
Consequently,
R g , one end 2 = b 2 ( N 2 − 1 ) 6 N .
This is independent of f at every N and equals the size of a free linear chain of N unit-mass beads. The convention specifies a weighted observable on the same network; it does not introduce additional physical junction beads. Interchanging A and B gives the same size.
To show that the distribution of junction mass matters, keep their combined mass equal to f and set μ A = f a , μ B = f ( 1 − a ) , with 0 ≤ a ≤ 1 . Substitution into Equation (55) gives
R g 2 = b 2 ( N 2 − 1 ) 6 N + b 2 a ( 1 − a ) f N .
For a fixed mass fraction a, the additional term vanishes only when all junction mass is assigned to one end. An equal split gives the additional contribution b 2 / ( 4 f N ) .
Independence of the mean-square size from f must also be distinguished from a finite-chain contraction factor equal to 1 / f . If the reference for Equation (56) is a free linear chain of f N unit-mass beads, so that total mass is the same, then
g one end = f ( N 2 − 1 ) f 2 N 2 − 1 , g one end − 1 f = − f 2 − 1 f ( f 2 N 2 − 1 ) .
Here f N > 1 is required for a nonzero reference radius. For f > 1 this ratio tends to 1 / f only in the long-chain limit. Thus the mass convention can remove the f-dependence of the size without removing finite-chain corrections to the contraction factor. These examples make explicit the observable conventions needed when comparing discrete versions of bridge-number independence, including the multi-theta results of Uehara and Deguchi [3].

7. Conclusions

For Gaussian bridged rings with equal bridges and freely fluctuating junctions, the continuum mean-square radius of gyration is N b 2 / 6 . The contraction factor relative to a linear chain of the same total contour mass is 1 / f . This established result follows directly when the junction separation and the fluctuations within each bridge are separated. The contribution from the junction separation is cancelled by the corresponding subtraction for the fluctuating center of mass. The parallel-axis form expresses the same cancellation as a balance between the internal size of the bridges and the dispersion of their centers.
The resistance calculation supplies the complete pair integrations behind Equations (14) and (15) of Paper I. It replaces f − 2 by f − 1 in the same-bridge expression while retaining f − 2 in the different-bridge reduction. The final size and contraction formulas of Paper I are unchanged. The additional derivations in the appendices connect this calculation to star closure, the spectrum of the continuum operator, and counts of spanning forests.
Unequal bridge lengths change both the junction variance and the mass averages of the bridge fluctuations. At fixed total contour length, weak length inequality increases the contraction factor to quadratic order for more than two bridges. A redistribution of mass at fixed Gaussian spring statistics is a different operation and changes only the observable. The explicit formulas keep these effects separate.
For finite chains, the size formula with each junction counted once agrees with the general equal-subdivision theorem and gives the exact evaluation of the static spectral sum used in Paper I. The factored difference from the continuum contraction factor fixes the sign of the finite correction and establishes nonmonotonic dependence over the full subdivision range for more than two bridges. Alternative junction weights can make the mean-square size exactly independent of the number of bridges, but the contraction factor still depends on its finite linear reference. The distinction disappears at leading order in the long-chain limit. All these statements concern the specified Gaussian equilibrium measure and mass distribution, with unrestricted chain crossing.

Author Contributions

Conceptualization, methodology, formal analysis, writing—original draft preparation, and writing—review and editing, Y.W. The author has read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

This work contains analytical derivations. No datasets were generated or analysed.

Acknowledgments

Claude (Anthropic) was used for algebraic checking. ChatGPT (OpenAI) was used to assist with the derivations, reference audit, text revision, and preparation of the LaTeX files. Responsibility for the manuscript remains with the author.

Conflicts of Interest

The author declares no conflict of interest.

Appendix A. Closing the Ends of a Gaussian Star

The same network can be formed by joining the free ends of a star polymer. This construction allows us to calculate how much of the star’s size is lost on closure. Because the chain statistics are Gaussian, the motions removed by closure can be separated from the motions that remain.

Appendix A.1. The Size of the Unconstrained Star

Take f independent Brownian arms of contour length N with their common origin at A. Their endpoints R e satisfy R e 2 = q . The mean-square position averaged along any arm is ∫ 0 1 q x d x = q / 2 . An arm’s mean position has variance
q ∫ 0 1 ∫ 0 1 min ( x , y ) d x d y = q 3 .
Independence of different arms therefore gives
R g , star 2 = q 2 − q 3 f = q ( 3 f − 2 ) 6 f , g star = 3 f − 2 f 2 ,
the classical equal-arm result [1].

Appendix A.2. The Change in Size on Closing the Star

Write the free arm as W e ( x ) = x R e + η e ( x ) , where its endpoint R e is independent of the fluctuation η e . To form the bridged network, impose R e = R 1 for e = 2 , … , f . Define the mean endpoint and its deviations by
R ¯ = 1 f ∑ e R e , Δ e = R e − R ¯ , ∑ e Δ e = 0 .
The independent, equal-variance Gaussian endpoints give
| R ¯ | 2 = q f , Δ e 2 = q 1 − 1 f , R ¯ · Δ e = 0 .
Thus R ¯ is independent of all the Δ e . The free-star path separates into two independent parts:
W e ( x ) = x R ¯ + η e ( x ) ︸ r e c ( x ) + x Δ e ︸ u e ( x ) .
The first part has common endpoints and exactly the distribution of the bridged network. The second part describes the endpoint differences removed on closure. Conditioning the endpoints to coincide sets this second part to zero and leaves the first part unchanged.
The squared radius of gyration is a quadratic function of the positions. The two parts in Equation (A2) have zero mean and are independent, so their cross term has zero average. Consequently,
R g , star 2 = R g , bridged 2 + S g 2 [ u ] .
The center of mass of u is zero because ∑ e Δ e = 0 . Its contribution to the gyration is therefore
S g 2 [ u ] = 1 f ∑ e ∫ 0 1 x 2 Δ e 2 d x = q 3 1 − 1 f .
Subtracting this from Equation (A1) gives
R g , bridged 2 = q 2 − q 3 f − q 3 1 − 1 f = q 6 .
For f = 1 there is no closure constraint; for f = 2 the two arms form a ring. This calculation uses continuous contour mass, for which a single endpoint has zero mass. Identifying discrete end beads also changes the mass counting, as discussed in Section 6.

Appendix B. Normal-Mode Derivation

Appendix B.1. From Gaussian Covariance to a Spectral Trace

For the finite graph in Equation (19), choose the origin at the center of mass, so ∑ i r i = 0 . Diagonalizing K gives one translational zero eigenvalue and n − 1 positive eigenvalues. Each Cartesian normal coordinate with eigenvalue λ p has variance b 2 / ( 3 λ p ) . Therefore
R g 2 = b 2 n tr K + = b 2 n ∑ p = 1 n − 1 1 λ p .
This graph formulation of Gaussian molecular statistics is well established [4,7,10,11]. Equation (A5) is Equation (16) of Paper I in the notation N t = n . Its “Zimm matrix” is the connectivity matrix K defined in Section 4. Equation (19) of Paper I uses the eigenvalues for relaxation times; that dynamical relation is not needed for the equilibrium size. Section 6 evaluates the static sum in closed form through discrete bridge covariances, and Appendix C does so through forest counts.
In the continuum, the modes are functions along the bridges. Their normalization uses the contour integral ∑ e ∫ 0 N ϕ e ( s ) ψ e ( s ) d s . The connectivity matrix is replaced by the operator − d 2 / d s 2 . At each junction, all bridges have the same displacement and the sum of their outward derivatives vanishes. They are the natural boundary conditions of the Gaussian quadratic form with no additional vertex term [12]. For smooth functions ϕ and ψ that are continuous at the junctions, integration by parts gives
∑ e ∫ 0 N ϕ e ′ ( s ) ψ e ′ ( s ) d s = ∑ e ∫ 0 N [ − ϕ e ′ ′ ( s ) ] ψ e ( s ) d s + ∑ e [ ϕ e ′ ( N ) ψ e ( N ) − ϕ e ′ ( 0 ) ψ e ( 0 ) ] .
The two common junction values of ψ can be varied independently. The boundary term therefore vanishes when ∑ e ϕ e ′ ( 0 ) = ∑ e ϕ e ′ ( N ) = 0 , equivalently when the sum of outward derivatives at each junction vanishes. These conditions apply to the operator eigenfunctions. They do not require an individual Brownian conformation to have ordinary tangents or to satisfy instantaneous mechanical force balance.
To see the normalization explicitly, expand each Cartesian coordinate in modes normalized to unit contour integral. A mode of eigenvalue λ contributes 3 λ a 2 / ( 2 b 2 ) to the energy in units of k B T , so a 2 = b 2 / ( 3 λ ) . Summing the three Cartesian contributions and dividing by L = f N gives
R g 2 = b 2 L ∑ λ > 0 m λ λ ,
where m λ is the number of independent modes with that eigenvalue. The constant mode translates the molecule and is omitted. The continuum modes differ from the modes of a finite bead chain; Equation (A5) must be used for that finite model.

Appendix B.2. Eigenvalues and Their Multiplicities

On edge e, a positive-eigenvalue solution has the form ϕ e ( s ) = a e cos ( k s ) + d e sin ( k s ) . At A, the continuity and derivative conditions require
a e = a for all e , ∑ e d e = 0 .
At B, the derivative condition reduces to − f a sin ( k N ) + cos ( k N ) ∑ e d e = 0 . If sin ( k N ) ≠ 0 , continuity at B makes all the d e equal; their sum then forces them to vanish, and the remaining derivative condition forces a = 0 . There is no nonzero eigenfunction in that case. Consequently,
k p = p π N , λ p = p π N 2 , p = 1 , 2 , … .
At each such p, one cosine mode common to all bridges and f − 1 sine modes whose amplitudes sum to zero are allowed. More explicitly, take orthonormal vectors v ( α ) ∈ R f with ∑ e v e ( α ) = 0 . An orthonormal basis for the eigenspace is
ϕ p , e ( 0 ) ( s ) = 2 f N cos p π s N , ϕ p , e ( α ) ( s ) = 2 N v e ( α ) sin p π s N , α = 1 , … , f − 1 .
Thus every positive continuum eigenvalue has multiplicity f. This statement concerns the differential operator; it is not a claim about the multiplicities of the finite connectivity matrix. The only zero mode is the globally constant function: a zero-eigenvalue linear solution must have common slope on all edges, and the derivative condition sets that slope to zero.
Substitution into Equation (A6) yields
R g 2 = b 2 f N ∑ p = 1 ∞ f N 2 p 2 π 2 = N b 2 π 2 π 2 6 = N b 2 6 .
There are f modes for each positive eigenvalue and f N segments in total. Their ratio gives the same mean-square size as a single free chain of length N.

Appendix C. Counting Trees and Forests

Appendix C.1. Extension of the Kramers Expression to Rings

For a Gaussian tree of n beads, removing a bond splits the tree into pieces of sizes n 1 and n 2 . The Kramers expression is R g 2 = ( b 2 / n 2 ) ∑ bonds n 1 n 2 [13]. For a graph with cycles, a single cut generally does not disconnect the graph. We instead count ways of retaining all beads in two connected pieces, with no ring in either piece. Each such choice of retained springs is a spanning two-forest. A spanning tree retains all beads in one connected piece without a ring.
Let τ ( G ) be the number of spanning trees and define
F 2 ( G ) = ∑ F = T 1 ∪ T 2 | T 1 | | T 2 | ,
where | T 1 | and | T 2 | are the numbers of beads in the two pieces. Each choice of retained springs is counted once; interchanging the names of the pieces does not give another forest. The factor | T 1 | | T 2 | counts pairs of beads in different pieces. The matrix-tree and matrix-forest coefficient identities [14,15] give
det ( t I + K ) = n τ ( G ) t + F 2 ( G ) t 2 + … .
The factor n counts the possible choices of a root in a spanning tree. For a forest with two pieces, choosing one root in each gives | T 1 | | T 2 | choices. These are the weights in the two coefficients. On the other hand, det ( t I + K ) = t ∏ p = 1 n − 1 ( t + λ p ) . The ratio of the t 2 and t coefficients is therefore ∑ p 1 / λ p . Equation (A5) becomes
R g 2 = b 2 F 2 ( G ) n 2 τ ( G ) .
For a tree τ = 1 and every spanning two-forest is obtained by removing one bond, which recovers the Kramers sum. This is an exact finite-graph identity. The combinatorial step avoids explicit eigenvalue evaluation, but its connection to polymer size still uses Gaussian covariance.

Appendix C.2. Counting the Two Kinds of Forest

Take f paths of N edges each, so n = f ( N − 1 ) + 2 . Parallel edges are distinct edges when N = 1 . A spanning tree must keep exactly one complete A–B path; every other path must be cut exactly once, or a cycle or disconnected interior component would remain. Hence
τ ( G ) = f N f − 1 .
There are precisely two types of spanning two-forest.
Type A: the junctions are in different components. Every bridge is cut once. Let a e = 0 , … , N − 1 be the number of its interior vertices retained on the A side of the cut. The A-component size is V A = 1 + ∑ e a e . Averaging over the N f equally numerous cut choices gives
E V A = n 2 , Var ( V A ) = f ( N 2 − 1 ) 12 .
Therefore
F A = N f E [ V A ( n − V A ) ] = N f n 2 4 − f ( N 2 − 1 ) 12 .
Type B: the junctions are in the same component. Exactly one bridge remains intact, one different bridge has two cuts, and all remaining bridges have one cut. The two cuts isolate an internal component of u = 1 , … , N − 1 vertices. There are N − u pairs of cut positions for this u. Consequently,
F B = f ( f − 1 ) N f − 2 ∑ u = 1 N − 1 ( N − u ) u ( n − u ) ,
∑ u = 1 N − 1 ( N − u ) u ( n − u ) = N ( N 2 − 1 ) ( 2 n − N ) 12 .
The second equality follows by expanding the summand as N n u − ( N + n ) u 2 + u 3 and using the standard sums of first, second, and third powers. The total is F 2 = F A + F B . Type B is absent for f = 1 or N = 1 .
These cases exhaust the possibilities: when the junctions are separated there can be no intact path; when they are together an acyclic spanning subgraph can have exactly one intact path, and its second component must be one isolated internal segment.

Appendix C.3. Long-Chain Asymptotics

For fixed f and large N, n = f N + O ( 1 ) . The exact counts yield
F A = N f + 2 f 2 4 − f 12 + O ( N f + 1 ) , F B = f ( f − 1 ) N f + 2 f 6 − 1 12 + O ( N f + 1 ) , F 2 = f 3 6 N f + 2 + O ( N f + 1 ) .
Using Equation (A10) and τ = f N f − 1 ,
R g 2 = N b 2 6 + O ( b 2 ) , R g 2 N b 2 ⟶ 1 6 .
The continuum result is the leading term of the exact counting formula for fixed f and fixed b. Retaining all terms gives Equation (43). A continuum refinement at fixed bridge variance q instead scales b 2 = q / N ; the remainder is then O ( q / N ) and the mean-square size tends to q / 6 .

Appendix D. The Wheatstone Resistance in Full

Use the normalized resistance labels in Figure 1c. Assume first that all h i > 0 . Replace the triangle ( a , A , B ) by a star with central node o and set D = h 1 + h 3 + h 5 . The delta–star transformation is
h a o = h 1 h 3 D , h A o = h 1 h 5 D , h B o = h 3 h 5 D .
These values follow by matching the three pairwise resistances seen from the triangle’s terminals. The transformed network is h a o in series with two parallel routes to b, giving
ρ a b = h 1 h 3 D + ( h 1 h 5 + h 2 D ) ( h 3 h 5 + h 4 D ) D [ h 5 ( h 1 + h 3 ) + D ( h 2 + h 4 ) ] .
Since
h 5 ( h 1 + h 3 ) + D ( h 2 + h 4 ) = h 5 ( h 1 + h 2 + h 3 + h 4 ) + ( h 1 + h 3 ) ( h 2 + h 4 ) ,
putting the two terms over a common denominator and cancelling D gives
ρ a b = h 5 ( h 1 + h 2 ) ( h 3 + h 4 ) + h 1 h 2 ( h 3 + h 4 ) + h 3 h 4 ( h 1 + h 2 ) h 5 ( h 1 + h 2 + h 3 + h 4 ) + ( h 1 + h 3 ) ( h 2 + h 4 ) .
The identity can also be checked by multiplying out both numerators. The four terms independent of h 5 are all four triple products of h 1 , h 2 , h 3 , h 4 . Two electrical limits check the connectivity:
h 5 → ∞ : ρ a b ⟶ ( h 1 + h 2 ) ( h 3 + h 4 ) h 1 + h 2 + h 3 + h 4 , h 5 → 0 : ρ a b ⟶ h 1 h 3 h 1 + h 3 + h 2 h 4 h 2 + h 4 .
The first removes the A–B edge and leaves two paths in parallel. The second identifies A with B and leaves two parallel pairs in series. Multiplication by q converts ρ a b into H II . Vanishing end segments are covered by continuous limits.

Appendix E. The Coordinates and Double Integral Used in Paper I

Unlike the common-A convention in the main text, Paper I measures the second point from B. Write its coordinate as y P = 1 − y and set
z = x + y P , w = x − y P , x = z + w 2 , y P = z − w 2 .
The absolute Jacobian is 1 / 2 . The unit square becomes the diamond
− 1 ≤ w ≤ 1 , | w | ≤ z ≤ 2 − | w | .
The resistances are now h 1 = x , h 3 = 1 − x , h 2 = 1 − y P , h 4 = y P , and h 5 = m = 1 / ( f − 2 ) for f > 2 . Equation (24) becomes
H II q = 2 m ( 1 − w 2 ) + 2 z − z 2 − w 2 2 + 4 m .
The integrand is even in w, so doubling the integral on 0 ≤ w ≤ 1 cancels the Jacobian 1 / 2 . Therefore
Σ II N 3 b 2 = 1 2 + 4 m ∫ 0 1 ∫ w 2 − w 2 m ( 1 − w 2 ) + 2 z − z 2 − w 2 d z d w .
The inner integral is
I ( w ) = 2 ( 1 − w ) [ 2 m ( 1 − w 2 ) − w 2 ] + 4 ( 1 − w ) − ( 2 − w ) 3 − w 3 3 .
The four contributions integrate to
4 m ∫ 0 1 ( 1 − w ) ( 1 − w 2 ) d w = 5 m 3 , − 2 ∫ 0 1 ( 1 − w ) w 2 d w = − 1 6 , 4 ∫ 0 1 ( 1 − w ) d w = 2 , − 1 3 ∫ 0 1 [ ( 2 − w ) 3 − w 3 ] d w = − 7 6 .
Their sum is ( 5 m + 2 ) / 3 , and hence
Σ II N 3 b 2 = 5 m + 2 6 ( 1 + 2 m ) = 2 f + 1 6 f .
Taking m → ∞ gives 5 / 12 for the ring, consistent with f = 2 in Equation (28). This also shows why the f − 2 denominator is correct for the different-bridge network.
For comparison, the same-bridge integral can be written in the original parallel-resistance form with α = 1 / ( f − 1 ) :
Σ I N 3 b 2 = 2 1 + α ∫ 0 1 ( 1 − u ) u ( 1 − u + α ) d u = 2 1 + α 1 12 + α 6 = 1 + 2 α 6 ( 1 + α ) = f + 1 6 f .
The f = 1 case is taken directly from H I = q u . Using the printed α = 1 / ( f − 2 ) would instead give f / [ 6 ( f − 1 ) ] for f > 2 , which is not the integral used in the final calculation of Paper I.

Appendix F. Reduction of the Published Finite-Subdivision Theorem

Theorem 2 of Cantarella et al. [5] applies when every edge of a connected base graph is replaced by the same number of Gaussian springs. For the present base graph there are two vertices, f parallel edges, and cycle rank f − 1 . Their subdivision number is our N, their vertex count is our n = f ( N − 1 ) + 2 , and their Cartesian variance convention gives d σ 2 = b 2 in three dimensions.
For N > 1 , both base vertices have the same weight ω = f + 2 / ( N − 1 ) . The weighted Laplacian and its positive eigenvalue are
K ω = 1 ω f − f − f f , λ + = 2 f ω , tr K ω + = ω 2 f = n 2 f ( N − 1 ) .
Their theorem therefore gives
R g 2 b 2 = N 2 − 1 2 n N N + 1 n 2 f ( N − 1 ) + f − 1 3 1 − 1 2 n − 1 6 1 − 1 n .
The first term is N / ( 4 f ) . The remaining terms combine to
N 2 − 1 12 n 2 ( 2 f − 3 ) n − f + 2 = N 2 − 1 12 n 2 2 ( f − 1 ) n − f N ,
where the last equality uses n = f ( N − 1 ) + 2 . This proves agreement with Equation (43). The case N = 1 , for which the intermediate weight ω is singular, is obtained directly from the two-bead network.
The expanded numerator in Equation (44) is also the one obtained from this theorem. In the displayed multi-theta example on page 14 of the published article [5], the coefficient of N and the constant term in that numerator are interchanged after mapping its notation to ours. Denoting the printed numerator by P printed , direct subtraction gives
P printed − P = 2 ( N − 1 ) ( f 3 − 3 f 2 + 4 f − 3 ) .
This discrepancy concerns the printed example, not the general theorem. Equations (43) and (44) follow both from the specialization above and from the two derivations in the present manuscript.

References

  1. Zimm, B.H.; Stockmayer, W.H. The Dimensions of Chain Molecules Containing Branches and Rings. J. Chem. Phys. 1949, 17, 1301–1314. [CrossRef]
  2. Zhu, L.; Wang, X.; Li, J.; Wang, Y. Radius of Gyration, Mean Span, and Geometric Shrinking Factors of Bridged Polycyclic Ring Polymers. Macromol. Theory Simul. 2016, 25, 482–496. [CrossRef]
  3. Uehara, E.; Deguchi, T. Statistical properties of multi-theta polymer chains. J. Phys. A: Math. Theor. 2018, 51, 134001. [CrossRef]
  4. Cantarella, J.; Deguchi, T.; Shonkwiler, C.; Uehara, E. Radius of gyration, contraction factors, and subdivisions of topological polymers. J. Phys. A: Math. Theor. 2022, 55, 475202. [CrossRef]
  5. Cantarella, J.; Deguchi, T.; Shonkwiler, C.; Uehara, E. An exact formula for the contraction factor of a subdivided Gaussian topological polymer. J. Phys. A: Math. Theor. 2025, 58, 355201. [CrossRef]
  6. Karatzas, I.; Shreve, S.E. Brownian Motion and Stochastic Calculus, 2nd ed.; Springer: New York, NY, USA, 1998. [CrossRef]
  7. Eichinger, B.E. Configuration Statistics of Gaussian Molecules. Macromolecules 1980, 13, 1–11. [CrossRef]
  8. Klein, D.J.; Randić, M. Resistance Distance. J. Math. Chem. 1993, 12, 81–95. [CrossRef]
  9. Casassa, E.F. Some Statistical Properties of Flexible Ring Polymers. J. Polym. Sci. Part A 1965, 3, 605–614. [CrossRef]
  10. Forsman, W.C. Graph Theory and the Statistics and Dynamics of Polymer Chains. J. Chem. Phys. 1976, 65, 4111–4115. [CrossRef]
  11. Gurtovenko, A.A.; Blumen, A. Generalized Gaussian Structures: Models for Polymer Systems with Complex Topologies. Adv. Polym. Sci. 2005, 182, 171–282. [CrossRef]
  12. Berkolaiko, G.; Kuchment, P. Introduction to Quantum Graphs; Vol. 186, Mathematical Surveys and Monographs, American Mathematical Society: Providence, RI, USA, 2013. [CrossRef]
  13. Kramers, H.A. The Behavior of Macromolecules in Inhomogeneous Flow. J. Chem. Phys. 1946, 14, 415–424. [CrossRef]
  14. Kelmans, A.K.; Chelnokov, V.M. A Certain Polynomial of a Graph and Graphs with an Extremal Number of Trees. J. Combin. Theory Ser. B 1974, 16, 197–214. [CrossRef]
  15. Chaiken, S. A Combinatorial Proof of the All Minors Matrix Tree Theorem. SIAM J. Algebraic Discrete Methods 1982, 3, 319–329. [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.