Related papers: Factoring the Laplacian to understand topological …
Graphical models and factor analysis are well-established tools in multivariate statistics. While these models can be both linked to structures exhibited by covariance and precision matrices, they are generally not jointly leveraged within…
In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…
An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up…
We present a novel mechanism for resolving the mechanical rigidity of nanoscopic circular polymers that flow in a complex environment. The emergence of a regime of negative differential mobility induced by topological interactions between…
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…
Network inference is the process of deciding what is the true unknown graph underlying a set of interactions between nodes. There is a vast literature on the subject, but most known methods have an important drawback: the inferred graph is…
In this study, a versatile methodology for initiating polymerization from monomers in highly cross-linked materials is investigated. As polymerization progresses, force-field parameters undergo continuous modification due to the formation…
I propose to study the complex physics of topological phases by an all optical implementation of a discrete-time quantum walk. The main novel ingredient is the use of parametric amplifiers in the random network which can in turn be used to…
We consider the Grover walk on the infinite graph in which an internal finite subgraph receives the inflow from the outside with some frequency and also radiates the outflow to the outside. To characterize the stationary state of this…
We present event distributions for the polymer translocation obtained by extensive Langevin dynamics simulations. Such distributions have not been reported previously and they provide new understanding of the stochastic characteristics of…
The miscibility of polymer blends, a classical problem in polymer science, may be altered, if one or both of the component do not have chain ends. Based on the idea of {\it topological volume}, we propose a mean-field theory to clarify how…
The conformational statistics of ring polymers in melts or dense solutions is strongly affected by their quenched microscopic topological state. The effect is particularly strong for untangled (i.e. non-concatenated and unknotted) rings,…
We introduce a continuous-time random walk model on an infinite multilayer structure inspired by transportation networks. Each layer is a copy of $\mathbb{R}^d$, indexed by a non-negative integer. A walker moves within a layer by means of…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…
Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices…
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…
Topological constraints (TCs) between polymers determine the behaviour of complex fluids such as creams, oils and plastics. Most of the polymer solutions used every day life employ linear chains; their behaviour is accurately captured by…
Dynamical properties of a long polymer ring in a melt of unknotted and unconcatenated rings are calculated. We re-examine and generalize the well known model of a ring confined to a lattice of topological obstacles in the light of the…
We introduce the matrix sums that represent a discrete analog of the matrix models with quartic potential. The probability space is given by the set of all simple n-vertex graphs with the Gibbs weight determined by the graph Laplacian. We…
We provide a deterministic $\tilde{O}(\log N)$-space algorithm for estimating random walk probabilities on undirected graphs, and more generally Eulerian directed graphs, to within inverse polynomial additive error…