Log in

Relevant bibliographies by topics / Random times

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Random times'

Author: Grafiati

Published: 4 June 2021

Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Random times.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Random times"

1

Helali, Amine, and Matthias Löwe. "Hitting times, commute times, and cover times for random walks on random hypergraphs." Statistics & Probability Letters 154 (November 2019): 108535. http://dx.doi.org/10.1016/j.spl.2019.06.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Li, Libo, and Marek Rutkowski. "Random times and multiplicative systems." Stochastic Processes and their Applications 122, no. 5 (2012): 2053–77. http://dx.doi.org/10.1016/j.spa.2012.02.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chupeau, Marie, Olivier Bénichou, and Raphaël Voituriez. "Cover times of random searches." Nature Physics 11, no. 10 (2015): 844–47. http://dx.doi.org/10.1038/nphys3413.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lacaze, B. "Random propagation times in ultrasonics." Waves in Random and Complex Media 20, no. 1 (2010): 179–90. http://dx.doi.org/10.1080/17455030903501840.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Barnett, Chris, and Ivan F. Wilde. "Random times and time projections." Proceedings of the American Mathematical Society 110, no. 2 (1990): 425. http://dx.doi.org/10.1090/s0002-9939-1990-1021894-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Nakagawa, Toshio, and Xufeng Zhao. "COMPARISONS OF REPLACEMENT POLICIES WITH CONSTANT AND RANDOM TIMES." Journal of the Operations Research Society of Japan 56, no. 1 (2013): 1–14. http://dx.doi.org/10.15807/jorsj.56.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kochubei, Anatoly, Yuri Kondratiev, and Jose Luis Da Silva. "From random times to fractional kinetics." Мiждисциплiнарнi дослiдження складних систем, no. 16 (May 23, 2020): 5–32. http://dx.doi.org/10.31392/iscs.2020.16.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Dupuis, Paul, and Hui Wang. "Optimal stopping with random intervention times." Advances in Applied Probability 34, no. 01 (2002): 141–57. http://dx.doi.org/10.1017/s0001867800011435.

Full text

Abstract:

We consider a class of optimal stopping problems where the ability to stop depends on an exogenous Poisson signal process - we can only stop at the Poisson jump times. Even though the time variable in these problems has a discrete aspect, a variational inequality can be obtained by considering an underlying continuous-time structure. Depending on whether stopping is allowed at t = 0, the value function exhibits different properties across the optimal exercise boundary. Indeed, the value function is only 𝒞 0 across the optimal boundary when stopping is allowed at t = 0 and 𝒞 2 otherwise, both contradicting the usual 𝒞 1 smoothness that is necessary and sufficient for the application of the principle of smooth fit. Also discussed is an equivalent stochastic control formulation for these stopping problems. Finally, we derive the asymptotic behaviour of the value functions and optimal exercise boundaries as the intensity of the Poisson process goes to infinity or, roughly speaking, as the problems converge to the classical continuous-time optimal stopping problems.

APA, Harvard, Vancouver, ISO, and other styles

9

Crisan, D., and O. Obanubi. "Particle filters with random resampling times." Stochastic Processes and their Applications 122, no. 4 (2012): 1332–68. http://dx.doi.org/10.1016/j.spa.2011.12.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Arbieto, Alexander, André Junqueira, and Regis Soares. "Hitting times for random dynamical systems." Dynamical Systems 28, no. 4 (2013): 484–500. http://dx.doi.org/10.1080/14689367.2013.819413.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Random times"

1

Rosén, Emil. "Random covering times, a simulation study." Thesis, Uppsala universitet, Analys och sannolikhetsteori, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-269338.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Obanubi, Olasunkanmi Olubunmi. "Particle filters with random resampling times." Thesis, Imperial College London, 2010. http://hdl.handle.net/10044/1/6339.

Full text

Abstract:

The ability to analyse, interpret and make inferences about evolving dynamical systems is of great importance in different areas of the world we live in today. Examples of such areas include audio engineering, finance and econometrics. In general, the dynamical systems are not directly measureable and only incomplete observations, quite often deteriorated by the presence noise are available. This leads us to the main objective of stochastic filtering: the estimation of an evolving dynamical system whose trajectory is modelled by a stochastic process called the signal, given the information available through its partial observation. Particle filters, which use clouds of weighted particles that evolve according to the law of the signal process, can be used to approximate the solution of the filtering problem. In time, as some of the particles become redundant, a procedure which eliminates these particles and multiplies the ones that contribute most to the resulting approximation is introduced at points in time called resampling/correction times. Practitioners normally use certain overall characteristics of the approximating system of particles (such as the effective sample size of the system) to determine when to correct the system. There are currently no results to justify the convergence of particle filters with random correction times to the solution of the filtering problem in continuous time. In this thesis, we analyse particle filters in a continuous time framework where resampling takes place at times that form a sequence of (predictable) stopping times. The particular focus will be on the case where the signal is a diffusion process on a d-dimensional Euclidean space. We will also look at central limit theorem type results for the approximating particle system. The results will then be used to make inferences about the threshold used in the effective sample size approach of approximating the signal.

