Moving Through Triadic Space

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bistability through Triadic Closure

We propose and analyse a class of evolving network models suitable for describing a dynamic topological structure. Applications include telecommunication, on-line social behaviour and information processing in neuroscience. We model the evolving network as a discrete time Markov chain, and study a very general framework where, conditioned on the current state, edges appear or disappear independ...

متن کامل

IQPNNI: moving fast through tree space and stopping in time.

An efficient tree reconstruction method (IQPNNI) is introduced to reconstruct a phylogenetic tree based on DNA or amino acid sequence data. Our approach combines various fast algorithms to generate a list of potential candidate trees. The key ingredient is the definition of so-called important quartets (IQs), which allow the computation of an intermediate tree in O(n(2)) time for n sequences. T...

متن کامل

Moving through time.

/FREEFull Text8.1. Riley M.A.,2. Balasubramaniam R.,3. Mitra S.,4. Turvey M.T.(1998). Visual influences on centre of pressure dynamics in upright posture.Ecological Psychology, 10, 65–91.CrossRefWeb of Science

متن کامل

Triadic Factor Analysis

This article is an extension of work which suggests using formal concepts as optimal factors of Factor Analysis. They discussed a method for decomposing a p × q binary matrix W into the Boolean matrix product P ◦ Q of a p × n binary matrix P and a n × q binary matrix Q with n as small as possible. We have generalised this factorization problem to the triadic case, looking for a decomposition of...

متن کامل

A random triadic process

Given a random 3-uniform hypergraph H = H(n, p) on n vertices where each triple independently appears with probability p, consider the following graph process. We start with the star G0 on the same vertex set, containing all the edges incident to some vertex v0, and repeatedly add an edge xy if there is a vertex z such that xz and zy are already in the graph and xzy ∈ H. We say that the process...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Special Issue: Animating the “Inside”

سال: 2009

ISSN: 1067-3040

DOI: 10.30535/mto.15.1.7