A homogenization approach for the motion of motor proteins

We consider the asymptotic behavior of an evolving weakly coupled Fokker–Planck system of two equations set in a periodic environment. The magnitudes of the diffusion and the coupling are, respectively, proportional and inversely proportional to the size of the period. We prove that, as the period tends to zero, the solutions of the system either propagate (concentrate) with a fixed constant velocity (determined by the data) or do not move at all. The system arises in the modeling of motor proteins which can take two different states. Our result implies that, in the limit, the molecules either move along a filament with a fixed direction and constant speed or remain immobile.     

Feasibility of motion planning on acyclic and strongly connected directed graphs

Motion planning is a fundamental problem of robotics with applications in many areas of computer science and beyond. Its restriction to graphs has been investigated in the literature, for it allows one to concentrate on the combinatorial problem abstracting from geometric considerations. In this paper, we consider motion planning over directed graphs, which are of interest for asymmetric communication networks. Directed graphs generalize undirected graphs, while introducing a new source of complexity to the motion planning problem: moves are not reversible. We first consider the class of acyclic directed graphs and show that the feasibility can be solved in time linear in the product of the number of vertices and the number of arcs. We then turn to strongly connected directed graphs. We first prove a structural theorem for decomposing strongly connected directed graphs into strongly biconnected components. Based on the structural decomposition, we show that the feasibility of motion planning on strongly connected directed graphs can be decided in linear time.     

A brownian motion model of return migration

This paper considers a continuous time, continuous state stochastic process to determine a theoretical model and empirical parameters for the probability distribution of remigration. A Brownian motion model is used for simplicity, with empirical findings drawn from a study of Israeli return migrants. A negative relationship between remigration (sojourn) time and the probability of return time is used to provide forecasts of remigration which can help governments who seek actively the return of their migrants to reach better decisions regarding the timing of their efforts.     

A phase-field model of grain boundary motion

We consider a phase-field model of grain structure evolution, which appears in materials sciences. In this paper we study the grain boundary motion model of Kobayashi-Warren-Carter type, which contains a singular diffusivity. The main objective of this paper is to show the existence of solutions in a generalized sense. Moreover, we show the uniqueness of solutions for the model in one-dimensional space. Dedicated to Jürgen Sprekels on the occasion of his 60th birthday     

A directed topic model applied to call center improvement

We propose subject matter expert refined topic (SMERT) allocation, a generative probabilistic model applicable to clustering freestyle text. SMERT models are three‐level hierarchical Bayesian models in which each item is modeled as a finite mixture over a set of topics. In addition to discrete data inputs, we introduce binomial inputs. These ‘high‐level’ data inputs permit the ‘boosting’ or affirming of terms in the topic definitions and the ‘zapping’ of other terms. We also present a collapsed Gibbs sampler for efficient estimation. The methods are illustrated using real world data from a call center. Also, we compare SMERT with three alternative approaches and two criteria. Copyright © 2015 John Wiley & Sons, Ltd.     

A mathematical framework for a crowd motion model

In a previous paper, we proposed a model for crowd motion, together with a numerical algorithm, especially designed to handle highly packed situations. This model rests on two principles: We first define a spontaneous velocity which corresponds to the velocity each individual would like to have in the absence of other people; The actual velocity is then computed as the projection of the spontaneous velocity onto the set of admissible velocities (i.e. velocities which do not violate the non-overlapping constraint). We describe here the underlying mathematical framework, and we explain how recent results by J.F. Edmond and L. Thibault on the sweeping process in the prox-regular case can be adapted to handle this situation, in terms of well-posedness as well as convergence of the numerical algorithm. To cite this article: B. Maury, J. Venel, C. R. Acad. Sci. Paris, Ser. I 346 (2008).     

A model of the coNP-complete non-Hamilton tour decision problem for directed graphs

