Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.23929 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912391312179200 |
|---|---|
| author | Toit, Nadine du Müller-Nedebock, Kristian K. |
| author_facet | Toit, Nadine du Müller-Nedebock, Kristian K. |
| contents | A novel field theoretical approach towards modelling dynamic networking in complex systems is presented. An equilibrium networking formalism which utilises Gaussian fields is adapted to model the dynamics of particles that can bind and unbind from one another. Here, \textit{networking} refers to the introduction of instantaneous co-localisation constraints and does not necessitate the formation of a well-defined transient or persistent network. By combining this formalism with Martin-Siggia-Rose generating functionals, a weighted generating functional for the networked system is obtained. The networking formalism introduces spatial and temporal constraints into the Langevin dynamics, via statistical weights, thereby accounting for all possible configurations in which particles can be networked to one another. A simple example of Brownian particles which can bind and unbind from one another demonstrates the tool and that this leads to results for physical quantities in a collective description. Applying the networking formalism to model the dynamics of cross-linking polymers in a mixture, we can calculate the average number of networking instances. As expected, the dynamic structure factors for each type of polymer show that the system collapses once networking is introduced, but that the addition of a repulsive time-dependent potential above a minimum strength prevents this. The examples presented in this paper indicate that this novel approach towards modelling dynamic networking could be applied to a range of synthetic and biological systems to obtain theoretical predictions for experimentally verifiable quantities. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_23929 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Dynamical Networking using Gaussian fields Toit, Nadine du Müller-Nedebock, Kristian K. Soft Condensed Matter A novel field theoretical approach towards modelling dynamic networking in complex systems is presented. An equilibrium networking formalism which utilises Gaussian fields is adapted to model the dynamics of particles that can bind and unbind from one another. Here, \textit{networking} refers to the introduction of instantaneous co-localisation constraints and does not necessitate the formation of a well-defined transient or persistent network. By combining this formalism with Martin-Siggia-Rose generating functionals, a weighted generating functional for the networked system is obtained. The networking formalism introduces spatial and temporal constraints into the Langevin dynamics, via statistical weights, thereby accounting for all possible configurations in which particles can be networked to one another. A simple example of Brownian particles which can bind and unbind from one another demonstrates the tool and that this leads to results for physical quantities in a collective description. Applying the networking formalism to model the dynamics of cross-linking polymers in a mixture, we can calculate the average number of networking instances. As expected, the dynamic structure factors for each type of polymer show that the system collapses once networking is introduced, but that the addition of a repulsive time-dependent potential above a minimum strength prevents this. The examples presented in this paper indicate that this novel approach towards modelling dynamic networking could be applied to a range of synthetic and biological systems to obtain theoretical predictions for experimentally verifiable quantities. |
| title | Dynamical Networking using Gaussian fields |
| topic | Soft Condensed Matter |
| url | https://arxiv.org/abs/2503.23929 |