Related papers: Trapping in dendrimers and regular hyperbranched p…
We derive an effective Maxwell-London equation for entangled polymer complex under the topological constraint, borrowing the theoretical framework from the topological field theory. We find that the transverse current flux of the test…
Entangled networks are ubiquitous in tissues, polymers, and fabrics. However, their mechanics remain insufficiently understood due to the complexity of the topological constraints at the network level. Here, we develop a mathematical…
Tree containment problem is a fundamental problem in phylogenetic study, as it is used to verify a network model. It asks whether a given network contain a subtree that resembles a binary tree. The problem is NP-complete in general, even in…
Treewidth and hypertree width have proven to be highly successful structural parameters in the context of the Constraint Satisfaction Problem (CSP). When either of these parameters is bounded by a constant, then CSP becomes solvable in…
We propose and study a model of polymer chains in a bilayer. Each chain is confined in one of the layers and polymer bonds on first neighbor edges in different layers interact. We also define and comment results for a model with…
Numerical studies of the reduced density matrix of a gapped spin-1/2 Heisenberg antiferromagnet on a two-leg ladder find that it has the same form as the Gibbs density matrix of a gapless spin-1/2 Heisenberg antiferromagnetic chain at a…
The theorem of Dekking and Host regarding tightness around the mean of first passage percolation on the binary tree, from the root to a boundary of a ball, is generalized to a class of graphs which includes all lattices in hyperbolic spaces…
Relatively general techniques for computing mean first-passage time (MFPT) of random walks on networks with a specific property are very useful, since a universal method for calculating MFPT on general graphs is not available because of…
We develop a theoretical description of the topological disentanglement occurring when torus knots reach the ends of a semi-flexible polymer under tension. These include decays into simpler knots and total unknotting. The minimal number of…
As a basic dynamic feature on complex networks, the property of random walk has received a lot of attention in recent years. In this paper, we first studied the analytical expression of the mean global first passage time (MGFPT) on the…
We study dynamic interplay between time-delay and velocity alignment in the ensemble of Cucker-Smale (C-S) particles(or agents) on time-varying networks which are modeled by digraphs containing spanning trees. Time-delayed dynamical systems…
We study two cross-linked polymer systems in the strong stretching regime. The first consists of two polymers sharing one endpoint, with the other two endpoints coupled by a harmonic potential. Within the weakly bending approximation, we…
Understanding how entanglements affect the behaviour of polymeric complex fluids is an open challenge in many fields. To elucidate the nature and consequence of entanglements in dense polymer solutions, we propose a novel method: a…
Extensive molecular simulations are applied to characterize the equilibrium dynamics, entanglement topology, and nonlinear extensional rheology of symmetric ring-linear polymer blends with systematically varied ring fraction $\phi_R$.…
Given a graph $G$ rooted at a vertex $r$ and weight functions, $\gamma, \tau: E(G) \rightarrow \mathbb{R}$, the generalized cable-trench problem (CTP) is to find a single spanning tree that simultaneously minimizes the sum of the total edge…
Indentation is a common experimental technique to study the mechanics of polymeric materials. The main advantage of using indentation is because this provides a direct correlation between the microstructure and the small-scale mechanical…
We have studied the conformational and scaling behaviors of a flexible dendrimer immersed in athermal or good solvents. A self-consistent field theory combined with a pre-averaged excluded volume potential representing the two-body…
We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A subset of nodes is selected according to some criterion. As a measure of…
We identify putatively maximally dense packings of tangent-sphere trimers with fixed bond angles ($\theta = \theta_0$) using a novel method, and contrast them to the disordered jammed states they form under quasistatic and dynamic athermal…
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tractable, in the sense that the posterior is also decomposable and…