相关论文: Topological versus rheological entanglement length…
We present a braided circuit topology framework for investigating topology and structural phase transitions in aggregates of semiflexible polymers. In the conventional approach to circuit topology, which specifically applies to single…
We consider the scaling of entanglement entropy in random Projected Entangled Pairs States (PEPS) with an internal symmetry given by a finite group G. We systematically demonstrate a correspondence between this entanglement entropy and the…
As a technique to investigate link-level loss rates of a computer network with low operational cost, loss tomography has received considerable attentions in recent years. A number of parameter estimation methods have been proposed for loss…
Public databases of large-scale topology measures (e.g.RIPE Atlas) are very popular both in the research and in the practitioners communities. They are used, at least, for understanding the state of the Internet in real time, for outage…
The relationship between the plateau modulus (G_0) and the persistence length (L_p) of entangled semiflexible polymers is still uncertain. Some previous theoretical models have predicted that G_0 decreases with increasing L_p, while…
Cyclomatic complexity is an incompletely specified but mathematically principled software metric that can be usefully applied to both source and binary code. We consider the application of path homology as a stronger analogue of cyclomatic…
The interplay between non-trivial band topology and strong electronic correlations is a central challenge in modern condensed matter physics. We investigate this competition on a two-leg ladder model with a p-wave-like hybridisation between…
We present an extensive analysis of the relaxation dynamics of entangled linear polymer melts via long-time molecular dynamics simulations of a generic bead-spring model. We study the mean-squared displacements, the autocorrelation function…
Networks are important representations in computer science to communicate structural aspects of a given system of interacting components. The evolution of a network has several topological properties that can provide us information on the…
This article surveys some theoretical aspects of Cellular Automata (CAs) research. In particular, we discuss on maximal length CA. An n-cell CA is a maximal length CA, if all the configurations except one form a single cycle. There is a…
For various polymers with different topological structures we numerically evaluate the mean-square radius of gyration and the hydrodynamic radius systematically through simulation. We call polymers with nontrivial topology topological…
We describe a connection between entanglement and designs. It involves the conical 2-designs introduced in a previous paper. These are a generalization of projective 2-designs which includes full sets of arbitrary rank mutually unbiased…
The mechanics of complex soft matter often cannot be understood in the classical physical frame of flexible polymers or rigid rods. The underlying constituents are semiflexible polymers, whose finite bending stiffness ($\kappa$) leads to…
Persistent homology (PH) has been widely applied to graph data to extract topological features. However, little attention has been paid to how different distance functions on a graph affect the resulting persistence barcodes and their…
In the literature, there are a few researches to design some parameters in the Proximal Point Algorithm (PPA), especially for the multi-objective convex optimizations. Introducing some parameters to PPA can make it more flexible and…
We analyze the statistics of the shortest and fastest paths on the road network between randomly sampled end points. To a good approximation, these optimal paths are found to be directed in that their lengths (at large scales) are linearly…
In recent times some interesting field theoretical descriptions of the statistical mechanics of entangling polymers have been proposed by various authors. In these approaches, a single test polymer fluctuating in a background of static…
Topological Data Analysis (TDA) can broadly be described as a collection of data analysis methods that find structure in data. This includes: clustering, manifold estimation, nonlinear dimension reduction, mode estimation, ridge estimation…
One measure of geometrical complexity of a spatial curve is the number of crossings in a planar projection of the curve. For $N$-noded ring polymers with a fixed knot type, we evaluate numerically the average of the crossing number over…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…