A truncated permutation matrix polytope is defined as the convex hull of a proper subset of n-permutations represented as 0/1 matrices. We present a linear system that models the coNP-complete non-Hamilton tour decision problem based upon constructing the convex hull of a set of truncated permutation matrix polytopes. Define polytope P^n–1 as the convex hull of all n-1 by n-1 permutation matrices. Each extreme point of P^n–1 is placed in correspondence (a bijection) with each Hamilton tour of a complete directed graph on n vertices. Given any n vertex graph G_n, a polynomial sized linear system F⁽ⁿ⁾ is constructed for which the image of its solution set, under an orthogonal projection, is the convex hull of the complete set of extrema of a subset of truncated permutation matrix polytopes, where each extreme point is in correspondence with each Hamilton tour not in G_n. The non-Hamilton tour decision problem is modeled by F⁽ⁿ⁾ such that G_n is non-Hamiltonian if and only if, under an orthogonal projection, the image of the solution set of F⁽ⁿ⁾ is P^n–1. The decision problem Is the projection of the solution set of F⁽ⁿ⁾=P^n–1? is therefore coNP-complete, and this particular model of the non-Hamilton tour problem appears to be new.Dedicated to the 250+ families in Kelowna BC, who lost their homes due to forest fires in 2003.I visited Ted at his home in Kelowna during this time - his family opened their home to evacuees and we shared happy and sad times with many wonderful people.     

A model of the mechanism of motion of a snake

The motion of a snake is considered using as a model an elastic rod in which the shape of the neutral axis is controllable. The optimal control of this shape, guaranteeing the minimum internal effort for a given value of the average tractive force, is found.     

The motion of a car moving on a terrain: A kinematic model

This work deals with the kinematic model of the motion of a car moving on a general rigid terrain. It is assumed that at each instant, each of the car's four wheels is in contact with the ground. Based on this assumption, a kinematic model for the motion of the car is derived.     

A bound on judicious bipartitions of directed graphs

Judicious partitioning problems on graphs ask for partitions that bound several quantities simultaneously,which have received much attention lately.Scott(2005)asked the following natural question:What is the maximum constant cdsuch that every directed graph D with m arcs and minimum outdegree d admits a bipartition V(D)=V_1∪V_2 satisfying min{e(V_1,V_2),e(V_2,V_1)}cdm?Here,for i=1,2,e(V_i,V_3-i)denotes the number of arcs in D from V_i to V_3-i.Lee et al.(2016)conjectured that every directed graph D with m arcs and minimum outdegree at least d 2 admits a bipartition V(D)=V_1∪V_2 such that min{e(V_1,V_2),e(V_2,V_1)}≥((d-1)/(2(2 d-1))+o(1))m.In this paper,we show that this conjecture holds under the additional natural condition that the minimum indegree is also at least d.     

Inference in directed evidential networks based on the transferable belief model

Inference algorithms in directed evidential networks (DEVN) obtain their efficiency by making use of the represented independencies between variables in the model. This can be done using the disjunctive rule of combination (DRC) and the generalized Bayesian theorem (GBT), both proposed by Smets [Ph. Smets, Belief functions: the disjunctive rule of combination and the generalized Bayesian theorem, International Journal of Approximate Reasoning 9 (1993) 1–35]. These rules make possible the use of conditional belief functions for reasoning in directed evidential networks, avoiding the computations of joint belief function on the product space. In this paper, new algorithms based on these two rules are proposed for the propagation of belief functions in singly and multiply directed evidential networks.     

A remark on renormalization of the quantum equation of motion for the matrix sigma model

The infinite part of a 1-prong vertex for the matrix σ-model is calculated in the background field formalism in one-loop approach. It is shown that renormalizations of the quantum equation of motion and effective action coincide if an additional factor is introduced. Bibliography: 7 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 347, 2007, pp. 30–33.     

Systemic view of learning scientific concepts: A description in terms of directed graph model

This study suggests a systemic view on concept learning, in which concepts are seen as complex, dynamically evolving structures with robust and persistent patterns emerging from loosely connected elemental pieces. The model is represented in the form of a directed graph, and it explains many empirically identified features of learning paths, including: (1) the stability of learned concepts, (2) changes in concept attributions (ontological shift) as guided by theoretical knowledge, and (3) the evolution of concepts as driven by model competition with the accumulation of evidence. The results thus show applicability of the systemic view and the directed graph model. © 2013 Wiley Periodicals, Inc. Complexity 19: 27–37, 2014     

