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

@@ Property / DOI @@
-.1016/j.endm.2018.11.005
@@ Property / DOI: 10.1016/j.endm.2018.11.005 / rank @@
-Normal rank
@@ Property / cites work @@
+Statistics of Gaussian packets on metric and decorated graphs
+Normal rank
@@ Property / cites work @@
+Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
+Normal rank
@@ Property / cites work @@
+The second term in the asymptotics for the number of points moving along a metric graph
+Normal rank
@@ Property / cites work @@
+The Lattice Points of Tetrahedra
@@ Property / cites work: The Lattice Points of Tetrahedra / rank @@
+Normal rank
@@ Property / cites work @@
+Integer points in polyhedra
@@ Property / cites work: Integer points in polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Q5704414
@@ Property / cites work: Q5704414 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2787522
@@ Property / cites work: Q2787522 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ENDM.2018.11.005
@@ Property / DOI: 10.1016/J.ENDM.2018.11.005 / rank @@
+Normal rank