相关论文: Statistical Properties of Contact Maps

A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…

The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…

Map matching is a common task when analysing GPS tracks, such as vehicle trajectories. The goal is to match a recorded noisy polygonal curve to a path on the map, usually represented as a geometric graph. The Fr\'echet distance is a…

We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution…

This paper describes how realistic neuromorphic networks can have their connectivity properties fully characterized in analytical fashion. By assuming that all neurons have the same shape and are regularly distributed along the…

We study here the social network generated by the asynchronous visits, to a fixed set of sites, of mobile agents modelled as independent random walks on the plane lattice. The social network is constructed by assuming that a group of agents…

The nearest neighbor contacts between the two halves of an N-site lattice self-avoiding walk offer an unusual example of scaling random geometry: for N going to infinity they are strictly finite in number but their radius of gyration Rc is…

Recently designed biomolecular approaches to build single chain polypeptide polyhedra as molecular origami nanostructures have risen high interest in various double traces of the underlying graphs of these polyhedra. Double traces are walks…

We enumerate the number of RNA contact structures according to their genus, i.e. the topological character of their pseudoknots. By using a recently proposed matrix model formulation for the RNA folding problem, we obtain exact results for…

We construct graphs (trees of bounded degree) on which the contact process has critical rate (which will be the same for both global and local survival) equal to any prescribed value between zero and $\lambda_c(\mathbb{Z})$, the critical…

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

In the last twenty years network science has proven its strength in modelling many real-world interacting systems as generic agents, the nodes, connected by pairwise edges. Yet, in many relevant cases, interactions are not pairwise but…

In probability theory, reinforced walks are random walks on a lattice (or more generally a graph) that preferentially revisit neighboring `locations' (sites or bonds) that have been visited before. In this paper, we consider walks with…

A closed-form formula is derived for the number of occurrences of matches of a multiset of patterns among all ordered (plane-planted) trees with a given number of edges. A pattern looks like a tree, with internal nodes and leaves, but also…

Here we present an approximate analytical theory for the relationship between a protein structure's contact matrix and the shape of its energy spectrum in amino acid sequence space. We demonstrate a dependence of the number of sequences of…

Networks having the geometry and the connectivity of trees are considered as the spatial support of spatiotemporal dynamical processes. A tree is characterized by two parameters: its ramification and its depth. The local dynamics at the…

A set of independence statements may define the independence structure of interest in a family of joint probability distributions. This structure is often captured by a graph that consists of nodes representing the random variables and of…

Contact planning is crucial in locomoting systems.Specifically, appropriate contact planning can enable versatile behaviors (e.g., sidewinding in limbless locomotors) and facilitate speed-dependent gait transitions (e.g., walk-trot-gallop…

Polymer chains with hard-core interaction on a two-dimensional lattice are modeled by directed random walks. Two models, one with intersecting walks (IW) and another with non-intersecting walks (NIW) are presented, solved and compared. The…

This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…