Graph limit theory provides a rigorous framework for analysing sequences of large graphs by representing them as continuous objects known as graphons – symmetric measurable functions on the unit ...

“The unpredictability of random numbers is fundamental to both digital security ... is based around the concept of intertwining different hash chains to form a hash graph,” the authors explained in ...

We investigate k-connectivity in secure wireless sensor networks under the random pairwise key predistribution scheme with unreliable links. When wireless communication links are modeled as ...

We consider the problem of wide-band direction-of-arrival (DOA) estimation of hydroacoustic signals from marine vessels, which contain both random and sinusoidal components. We generalize the existing ...

Random graphs and random structures; phase transitions; average-case analysis; exponential-time algorithms; and applications in operations research, biology, auctions, etc. Professor Konrad Swanepoel ...

Forming A Random Field via Stochastic Cliques: From Random Graphs to Fully Connected Random Fields ...