Topological correlations in dense lattice trivial knots Sergei Nechaev LPTMS (Orsay, France)

Slides:



Advertisements
Similar presentations
B ETTI NUMBERS OF RANDOM SIMPLICIAL COMPLEXES MATTHEW KAHLE & ELIZABETH MECKE Presented by Ariel Szapiro.
Advertisements

Complex Networks Advanced Computer Networks: Part1.
ETC Trento Workshop Spectral properties of complex networks
Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.
The Theory of Zeta Graphs with an Application to Random Networks Christopher Ré Stanford.
Bangalore conference, December, Rank 3-4 Coxeter Groups, Quaternions and Quasicrystals Mehmet Koca Department of Physics College of Science.
Differential geometry I
DYNAMICS OF RANDOM BOOLEAN NETWORKS James F. Lynch Clarkson University.
Week 5 - Models of Complex Networks I Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
It’s a Small World by Jamie Luo. Introduction Small World Networks and their place in Network Theory An application of a 1D small world network to model.
Ch 9.1: The Phase Plane: Linear Systems
Networks, Lie Monoids, & Generalized Entropy Metrics Networks, Lie Monoids, & Generalized Entropy Metrics St. Petersburg Russia September 25, 2005 Joseph.
The Potts and Ising Models of Statistical Mechanics.
Alon Arad Alon Arad Hurst Exponent of Complex Networks.
Graph, Search Algorithms Ka-Lok Ng Department of Bioinformatics Asia University.
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
Control Systems and Adaptive Process. Design, and control methods and strategies 1.
Geometric characterization of nodal domains Y. Elon, C. Joas, S. Gnutzman and U. Smilansky Non-regular surfaces and random wave ensembles General scope.
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
Diffusion Maps and Spectral Clustering
Copyright © Cengage Learning. All rights reserved. 1 Functions and Limits.
The Erdös-Rényi models
Absolute error. absolute function absolute value.
Molecular Descriptors
Spectral coordinate of node u is its location in the k -dimensional spectral space: Spectral coordinates: The i ’th component of the spectral coordinate.
Percolation in self-similar networks Dmitri Krioukov CAIDA/UCSD M. Á. Serrano, M. Boguñá UNT, March 2011.
Scalable and Fully Distributed Localization With Mere Connectivity.
Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.
8. Selected Applications. Applications of Monte Carlo Method Structural and thermodynamic properties of matter [gas, liquid, solid, polymers, (bio)-macro-
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Peter Virnau, Mehran Kardar, Yacov Kantor Capturing knots in (bio-) polymers …
Synchronization in complex network topologies
Workshop on Optimization in Complex Networks, CNLS, LANL (19-22 June 2006) Application of replica method to scale-free networks: Spectral density and spin-glass.
KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators:
Non-Fermi Liquid Behavior in Weak Itinerant Ferromagnet MnSi Nirmal Ghimire April 20, 2010 In Class Presentation Solid State Physics II Instructor: Elbio.
1 EE571 PART 3 Random Processes Huseyin Bilgekul Eeng571 Probability and astochastic Processes Department of Electrical and Electronic Engineering Eastern.
Native ultrametricity in random sparse systems Sergei Nechaev LPTMS, Orsay, France.
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
Network (graph) Models
Density of States for Graph Analysis
Random Walk for Similarity Testing in Complex Networks
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Random remarks about random walks
A rotating hairy BH in AdS_3
Correlations and Scale in Circumstellar Dust Shells
Yosuke Harashima, Keith Slevin
Pressure and Temperature Dependence of Growth and Morphology of Escherichia coli: Experiments and Stochastic Model  Pradeep Kumar, Albert Libchaber  Biophysical.
Volume 112, Issue 7, Pages (April 2017)
Jean-François Mercier, Gary W. Slater  Biophysical Journal 
Phase Transitions in Biological Systems with Many Components
Modeling Endoplasmic Reticulum Network Maintenance in a Plant Cell
Brendan K. Murphy, Kenneth D. Miller  Neuron 
Translation of Genotype to Phenotype by a Hierarchy of Cell Subsystems
Volume 19, Issue 7, Pages (July 2011)
Spin Models and Distance-Regular Graphs
Volume 23, Issue 10, Pages (October 2016)
Raft Formation in Lipid Bilayers Coupled to Curvature
Volume 80, Issue 1, Pages (October 2013)
Volume 133, Issue 2, Pages (April 2008)
Colocalization of Multiple DNA Loci: A Physical Mechanism
Universality and diversity of the protein folding scenarios:a comprehensive analysis with the aid of a lattice model  Leonid A Mirny, Victor Abkevich,
A Mesoscale Model of DNA and Its Renaturation
Cell dynamics of folding in two-dimensional model proteins
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Fluctuations, Pauses, and Backtracking in DNA Transcription
Pawel Gniewek, Andrzej Kolinski  Biophysical Journal 
Modeling Endoplasmic Reticulum Network Maintenance in a Plant Cell
Volume 76, Issue 5, Pages (May 1999)
A quantum machine learning algorithm based on generative models
Presentation transcript:

Topological correlations in dense lattice trivial knots Sergei Nechaev LPTMS (Orsay, France)

Structure of the talk 1.Biophysical motivations for the conside- ration of topological correlations in lattice knots; 2.“Statistical topology” of disordered systems: topology as a “quenched disorder”; 3.Conditional distributions and expectations of highest degree of polynomial invariants; 4.“Brownian bridges” in hyperbolic spaces.

Double helix of DNA could reach length ~ 2 m, consists of ~ 3 billions base pairs and is packed in a cell nucleus of size of ~ 20 micrometers. During transcription the DNA fragment should “disentangle” form densely packed state and should “fold back” after. How to do that fast and reversibly??? The possible answer is contained in an experimental work on human genome (E. Lieberman-Aiden, et al, Science, 2009): DNA forms a “crumpled” compact nontrivial fractal structure without knots 1. Biophysical motivations

The classical theory of coil-to-globule phase transitions (Lifshitz, Grosberg, Khokhlov, ) states: At low temperatures the macromolecule (with “open” ends) forms a compact weakly fluctuating drop-like “globular” structure. What is the geometry of an unknotted fluctuating polymer ring in a compact (“globular”) phase?

We considered a dense state of an unknotted polymer ring after a temperature jump from  –temp. to T (T<  ) This structure resembles self-similar Peano curve This structure is thermodynamically favorable! Theoretical prediction of a “crumpled” structure: A.Grosberg, E.Schakhnovich, S.N. (J. Physique, 1988)

In a compact state two scenarios of a microstructure formation could be realized. Either folds deeply penetrate each other as shown in (a), or folds of all scales stay segregated in the space as shown in (b). How to prove the existence of a crumpled structure? (a)(b)

We consider a quasi-two-dimensional system corresponding to a polymer globule in a thin slit

In a globular phase one can separate topological and spatial fluctuations. We model the globule by a dense knot diagram completely filling the rectangular lattice. Thus, we keep only the “topological disorder”. To the vertex k we assign the value of a “disorder” depending on the crossing type: 2. Statistical topology of disordered systems

What is a typical topological state of a “daughter” (quasi)knot under the condition that the “parent” knot is trivial? Quasiknot – a part of a knot equipped with boundary conditions. 3. Conditional distributions of knot invariants

How to characterize topological states? It is sufficient for statistical purposes to discriminate knots by degrees of polynomial (Kauffman) invariants: For trivial knots n ~ 1, for very complex knots n ~ N. Remark 1. Degree n reflects nonabelian character of topological interactions. Remark 2. Degree n defines the metric space and allows to range the knots by their complexities. Remark 3. Since is a partition function, the degree n has a sense of a free energy.

Write as a partition function of Potts spin system with disordered interactions on the dual lattice where Polynomial invariants and “Potts spin glass”

Results Typical conditional knot complexity n* of a daughter (quasi)knot, which is a part of a parent trivial knot, has asymptotic behavior: Relative complexity n*/N of a daughter knot tends to 0: Typical unconditional knot complexity n of a random knot has asymptotic behavior:

The space of all topological states in our model is non- Euclidean and is the space of constant negative curvature (Lobachevsky space). The random walk in Lobachevsky geometry can be modeled by multiplication of random noncommutative unomodular matrices. Brownian bridge = conditional random walk in Lobachevsky space. Example: Classical Fuerstenberg theorem, 1963 “Brownian bridges” in hyperbolic spaces

Elongation of a single random walk in hyperbolic geometry Radial distribution function is Random walks in Lobachevsky plane

Bunch of M random walks in Lobachevsky plane Probability to create a watermelon of two random walks in Lobachevsky plane where In general one has: Thus, For M ≥ 3 the trajectories are elongated in hyperbolic geometry

Toy model of hierarchically overlapping intervals

For the overlapping probability we have generated an ensemble of contact maps. The typical plots and the output are as follows (  = 3): We see the block-hierarchical structure (size 64x64)

What is the density of eigenvalues for such a matrix for typical distributions of matrix elements? 2. Random block-hierarchical adjacency matrices of random graphs (contact maps)

Matrix elements are defined as follows where, and is the level of the hierarchy Example:

3. Scale-free spectral density (μ = 0.2) (a) Semi–log plot of the distribution of eigenvalues for N = 256 (solid line) and N = 2048 (dashed line); (b) The left– and right–hand tails of for N = 256 in log– log coordinates.

Comparison of spectral densities of random hierarchical and Erdös-Rényi random graphs (a) The semi–log plot of the spectral densities for: random hierarchical graphs for N = 256 and μ = 0.2 (solid line), random Erdös-Rényi graphs for N = 256 and p = 0.2 (dotted line), for N = 256 and p = 0.02 (dashed line); (b) The central part of the figure (a) in the linear scale.

Numerical verification of the power-law behavior for Gaussian distribution of hierarchical adjacency matrix

4. Distribution of “motifs” in hierarchical networks Consider subgraphs-triads Define statistical significance Z k with respect to randomized networks with the same connectivity and Consider a vector p = { p 1,…, p 13 }. According to U. Alon et al (Science, 2004) all networks fall into 4 “superfamilies” with respect to distribution of components of the vector p (“motifs”).

The found distribution of motifs in hierarchical networks is very similar to the distribution of motifs in the superfamily II (networks of neurons) Distribution of motifs in the superfamily II (in the classification of U. Alon et al )  