相关论文: Radius of Gyration, Contraction Factors, and Subdi…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
We study certain topological problems that are inspired by applications to autonomous robot manipulation. Consider a continuous map $f\colon X\to Y$, where $f$ can be a kinematic map from the configuration space $X$ to the working space $Y$…
We establish several contraction formulas for Kirchhoff index. We relate Kirchhoff index with some other metrized graph invariants. By applying our contraction formulas successively when the graph is a tree, we derive new formulas for…
Active contour models based on partial differential equations have proved successful in image segmentation, yet the study of their geometric formulation on arbitrary geometric graphs is still at an early stage. In this paper, we introduce…
We study structural properties of a ring polymeric melt confined in a film in comparison to a linear counterpart using molecular dynamics simulations. Local structure orderings of ring and linear polymers in the vicinity of the surface are…
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…
We address the mechanism of drag reduction by polymers in turbulent wall bounded flows. On the basis of the equations of fluid mechanics we present a quantitative derivation of the "maximum drag reduction (MDR) asymptote" which is the…
In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of graphs with generalized pockets in terms of the resistance distance and Kirchhoff index of the factor graph.
We build a new probability measure on closed space and plane polygons. The key construction is a map, given by Knutson and Hausmann using the Hopf map on quaternions, from the complex Stiefel manifold of 2-frames in n-space to the space of…
A metric probability space $M$ admits thresholds if the random geometric graph on $M$ has a threshold for every monotone graph property. We connect the existence of thresholds to the uniform expansion of $M$ and prove that all standard…
We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximum number of edge-disjoint $t$-cliques. The extremal graphs…
We investigate the Rouse dynamics of a flexible ring polymer with a prime knot. Within a Monte Carlo approach, we locate the knot, follow its diffusion, and observe the fluctuations of its length. We characterise a topological time scale,…
Entangled polymers are deformed by a strong shear flow. The shape of the polymer, called the form factor, is measured by small angle neutron scattering. However, the real-space molecular structure is not directly available from the…
We provide a formula for the partition function of five-dimensional $\mathcal{N}=1$ gauge theories on $\mathcal{M}_4 \times S^1$, topologically twisted along $\mathcal{M}_4$ in the presence of general background magnetic fluxes, where…
We introduce a two-dimensional lattice model for the description of knotted polymer rings. A polymer configuration is modeled by a closed polygon drawn on the square diagonal lattice, with possible crossings describing pairs of strands of…
We prove several new results about the topology of fibers of Gelfand--Zeitlin systems on unitary and orthogonal coadjoint orbits, at the same time finding a unifying framework recovering and shedding light on essentially all known results.…
Probabilistic models of directed polymers in random environment have received considerable attention in recent years. Much of this attention has focused on integrable models. In this paper, we introduce some new computational tools that do…
A convenient measure of a map or flow's chaotic action is the topological entropy. In many cases, the entropy has a homological origin: it is forced by the topology of the space. For example, in simple toral maps, the topological entropy is…
We study the passage (translocation) of a self-avoiding polymer through a membrane pore in two dimensions. In particular, we numerically measure the probability distribution Q(T) of the translocation time T, and the distribution P(s,t) of…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…