Dynamic geometric graph processes: Adjacency operator approach

DOI10.1007/S00006-010-0228-6MaRDI QIDQ605304zbMATH OpenOpenAlexFDO

Authors R. Schott, G. S. Staples

Publication date 23 November 2010

Published in Advances in Applied Clifford Algebras (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00006-010-0228-6

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Network design and communication in computer systems (68M10)

Recommendations

• Model of a random geometric graph with attachment to the coverage area
• Size of the giant component in a random geometric graph
• The spectrum of a random geometric graph is concentrated
• A random geometric graph built on a time-varying Riemannian manifold
• Some properties for the largest component of random geometric graphs with applications in sensor networks

Cited in

(1)

• Relation between graph of a lattice with respect to its ideals and corresponding adjacency matrix

This page was built for publication: Dynamic geometric graph processes: Adjacency operator approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q605304)