Results 41 to 50 of about 939,183 (156)
Non Uniform Random Walks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Given $\epsilon _i ∈ [0,1)$ for each $1 < i < n$, a particle performs the following random walk on $\{1,2,...,n\:\}$par If the particle is at $n$, it chooses a point uniformly at random (u.a.r.) from $\{1,...,n-1\}$.
Nisheeth Vishnoi
doaj +1 more source
Asymptotics of Riordan arrays [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The machinery of Riordan arrays has been used recently by several authors. We show how meromorphic singularity analysis can be used to provide uniform bivariate asymptotic expansions, in the central regime, for a generalization of these arrays.
Mark C. Wilson
doaj +1 more source
Computational Mechanics, 2020 A recently introduced NURBS mesh generation method for complex-geometry Isogeometric Analysis (IGA) is applied to building a high-quality mesh for a gas turbine.
Y. Bazilevs +6 more
semanticscholar +1 more source
The volume and time comparison principle and transition probability estimates for random walks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the mean exit time ...
András Telcs
doaj +1 more source
On expected number of maximal points in polytopes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We answer an old question: what are possible growth rates of the expected number of vector-maximal points in a uniform sample from a polytope.
Yu. Baryshnikov
doaj +1 more source
Domination analysis for scheduling on non preemptive uniformly related machines [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 no ...
Idan Eisner, Alek Vainshtein
doaj +1 more source
(Non)Existence of Pleated Folds: How Paper Folds Between Creases [PDF]
, 2011 We prove that the pleated hyperbolic paraboloid, a familiar origami model known since 1927, in fact cannot be folded with the standard crease pattern in the standard mathematical model of zero-thickness paper.
B. Hayes +14 more
core +2 more sources
Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We give a unified treatment of the limit, as the size tends to infinity, of random simply generated trees, including both the well-known result in the standard case of critical Galton-Watson trees and similar but less well-known results in the other ...
Svante Janson
doaj +1 more source
The persistence landscape and some of its properties
, 2019 Persistence landscapes map persistence diagrams into a function space, which may often be taken to be a Banach space or even a Hilbert space. In the latter case, it is a feature map and there is an associated kernel. The main advantage of this summary is
A Adcock +33 more
core +1 more source
Quantum random walks in one dimension via generating functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We analyze nearest neighbor one-dimensional quantum random walks with arbitrary unitary coin-flip matrices. Using a multivariate generating function analysis we give a simplified proof of a known phenomenon, namely that the walk has linear speed rather ...
Andrew Bressler, Robin Pemantle
doaj +1 more source