Search Results for ""
501 - 510 of 1536 for Small-World Network Average PathSearch Results
An Eulerian cycle, also called an Eulerian circuit, Euler circuit, Eulerian tour, or Euler tour, is a trail which starts and ends at the same graph vertex. In other words, it ...
The winding number W(theta) of a map f(theta) with initial value theta is defined by W(theta)=lim_(n->infty)(f^n(theta)-theta)/n, which represents the average increase in the ...
The term "math" is the usual term for "mathematics" used in the United States. In contrast, the term "maths" is used in the United Kingdom.
A moving average may generate an irregular oscillation even if none exists in the original data.
The adjective "affine" indicates everything that is related to the geometry of affine spaces. A coordinate system for the n-dimensional affine space R^n is determined by any ...
The maximum flow between vertices v_i and v_j in a graph G is exactly the weight of the smallest set of edges to disconnect G with v_i and v_j in different components (Ford ...
A local source is a node of a directed graph with no entering edges (Borowski and Borwein 1991, p. 401; left figure), and a global source (often simply called a source) is a ...
A polyhedron dissection (or decomposition) is a dissection of one or more polyhedra into other shapes. Two polyhedra can be dissected into each other iff they have equal Dehn ...
Cube point picking is the three-dimensional case of hypercube point picking. The average distance from a point picked at random inside a unit cube to the center is given by ...
The Gauss-Kuzmin distribution is the distribution of occurrences of a positive integer k in the continued fraction of a random (or "generic") real number. Consider xi_n ...
...
View search results from all Wolfram sites (167717 matches)

