We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distribution where the expansion property depends on a tunable parameter of the model. The vertices of Gn are n sequentially generated points x1, x2, . . . , xn chosen uniformly at random from the unit sphere in R. After generati...

We study preferential attachment mechanisms in random graphs that are parameterized by (i) a constant bias affecting the degreebiased distribution on the vertex set and (ii) the distribution of times at which new vertices are created by the model. The class of random graphs so defined admits a representation theorem reminiscent of residual allocation, or “stick-breaking” schemes. We characteriz...

sybil attacks pose a serious threat for wireless sensor networks (wsn) security. they can create problems in routing, voting schemes, decision making, distributed storage and sensor re-programming. in a sybil attack,the attacker masquerades as multiple sensor identities, that are actually controlled by one or a few existing attacker nodes. sybil identities are fabricated out of stolen keys, obt...

the present paper offers a meso-scale numerical model to investigate the effects of random distribution of aggregate particles and steel fibers on the elastic modulus of steel fiber reinforced concrete (sfrc). meso-scale model distinctively models coarse aggregate, cementitious mortar, and interfacial transition zone (itz) between aggregate, mortar, and steel fibers with their respective materi...

Existing bidirectional reflectance distribution function (BRDF) models are capable of capturing the distinctive highlights produced by the fibrous nature of wood. However, capturing parameter textures for even a single specimen remains a laborious process requiring specialized equipment. In this paper we take a procedural approach to generating parameters for the wood BSDF. We characterize the ...

We study the mixing time of random graphs in the d-dimensional toric unit cube [0, 1] generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights, drawn from s...

Numerous studies show that most known real-world complex networks share similar properties in their connectivity and degree distribution. They are called small worlds. This article gives a method to turn random graphs into Small World graphs by the dint of random walks.