Перевод: с английского на русский

с русского на английский

random+graph

Страницы

См. также в других словарях:

  • Random graph — In mathematics, a random graph is a graph that is generated by some random process. The theory of random graphs lies at the intersection between graph theory and probability theory, and studies the properties of typical random graphs.Random graph …   Wikipedia

  • Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia

  • Random walk — A random walk, sometimes denoted RW, is a mathematical formalization of a trajectory that consists of taking successive random steps. The results of random walk analysis have been applied to computer science, physics, ecology, economics and a… …   Wikipedia

  • Random regular graph — A random d regular graph is a graph from mathcal{G} {n,d}, which denotes the probability space of all d regular graphs on vertex set [n] , where nd is even and [n] :={1,2,3,...,n 1,n}, with uniform distribution. Pairing ModelPairing Model, also… …   Wikipedia

  • Random minimal spanning tree — In mathematics, random minimal spanning tree, or random MST, is a model (actually two related models) for a random tree (see also minimal spanning tree). It might be compared against the uniform spanning tree, a different model for a random tree… …   Wikipedia

  • Random geometric graph — In graph theory, a random geometric graph is a random undirected graph drawn on a bounded region, eg. the unit torus [0, 1)2.It is generated by # Placing vertices at random uniformly and independently on the region # Connecting two vertices, u ,… …   Wikipedia

  • Random walk hypothesis — The random walk hypothesis is a financial theory stating that stock market prices evolve according to a random walk and thus the prices of the stock market cannot be predicted. It has been described as jibing with the efficient market hypothesis …   Wikipedia

  • Random neural network — The random neural network (RNN) is a mathematical representation of neurons or cells which exchange spiking signals. Each cell is represented by an integer whose value rises when the cell receives an excitatory spike and drops when it receives an …   Wikipedia

  • Graph cuts in computer vision — As applied in the field of computer vision, graph cuts can be employed to efficiently solve a wide variety of low level computer vision problems ( early vision ), such as image smoothing, the stereo correspondence problem, and many other computer …   Wikipedia

  • Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… …   Wikipedia

  • Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
… Нажмите правой клавишей мыши и выберите «Копировать ссылку»