Search Results for ""

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

Given a subset A of a larger set, the characteristic function chi_A, sometimes also called the indicator function, is the function defined to be identically one on A, and is ...

A temporal point process is a random process whose realizations consist of the times {tau_j}_(j in J) of isolated events. Note that in some literature, the values tau_j are ...

A random number generator produced by iterating X_(n+1)=|100lnX_n (mod 1)| for a seed X_0=0.1. This simple generator passes the noise sphere test for randomness by showing no ...

A method of displaying simple statistical parameters including hinges, the statistical median, and upper and lower values.

Random walk trajectories which are composed of self-similar jumps. They are described by the Lévy distribution.

A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p). An s-cluster is an isolated group of s adjacent (i.e., horizontally ...

A theorem from information theory that is a simple consequence of the weak law of large numbers. It states that if a set of values X_1, X_2, ..., X_n is drawn independently ...