APA, Harvard, Vancouver, ISO, and other styles

3

Wallén, Daniel. "Cover times of random walks on graphs." Thesis, Uppsala University, Department of Mathematics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-125278.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Sbihi, Amine M. (Amine Mohammed). "Covering times for random walks on graphs." Thesis, McGill University, 1990. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74538.

Full text

Abstract:

This thesis is a contribution to the covering times problems for random walks on graphs. By considering uniform random walks on finite connected graphs, the covering time is defined as the time (number of steps) taken by the random walk to visit every vertex. The motivating problem of this thesis is to find bounds for the expected covering times. We provide explicit bounds that are uniformly valid over all starting points and over large classes of graphs. In some cases the asymptotic distribution of the suitably normalized covering time is given as well.

APA, Harvard, Vancouver, ISO, and other styles

5

Abe, Yoshihiro. "Cover times and extrema of local times for random walks on graphs." 京都大学 (Kyoto University), 2016. http://hdl.handle.net/2433/215283.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kang, Sungyeol. "Extreme values of random times in stochastic networks." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/24305.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Carlsund, Anna. "Cover Times, Sign-dependent Random Walks, and Maxima." Doctoral thesis, KTH, Mathematics, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3624.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kenyon, Astrid Sandrine. "Stochastic vehicle routing problems with random travel times /." Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mussini, Filipe. "Random cover times using the Poisson cylinder process." Licentiate thesis, Uppsala universitet, Analys och sannolikhetsteori, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-329351.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Forghani, Behrang. "Transformed Random Walks." Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/32538.

Full text

Abstract:

We consider transformations of a given random walk on a countable group determined by Markov stopping times. We prove that these transformations preserve the Poisson boundary. Moreover, under some mild conditions, the asymptotic entropy (resp., rate of escape) of the transformed random walks is equal to the asymptotic entropy (resp., rate of escape) of the original random walk multiplied by the expectation of the corresponding stopping time. This is an analogue of the well-known Abramov's formula from ergodic theory.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Random times"

1

Jacobs, Patricia A. First passage times for combinations of random loads. Naval Postgraduate School, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

1956-, Chen Xia, and Rosen Jay 1948-, eds. Moderate deviations for the range of planar random walks. American Mathematical Society, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Nicolas, Christian. Random walk. Architectural Association Students Union, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

A random walk down Wall Street: The time-tested strategy for successful investing. W.W. Norton, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

A random walk down Wall Street: The time-tested strategy for successful investing. W.W. Norton & Co., 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Stationary sequences and random fields. Birkhäuser, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Sowers, R. B. Short-time geometry of random heat kernels. American Mathematical Society, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

I, Miller Michael, and Snyder Donald L. 1943-, eds. Random point processes in time and space. 2nd ed. Springer-Verlag, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

name, No. Introduction to random time and quantum randomness. World Scientific, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Sowers, R. B. Short-time geometry of random heat kernels. American Mathematical Society, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Random times"

1

Chen, Xia. "Brownian intersection local times." In Random Walk Intersections. American Mathematical Society, 2010. http://dx.doi.org/10.1090/surv/157/02.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Aksamit, Anna, and Monique Jeanblanc. "Compensators of Random Times." In SpringerBriefs in Quantitative Finance. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-41255-9_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bielecki, Tomasz R., and Marek Rutkowski. "Case of Several Random Times." In Springer Finance. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-04821-4_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Stobart, Simon, and Mike Vassileiou. "Dates, Times and Random Numbers." In PHP and MySQL Manual. Springer London, 2004. http://dx.doi.org/10.1007/978-0-85729-404-3_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bożejko, Wojciech, Paweł Rajba, and Mieczysław Wodecki. "Stable Scheduling with Random Processing Times." In Topics in Intelligent Engineering and Informatics. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-01436-4_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Zacks, Shelemyahu. "First Crossing a Random Process." In Sample Path Analysis and Distributions of Boundary Crossing Times. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67059-1_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Ben-Hamou, Anna, Eyal Lubetzky, and Yuval Peres. "Comparing mixing times on sparse random graphs." In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2018. http://dx.doi.org/10.1137/1.9781611975031.113.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Helber, Stefan. "Assembly/Disassembly Systems with Random Processing Times." In Lecture Notes in Economics and Mathematical Systems. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-95863-2_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lacaze, B. "Reconstruction of Stationary Processes Sampled at Random Times." In Nonuniform Sampling. Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-1229-5_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bertoin, Jean. "Some Aspects of Random Fragmentations in Continuous Times." In Dynamics and Randomness II. Springer Netherlands, 2004. http://dx.doi.org/10.1007/978-1-4020-2469-6_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Random times"

1

