Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph (Q1739922): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Statistics of Gaussian packets on metric and decorated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The second term in the asymptotics for the number of points moving along a metric graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lattice Points of Tetrahedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer points in polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2787522 / rank
 
Normal rank

Revision as of 01:52, 19 July 2024

scientific article
Language Label Description Also known as
English
Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph
scientific article

    Statements

    Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph (English)
    0 references
    29 April 2019
    0 references
    metric graphs
    0 references
    graph polynomials
    0 references
    Barnes' multiple Bernoulli polynomials
    0 references
    random walks on graphs
    0 references

    Identifiers