Results 31 to 40 of about 210 (139)
Vertex labeling and routing in expanded Apollonian networks [PDF]
, 2007 We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered.
Zhang, Zhongzhi +5 more
core +1 more source
Quantum transport with coupled cavities on an Apollonian network [PDF]
Physical Review A, 2013 10 pages, 10 ...
Almeida, Guilherme M. A. +1 more
openaire +2 more sources
Engineering Reports, Volume 7, Issue 1, January 2025.This research contributes to the advancement of compact and efficient antenna designs for wireless communication systems. Detailed considerations are given to the 2.4 and 5.2 GHz bands to ensure compatibility with standard Wi‐Fi protocols. The designed circular fractal antenna is compared with the conventional circular patch antenna and the results ...
SatheeshKumar Palanisamy +3 more
wiley +1 more source
, 2004 In this letter, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called {\bf Random Apollonian Networks}(RANs) as they can be considered as a variation of Apollonian networks.
Zhou, Tao +4 more
openaire +2 more sources
Geophysical Research Letters, Volume 51, Issue 18, 28 September 2024.Abstract Creating accurate predictive models for drift and pack ice is crucial for a wide array of applications, from improving maritime operations to improving weather prediction and climate simulations. Traditional large‐scale sea ice dynamics models rely on phenomenological ice rheology to simulate ice movements.
J. A. Åström, A. Polojärvi
wiley +1 more source
Parallel Random Apollonian Networks
CoRR, 2009 We present and study in this paper a simple algorithm that produces so called growing Parallel Random Apollonian Networks (P-RAN) in any dimension d. Analytical derivations show that these networks still exhibit small-word and scale-free characteristics. To characterize further the structure of P-RAN, we introduce new parameters that we refer to as the
Nicolas Bonnel 0001 +2 more
openaire +2 more sources
Pelopidarum secunda: a ‘site of memory’ in the history of Elizabethan revenge tragedy
Renaissance Studies, Volume 38, Issue 3, Page 394-415, June 2024.Abstract Pelopidarum secunda is an understudied anonymous English adaptation of Seneca's Agamemnon and Sophocles' Electra. The play is preserved only in manuscript and was probably performed at Winchester College around 1590. Through a combination of Marvin Carlson's notions of ‘ghosting’ and of the ‘site of memory’ with a neo‐historicist approach, the
Angelica Vedelago
wiley +1 more source
Distances in random Apollonian network structures [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper, we study the distribution of distances in random Apollonian network structures (RANS), a family of graphs which has a one-to-one correspondence with planar ternary trees. Using multivariate generating functions that express all information on distances, and singularity analysis for evaluating the coefficients of these functions, we prove
Bodini, Olivier +2 more
openaire +3 more sources
Journal of Mathematics, Volume 2024, Issue 1, 2024.One important algebraic invariant in networks is complexity. This invariant ensures the accuracy and dependability of the network. In this paper, we employ a combinatorial approach to determine the graph’s complexity. A fundamental set of building blocks (basic graphs) will serve as the foundation for all the graphs we investigate, after which we will ...
Mohamed R. Zeen El Deen +3 more
wiley +1 more source
Ising model on the Apollonian network with node-dependent interactions [PDF]
Physical Review E, 2009 6 figures, 12 figure ...
Andrade, R. F. S. +2 more
openaire +3 more sources