Oosthuizen, Joubert, and Stephan Wagner. "On the distribution of random walk hitting times in random trees." In 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974775.7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Alexander, V. A. Mandel. "Inventory control policies for random lead times." In 2017 Tenth International Conference Management of Large-Scale System Development (MLSD). IEEE, 2017. http://dx.doi.org/10.1109/mlsd.2017.8109659.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Konsowa, Mokhtar. "Commute times of random walks on trees." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2012: International Conference of Numerical Analysis and Applied Mathematics. AIP, 2012. http://dx.doi.org/10.1063/1.4756438.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lamiri, Mehdi, Johann Dreo, and Xiaolan Xie. "Operating Room Planning with Random Surgery Times." In 2007 IEEE International Conference on Automation Science and Engineering. IEEE, 2007. http://dx.doi.org/10.1109/coase.2007.4341749.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bouman, Niek, Sem Borst, and Johan van Leeuwaarden. "Delays and mixing times in random-access networks." In the ACM SIGMETRICS/international conference. ACM Press, 2013. http://dx.doi.org/10.1145/2465529.2465759.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Rao, Liangxin, and Minqing Gong. "Availability for repairable series systems with random repair times." In 2011 9th International Conference on Reliability, Maintainability and Safety (ICRMS 2011). IEEE, 2011. http://dx.doi.org/10.1109/icrms.2011.5979394.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Adve, Vikram S., and Mary K. Vernon. "The influence of random delays on parallel execution times." In the 1993 ACM SIGMETRICS conference. ACM Press, 1993. http://dx.doi.org/10.1145/166955.166982.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Gafni, Eli, and Michael Mitzenmacher. "Analysis of timing-based mutual exclusion with random times." In the eighteenth annual ACM symposium. ACM Press, 1999. http://dx.doi.org/10.1145/301308.301318.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Magniez, Frederic, Ashwin Nayak, Peter C. Richter, and Miklos Santha. "On the hitting times of quantum versus random walks." In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2009. http://dx.doi.org/10.1137/1.9781611973068.10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Dervovic, Danial, Parisa Hassanzadeh, Samuel Assefa, and Prashant Reddy. "Non-Parametric Stochastic Sequential Assignment With Random Arrival Times." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/579.

Full text

Abstract:

We consider a problem wherein jobs arrive at random times and assume random values. Upon each job arrival, the decision-maker must decide immediately whether or not to accept the job and gain the value on offer as a reward, with the constraint that they may only accept at most n jobs over some reference time period. The decision-maker only has access to M independent realisations of the job arrival process. We propose an algorithm, Non-Parametric Sequential Allocation (NPSA), for solving this problem. Moreover, we prove that the expected reward returned by the NPSA algorithm converges in probability to optimality as M grows large. We demonstrate the effectiveness of the algorithm empirically on synthetic data and on public fraud-detection datasets, from where the motivation for this work is derived.

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Random times"

1

Engelhardt, M. E. Statistical analysis of random duration times. Office of Scientific and Technical Information (OSTI), 1996. http://dx.doi.org/10.2172/237434.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Getoor, R. K., and Joseph Glover. Constructing Markov Processes with Random Times of Birth and Death,. Defense Technical Information Center, 1986. http://dx.doi.org/10.21236/ada171856.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Santos, Nierlson, and A. E. Gene Freeman. Adjusting Dairy Yield Records From 3 Times to 2 Time Milking Using a Random Regression Model. Iowa State University, 2004. http://dx.doi.org/10.31274/ans_air-180814-939.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Tackett, Gregory B. Real-Time Pseudo-Random Representation of Urban Sprawl. Defense Technical Information Center, 2001. http://dx.doi.org/10.21236/ada394152.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Matei, Ion, Assane Gueye, and John S. Baras. Flow Control in Time-Varying, Random Supply Chains. National Institute of Standards and Technology, 2013. http://dx.doi.org/10.6028/nist.ir.7907.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Zippel, Richard. An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Time. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada210103.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Pfander, Goetz E., Holger Rauhut, and Joel A. Tropp. The Restricted Isometry Property for Time-Frequency Structured Random Matrices. Defense Technical Information Center, 2011. http://dx.doi.org/10.21236/ada563016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ait-Sahalia, Yacine, and Per Mykland. The Effects of Random and Discrete Sampling When Estimating Continuous-Time Diffusions. National Bureau of Economic Research, 2002. http://dx.doi.org/10.3386/t0276.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Makowski, Armand M., and Adam Shwartz. Analysis and Adaptive Control of a Discrete-Time Single-Server Network with Random Routing. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada454733.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Rodríguez Chatruc, Marisol, and Sandra Rozo. Attitudes towards Migrants during Crisis Times. Inter-American Development Bank, 2021. http://dx.doi.org/10.18235/0003331.

Full text

Abstract:

How are natives attitudes towards migrants shaped by economic crises? Natives could show more compassion towards migrants as everyone faces a common threat. Alternatively, natives prejudice could rise as competition for scarce economic opportunities increases. We conduct an online survey to 3,400 Colombian citizens and randomly prime half of them to think about the economic consequences of COVID-19, before eliciting their altruism and attitudes towards Venezuelan migrants. We find that natives attitudes towards migrants are substantially more negative in the treatment relative to the control group. Individuals ages 18 to 25 years, however, respond to the treatment by showing more altruism.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!