منابع مشابه
Volume anomaly in ferrimagnetism
2014 The volume anomaly 0394V/V due to the magnetic energy corresponding to the exchange interactions is experimentally determined for YIG. The experimental values (from 77 K to Tc) agree with the values deduced from the theoretical expression based on the Néel’s theories of volume anomaly and of ferrimagnetism. These results are compared with those obtained by other authors on ferromagnetic an...
متن کاملChasing robbers on percolated random geometric graphs
In this paper, we study the vertex pursuit game of Cops and Robbers, in which cops try to capture a robber on the vertices of a graph. The minimum number of cops required to win on a given graph G is called the cop number of G. We focus on G(n, r, p), a percolated random geometric graph in which n vertices are chosen uniformly at random and independently from [0, 1]. Two vertices are adjacent w...
متن کاملLaser-induced micron and submicron ordering effects in quasi-percolated nanostructured silver thin films.
Quasi-percolated nanostructured silver thin films are used as the starting morphology for inducing simultaneously changes in shape and ordering effects by laser irradiation. The complex fingered nanostructures are transformed into nanospheres which in turn are arranged in micro-circular patterns when irradiated through a pinhole. These transformations are characterized by transmission electron ...
متن کاملFerrimagnetism of MnV(2)O(4) spinel.
The spinel MnV(2)O(4) is a two-sublattice ferrimagnet, with site A occupied by the Mn(2+) ion and site B by the V(3+) ion. The magnon of the system, the transversal fluctuation of the total magnetization, is a complicated mixture of the sublattice A and B transversal magnetic fluctuations. As a result, the magnons' fluctuations suppress in a different way the manganese and vanadium sublattice m...
متن کاملThe acquaintance time of (percolated) random geometric graphs
In this paper, we study the acquaintance time AC(G) defined for a connected graph G. We focus on G(n, r, p), a random subgraph of a random geometric graph in which n vertices are chosen uniformly at random and independently from [0, 1], and two vertices are adjacent with probability p if the Euclidean distance between them is at most r. We present asymptotic results for the acquaintance time of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2009
ISSN: 1742-6596
DOI: 10.1088/1742-6596/145/1/012080