A recognition algorithm for the intersection graphs of directed paths in directed trees

Consider a finite family of non-empty sets. The intersection graph of this family is obtained by representing each set by a vertex, two vertices being connected by an edge if and only if the corresponding sets intersect. The intersection graph of a family of directed paths in a directed tree is called a directed path graph. In this paper we present an efficient algorithm which constructs to a given graph a representation by a family of directed paths on a directed tree, if one exists. Also, we prove that a graph is a proper directed path graph if and only if it is a directed path graph.     

Self-avoiding random walk: A Brownian motion model with local time drift

Summary A natural model for a self-avoiding Brownian motion inR ^d, when specialised and simplified tod=1, becomes the stochastic differential equation , where {L(t, x):t0,xR} is the local time process ofX. ThoughX is not Markovian, an analogue of the Ray-Knight theorem holds for {L(,x):xR}, which allows one to prove in many cases of interest that exists almost surely, and to identify the limit.     

The intermediate disorder regime for a directed polymer model on a hierarchical lattice

We study a directed polymer model defined on a hierarchical diamond lattice, where the lattice is constructed recursively through a recipe depending on a branching number $b\in \mathbb{N}$ and a segment number $s\in \mathbb{N}$. When $b\le s$ it is known that the model exhibits strong disorder for all positive values of the inverse temperature $\beta$, and thus weak disorder reigns only for $\beta =0$ (infinite temperature). Our focus is on the so-called intermediate disorder regime in which the inverse temperature $\beta \equiv {\beta }_n$ vanishes at an appropriate rate as the size $n$ of the system grows. Our analysis requires separate treatment for the cases $b<s$ and $b=s$. In the case $b<s$ we prove that when the inverse temperature is taken to be of the form ${\beta }_n=\stackrel{?}{\beta }{(b/s)}^{n/2}$ for $\stackrel{?}{\beta }>0$, the normalized partition function of the system converges weakly as $n\to \infty$ to a distribution $L\left(\stackrel{?}{\beta }\right)$ and does so universally with respect to the initial weight distribution. We prove the convergence using renormalization group type ideas rather than the standard Wiener chaos analysis. In the case $b=s$ we find a critical point in the behavior of the model when the inverse temperature is scaled as ${\beta }_n=\stackrel{?}{\beta }/n$; for an explicitly computable critical value ${\kappa }_b>0$ the variance of the normalized partition function converges to zero with large $n$ when $\stackrel{?}{\beta }\le {\kappa }_b$ and grows without bound when $\stackrel{?}{\beta }>{\kappa }_b$. Finally, we prove a central limit theorem for the normalized partition function when $\stackrel{?}{\beta }\le {\kappa }_b$.     

A note on minimal directed graphs with given girth

Caccetta and Häggkvist conjectured that the minimum order of a directed graph with girth g and outdegree not less than r is r(g − 1) + 1. They proved this conjecture for r = 2. We prove it for r = 3.     

A model and simulation for homeorhesis in the motion of a single individual

In contrast to nonliving systems, all living systems perform homeorhesis. The system state tends to the so-called necessary path, or creode, when the exogenous signals are in a certain system-relevant range. The present work develops the homeorhesis-aware dynamical model for the motion of a single individual (e.g., human). The model allows for the purposeful behaviour of the individual, the creode, the exogenous forces, and the individual-specific sensitivity to their influences. The model also describes the homeorhetic-dysfunction movements. The transparency of the model is such that it allows a physical analogue in the form of electronic circuits. The model is a first step towards the construction of sociologically relevant models for the prediction of human behaviour. It is indispensable for the analyses of dangerous scenarios where the experiments are impossible, for example when predicting the behaviour of panic-stricken crowds in life-threatening situations. The work illustrates the corresponding numerical-simulation results with a series of figures and suggests topics for future research.