Transition functions, corresponding to almost multiplicative functionals

1965 ◽  
pp. 281-300
Author(s):  
E. B. Dynkin
Keyword(s):  
Transition Functions ◽  
Multiplicative Functionals

On the optimal search for a target whose motion is a Markov process

1973 ◽  
Vol 10 (4) ◽  
pp. 847-856 ◽  
Author(s):  
Lauri Saretsalo
Keyword(s):  
Markov Process ◽  
Euclidean Space ◽  
Markov Processes ◽  
General Condition ◽  
Necessary Condition ◽  
Dimensional Euclidean Space ◽  
Optimal Search ◽  
Continuous Transition ◽  
Transition Functions ◽  
Multiplicative Functionals

We will consider the optimal search for a target whose motion is a Markov process. The classical detection law leads to the use of multiplicative functionals and the search is equivalent to the termination of the Markov process with a termination density. A general condition for the optimality is derived and for Markov processes in n-dimensional Euclidean space with continuous transition functions we derive a simple necessary condition which generalizes the result of Hellman (1972).

On the optimal search for a target whose motion is a Markov process

1973 ◽  
Vol 10 (04) ◽  
pp. 847-856 ◽  
Author(s):  
Lauri Saretsalo
Keyword(s):  
Markov Process ◽  
Euclidean Space ◽  
Markov Processes ◽  
General Condition ◽  
Necessary Condition ◽  
Dimensional Euclidean Space ◽  
Optimal Search ◽  
Continuous Transition ◽  
Transition Functions ◽  
Multiplicative Functionals

We will consider the optimal search for a target whose motion is a Markov process. The classical detection law leads to the use of multiplicative functionals and the search is equivalent to the termination of the Markov process with a termination density. A general condition for the optimality is derived and for Markov processes in n-dimensional Euclidean space with continuous transition functions we derive a simple necessary condition which generalizes the result of Hellman (1972).

Approximately Multiplicative Functionals

1986 ◽  
Vol s2-34 (3) ◽  
pp. 489-510 ◽  
Author(s):  
B. E. Johnson
Keyword(s):  
Multiplicative Functionals

Phase Transition in Elementary Cellular Automata with Memory

2014 ◽  
Vol 24 (09) ◽  
pp. 1450116 ◽  
Author(s):  
Shigeru Ninagawa ◽  
Andrew Adamatzky ◽  
Ramón Alonso-Sanz
Keyword(s):  
Cellular Automata ◽  
State Transition ◽  
Time Interval ◽  
Complex Behavior ◽  
Weighted Function ◽  
Transition Functions ◽  
Elementary Cellular Automata ◽  
Computational Universality ◽  
With Memory ◽  
Time Automaton

We study elementary cellular automata with memory. The memory is a weighted function averaged over cell states in a time interval, with a varying factor which determines how strongly a cell's previous states contribute to the cell's present state. We classify selected cell-state transition functions based on Lempel–Ziv compressibility of space-time automaton configurations generated by these functions and the spectral analysis of their transitory behavior. We focus on rules 18, 22, and 54 because they exhibit the most intriguing behavior, including computational universality. We show that a complex behavior is observed near the nonmonotonous transition to null behavior (rules 18 and 54) or during the monotonic transition from chaotic to periodic behavior (rule 22).

On the existence of markov processes with given transition functions

Stochastics ◽  
1982 ◽  
Vol 6 (2) ◽  
pp. 139-145
Author(s):  
M. P. Ershov ◽  
A. Wakolbinger
Keyword(s):  
Markov Processes ◽  
Transition Functions

INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS

1978 ◽  
Vol 4 (3) ◽  
pp. 201-209 ◽  
Author(s):  
BRUNO BUCHBERGER ◽  
BERNHARD ROIDER
Keyword(s):  
Input Output ◽  
Transition Functions

scholarly journals Analyzing the Effect of Time in Migration Measurement Using Georeferenced Digital Trace Data

Demography ◽  
2021 ◽  
Vol 58 (1) ◽  
pp. 51-74
Author(s):  
Lee Fiorio ◽  
Emilio Zagheni ◽  
Guy Abel ◽  
Johnathan Hill ◽  
Gabriel Pestre ◽  
...  
Keyword(s):  
Empirical Data ◽  
Survival Function ◽  
The United States ◽  
Population Characteristics ◽  
Phone Call ◽  
Research Strategies ◽  
Data Set ◽  
Trace Data ◽  
Transition Functions ◽  
Temporal Granularity

Abstract Georeferenced digital trace data offer unprecedented flexibility in migration estimation. Because of their high temporal granularity, many migration estimates can be generated from the same data set by changing the definition parameters. Yet despite the growing application of digital trace data to migration research, strategies for taking advantage of their temporal granularity remain largely underdeveloped. In this paper, we provide a general framework for converting digital trace data into estimates of migration transitions and for systematically analyzing their variation along a quasi-continuous time scale, analogous to a survival function. From migration theory, we develop two simple hypotheses regarding how we expect our estimated migration transition functions to behave. We then test our hypotheses on simulated data and empirical data from three platforms in two internal migration contexts: geotagged Tweets and Gowalla check-ins in the United States, and cell-phone call detail records in Senegal. Our results demonstrate the need for evaluating the internal consistency of migration estimates derived from digital trace data before using them in substantive research. At the same time, however, common patterns across our three empirical data sets point to an emergent research agenda using digital trace data to study the specific functional relationship between estimates of migration and time and how this relationship varies by geography and population characteristics.

scholarly journals Joint spectra and multiplicative functionals

1988 ◽  
Vol 56 (2) ◽  
pp. 357-366
Author(s):  
Andrzej Sołtysiak
Keyword(s):  
Multiplicative Functionals
Sign in / Sign up

Export Citation Format

Share Document