Search results

Jump to navigation Jump to search
  • {{Short description|Modification of the random walk model}} The '''persistent random walk''' is a modification of the [[random walk]] model. ...
    1 KB (148 words) - 21:42, 20 June 2024
  • ...ion of coalescing [[random walk]]s, with one walk starting from each point of the integer lattice Z at each time. ...g the arrows backwards in time, which are distributed as coalescing random walks.]] ...
    7 KB (1,035 words) - 01:02, 17 May 2024
  • {{Short description|Random walk with random time between jumps}} ...09075|pages=89–}}</ref> More generally it can be seen to be a special case of a [[Markov renewal process]]. ...
    5 KB (726 words) - 17:16, 12 December 2023
  • ...method''' is a technique that transforms a function defined on the surface of the [[sphere]] to a function defined on a rectangular domain while preservi ...ef>C. Sun, J. Li, F.-F. Jin, and F. Xie, Contrasting meridional structures of stratospheric and tropospheric planetary wave variability in the northern h ...
    3 KB (497 words) - 11:10, 15 September 2024
  • ...wer bound on the second-largest [[eigenvalue]] of the [[adjacency matrix]] of a <math>d</math>-regular graph,<ref>{{citation | title = On the second eigenvalue of a graph ...
    9 KB (1,557 words) - 17:59, 7 February 2024
  • ...ontinuous Monte-Carlo Methods for the Dirichlet Problem|journal=The Annals of Mathematical Statistics|date=Sep 1956|volume=27|issue=3|pages=569–589|jstor ...PDEs, and simulates paths of [[Brownian motion]] (or for some more general variants, [[diffusion processes]]), ...
    15 KB (2,249 words) - 03:37, 27 August 2023
  • ...ate=June 2021}}[[File:Random walk in1d.jpg|thumb|right|'''Figure 1''' Part of a semi-Markovian discrete system in one dimension with directional jumping ...ding with the transition probabilities, and then drawing a random time out of the relevant JT-PDF.{{Citation needed|date=June 2021}}]] ...
    30 KB (4,231 words) - 22:05, 15 November 2024
  • ...r has to find their own number in one of 100 drawers, but may open only 50 of the drawers.]] ...rs hopeless, but a clever strategy offers the prisoners a realistic chance of survival. ...
    26 KB (3,901 words) - 23:26, 25 February 2025
  • ...of Alternative Models of the Short-Term Interest Rate |journal=The Journal of Finance |language=en |volume=47 |issue=3 |pages=1209–1227 |doi=10.1111/j.15 ...the Wavelet Response to Some CKLS Processes |journal=International Journal of Financial Studies |language=en |volume=6 |issue=3 |pages=76 |doi=10.3390/ij ...
    11 KB (1,484 words) - 16:48, 23 June 2024
  • {{Short description|Binary tree selected at random}} ...on orderings (bottom) assigns the center tree probability 1/3, because two of the six possible insertion orderings generate the same tree; the other four ...
    39 KB (5,688 words) - 05:35, 5 November 2024
  • ...hematics)|network]], calculated as the reciprocal of the sum of the length of the [[Shortest path problem|shortest paths]] between the node and all other ...paths between the red square node and the red circle node. The closeness of the red square node is therefore 5/(1+1+1+2+2) = 5/7.]] ...
    20 KB (2,733 words) - 06:44, 9 December 2024
  • ...a method for identifying conserved [[sequence motif|motifs]] within a set of [[nucleic acid sequence|nucleic acid]] or [[peptide sequence]]s. ...n to be [[NP-complete]]. The [[Time complexity|time complexities]] of most of the planted motif search algorithms depend exponentially on the alphabet si ...
    34 KB (5,377 words) - 08:29, 18 July 2024
  • ...prevents compromised long-term keys from compromising the confidentiality of old communication sessions. These properties seemed to make SIDH a natural ...such as [[Transport Layer Security|TLS/SSL]]) has prompted the development of post-quantum cryptography.<ref>{{cite web|last=Utsler|first=Jim|title=Quant ...
    25 KB (3,825 words) - 01:30, 30 December 2023
  • ...nd as the complexity and amount of data involved rise, more efficient ways of solving optimization problems are needed. [[Quantum computing]] may allow p ...a process of constructing a [[mathematical function]] that best fits a set of data points. The fit's quality is measured by some criteria, usually the di ...
    25 KB (3,714 words) - 06:08, 28 February 2025
  • {{Short description|Theory in the domain of evolutionary biology}} ...'introduction'' is the [[population genetic]] process that adds to the set of [[allele]]s in a population with non-zero frequencies). ...
    118 KB (16,971 words) - 12:51, 24 February 2025
  • {{short description|Set of learning techniques in machine learning}} ...s or text, or to an initial set of [[Feature (machine learning)|features]] of the data. Feature learning is intended to result in faster training or bett ...
    45 KB (6,270 words) - 16:45, 5 February 2025
  • ...es a [[decimal expansion]] and set containing each number, ordered by year of discovery. ...o sort the table alphabetically, by decimal value, or by set. Explanations of the symbols in the right hand column can be found by clicking on them. ...
    97 KB (12,300 words) - 09:02, 7 February 2025
  • {{Short description|Interpretation of quantum mechanics}} {{Quantum mechanics|cTopic=[[Interpretation of quantum mechanics|Interpretations]]}} ...
    70 KB (9,934 words) - 14:50, 6 November 2024