Planck's law In 1880, André-Prosper-Paul Crova published a diagram of the three-dimensional appearance of the graph of the strength of thermal radiation as a function of wavelength and temperature. He determined the spectral variable by use of prisms. He analyzed the surface through what he called "isothermal" curves, sections for a single temperature, with a spectral variable on the abscissa and a power variable on the ordinate. He put smooth curves through his experimental data points. They had one peak at a spectral value characteristic for the temperature, and fell either side of it towards the horizontal axis. Such spectral sections are
Biased random walk on a graph total number of the shortest paths between all pairs of nodes that pass through the node formula_14. In fact the walker prefers the nodes with higher betweenness centrality which is defined as below: Based on the above equation, the recurrence time to a node in the biased walk is given by: Variety of applications by using biased random walks on graphs have been developed; control of diffusion, advertisement of products on social networks, explaining dispersal and population redistribution of animals and micro-organisms, community detections, wireless networks, search engines and so on. Biased random walk on a graph In network science,