English
Related papers

Related papers: Structural characterization of ice polymorphs from…

200 papers

Various subsets of self-avoiding walks naturally appear when investigating existing methods designed to predict the 3D conformation of a protein of interest. Two such subsets, namely the folded and the unfoldable self-avoiding walks, are…

Biomolecules · Quantitative Biology 2013-06-19 Jacques M. Bahi , Christophe Guyeux , Kamel Mazouzi , Laurent Philippe

The importance of structured, complex connectivity patterns found in several real-world systems is to a great extent related to their respective effects in constraining and even defining the respective dynamics. Yet, while complex networks…

Tissues and Organs · Quantitative Biology 2008-05-16 Matheus P. Viana , Bruno A. N. Travencolo , E. Tanck , Luciano da F. Costa

We study Hamiltonian walks (HWs) on Sierpinski and $n$--simplex fractals. Via numerical analysis of exact recursion relations for the number of HWs we calculate the connectivity constant $\omega$ and find the asymptotic behaviour of the…

Statistical Mechanics · Physics 2009-11-10 Jelena Stajic , Suncica Elezovic-Hadzic

For d at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons…

Probability · Mathematics 2017-02-09 Alan Hammond

We investigated the structural and dynamical properties of a tetrahedrally coordinated crystalline ice from first principles based on density functional theory within the generalized gradient approximation with the projected augmented wave…

Materials Science · Physics 2007-05-23 W. A. Adeagbo , A. Zayak , P. Entel

We study dynamical and computational properties of the set of bi-infinite self-avoiding walks on Cayley graphs, as well as ways to compute, approximate and bound their connective constant. To do this, we introduce the skeleton $X_{G,S}$ of…

Combinatorics · Mathematics 2024-09-25 Nathalie Aubrun , Nicolás Bitar

The density crossover scaling of various thermodynamic properties of solutions and melts of self-avoiding and highly flexible polymer chains without chain intersections confined to strictly two dimensions is investigated by means of…

Soft Condensed Matter · Physics 2012-09-03 N. Schulmann , H. Meyer , P. Polińska , J. Baschnagel , J. P. Wittmer

We perform a Monte Carlo simulation of two-dimensional N-step interacting self-avoiding walks at the theta point, with lengths up to N=3200. We compute the critical exponents, verifying the Coulomb-gas predictions, the theta-point…

Soft Condensed Matter · Physics 2015-03-17 Sergio Caracciolo , Marco Gherardi , Mauro Papinutto , Andrea Pelissetto

Based on neutron wide-angle diffraction and small-angle neutron scattering experiments, we show that there is a correlation between the preparational conditions of amorphous ice structures, their microscopic structural properties, the…

Disordered Systems and Neural Networks · Physics 2007-05-23 Michael Marek Koza , Thomas Hansen , Roland P. May , Helmut Schober

Hydrogen-bond forms a pair of asymmetric, coupled, H-bridged oscillators with ultra-short-range interactions and memory. hydrogen bond cooperative relaxation and the associated binding electron entrapment and nonbonding electron…

Soft Condensed Matter · Physics 2015-01-16 Chang Q Sun

We argue that the relative thermal conductance between interfaces with different morphologies is controlled by crystal structure through $M_{min}/M_c > 1$, the ratio between the {\it minimum mode} count on either side $M_{min}$, and the…

The connective constant mu of a graph is the exponential growth rate of the number of n-step self-avoiding walks starting at a given vertex. A self-avoiding walk is said to be forward (respectively, backward) extendable if it may be…

Combinatorics · Mathematics 2018-10-26 Geoffrey R. Grimmett , Alexander E. Holroyd , Yuval Peres

The connective constant $\mu(G)$ of a quasi-transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective…

Combinatorics · Mathematics 2018-08-21 Geoffrey R. Grimmett , Zhongyang Li

Dynamic systems characterized by diversified evolutions are not only more flexible, but also more resilient to attacks, failures and changing conditions. This article addresses the quantification of the diversity of non-linear transient…

Physics and Society · Physics 2008-01-07 Luciano da Fontoura Costa

The scaling properties of self-avoiding walks on a d-dimensional diluted lattice at the percolation threshold are analyzed by a field-theoretical renormalization group approach. To this end we reconsider the model of Y. Meir and A. B.…

Soft Condensed Matter · Physics 2009-11-10 C. von Ferber , V. Blavats'ka , R. Folk , Yu. Holovatch

We attempt to extract a homological structure of two kinds of graphs by the Grover walk. The first one consists of a cycle and two semi-infinite lines and the second one is assembled by a periodic embedding of the cycles in $\mathbb{Z}$. We…

Mathematical Physics · Physics 2014-05-08 Takuya Machida , Etsuo Segawa

This is an exposition of the theorem from the title, which says that the number of self-avoiding walks with n steps in the hexagonal lattice has asymptotics (2cos(pi/8))^{n+o(n)}. We lift the key identity to formal level and simplify the…

Combinatorics · Mathematics 2011-04-08 Martin Klazar

We examine self-avoiding walks in dimensions 4 to 8 using high-precision Monte-Carlo simulations up to length N=16384, providing the first such results in dimensions $d > 4$ on which we concentrate our analysis. We analyse the scaling…

Statistical Mechanics · Physics 2009-11-07 Aleksander L. Owczarek , Thomas Prellberg

Quantifying the correlation between the complex structures of amorphous materials and their physical properties has been a long-standing problem in materials science. In amorphous Si, a representative covalent amorphous solid, the presence…

Materials Science · Physics 2022-06-29 Emi Minamitani , Takuma Shiga , Makoto Kashiwagi , Ippei Obayashi

We study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory…

Probability · Mathematics 2011-06-21 Francis Comets , Mikhail V. Menshikov , Stanislav Volkov , Andrew R. Wade