Higher Order Networks An Introduction to

Simplicial Complexes 1st Edition Ginestra

Bianconi download

https://ebookname.com/product/higher-order-networks-an-
introduction-to-simplicial-complexes-1st-edition-ginestra-
bianconi/

Get the full ebook with Bonus Features for a Better Reading Experience on ebookname.com
Instant digital products (PDF, ePub, MOBI) available
Download now and explore formats that suit you...

Networks An Introduction 1st Edition Mark Newman

https://ebookname.com/product/networks-an-introduction-1st-
edition-mark-newman/

Using Simulations to Promote Learning in Higher

Education An Introduction 1st Edition John Paul Hertel

https://ebookname.com/product/using-simulations-to-promote-
learning-in-higher-education-an-introduction-1st-edition-john-
paul-hertel/

From Molecules to Networks An Introduction to Cellular

and Molecular Neuroscience 1st Edition John H. Byrne

https://ebookname.com/product/from-molecules-to-networks-an-
introduction-to-cellular-and-molecular-neuroscience-1st-edition-
john-h-byrne/

Liver Transplantation Clinical Assessment and

Management 1st Edition James Neuberger

https://ebookname.com/product/liver-transplantation-clinical-
assessment-and-management-1st-edition-james-neuberger/
Taiwan s Security and Air Power Taiwan s Defense
against the Air Threat from Mainland China
Routledgecurzon Security in Asia Series 1st Edition
Martin Edmonds
https://ebookname.com/product/taiwan-s-security-and-air-power-
taiwan-s-defense-against-the-air-threat-from-mainland-china-
routledgecurzon-security-in-asia-series-1st-edition-martin-
edmonds/

Ten steps to complex learning 3rd Edition Edition

Jeroen Van Merriënboer

https://ebookname.com/product/ten-steps-to-complex-learning-3rd-
edition-edition-jeroen-van-merrienboer/

Stiletto 1st Edition Daniel O'Malley

https://ebookname.com/product/stiletto-1st-edition-daniel-
omalley/

Teach Yourself VISUALLY WordPress 1st Edition Janet

Majure

https://ebookname.com/product/teach-yourself-visually-
wordpress-1st-edition-janet-majure/

The Jesus Mysteries Was the Original Jesus a Pagan God

Tim Freke

https://ebookname.com/product/the-jesus-mysteries-was-the-
original-jesus-a-pagan-god-tim-freke/
Principles of System Identification Theory and Practice
1st Edition Arun K. Tangirala

https://ebookname.com/product/principles-of-system-
identification-theory-and-practice-1st-edition-arun-k-tangirala/
 Bianconi
Higher-order networks describe the many-body interactions of
a large variety of complex systems ranging from the the brain
to collaboration networks. Simplicial complexes are generalized
network structures which allow us to capture the combinatorial
properties, the topology and the geometry of higher-order
networks. Having been used extensively in quantum gravity The Structure and Dynamics
to describe discrete or discretized space-time, simplicial
complexes have only recently become the representation of of Complex Networks
choice for capturing the underlying network topology and
geometry of complex systems.
This Element provides an in-depth introduction to the very
hot topic of network theory, covering a wide range of subjects
Higher-Order

Higher-Order Networks
ranging from emergent hyperbolic geometry and topological
data analysis to higher-order dynamics. This Element aims to
demonstrate that simplicial complexes provide a very general
mathematical framework to reveal how higher-order dynamics
Networks
depends on simplicial network topology and geometry.
An Introduction to
About the series Series editors
Simplicial Complexes
This cutting-edge new series provides Guido Caldarelli
authoritative and detailed coverage Ca’ Foscari
University of
Ginestra Bianconi
of the underlying theory of complex
networks, specifically their structure and Venice
dynamical properties. Each Element within

https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

the series will focus upon one of three
primary topics: static networks, dynamical
networks and numerical/computing
network resources.

Cover image: jivacore/Shutterstock ISSN 2516-5763 (online)

ISSN 2516-5755 (print)
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press
 Elements in the Structure and Dynamics of Complex Networks
edited by
Guido Caldarelli
Ca’ Foscari University of Venice

H I GH E R - O R D E R
NE T W O R KS
An Introduction to Simplicial Complexes

Ginestra Bianconi
Queen Mary University of London and The Alan
Turing Institute
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press
 University Printing House, Cambridge CB2 8BS, United Kingdom
One Liberty Plaza, 20th Floor, New York, NY 10006, USA
477 Williamstown Road, Port Melbourne, VIC 3207, Australia
314–321, 3rd Floor, Plot 3, Splendor Forum, Jasola District Centre,
New Delhi – 110025, India
103 Penang Road, #05–06/07, Visioncrest Commercial, Singapore 238467

Cambridge University Press is part of the University of Cambridge.

It furthers the University’s mission by disseminating knowledge in the pursuit of
education, learning, and research at the highest international levels of excellence.

www.cambridge.org
Information on this title: www.cambridge.org/9781108726733
DOI: 10.1017/9781108770996
© Ginestra Bianconi 2021
This publication is in copyright. Subject to statutory exception
and to the provisions of relevant collective licensing agreements,
no reproduction of any part may take place without the written
permission of Cambridge University Press.
First published 2021
A catalogue record for this publication is available from the British Library.
ISBN 978-1-108-72673-3 Paperback
ISSN 2516-5763 (online)
ISSN 2516-5755 (print)
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

Cambridge University Press has no responsibility for the persistence or accuracy of

URLs for external or third-party internet websites referred to in this publication
and does not guarantee that any content on such websites is, or will remain,
accurate or appropriate.
 Higher-Order Networks

An Introduction to Simplicial Complexes

Elements in the Structure and Dynamics of Complex Networks

DOI: 10.1017/9781108770996
First published online: November 2021

Ginestra Bianconi
Queen Mary University of London and The Alan Turing Institute
Author for correspondence: Ginestra Bianconi, [email protected]

Abstract: Higher-order networks describe the many-body interactions of a

large variety of complex systems ranging from the the brain to
collaboration networks. Simplicial complexes are generalized network
structures which allow us to capture the combinatorial properties, the
topology and the geometry of higher-order networks. Having been used
extensively in quantum gravity to describe discrete or discretized
space-time, simplicial complexes have only recently become the
representation of choice for capturing the underlying network topology
and geometry of complex systems.
This Element provides an in-depth introduction to the very hot topic of
network theory, covering a wide range of subjects ranging from emergent
hyperbolic geometry and topological data analysis to higher-order
dynamics. This Element aims to demonstrate that simplicial complexes
provide a very general mathematical framework to reveal how higher-order
dynamics depends on simplicial network topology and geometry.
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

Keywords: Higher-order networks, Simplicial complexes, Higher-order

dynamics, Simplicial network topology and geometry, Topological data analysis

© Ginestra Bianconi 2021

ISBNs: 9781108726733 (PB), 9781108770996 (OC)
ISSNs: 2516-5763 (online), 2516-5755 (print)
 Contents

1 The Relevance of Higher-Order Networks

in Network Science 1

2 Combinatorial and Statistical Properties of Simplicial

Complexes 7

3 Simplicial Network Topology 30

4 Simplicial Network Geometry 46

5 Emergent Geometry 56

6 Higher-Order Dynamics: Synchronization 86

7 Higher-Order Dynamics: Percolation 99

8 Higher-Order Dynamics: Contagion Models 107

9 Outlook 113
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

Appendix A Maximum Entropy Ensembles of Simplicial

Complexes 115

Appendix B The Hodge Decomposition 119

Appendix C Spectral Dimension of Euclidean Lattices 121

Appendix D Topological Moves 123

Appendix E Emergent Preferential Attachment 125

Appendix F Generalized Degree Distributions of NGFs

(Neutral Model) 127

Appendix G Apollonian and Pseudo-Fractal Simplicial

Complexes 129

References 130
 Higher-Order Networks 1

1 The Relevance of Higher-Order Networks

in Network Science
1.1 Simplicial Complexes as Generalized Network Structures
Network science [1–4] is routed on the idea that the complexity of interacting
systems can be captured by the network of interactions between their con-
stituents. This very powerful framework has enabled the scientific community
to make unprecedented progress in the understanding of complex systems rang-
ing from the brain to society. In the last 20 years, network theory has revealed
the rich interplay between the network topology and dynamics [3, 5]. It has been
shown that universal statistical properties of complex networks, such as the
scale-free degree distribution and the small-world nature of complex networks,
are responsible for the surprising dynamical properties that processes such as
percolation, epidemic spreading, Ising model and synchronization display in
these networks.
Recently, mounting evidence reveals that to make the next big leap for-
ward in understanding and predicting the behavior of complex networks it is
important to abandon the framework of a simple network formed exclusively
by pairwise interactions and use generalized network structures that can bet-
ter capture the richness of real data. Multilayer networks [6] are well-studied
generalized networks that are able to treat datasets in which interactions have
different nature and connotation displaying a rich interplay between struc-
ture and dynamics. More recently the research attention has been focusing on
higher-order networks [7–11] that allow capture of the many-body interactions
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

of complex systems going beyond the pairwise interaction framework.

Consider for example three regions of the brain. These three regions can be
correlated with each other pairwise via three two-body interactions or might
be related by a higher-order (three-body) interaction, revealed by the fact that
these three regions of the brain are typically activated at the same time. These
two scenarios correspond to very different dynamics that can be distinguished
only by considering higher-order networks. Indeed in the first case the higher-
order network between the three regions of the brain will include just three
links, while in the second case the three brain regions would form a three-
body interaction indicated by a filled triangle (also called a two-dimensional
simplex). In social networks a notable example of a higher-order network is
constituted by the set of face-to-face interactions at a party or during a cof-
fee break at a conference. In this context the people will form conversation
groups, often involving more than two individuals, in which ideas are shared
and elaborated in a way that is not reducible to a set of pairwise conversations.
 2 The Structure and Dynamics of Complex Networks

Likewise in protein interaction networks proteins bind to each other forming

protein complexes typically including more than two different proteins. Only
when the protein complex is fully assembled is the protein complex able to
perform its biological task. This indicates that the biological function of the
protein complex is the result of many-body interactions between its constituent
proteins and cannot be reduced to a set of pairwise interactions.
Higher-order networks fully capture the interactions between two or more
nodes and are necessary to describe dynamical processes depending on many-
body interactions. In recent years this research field has boomed and important
new progress has been made to uncover the interplay between higher-order
structure and dynamics. In this work we aim to provide a brief introduction
to the subject that could be useful for graduate students and for researchers to
jump start into this lively research field.

1.2 Simplicial Complexes and Hypergraphs

When faced with the problem of capturing higher-order interactions existing
in a dataset, two generalized network structures are potentially useful for the
researcher: simplicial complexes and hypergraphs.
Both simplicial complexes and hypergraphs capture higher-order interac-
tions and are formed by a set of nodes v 2 f1; 2; 3 : : : ; Ng and a set of
many-body interactions including two or more nodes, such as

˛ D Œv0 ; v1 ; : : : ; vd ; (1.1)
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

with d  1. These many-body interactions are called simplices of a simplicial

complex or hyperedges of a hypergraph. These higher-order interactions induce
a very rich combinatorial structure for higher-order networks [12] that can also
have very relevant consequences for higher-order dynamics, including syn-
chronization and contagion processes [13, 14]. As both simplicial complexes
and hypergraphs capture the many-body interactions in a complex system, the
vast majority of many-body phenomena obtained in one framework can be
directly translated into the other framework.
The only difference between simplicial complexes and hypergraphs is a
subtle one: the set of simplices of a simplicial complex is closed under the
inclusion of subsets of the simplices in the set while no such constraint exists
for a hypergraph. This means that in a simplicial complex, if the simplex ˛
given by

Œv0 ; v1 ; v2 ; (1.2)

belongs to the simplicial complex, then the simplices

 Higher-Order Networks 3

Œv0 ; v1 ; Œv0 ; v2 ; Œv1 ; v2 ; Œv0 ; Œv1 ; Œv2 ; (1.3)

must also belong to the simplicial complex. In other words, if we consider a

collaboration network in which three authors have written a paper together,
then we should include in the simplicial complex also the three pairwise inter-
actions between the authors and the set of the three isolated nodes. This might
look like an artificial constraint, but actually it comes with the great advantage
that simplicial complexes are natural topological spaces for which important
topological results exist. This widely developed branch of mathematics pro-
vides a powerful resource for extracting information and revealing the interplay
between topological and geometrical properties of higher-order networks and
their dynamics.
The scientific research on higher-order networks is currently growing and
many important results have been recently obtained in this field. In this Ele-
ment, our goal is to provide a self-contained, coherent and uniform account of
the results on higher-order networks. For space limitations we have chosen to
focus mostly on simplicial complexes. However, on a number of occasions we
will refer to results exclusively applying to hypergraphs.

1.3 A Topological Approach to Complex

Interacting Systems
A simplex characterizes an interaction between two or more nodes. The sim-
plices of a simplicial complex are glued to one another by sharing a subset of
their nodes, resulting in topological spaces. Topological spaces have a num-
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

ber of features, for instance they can be characterized not only by the number
of their connected components, like networks, but also by the number of their
higher-order cavities or holes indicated by their Betti numbers. Applied topol-
ogy [8, 15–19] studies the underlying topology (including the Betti numbers)
of simplicial complexes coming from real data. This field has been flourish-
ing in the last decades and was initially applied to extract information from
data-clouds coming from different sources of data including, for instance,
gene-expression. An important framework that has been developed in applied
topology is called persistent homology and is based on an operation called
filtration that aims at coarse-graining the data with different resolution char-
acterizing how long topological features persist. Only recently [20, 21] has this
approach been applied to real networked data and in particular to brain func-
tional networks, which are weighted networks in which the filtration procedure
is not simple coarse-graining, rather it is substituted with a change of thresh-
old in the weights of the links. Persistence homology of complex networks
is a powerful topological tool that makes extensive use of the simplicial rep-
resentation of data and has shown to reveal differences not accounted for by
 4 The Structure and Dynamics of Complex Networks

other more traditional Network Science measures. However the possibility of

using persistence homology is by no means the only benefit of using topology
to analyze higher-order networks. In neuroscience [8, 22] the use of simpli-
cial complexes has been booming in recent years and novel results show the
rich interplay between topology and dynamics in the framework of the in-silico
reconstruction of rat brain cortex [23]. Moreover, simplicial topology can be
also used to investigate the local [24] and the meso-scale structure [25, 26] of
network data.
Departing from the benefit that topology can bring to higher-order data anal-
ysis, recently it has been shown that topology, and specifically Hodge theory,
can be exploited by higher-order networks for sustaining and synchronizing
higher-order topological signals, i.e. dynamical variables that are not only
defined on the nodes of the network, but rather like fluxes they can be defined
on links or even on higher-order structures like triangles or tetrahedra [27].
Interestingly topological signals are also attracting increasing attention from
the signal processing perspective [28].
This multifaceted research field clearly shows that topology is a fundamental
tool to investigate higher-order network structure and dynamics.

1.4 A Geometrical Approach to Higher-Order Networks

If the links of a simplicial complex are assigned a distance, simplices have
an automatic interpretation as geometrical objects, and can be understood as
nodes, links, triangles, tethrahedra, etc. In particular, in absence of other data
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

that can be used to assign a distance to each link, the network scientist can
always choose to assign the same distance to each link.
Since simplicial complexes describe discrete simplicial geometries, mod-
eling simplicial complexes opens the possibility to reveal the fundamental
mechanisms of emergent simplicial geometry.
The long-standing mathematical problem of emergent geometry originates in
the field of quantum gravity, but this field is also very significant for complex
systems such as brain networks. Emergent simplicial geometry refers to the
ability of non-equilibrium or equilibrium models to generate simplicial com-
plexes with notable geometric properties by using purely combinatorial rules
that make no explicit reference to the network geometry. For instance emergent
geometry models should be independent of any possible simplicial complex
embedding.
Recently a series of works [29–31] has proposed a theoretical framework
called Network Geometry with Flavor that captures the fundamental mechan-
ism of emergent hyperbolic geometry. This framework opens a new perspec-
tive into the long-standing problem of emergent geometry and has possible
 Higher-Order Networks 5

implications ranging from quantum gravity to complex systems. Addition-

ally, this framework generates simplicial networks whose underlying network
structure displays all the statistical properties of complex networks including
scale-free degree distribution, high clustering coefficient, small-world diam-
eter and significant community structure. The resulting simplicial complexes
can reveal distinct geometrical features including a finite spectral dimension
[32, 33]. The spectral dimension [34] characterizes the slow relaxation of
diffusion processes to their equilibrium steady-state distribution, similarly to
what happens for finite-dimensional Euclidean networks. However, higher-
order networks with finite spectral dimensions might dramatically differ from
Euclidean networks. In fact a finite spectral dimension can co-exist with small-
world properties (including an infinite Hausdorff dimension) and a non-trivial
community structure. The intrinsic geometrical nature of simplicial complexes
with finite spectral dimensions can have a profound effect on dynamical pro-
cesses such as diffusion and synchronization [35, 36]. In particular, if the
spectral dimension dS is smaller than four, dS  4, it is not possible to observe
a synchronized phase of the Kuramoto dynamics and strong spatio-temporal
fluctuations are observed instead.
Hyperbolic simplicial geometry also has an important effect on percolation
processes. Indeed, percolation on hyperbolic simplicial complexes can dis-
play more than one transition and critical behavior at the emergence of the
extensive component that deviates from the standard second-order continu-
ous transition. Indeed discontinuous transitions or continuouss transitions with
non-trivial critical behavior can be found, depending on the geometry of the
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

higher-order network [37].

1.5 The Advantages of Using Simplicial Complexes and the

Outline of the Element Structure
Beside allowing a full topological analysis of higher-order networks, simplicial
complexes have the following two advantages: they capture the many-body
interactions of a complex system and they allow us to uncover the impor-
tant role that simplicial topology and simplicial geometry have in dynamics.
So far our understanding of the interaction between structure and dynamics
has focused on the combinatorial properties of networks (such as their degree
distribution) and some of their spectral properties [3, 5]. Study of the interplay
between higher-order networks starts to reveal a much richer picture summa-
rized in the diagram presented in Figure 1 in which discrete simplicial network
geometry and topology provides new clues to interpret higher-order dynamics.
This very innovative framework is emerging from recent research on higher-
order networks and has the potential to significantly change the way in which
 6 The Structure and Dynamics of Complex Networks

Figure 1 The interplay between higher-order structure and dynamics is

mediated by the higher-order combinatorial and statistical properties
combined with simplicial network topology and geometry.

we investigate the interplay between structure and dynamics in complex sys-

tems. In this Element our goal is to provide the fundamental tools to understand
the current research in the field and to make the next steps in this wonderful
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

world of higher-order networks. The Element will introduce important aspects

of discrete topology and discrete geometry in a pedagogical way accessible
to the interdisciplinary audience of PhD students and researchers in network
science.
The Element is structured as follows: in Section 2 we will provide the mathe-
matical definitions of simplicial complexes and discuss their combinatorial and
statistical properties, covering generalized degrees and the maximum entropy
models of simplicial complexes; Section 3 will cover the basic elements of sim-
plicial network topology, ranging from Topological Data Analysis (TDA) of
simplicial complexes, to properties of the higher-order Laplacians; Section 4
is devoted to simplicial network geometry; Section 5 discusses models of
emergent geometry including Network Geometry with Flavor; Sections 6, 7,
8 discuss higher-order dynamics including synchronization, percolation and
contagion models; finally in Section 9 we provide concluding remarks. The
Appendices provide further useful details on the material presented in the main
body of this work.
 Higher-Order Networks 7

Due to space limitations we have adopted a style that favors coherence of

narrative over providing an exhaustive review of all the papers on the sub-
ject. Therefore we regret that we have not been able to cover all the growing
literature on the subject.

2 Combinatorial and Statistical Properties of Simplicial

Complexes
2.1 Mathematical Definitions
2.1.1 Basic Properties of Simplicial Complexes and Hypergraphs

A network is a graph G D .V; E/ formed by a set of nodes V and a set of links E

that represent the elements of a complex system and their interactions, respec-
tively. Networks are ubiquitous and include systems as different as the WWW
(web graphs), infrastructures (such as airport networks or road networks) and
biological networks (such as the brain or the protein interaction network in the
cell). Networks are pivotal to capturing the architecture of complex systems;
however, they have the important limitation that they cannot be used to capture
the higher-order interactions. In order to encode for the many-body interactions
between the elements of a complex system, higher-order networks need to be
used. A powerful mathematical framework to describe higher-order networks
is provided by simplicial complexes. Simplicial complexes are formed by a set
of simplices. The simplices indicate the interactions existing between two or
more nodes and are defined as follows:
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

S
A d-dimensional simplex ˛ (also indicated as a d-simplex ˛) is formed by
a set of .d C 1/ interacting nodes

˛ D Œv0 ; v1 ; v2 : : : ; vd :

It describes a many-body interaction between the nodes.

It allows for a topological and a geometrical interpretation of the simplex.

For instance, a node is a 0-simplex, a link is a 1-simplex, a triangle is a

2-simplex a tetrahedron is a 3-simplex and so on (see Figure 2).

F
A face of a d-dimensional simplex ˛ is a simplex ˛ 0 formed by a proper
subset of nodes of the simplex, i.e. ˛ 0  ˛:
 8 The Structure and Dynamics of Complex Networks

0-simplex 1-simplex 2-simplex 3-simplex

Figure 2 A 0-simplex is a node, a 1-simplex is a link, a 2-simplex is a
triangle, a 3-simplex is a tethrahedron and so on.
Source: Reprinted from [38] ©SISSA Medialab Srl. Reproduced by permission of IOP
Publishing. All rights reserved.

3-simplex

Faces

4 0-simplices 6 1-simplices 4 2-simplices

Figure 3 The faces of a 3-simplex (tetrahedron) are four 0-simplices (nodes),
six links (1-simplices) and four triangles (2-simplices).
Source: Reprinted from [38] ©SISSA Medialab Srl. Reproduced by permission of IOP
Publishing. All rights reserved.

For instance the faces of a 2-simplex Œv0 ; v1 ; v2  include three nodes Œv0 ,
Œv1 , Œv2  and three links Œv0 ; v1 ; Œv0 ; v2 ; Œv1 ; v2 . Similarly, in Figure 3 we
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

characterize the faces of a tetrahedron.

The simplices constitute the building blocks of simplicial complexes.

S
A simplicial complex K is formed by a set of simplices that is closed under
the inclusion of the faces of each simplex.
The dimension d of a simplicial complex is the largest dimension of its
simplices.

Simplicial complexes represent higher-order networks, which include interac-

tions between two or more nodes, described by simplices. In more stringent
mathematical terms a simplicial complex K is a a set of simplices that satisfy
the following two conditions:
 Higher-Order Networks 9

(a) if a simplex ˛ belongs to the simplicial complex, i.e. ˛ 2 K, then any face
˛ 0 of the simplex ˛ is also included in the simplicial complex, i.e. if ˛ 0  ˛
then ˛ 0 2 K;
(b) given two simplices of the simplicial complex ˛ 2 K and ˛ 0 2 K then
either their intersection belongs to the simplicial complex, i.e. ˛ \ ˛ 0 2 K,
or their intersection is null, i.e. ˛ \ ˛ 0 D ;.

Here and in the future we will indicate with N the total number of nodes
in the simplicial complex and we will indicate with NŒm the total number
of m-dimensional simplices in the simplicial complex (note that NŒ0 D N).
Furthermore we will indicate with Qm .N/ the set of all possible and distinct
m-dimensional simplices that can be present in a simplicial complex K includ-
ing N nodes. With Sm .K/ we will indicate instead the set of all m-dimensional
simplices present in K.
Among the simplices of a simplicial complex, the facets play a very relevant
role.

F
A facet is a simplex of a simplicial complex that is not a face of any
other simplex. Therefore a simplicial complex is fully determined by the
sequence of its facets.

A very interesting class of simplicial complexes are pure simplicial com-

https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

plexes.

P
A pure d-dimensional simplicial complex is formed by a set of d-
dimensional simplices and their faces.
Therefore pure d-dimensional simplicial complexes admit as facets only
d-dimensional simplices.

This implies that pure d-dimensional simplicial complexes are formed exclu-
sively by gluing d-dimensional simplices along their faces. In Figure 4 we show
an example of simplicial complex that is pure and an example of a simplicial
complex that it is not pure.
An interesting question is whether it is possible to convert a simplicial com-
plex into a network and vice versa and how much information is lost/retained
 10 The Structure and Dynamics of Complex Networks

Figure 4 An example of a 2-dimensional simplicial complex that is pure and

an example of a 2-dimensional simplicial complex that is not pure.

in the process. Given a simplicial complex it is always possible to extract a

network known as the 1-skeleton of the simplicial complex by considering
exclusively the nodes and links belonging to the simplicial complex. Con-
versely, given a network, it is possible to derive deterministically a simplicial
complex called the clique complex of the network. The clique complex is
obtained from a network by taking every .d C 1/-clique in a simplex of dimen-
sion d. The clique complex is a simplicial complex. In fact, if a simplex is
included in a clique complex, then all its subsimplices are also included. More-
over any two simplices of the clique complex have an intersection that is either
the null set or a simplex of the clique complex.
Hypergraphs are alternative representations of higher-order networks that
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

can be used instead of simplicial complexes.

H
A hypergraph G D .V; EH / is defined by a set V of N nodes and a set EH of
hyperedges, where an .m C 1/-hyperedge indicates a set of m C 1 nodes

e D Œv0 ; v1 ; v2 ; : : : ; vm ;

with generic values of 1  m < N.

A hyperedge describes the many-body interaction between the nodes.

As mathematical objects simplicial complexes are distinct from hypergraphs,

the difference being that simplicial complexes include all the subsets of a
given simplex. From a network science perspective a given dataset includ-
ing higher-order interactions can be described either as a simplicial complex
 Higher-Order Networks 11

or as a hypergraph. However, it might be argued that in a simplicial complex

description of a higher-order network dataset we can lose some information.
For instance a collaboration network is a good example of a hypergraph where
hyperedges correspond to the fact that the considered set of authors (nodes)
have published at least a paper together. In this context having a hyperedge
connecting three authors indicates that the three authors have co-authored at
least a paper together. However, the existence of this three-body interaction
does not imply that each scientist has also co-authored a two-author paper with
each other scientist in the trio. Therefore by using simplicial complexes to
model a collaboration network, we essentially retain only information about
the facets of the collaboration while losing detailed information about which
lower-dimensional simplex actually indicates a real collaboration. On the other
side simplicial complexes allow the use of the very powerful tools of simplicial
network topology and geometry that can be a game changer, revealing a much
richer interplay between network topology and geometry.
We really believe that it is important for the network scientist to use the
right tool for the right problem. It turns out that in many contexts relevant to
the network scientist the alternative representations (hypergraph and simplicial
complexes) are actually interchangeable. In the cases where they are not, it is
important to be able to understand the benefits of one or the other representation
and how the results obtained in one framework can be relevant to informing the
investigation using the alternative representation.
In this Element, as we want to introduce the reader to the wonderful world
of simplicial network topology and geometry, we will mostly cover sim-
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

plicial complexes; however, results that apply to hypergraphs will also be

covered.

2.1.2 Cell Complexes

Cell complexes (or CW complexes where C stands for closure finite and W
stands for weak topology) are a generalization of simplicial complexes that
are not exclusively formed by simplices but instead can be formed by basic
building blocks called cells. Cells describe many-body interactions that are
weaker than those of simplicial complexes, and they have a 1-skeleton that
differs from a clique. This means that a square can be interpreted as a cell of
four-body interactions whose faces are just four links. This can be useful in
some situations such as social interaction networks where, for instance, a dis-
cussion group can be formed by four people not all having a pairwise social tie
with everybody else in the group, or in protein interactions networks where not
all the proteins of a protein complex bind pairwise to each other.
 12 The Structure and Dynamics of Complex Networks

(a) (b) (c) (d) (e)

Figure 5 All the regular polytopes in d D 3 (Platonic solids): (a) tetrahedron,
(b) cube, (c) octahedron, (d) dodecahedron, (e) icosahedron.
Source: Reprinted from [32].

Mathematically, a d-dimensional cell is a d-dimensional convex polytope

and in general open d-dimensional cells are topological spaces homeomorphic
to an open ball. Therefore 0-dimensional cells are nodes and 1-dimensional
cells are links, and therefore do not differ from 0-dimensional and
1-dimensional simplices. However, 2-dimensional cells include m-polygons
such as triangles (2-dimensional simplices), squares, pentagons etc. Simi-
larly, 3-dimensional cells include the Platonic solids, such as tethrahedra
(3-dimensional simplices), cubes, octahedra, dodecahedra and icosahedra (see
Figure 5). Interestingly, in dimension d D 4 there are more regular polytopes
than in dimension d D 3 (being 6), but for any dimension d > 4 there are only
three types of regular (convex) polytopes: the simplex, the hypercube and the
orthoplex.
A cell complex KO has the following two properties:

(a) it is formed by a set of cells that is closure-finite, meaning that every cell
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

is covered by a finite union of open cells;

(b) given two cells of the cell complex ˛ 2 KO and ˛ 0 2 KO then either their inter-
section belongs to the cell complex, i.e. ˛ \ ˛ 0 2 K,O or their intersection is
0
a null set, i.e. ˛ \ ˛ D ;.

In this Element we will discuss mostly the properties of simplicial com-

plexes; however, in a number of places we will refer to results applying to
more general cell complexes.

2.2 Generalized Degrees of Simplicial Complexes

A key local structural property of networks is the degree of the nodes. The
degree of a node characterizes only the local structure of the network around
the node – its number of interactions. However, the statistical properties
associated with the degree are important global properties of the network
that can significantly affect its global dynamics, as in the case of scale-free
degree distributions [1]. It is therefore natural to desire to extend the notion
 Higher-Order Networks 13

Figure 6 A 2-dimensional simplicial complex is shown together with its

generalized degree sequences k2;0 and k2;1 of the nodes and links, respectively.

of degrees to simplicial complexes. The generalized degrees [12, 29, 39] are
the fundamental combinatorial properties describing the structure of simpli-
cial complexes. Interestingly, in a simplicial complex not only nodes, but also
links and higher-dimensional simplices can be associated with generalized
degrees.

G
The generalized degree [12, 29, 39] kd;m .˛/ of an m-dimensional sim-
plex ˛ indicates the number of d-dimensional simplices incident to the
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

m-simplex ˛.

We note that k1;0 .Œr/ reduces to the degree of node r in the 1-skeleton of the
simplicial complex. In Figure 6 we show a 2-dimensional simplicial complex
together with the list of the generalized degrees k2;1 and k2;0 of its nodes and
links, respectively. Note that while the generalized degrees kd;m can be defined
for every pair of dimensions .d; m/ with d ¤ m, the generalized degrees with
d < m are trivial and do not depend on the simplicial complex structure, indeed
they characterize how many d-dimensional faces an m-dimensional simplex
has. Therefore, for d < m we have
!
mC1
kd;m .˛/ D ;
dC1

for every m-dimensional simplex of any simplicial complex. It follows that the
relevant generalized degrees kd;m .˛/ for describing the different structures of
 14 The Structure and Dynamics of Complex Networks

simplicial complexes have d > m. The generalized degrees are of fundamental

importance for capturing the combinatorial and statistical properties of sim-
plicial complex data and of models of simplicial complexes. Interestingly, a
simplicial complex can display very different generalized degree distributions
kd;m if one considers different dimensions m, as we will demonstrate in the
case of the model Network Geometry with Flavor (see Section 5.3). The gen-
eralized degrees can be also used to determine the combinatorial conditions for
observing a discrete manifold (see Section 4.1). They are therefore an impor-
tant combinatorial aspect of simplicial complexes that is related to their discrete
network geometry.
In addition to generalized degrees, another useful statistical property of
simplicial complexes is the distribution of the size of their facets. For exam-
ple, in the collaboration network this captures the distribution of the largest
collaborations involving a set of authors [40].

2.3 Pure Simplicial Complexes and Their Tensorial

Representation
Pure d-dimensional simplicial complexes have a structure that can be fully
captured by a .d C 1/-dimensional tensor aŒd called an adjacency tensor.
The adjacency tensor aŒd has elements aŒd
˛ 2 f0; 1g indicating, for each
possible d-dimensional simplex ˛ 2 Qd .N/, if the simplex is present (a˛ D 1)
or absent (a˛ D 0) in the simplicial complex K, i.e.
(
Œd 1 if ˛ 2 Sd .K/;
a˛ D (2.1)
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

0 otherwise:

The adjacency matrix tensor is symmetric under the permutation of the order of
the nodes in the simplices, for instance, if in a 2-dimensional simplical complex
Œ2
we have arsq D aŒ2 Œ2
sqr D asrq and so on for each possible permutation of the three
indices forming the simplex ˛ D Œr; s; q.

2.4 Generalized Degrees of Pure Simplicial Complexes

2.4.1 General Properties
The generalized degrees kd;m .˛/ of a pure d-dimensional simplicial complex
can be defined in terms of the adjacency tensor aŒd as
X
kd;m .˛/ D aŒd
˛0 : (2.2)
˛ 0 2Qd .N/j˛ 0 ˛

The generalized degrees obey a nice combinatorial relation as they are not inde-
pendent of each other. In fact, the generalized degree of an m-face ˛ is related to
 Higher-Order Networks 15

the generalized degree of the m0 -dimensional faces incident to it, with m0 > m,
by the simple combinatorial relation
1 X
kd;m .˛/ D ! kd;m0 .˛ 0 /: (2.3)
d m ˛ 0 2Qd .N/j˛ 0 ˛
m0 m
!
dC1
Moreover, since every d-dimensional simplex belongs to
mC1
m-dimensional faces, in a simplicial complex with M d-dimensional simplices
we have
!
X dC1
kd;m .˛/ D M: (2.4)
mC1
˛2Sm .K/

2.4.2 Case of a Simplicial Complex of Dimension d D 1

Simplicial complexes of dimension d D 1 are networks and therefore are

formed exclusively by nodes and links. The adjacency tensor of the
1-dimensional simplicial complex reduces to the adjacency matrix aŒ1 (also
indicated as A), whose elements aŒ1rs (or Ars ) indicate whether the link Œr; s is
present or not in the network. In this case, the generalized degree k1;0 .Œr/ of a
node r simply indicates its degree (also indicated as kr ), i.e. the number of links
incident to it,
N
X
k1;0 .Œr/ D aŒ1
rs : (2.5)
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

sD1

2.4.3 Case of a Simplicial Complex of Dimension d D 2

Pure simplicial complexes of dimension d D 2 are formed exclusively by a set

of triangles and their faces (nodes and links). A 2-dimensional pure simplicial
complex is determined by the adjacency tensor aŒ2 of elements aŒ2
rsq D 1 if the
triangle ˛ D Œr; s; q belongs to the simplicial complex and aŒ2
rsq D 0 if it does
not belong to the simplicial complex. The generalized degree k2;0 .Œr/ of node
r is given by
X
k2;0 .Œr/ D aŒ2
rsq ; (2.6)
s<q

while the generalized degree k2;1 .Œr; s/ of a link ˛ D Œr; s is given by
N
X
k2;1 .Œr; s/ D aŒ2
rsq : (2.7)
qD1
 16 The Structure and Dynamics of Complex Networks

The generalized degree k2;0 .Œr/ of node r indicates the number of triangles
incident to it, while the generalized degree k2;1 .Œr; s/ of the link Œr; s indicates
the number of triangles incident to the link. The generalized degree of the nodes
is related to the generalized degree of the links. In fact it is easy to see that

X N
1 X Œ2 1X
k2;0 .Œr/ D aŒ2
rsq D arsq D k2;1 .Œr; s/: (2.8)
s<q
2 s;q 2 sD1

Since each triangle is incident to three nodes, we have

N
X
k2;0 .Œr/ D 3M; (2.9)
rD1

where M is the number of 2-dimensional simplices in the simplicial complex.

2.5 Clique Complexes of Random Uncorrelated Networks

Clique complexes are a simple way to generate simplicial complexes starting
from network data. As network data is currently more abundant than higher-
order network data, it is important to investigate here the properties of the
clique complexes of the most simple models of networks, i.e. random uncorre-
lated networks. Random uncorrelated networks are sparse networks, indicating
that the number of links scales as the number of nodes in the network. More-
over, random uncorrelated networks are random networks with a given degree
sequence, as long at the degrees of the network have a structural cutoff. The
structural cutoff imposes that all the degrees of the network should be much
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

lower than the structural cutoff, i.e.

p
kr  K D hkiN; (2.10)

for all nodes r 2 f1; 2; : : :g, where here hki indicates the average degree of
the network. In this limit the maximum entropy network ensemble enforc-
ing the given degree sequence describes a null model in which there are no
degree–degree correlations, i.e. the degree of the node at one end of a link is
not correlated with the degree of the node at the other end of the link.
If one performs the clique complex of this ensemble, every .d C 1/-clique
is reduced to a d-dimensional simplex of the clique complex. For Erdös–Rényi
graphs in which the number of links L scales as the number of nodes N (Pois-
son networks), the expected number of cliques of size greater than 3 is null in
the large N limit, implying that the clique complex is at most 2-dimensional
[41]. However, the situation changes significantly if one considers an uncorre-
lated network with power-law degree distribution P.k/ D Ck and exponent
 Higher-Order Networks 17

2 .2; 3/ [42]. Indeed, in this case the expected number Nd of d-simplices in

the clique complex of the network scales, as long as d > 1, as

Nd D O.N  / (2.11)

with
1
D .d C 1/.d C 1 /; (2.12)
2
so it is diverging in the large network limit N ! 1. For D 3, a logarithmic
scaling is observed:

Nd D O..ln N/dC1 /: (2.13)

Moreover, and even more surprisingly, the clique number of the random scale-
free network diverges [42], i.e. the size of the largest clique of the network
skeleton of the simplicial complex diverges with N ! 1 for 2 .2; 3. This
implies that in a clique complex of a random uncorrelated scale-free network,
the dimension of the largest facet diverges. This phenomenon is due to the
fact that uncorrelated scale-free networks display a hierarchical structure (also
revealed by their core structure) and it becomes easier for nodes of high degrees
to form cliques.
It follows that if we consider the clique complex of a network with broad
degree distribution, and also if the network is sparse, we expect that the dimen-
sion of the obtained simplicial complex is significantly large. Therefore the
clique complex of a network with broad degree distribution is expected to have
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

very significant differences with respect to the clique complex of a Poisson

network with the same average degree.

2.6 Maximum Entropy Ensembles of Simplicial Complex

2.6.1 Microcanonical and Canonical Ensembles
of Simplicial Complexes
A combination of combinatorial and statistical arguments are at the very heart
of information theory of simplicial complexes. This theory has the aim to pro-
vide null models of simplicial complexes that are the least biased given a set
of constraints [12]. These models are obtained using the Maximum Entropy
Principle, which is one of the pillars of information theory [6, 43, 44]. First
of all we consider an ensemble of simplicial complexes, formed by assigning
a probability P.K/ to every simplicial complex K belonging to the set K of
all possible simplicial complexes. The entropy of the ensemble of simplicial
complexes is given by
 18 The Structure and Dynamics of Complex Networks
X
SD P.K/ ln P.K/; (2.14)
K2K

where we use the standard convention that if P.K/ D 0, then we take

P.K/ ln P.K/ D 0 ln 0 D 0. The entropy of the ensemble of simplicial com-
plexes characterizes the logarithm of the typical number of simplices in the
ensemble.
According to the Maximum Entropy Principle, the least-biased ensemble is
one satisfying a given set of constraints, characterized by a probability P.K/
that can be obtained by maximizing the entropy S, given the constraints. The
entropy of maximum-entropy simplicial complexes is a fundamental informa-
tion theory measure that can be used to quantify the information content of the
constraints. In fact constraints that carry a high information content are more
difficult to satisfy by a random simplicial complex and correspond to a smaller
entropy of the ensemble. On the other hand, constraints that do not limit the
structure of simplicial complexes much are more easy to satisfy and correspond
to a higher value of entropy.
Recently [12, 45], it has been shown that maximum-entropy models of net-
works and generalized network structures can be constructed using an analogy
with statistical mechanics. In statistical mechanics [46] a distinction is made
between canonical and microcanonical ensembles, which consider configura-
tions of a dynamical system that are compatible with a given value of the energy
and with a given expected value of the energy. Similarly, when constructing
ensembles of networks or of simplicial complexes, we can consider ensem-
bles with a given set of hard constraints (satisfied in any single instance) or a
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

given set of soft constraints (satisfied on average over all the instances of the
ensemble).
For simplicial complex ensembles we can consider a given set of observ-
O which might indicate, for instance, the total
ables F .K/ with  D 1; 2; : : : P,
number of d-dimensional simplices or the generalized degree of a node in a
pure d-dimensional simplicial complex. From these observables it is possible
to consider a set of hard constraints given by

F .K/ D C ; (2.15)

which needs to be satisfied for every simplicial complex K represented in the

ensemble, i.e. for every simplicial complex K having non-zero probability in
the ensemble. Alternatively, it is possible to consider a set of soft constraints
that enforce limits on average on the ensemble, i.e.
X
P.K/F .K/ D C N : (2.16)
K
 Higher-Order Networks 19

Hard and soft constraints corresponding to the same choice of observables

F .K/ and having C D CN  are called conjugated constraints. The maxi-
mum entropy ensembles satisfying the soft constraints are called canonical
ensembles and are characterized by a probability PC .K/ that follows a Gibbs
distribution and is therefore given by (see Appendix A for details of the
derivation)
1 PPO
 F .K/
PC .K/ D e D1 ; (2.17)
ZC
where the parameters  are the Lagrangian multipliers enforcing the con-
straints and are fixed by imposing Eq. (2.16), while ZC is a normalization
constant also called the partition function. The maximum-entropy ensembles
satisfying the hard constraints are called microcanonical ensembles and are
characterized by a probability PM .K/ that is uniform over all the simplicial
complexes satisfying the hard constraints (see Appendix A for details of the
derivation), i.e.
PO
1 Y
PM .K/ D ı.C ; F .K//; (2.18)
ZM D1

where here and in the following ı.x; y/ indicates the Kronecker delta, with
ı.x; y/ D 1 if x D y and otherwise ı.x; y/ D 0, and where ZM indicates the num-
ber N of simplicial complexes satisfying the hard constraints, i.e. ZM D N . The
entropy † of the microcanonical ensemble is therefore given by the logarithm
of the number of simplicial complexes in the ensemble,
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

† D ln N : (2.19)

Canonical and microcanonical ensembles satisfying conjugated constraints are

conjugated ensembles. If we indicate with S the entropy of the canonical ensem-
ble and with † the entropy of the conjugated microcanonical ensemble we have
[12, 47]

†DS O
; (2.20)
O is defined (see Appedix A for details of the derivation) as
where 
2 3
X YPO
O D ln 4
 PC .K/ ı.C ; F .K//5 : (2.21)
K2K D1

Therefore  O is a measure of how much the canonical ensemble deviates from

the microcanonical ensemble. In fact,  O gives the absolute value of the loga-
rithm of the probability that in the canonical ensemble the hard constraints are
satisfied. If O is subextensive, i.e. 
O D o.N/, then the conjugated ensembles
 20 The Structure and Dynamics of Complex Networks

are statistically equivalent, meaning that they have the same statistical proper-
ties in the limit of large simplicial complexes, i.e. N ! 1. Conversely, if  O is
extensive, i.e. O D O.N/ then the two ensembles are not statistically equiva-
lent [12, 47]. In simplicial complexes, as in networks, this latter scenario occurs
in cases in which we fix an extensive number of constraints, i.e. a number of
constraints PO that is proportional to N [12]. This includes, for instance, the case
in which we impose the expected generalized degree sequence of the nodes.

2.6.2 Canonical Ensemble of Simplicial Complexes with Given

Generalized Degree Sequence of the Nodes

Maximum-entropy simplicial complexes can be used to define simplicial com-

plex models that are the higher-order equivalent of Erdös and Rényi random
graphs [48, 49]. Here we focus on ensembles that capture the heterogeneities
present in simplicial complexes and that are most useful to the network sci-
entist. Specifically we consider canonical ensembles of pure d-dimensional
simplicial complexes with given expected generalized degree sequences of the
nodes fkN d;0 .Œr/g first studied in Ref. [12]. We identify every pure (labelled) sim-
plicial complex with its adjacency tensor aŒd indicated simply as a for a more
concise notation. The maximum entropy ensemble of simplicial complexes is
determined when we know the probability P.K/ D P.a/ of every simplicial
complex K with adjacency tensor a.
We can find P.a/ of the canonical ensembles of pure d-dimensional simpli-
cial complexes with given expected generalized degree sequences of the nodes
fkN d;0 .Œr/g by maximizing the entropy S under the constraints
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

X
P.a/Fr .a/ D kN d;0 .Œr/; (2.22)
a

where Fr .a/ is given by

X
Fr .a/ D ari1 i2 ;i3 :::id (2.23)
i1 <i2 <:::<id

and where kN d;0 .Œr/ indicates the expected number of d-dimensional simplices
incident to each node r 2 f1; 2; : : : ; Ng.
We will consider here exclusively the sparse regime, which is relevant for
most of the applications of complex networks, in which the number of sim-
plices M is of the same order of magnitude as the number of nodes M / N:
˝ ˛
In this limit the average expected generalized degree kN d;0 .Œr/ is independent
of the network size. The maximum entropy distribution P.a/ obeys the Gibbs
measure given by Eq. (2.17) corresponding to the choice of constraints given
P
by Eqs. (2.22)–(2.23). The marginal probability p˛ D K2K a˛ P.K/ of a
 Higher-Order Networks 21

d-dimensional simplex ˛ indicates the probability that the simplex belongs to

the simplicial complex and is given by
P
r
e r˛
p˛ D P
r
: (2.24)
1Ce r˛

Note that the constraints of the ensemble can be expressed simply in terms of
these marginals, implying that the equations that the Lagrangian multipliers
fr g need to satisfy are
P
X X e s˛ s
kN d;0 .Œr/ D p˛ D P
s
: (2.25)
1Ce s˛
˛jr˛ ˛jr˛

The expression (Eq.(2.24)) for the marginal probability p˛ reduces for d D 1 to

the known marginal probability prs of a link ˛ D Œr; s in the canonical network
ensemble

e r s
prs D : (2.26)
1 C e r s

For d D 2, instead the marginal probability prsq of a triangle ˛ D Œr; s; q reads

e r s q
prsq D : (2.27)
1 C e r s q

The fact that in general these marginal probabilities do not factorize into fac-
tors depending exclusively on a single node of the simplex indicates that the
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

ensemble of simplicial complexes displays natural generalized degree–degree

correlations. These natural correlations are induced among the generalized
degrees of the nodes connected by a simplex and they are the higher-order
counterpart of the natural correlations that are well known to exist in maximum-
entropy ensembles of networks with a given expected degree distribution. A
study of generalized degree–degree correlations in the canonical ensemble
of simplicial complexes (see Ref. [12]) reveals that the simplicial correla-
tions found in these ensembles are more pronounced than in the ensemble of
networks (simplicial complexes of dimension d D 1).
In the presence of the structural cutoff, K, i.e., when the generalized degree
of the nodes obey

˝ ˛
d !1=.dC1/
kN d;0 .Œr/ N
kN d;0 .Œr/  K D ; (2.28)
dŠ
 22 The Structure and Dynamics of Complex Networks

the marginal p˛ factorizes and becomes proportional to the product of the

expected generalized degree of its nodes [12], i.e.
Q
kN d;0 .Œr/
p˛ D dŠ r˛
d : (2.29)
hkN d;0 .Œr/iN

This implies that in this limit the generalized degree–degree correlations van-
ish and we can consider the canonical ensemble of simplicial complexes null
models of uncorrelated simplicial complexes. This expression for the marginal
probability is very useful for studying dynamical processes on simplicial com-
plexes. For d D 1 the expression of the uncorrelated marginal probability prs
of a link ˛ D Œr; s reduces to the well-known expression

kN 1;0 .Œr/kN 1;0 .Œs/

prs D
: (2.30)
hkN 1;0 .Œr/iN

However, for d D 2 the uncorrelated marginal probability prsq of a triangle ˛ D

Œr; s; q reads

kN 2;0 .Œr/kN 2;0 .Œs/kN 2;0 .Œq/

prsq D 2 ˝ ˛
2 : (2.31)
kN 2;0 .Œr/ N

The entropy of the canonical ensemble of simplicial complexes has a very sim-
ple expression due to the fact that the constraint enforcing given generalized
degrees of the nodes is linear in the adjacency tensor. Indeed we have that the
entropy S of the ensemble is fully determined by the marginals p˛ and is given
by
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

X
SD Œp˛ ln p˛ C .1 p˛ / ln.1 p˛ /: (2.32)
˛2Qd .N/

Similarly, the probability distribution of the full simplicial complex can be

expressed in terms of the marginal probabilities as
Y
P.a/ D pa˛˛ .1 p˛ /1 a˛ : (2.33)
˛2Qd .N/

The simplicial complexes in the canonical ensemble can be generated very

simply according to the following algorithm:

(1) The marginal probabilities p˛ are calculated for each possible d-

dimensional simplex ˛ of the simplicial complex by solving Eq. (2.25).
(2) Each possible simplex ˛ 2 Qd .N/ of a simplicial complex formed by N
nodes is included in the simplicial complex, together with all its faces, with
probability p˛ .
 Higher-Order Networks 23

2.6.3 Configuration Model of Simplicial Complexes

The configuration model of simplicial complexes [12] is the maximum-entropy

microcanonical ensemble of simplicial complexes having a given sequence
of generalized degrees of the nodes fkd;0 .Œr/grD1;2;:::;N : The probability P.K/
is therefore uniform over all simplicial complexes having the same sequence
of generalized degrees of the nodes. The partition function ZM indicates the
number of distinct simplicial complexes having the same generalized degree
sequence of the nodes.
Having defined the configuration model of simplicial complexes, one impor-
tant problem is the formulation of an actual algorithm for generating simplicial
complexes belonging to this ensemble. This algorithm builds on the represen-
tation of the simplicial complex in terms of a factor graph, i.e. a bipartite graph
formed by nodes, and factor nodes (representing d-dimensional simplices, for
instance triangles). The algorithm, schematically represented in Figure 7, is
defined as follows:

 Starting from a set of N nodes, to each node r a set of kd;0 .Œr/ stubs is
assigned.
 The stubs are matched to auxiliary factor nodes of degree d C 1.
 The obtained factor graph is converted into a simplicial complex. Every set
of .d C 1/ nodes incident to the same factor node of the factor graph corre-
sponds, in the simplicial complex, to a d-dimensional simplex formed by the
same set of nodes.
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

The matching of the stubs needs to be done randomly; however, some matches
are not permitted and if they occur the algorithm needs to be rerun from scratch.
The illegal matchings (see Figure 8 for a schematic description) are: matches
in which the same set of nodes are matched to more than one factor node or
matches in which the same factor node is matched to more than one stub inci-
dent to the same node. The code for the configuration model of a simplicial
complex is available in the repository [50]. From the algorithm generating sin-
gle instances of the simplicial networks in the configuration model we deduce
two main conclusions:

 Given the generalized degree of the nodes there are, in general, multiple ways
to realize the simplicial complex.
 The information encoded in the constraints is captured by the entropy †
of the ensemble, which is given by the logarithm of the number N of
simplicial complexes that realize a given generalized degree of the nodes,
i.e. † D ln N .
 24 The Structure and Dynamics of Complex Networks

Figure 7 Schematic representation of the algorithm generating single

instances of the configuration model of simplicial complexes. Panel (a): each
node of the simplicial complex is assigned a number kd;0 .r/ of stubs. Panels
(b) and (c): stubs are matched to factor nodes of degree d C 1, and the factor
graph is converted into a simplicial complex. It is evident that with this
algorithm, different simplicial complexes with the same generalized degree
sequence of the nodes can be generated (such as the different simplicial
complexes shown in panel (b) and panel (c)).
https://doi.org/10.1017/9781108770996 Published online by Cambridge University Press

Source: Reprinted figure with permission from [12] ©Copyright (2016) by the
American Physical Society.

The entropy † of the configuration model is related to the entropy S of the

conjugated canonical ensemble of simplicial complexes with a given expected
O is given by [12]
generalized degree of the nodes by Eq. (2.20), where 

N
" #
X .kd;0 .Œr//kd;0 .Œr/
O D kd;0 .Œr/
 ln e ;
rD1
kd;0 .Œr/Š

as long as the simplicial complex displays the structural cutoff given by Eq.
(2.28). From this expression it is possible to deduce the asymptotic number N
of simplicial complexes with a given generalized degree of the nodes, which is
given by [12]
Exploring the Variety of Random
Documents with Different Content
The text on this page is estimated to be only 21.68%
accurate

1489 νννάς — νηαχ&έντΒς 1490 νννάς• αΐξ άγρια •ύνντί'

αϊξ. χαϊ τό τον άροτρου σιί^ήρίον τό τέμνον τήν γήν (ϋννη), χαϊ
νννις ομοίως ΰννος' ηωλος ό ίν τ]^ γαστρϊ νοσήσας^ ηρϊν χυηΒηναι
(Ιννός) •^ύντΒτράστιαν κατεαγέν, Σαλαμίνιοι ή^νντωοΒ'
συμπαρησαν ΰξον βόησον ύοή'λλός' τόπος συών βορβορώδης
ύοβότης' συοβόσχης νομεμνία• εορτή τις ί ν ^ Αργεί νομένη'
βρεχομένη ύον ομοίως [208] ύοσχυαμ^ς (Ρ1ι«Γ6€γ. ρ. 284)*
μαίνχ^^ άηό της ηόας ύοχαί' τό βορβορώδες νδωρ (203) ύηάγειν' τό
ήσΰχως πίνειν ύηαγορ{έ)ία' συμβούλια ύηαγορενουοί' λαλοΰοίν
ύηάγορον χατά βίαν νηερήφανον ύηαγωγεύς (Ηβηηίρρ. ρ. 97 Αγ.
Αντ. 1148)* ηρός ηλίνθων οίχοδομήν ηηλός υπαγωγή (Τΐιυο. III 97)•
ύηοχώρησις ύ π άγων νηό δίχην άγων νκαί' "^ηρό του χαΧ νυν, νηαϊ
πόδα (Β 824) ύπαϊ όέ Ιδεσχε (Γ 217)• ύπέβλεπεν [20] ύπαιδράσειαν
ύπόψειαν (οΓ. ύποδρασίην) νπαιθα {Σ 421)* ίμπροσ^εν ύπαί&ριον
υπό τόν αέρα •^ύπαιχαλούσας* ύποτρεμούσας ύπαιλίχαξβ' έχ
πέτρας υποχωρεί ύπαινίττεταί• αΐνιγματωδως ίμφαίνει ύπαλευάμενος
(ο 275)• φυλαξάμενος [28-92] ύπαντά^ (ΑΗ^ΙορΗ. Γγ. Ι. ρ. 1187)*
έ^ έναν^ τίας [βά 83] ύπαντιάζεί' νπαντ^ -^ύπ' άντιαίης' υπό της
ή^αίσχράς έ| έναν^ τίας ή^πολεμούση; ύπάντλ[ε]ια* χαλχά άγγεΐα^
χάδοί ύηαντροί' οΐ υπό τό σπήλαων ύπανύσ^αΐ' ύπουργεΐν •^υπαπίεΐ'
υποστρέφει ύπ* άπειρίας' ύπό αμαρτίας υ παρ (τ 417)• τό μεθ*
ήμέραν δναρ, ενήμερη, οίον φανερως^ έναργώς, άλη9ές [42]
ΰπαρνος ποίμνη' άρνας έχουσα ύπάργυρον τό χινάμωμον ύπάρξας'
χατάρξας 10 ΰπαρξις' προγένεσις. ή ουσία υπάρχει, (ΑροΠ. 1βχ.)'
προχατάρχει ύπαρχος (δορϋ. Αί. 1094 Χβη. ΗεΙΙ. ΥΙΙ 4, 19)•
οίχονόμος, πολέμου στρατηγός υπάρχων πεφυχώς, ών νπαρχ^εΖσαν
προγεγονυΐαν ύπασπισταί' βοηθοί, ύπηρέται υπασπίδια προποδίξων
{Ν 158)• υπό τήν ασπίδα τι&εϊς τους πόδας χαϊ ούτως προβαίνων 20
υπασπιστής (Χβη. Αη. IV 2, 20)• βοηθός^ δορυφόρος^ υπηρέτης
υπάτη* υψηλή, δυνατή ύπατε χρειόντων (θ 31)* βασιλεΰ
βασιλευόντων ύπάτη' υπέρτατη, ανωτάτη, πλούσια ύπάτμενοΐ'
δούλοι^ υπουργοί ύ πατον μήστωρα (θ 22 Ρ 339)* τόν Ιν τφ
βουλεύσασ^αι σοφωτατον^ οίον πρώτον ύπατος* υψηλός, έντιμος,
πρώτος, διαφέ^ 30 ρων των άλλων, έξοχώτατας ύπ* αυλή ν υπ*
οίχον υπ* αύλοϋ' μετ αύλοϋ •\ύπ* αύνήν παρ* Έχαταίω. Φιλητας
ύπαφήτορες' ύϋΛΛΒταγμένοι ύπαφρον (ΕυΓ. ΗΜβ. 707)* το μή
φανερόν ύπαφρον λέγουσιν, άλλΛΜηοΦοον τό ύγρασίαν έχον
Ιμφερή άφ(^^ιοι χρύφιον χαϊ ύπουλον τό ύπαφρον 'Υπαχαιοί
{ϊίξτοά. VII 91)• όνομα•[στιχόν 40 ύπαχ^έντες (Ββιη. 59, 18)*
υποβληθέντες, πεισ&έντες, άπατηθέντες €00. 08 ύννής 200
σαλαμήνιος 2 ύξον, βοήΘησον Ζ εΓ. ύαλος, ύοχαί^ συόαι^ συηλαι (5
ύομεμνύνειαΊ) 7 ύον* δμοιον 9 ύοσχιαμεις, μαΐνει 18 ύπά πο 19
ύπαιδαήδασχεν 22 ύπάσσεα 33 υπαντάξας 35 υπαντ\ (39 ύπάπει,
υπόστρεφε "ί)^ 50 ύπασθεΐσαν 54 ύπαστή Μ βασι 98 μήστορα 62
παρεχατέω φιΛιτά^ 04 ύπαφροΐς — ύπαφρον — άλλα τό ύπαφον τό
28 ί* (Δ 501) μεθ* ήμέραν, αληθές 94
The text on this page is estimated to be only 15.38%
accurate

1491 ϋπία — - ύη8ρβάλλί$ 14» νηεα' τά όηητια [68. 69]

νηέγρα^Βν (οί. ΤΙιυο. V 56)* ίχάρξίζεν^ ή ίγραίρεν ύίΐΒδίσμΒν^η*
υπεξέχειτο [71] ύηεζΒνγμένος' νηοτΒχαγμίνος ύκεξωϋ&αί' τό εΙς
άνδρας έλθ€ϊν» Φιλητας ύηεζωσμένοί' -^ άν4ΐη€ίσαντ€ς ύηέΒην [βά
76] -^ύΜΗ^έμψ [77—82] ύη^ίχ^ί (δορίι. Αι. 670)* ύηααονΒΐ,
ύποχωρεΐ^ υποτάσσεται ύίΐείκετε* τά αυτά ύηΒίλημμένη*
άντ(ε)ιλημμένη ύηειΧημμένον (Οβιη. 623, 5)* ύκονενοΊ^' μένον,
νηενηνεγμένον [87] ύηεΖξά σνι, (Χοη. Αη. ΥΙΙ 7, 31)* ύηεχωρησά σα
[8•— 98] ύηέχειντο' υποκείμενοι ήσαν ύηέχΒεσις' νπόθεσις
ύηεχινοΰντο' Ί* κατενοίγοντο^ ή έΛΧΟουντο (ύηεκκανστρια' ή τής
Ά^Ίΐνάς ιέρεια) €Γ. 424 ύπέκλινεν ύηέταξεν [68] ύηεκχρο&έων (^
125)* ύπεχτρέχα^ν [606] ύηελθεΐν νπεισελ^εΐν^ ύποδραμεΐν
ύηέλαίος• γλοιός [8] ύπελείν νπειλεΧν [&] ύηεμνήμνκεν (Χ 491)*
ύηομέμνχε^ κλαίει^ στενάζει^ στνγνάζει ύη* έμοΐ' ύπό τήν έμήν
έξονσίαν ύηεμφαίνεΐ' φανεροί ύπεναντίος• εχθρός [10] νπενες' εΙς
τετάρτην νπ' ένεσίχιαι (6ρί€. ροβΙ.)- βσνλαΖς ύηενηνεγμένον*
νκοχείμενον [14] ύπενόστησεν (Τΐιιιο. III 89)- νηέύχρί^,
ύπεχώρησεν νόστος γάρ ή οδός •^ύπεξέΒαντο (ΑροΠορΙι. Γγ. II ρ.
882)* νπεκέκαυτο [Ι7~1^ ύπεξήκριζον (ΕυΓ. Βΐΰοΐι. 676)* νβριζη
ύπεξίει (οΓ. ΡΙβΙ. Ρ1ΐ86(1. 106 Α)- «χί|(σταται 10 ύπεξίσταταΐ' τά
αυτά ύπεξίστησί' μεθίστησι ύπέπισα' νπεπότισα ύπεηόδισεν
άνεπόδισεν [β] ύπέρα• ίν τρ νηί σχοινιά τινά (€ί, € 260)
ύηερα}^ασ&είς (εί. ΡΙθΙ. δ^^ιηρ. ρ. 180 Α)' νπερθανμάσας [29—11]
νπερα (Αγ. Η Α. V 19)- σχωλ'ψίές τίνες '^ύηεραγονασήΐ'τάς •
είμαρμένας χρόχας, οίον νπερστήμονας 20 ύπεραίρεταΐ' υψονται
ύπεραέΐ {Α 297)* νκεράγονη, αατά χψ πνοην [86—68] ή^ύπεράλλα
ηέτηξ' νπ^ρ το δέον ύπεράλ{λ)εταΐ' νπερπηδ^ ύηεραλεΖταΐ'
υπερπηδήσει [42] ύπερανάστης' μετανάστης, μεταβάτης
ύπερανέστηκεν ' ύπερβέβηχεν^ έχ τον υπέρ ήτοι νψηλότερον
ύπέραντλα* πολλά [46. 47] 30 ύπέρανχος (Αββεϋ. δβρΙ. 483)-
-υπερήφανος υπερβάλλει,• νπερνικςί. νπερτέ&εται. παραβαίνει, ή
ίπαναφέρει εΙς σνυβονλίαν €00. β1 /ύηεα• τά οπίσθια 70 νπέρραιρεν
71 νπεδέαμενεν 74 άλίδρας — φιλήτας 84 ΆβΜΜχται 604 ύπέλλειν
νπειλιΐν βη νπελεϊν^ νφίλεΐν% 12 ύπενεσίησι 13 ϊ'Μίέΐ(9\ (21 \ι^ει —
|ατο?) 25 \ησίν 1)18 32 ύπέραι 85 ύπεράίΐ 48 ύπέραγχος ΗΕδ. 68
νπέασιν (1202)* ίληλύθασιν 69 ϋπεδείδεσκεν (Γ 217)• ύπεβλεπετο
72 νπέδοί (κ 398)• [υπεισέλθοί] νπεισήλθεν Αά 76 [ίαπροσθεν] 77
ύπέΘεντο (Ιβτηη. ΟΧΧνί 25)• σννεβονλενοντο 78 νπεθολίάσθη (Ο
520)• έμπροσθεν έκλείσ»ην 79 ύπε^όμησεν' ομοίως^ 80 ύπεθοεί
(ΕϋΓ. ΑικΙγ. 195)• υπερέχει, υπερβάλλει (399) 81 νπε9ρον' νπό τόν
αέρα 82 ϋπειδονμενοι (Ρο1>'5. 1 66, 6)• νφορώμενοι (οΓ. νπηδ—)
87 -^ύπείνεχεν νπέβαλεν, νπεΐχεν (526) 89 νπείξομαι (Α 294)• 7/^ω,
νπονοστήσω, υποχωρήσω (οί. νποεί-^) 90 νπείραλα (Ψ'227)• νπό
τήν άλα, ύπ^ρ τήν θάλασσαν 91 νπείροχος (Ζ 208)• υπέροχος,
υπερέχων ^2 νπεΐχεν νπέβαλ{λ}εν (526) 93 νπ' έχδιόσαισαν παρά τό
έκ Δώς είμαρμέυον 98 νπεκδράμω (Ε»Γ. Απάτ. 338)* φ[ε]ύγω 800
νπέκτρενον (ίρ 3)• το έτρεμαν (ςί. 296) 3 ύπέλαβεν (ΑοΙ. Αρ. 1 9}•
υπεδέξατο 5 νπέμ'βρνον (ι 244)* νεογνόν βρέφος νπέβαλεν, ϊνα
εΰρχί άμέλξαι 10 ύπένερθεν (Β 150)• ύποκάτωθεν 14 ύπενόθενσεν
(II Μβοο. IV 7)• ιΪΛεφί^έΐοίν 17 ύπεξέφερε (θ 268)• προέτεινε,
προεβάλλετο 18 ύπεξέφερον (Ε 377)* εις το έξω έφερον 19
ύπεξελέασθαι (Ο 180)• ιί^Γβκκλίνειν (οΓ. ^^ίΐλ— ) 26 υπέρ (Π €ογ.
XI 23)• πρόθεοις. πολύ, πλέον, λίαν 29 ύπειρεσία' ή των έρεσσ
όντων καθέδρα (^ί. νπη — ) 30 ύπειλημμένον ύπενενοημένον 31
{ν)περάγον (Ι Νβοΰ. VI 43)• διαφέρον 36 νπέραε (£260)* τα σχοινιά
87 νπέραχαος (Ι €θΓ. \\1 36)• μέγας 38 νπεράλα Ιψ 227)• θάλασσαν
42 νηεράλμενον (Ε 138)• ι^Λβραλλόμενον 46 υπερασπίζω (Ι.ΧΧ)•
βοηθώ, άντιλαυβάνω. καϊ ύηερασπιστής (θ€Β«5. XV 1)• άντιλήπτωρ
47 ύπερασηιω (ΙΤ Κ«|^;. XIX 34)• προΐσταμαι "
The text on this page is estimated to be only 21.41%
accurate

1493 ύπβρβάν — ΰηβρχόμηας 1494 ή^ύπερβάν νΛΒρώαν

ύπέρβασις' νβρις, άδιχία. χάρος, αμαρτία, ύηερηφανία, ηαράβασις
όρχων ύηερβασίης {Π 18)* άδιχίας, νκερηψανίας ύκερβατόν
ύηερβαινόμενον ύηέρβιον (Ρ 19)* νηεράγοντα τβ βΐμ. ύηίρ δύναμιν.
ηάνυ βιαίως ύκερβληδην νκεράγαν ύηερβλνζεΐ' ύηερβολή• ηολύ
ύπερβολία* νβρις. χάρος (οΓ. νηερολβή) [99] ύηεργνϊον ύηέρμηχες^
μέγα (ύηέργνον) ύηερδέα (Ρ 330)* ύηεραγάντως ένδεά, ή ελάσσονα
χατά δνραμιν νπερδέα δημ{ον) έχοντα [62] ύχέρδιχοΐ' σννηγάροί οΐ
τό δίχαιον υπερβαίνοντες νίξερδειηνεΖ' ύπερτρυφ^, νηερηγάα^ψ
νηβρεΒαυμάσ&η νηερηχάντισεν (Αγ. ΡΙαΙ. 666) * ύηερέδραμεν
ύηερήχρισας* ύηεράγαν {νηέρ άχραν) έπήδησας νηερήμεροί' οΐ έν
ταΐς χαταδίχαις ηρός ^χτισιν ημέρας λαβάντες χαϊ μή δίολυσάμενοί
ύαερημερος (ΑηΙίρΙιο 136| 39 Ε^βίββ 167, 42)- ΙχηράΒεσμος [91] 10
ύηερήνωρ (£516 Ηββ. ΤΗ. 995)* ενιρυχος^ ανδρείος, υβριστής,
υπερέχων, υπερήφανος. παράνομος, ή ά υπερέχων χατά τήν
άνδρείαν [98] ύπερήρτο' χατεξανίστατο (ς. ν.) [96 — ^97]
ύπερήφανος' ύπέρφρων. άγνώμων ύπερ^$ϊ (Εαη ΑηάΓ. 195)*
υπερέχει, ύπο^9έχει, ήγουν 9έει (280) [400. 1] ύπερ&έοντας•
ύπερτρέχοντας υπερθέσεις* άναβολαΐ. υπερβάσεις [4—9] ύπερείδει
(ΡΙβΙ. ΡΙΐ8β4. 99 Β)* στηρίζει [66] 20 ύπερίδη' χαταφρονρ (366)
ύπερειδούσης' στηριζούσης ύπέρειπε* χατέβαλ(λ)εν, άπό του
έρείπειν ύπερείσατε' στηρίζατε ύπερεή^χστήξεί' ύπερσταΒήσεται
ύπερέχτισις' ύπεραπότισις ύπερένεγχαν ύφωθησαν νπερέλασις•
ύπέρθεσις^ υπερβολή [74] ύπε{ρ)έξουσΐ' μείζονες έσονται [16]
ύπέρεπτε (Φ 271)• ήσθιεν. ύπενεδίδου. ύπέσυρεν ύπέρευγε'
ύπερχάλως [Ϊ9— 81] ύπερέσσεται* περιέσται^ κρατήσει υπερέχει-
άνω&εν επιβάλλει, βοη&εΐ, διαφ^ρ€ί, υπερβάλλει^ υπεράνω έχει
ύπερέχοντί' έξουσιάζοντι ύπερζέσας' άναφλεχΒεις 30 ύπεριχταίνοντο
(ψ 3)• Ινιοι υπέρ δύναμιν^ Ιχνουν ύπεριχνοΰντο διά τήν χαράν^ ο
έστιν έξετείνοντο ύπεριππία' άγων τις παρθένων [18] ύπερισχύουσαν
ύπερβάλλουσαν ύπερίων τόν έν τφ άέρι^ ή 6 ήλιος άπό του ύπ^ρ
ημάς Ιέναι ή^ύπερχαταβαπτύουσαν άντϊτοΰ υπερήφανους λόγους
ποιούμενους ύπερχαχεΖν δ νυν έχχαχειν υπέρ χάρα φοιτωντα (ΕιΐΓ.
Ηίρρ. 1058)• υπέρ χεφαλής έρχάμενον ύπερχείμενον άνω χείμενον
[20] ύπερχείσθω- ύίΐίΐΆίθείσ^ω [22] ύπερχόμπως ( ΑμοΙι. ΙΒ|^136) *
υπερηφάνως ^Βα [24. 25] €0Ό. 51 μαρτυρία 56 ΰπερβλύδην^
ύπεοάγων 68 ^ρεϋτειν ^ 71 \χτησις ύπεράφρων 410 ύπερίδει^
χαταφρονεΐ 1\ υπιχταίνΦντο 12 ύπεριπτία {Λ. έφιππος ϋί ίππετοΰμαι)
18 δεχόμενον 19 άναχείμενον ΗΕ8. 59 ύπεργμένων δοθέντων,
προελ^όντων (νπηγ^) 62 ύπέρδεσμα' ενέχυρα, υποδήματα (604) 66
ύπερείδεί' χαταφρονει (410) 74 ύπερένδοξος (ΟβηΙ. Ιγ. ριιβΓ. 23,
25)• άγαν ένδοξος 76 ύπερέπτατο {θ 192)• ύπερίπτατο.
ύπερέδραμεν. ύπερεπήδησεν 79 ύπεριφερές' μετεωοοφόρον
(υπεράφρυς [Οτ9%. Νιζ. II 78 Β]* μετεωροφρονων) θεοϋ γνώμρν 4
ύπερθοξεονται (β 179)• ύπερπηδωσιν 5 ύπέρ&ορον (1472)* ύπερ^
επήδησα, ύπερηλάμην 6 υπέρθυμοι (Ζ 111)* πράθυμοι. μεγαλάφυχοι
7 ύπερθώριος {η 90)• ο επάνω των ^υρων τόπος 8 Ύπερία (Ζ 457 -
^ Β 734)• ή των Φαιάχων πάλις. χαϊ χρήνη ($ορΙι. Γγ. 758 Όί.) 9
ύπερίοντα (μ 133)• υπέρ ημάς Ιόντα 6 ήλιος , άπό του υπέρ ήμας
Ιέναι 18 ύπέριπτεν (Φ 271)• χατέσει^ (377) ^ ύπέρχεισαι (Ργου.
XXXI 29 £ιβ€ΐι. ΧΥΙ46>' υπερβάλλεις 22 υπέρ χεφαλής (Β 20)*
υπεράνω της χεφαλής 24 ύπερ* η της 'Αθψάς ίέραα (297) 25
ύπερχάσμια' ως άγγελοι, χαϊ τα μέλλοντα χαυστρα ν»έρ τόν χάσμον
94 ■Ν «1 •ι
The text on this page is estimated to be only 16.62%
accurate

1495 ύη€ρηνάρ$ον — νηερφυως 1496 ύπερχυάνεον λίαν

χυάΐβ99ν ύπερχυδαντας {Δ 66)* ^η^ρίχοντας τζ δόξρ^
νηερενδόξαυς γενομένους [18] νπερμαζ^' νηερτρυφψ ύηερμενέΐ (Β
116)* τφ νηεράγοντι χατά τό μένος^ τουτέοη τζ ί^χύί ύηερχρατεί
ύηερμενης' μεγάλην Ιχων Ισχύν [<2] ύηέρμορα {Β 155)* ύη^ρ τό
δέον, ύπ^ρ τό χα^ήχον ύη^ρ μόρον (Φ 517)* ομοίως 10
•^νηερνεμεΐς* ύηερορψς (499) •ύπερνήχεται* υπερέχει^ ύηερβαίνει
ύηερνιχ §ί' άντίμάχεταί [18] ύΛεροι(α)ζομενου' ύηερηφανευομένου
ύΛεροιησάμενοί' νπερηφανονντβί [41—43] νηεροηλίαις {Α 205 ?)'
ύΛερηψ9ΐ9ίαις^ νηερφροσύναις [45] •ύηεροηλίαοαίτο (ρ 268)*
νιχήσειεν. ή ύηερηφ ανήσείεν νηέροηλον ύκ^ρ τό δέον.
νηερήφαναν, 20 •[ιρενδές νηέροΛτον μεγα^ χαϊ νηϊρ τό μέτρον^ χαϊ
τά όμοια ύηερορ^' χαταφρονεΐ^ παραβλέπει υηερόριος' έχτός των
ορίων ύ/ίέρον Λεριστροφήν (Ρΐιϋειη. ΰοηι. ρ. 11)* παροιμία [ιά 51]
[52] ύ/ιερόφρνς' υπερήφανους [54] ύηεροχή' έξοχη, υπερβολή
ϋπέροχον ηερισαόν, δεινόν. μείζον 30 υπεροψία* ύπερηφανία, παρά
τό τά νπ^ρ αυτόν ^εωρεΐν [58] ύπερπηδών υπέρβαρων [60]
ύπερσχεΐν •[ άνατελεΐν, νπερμαχησαι» βοηΒήσαι, αχεπάσαι νπέρσχες'
σχέβί^ίφ^, χαϊ τά όμοια ύπερτάτην {Ενίτ1'ίΐθ.ί2ί9)' νψηλήν,
ύπερβαίνονσαν υπέρτατος (^Γ381)• μέγιστος, πρεσβντατος.
ή^ύπερτεΐς' Ερητικων πόλεων έπίΒβτα ύπερτελής (ΑβκΙι. Α§. 286) -
ύπίρ τό τέλ$; άφιχομένη ύηερτέλλοντες' ανατέλλοντες ύπερτέλλων
νπερα{να)χέλλωίρ ^ νπερψΛΐ' νόμενος των άλλων άστρων ύπερτενη
(ΑββεΗ^τΙ. Βεΐύί. ΑΟ. 353, 10) ύπερανατείνονσα , υψηλή υπέρτερα•
υψηλότερα (€Γ. 8€ΐιο1. Ε•Γ. ΡΙιμβ. 335) ' οΐ όέ νεωτέρα, ^
πρεσβυτέρα, ή άροτρον ύπερτερία (ξ 70 ΡΙβΙ. ΤΗβββΙ. 207 Α)* η
άνα^&εν της αμάξης έχιτι^έμενον ύκερτερίχισι• νεωτερισμοΐς.
νχερηφανίαι; ύπερτερώτερος' νεώτερος ίύπέρτερον εσχατον,
νστερον. νεωτερον. ευγενή ίύπερτερείη' τό πήγμα της αμάξης
"Ιύπέρτερα (γ^^)' χρέατα έτζτός τον σώματος προς την σύγχρισιν
των εντός ^υπερτερούν δεσπόζον [79] ύπέρτεχνον σπονδαΐον
νπερτοναίων υπέρ των άνω σννδεδεμέ' νων χαϊ διατετα[γ]μένων
Ίύπέρν^ρος' ή^πυραχτής (πνρράχης) υπέρφασις' νπερηφανία,
μεγαλορρημοσντη ύπερφέρεις (ΕυΓ. Η^ηοΐ. 554) - ύπερβάΧ^ λεις
[8^] υπέρ φευ (ΑββεΙι. Α|^. 362 β].)* ύπεράγαν υπερφίαλος (Ο
94)• υπερήφανος, υβριστής, παράνομος, [βά 87] ι; εχσπονδος
ύπερφλύζεΐ' άναρρεΐ, Ιχφυσαί ύπέρφρονα (δορΗ. Αί. 1236)*
υπερήφανοι. αγνώμονα, υψηλόφρονα ύπερφυά (Αγ. ΝυΙ). 76 Ε^ς.
141)• υπέο φύσιν μίγαν ύπερφυές (ΗβΓ0(). IX 78)• υπερμέγεθες,
μείζον ύπερφύς (ΗβΓοά. VI 127)• νπεργεννη^είς ανώτατος,
υψηλότατος, ευγενέστατος [65] 40 ύπερφυώς (Αγ. Αείι. 142)•
ύπεραγόντως εΟΒ. 4β Ιήσσαιτο 53 ύπερόφους 61 ύπεραχεΐν,
άνατελεΐν 62 νπεράης ης χεσον 64 ύψηλώτατες 65 υπέρτερος — των
στέγων 74 ύπερτερεοίτερος 78 ύπέρτερον €γτ\\\, Υοβδ. 81 ύπίρ των
νεών 82 ύπέρι&ρος 84 \ερεΐς \α)^ίς 86 υ^βρφΓ. 90 φύσει μέγα ΗΕδ.
28 ύπερχυδέοντας' λίαν ένδοξους 32 ύπερμενέον ύπερηφανοϋντα,
υπερέχοντα τή δυνάμει 38 ύπέρογχον (Εχοιί. XVIII 22)* μέγα,
ύψηλόν, ύπερ μέτρον 41 ύπερόλβη' χόρυς. ύβρις (οί. υπερβολή) 42
ύπεροπεύεΐ' ψεύδεται (ήπ — ) 43 υπεροπενς' ψενστης, υπερόπτης
(ήπ — ) 45 ύπεροπλήσαΐ' ύπερβήναι, ύποπηδήσαι Αά &1 λέγεται δέ
Ιπϊ των τά αυτά ποιούντων χαϊ μηδέν περαινόντων 52 ύπερούσιος*
αγαπητός, πεφιλημένος 54 ύπέροφρυς (θΓβ^. Κβζ. II ρ. 78 Β)•
ύπέροπτος 58 ύπερπα&ήσας (Εμγ. ΡΙιο^• 1456)* πάνυ λυπη&είς ( —
ασ* — εΐσα) 60 ύπεράγη {Π 300)• διερράγη 65 ύπερ τέγος (Ο〧.
Νβζ. ΟβΓίη. 1 178)* υπεράνω της στέγης 79 υπερτήρα (ΡΙβΙ.
ΤΙιβαβΙ. 207 Α)• τό της αμάξης πήγμα 85 ύπερφερές (ΕΧΧ)• μέγα
υπέρ φύσει, ή ύπεράγων Αά 87 [ύπερφυής' μβχβλοπρεπής.]
The text on this page is estimated to be only 19.02%
accurate

1497 νηερχβίλες — ύπ9βιβάζον%βς 1498 υη%ρχ%ιλέ£'

ύπερμ^μετρημένον ύηερχβιλών ύπερμέστων ύπερχέων υπερέχων
νηέρχολος (ΑηΙίρΙι. ίΓ. Χ61Ι ρ. 159)* νηερβαλλόντως όργιζόμενος
ύηέρχρεως (θ€ΐη. 821, 14)* ό κολλώ ηλειω της ονσίας οφειλών ν
περώ (ΑηβΙ. ίΓ. ίηο. Ι.1Ι)* ύκοβαλω. άντϊ τοΰ ηροερώ ν περώ (435)
[500. 1] νπερωησαν (θ 122)* νπεχώρησαν [8] νπερφον άνώγαιον
ύπερώφ&η (ΤΗαο. Υ 28)- παρώφΒη ύπεσάχ[χ]ισεν* ύπηθει τφ
σάχ[χ]φ. ίνιοι ηρόχοπτε [7] νπεσις' ταπείνωσις^ Μοοις [9]
υπεσπληπαμένον (Οοιηκί)' "ύποπιασμέ" νον. ή ηεποααλμένον [11—
14] νπεστόρεσταί- νπέστρωται^ ήπλωται [16] ύπεσχηχώς' ύποστάς
νπέσχηταΐ' έτιήγγελται ύπέφηνεν (ρ 409)* νπέδειξεν^ εφανέρωσεν ν
π εχ άλχ ίΟ α' ηρός χαλχού υπε^έμην [21. 22) νπεχε' υπόφερε,
πάρεχε, υπόμενε ύπέχεί' υπομένει, ύφίσταταί. δίδωσιν ύπέχεταΐ' ή^
προμη&εΐται ύπεχευεν (Α 842)* νπεβαλλεν^ νπέχυσεν ύπηγάγετο'
ήπάτησεν [βά 27] [28] ύπηλάτων (ΗίρροεΓ. 11 ρ. 38 Κ)* των ή^ύηό
ίλάττων, ένιοί φύλλων [30. ΖΙ] ύπ-ήλλαξεν ύπεχώρει ύπήν ύπηρχεν
[84] ύ π η ν ας (οί. Αββοΐι^ΐ. Γγ. 26)* γενειάδας ύαηνέμια ώά (ΡΙβΙ.
εοιη. ρ. 629)* τά δίχα του όχευ^ήναΜ γεννώμενα ύπηνέμους'
σχεπηνούς ή-ύπηνέμιον άνεμον ύετύν, χαϊ τά όμοια ύπήνη' τό
γένειον , ήτοι πώγων, άλλοι, μΰσταζ, ο[λλθ4 νηήνη^ δς έστι υπό την
(»Ζνα τόπος [40] ύπηντίαξον (ΗβΓοά. ΙΥ 21) * ΰπηρταη^ [42]
•^ύπήρατος• λογομάχος, ΰπέρλαμπρος υπηρεσία (ΤΗιιο. II 93)* των
χωπηλατούντων δέρματα τίνα, ώς προσχεφάλαια , έφ' ων χαθέζονται
[4&] ύπηρέαιον ή σανίς της χα^έδρας ύπήτριον (ΤΙι«οροιηρ. €θπι. ρ.
811)* ύπο10 γάστριον, Ιφήβαιον ΰπηχεί (οΓ. ΡΙι6Γ6€Γ. ρ. 254)*
βομβει υπήχ&ην ήλΘον [51. 52] ύπίσχεται (Ψ* 209)* άναδέχεται,
ύπισχνεΐται ύπισχνεΐται (ΡΙβΙ. Οίν. 61>6 Ε)• ομολογεί, συντΙΒϋ^αι,
επαγγέλλεται υπ* Ιχνιον υπό τά Ιχνη ύπιωγαί {ε 404)* ύηαγωγαΐ,
ύποδρομαϊ της πέτρας διά σχέπην, σχεπηνά μέρη 20 ή^ύπνάσσει•
ύπνώσσει ύπνοΐ' χοιμάται ΰπνος{3 7Ζ^) [βά 58] ι/Λ νου δώρο ν {Η
482)* ΰπνος, άνάπαυσις ύπνώ' χοιμώμαι. ί) αγρυπνώ ύπνωτιχόν
(ΑτίβΙοΚ. άο βοοη. €. 3)' ό μαν» δραγόρας υπό* πρό^εαις [63]
υπόβαθρα- χρηπίς. Θεμέλιος, ύπόβασις ύποβαίνει* έλαττοϋται 30
ύποβάσεΐ' ύποχαταβάσει [67] ύποβασμόν ΰποβάΘραν •[ύπόβασις' ό
ένδότατος χιτών, ή περίζωμα ΰποβατάν ύποβίηή^όν, τό ύποπόδιον (
— άύποβεβηχώς• μιχρότΐφΐ^^ έλάττατν ΰποβιβάξοντες'
ύποχαταβαίνοντες. ίλαττοϋντες €0Ό, 95 ΰπέρχειλον νπέρμεστον 98
πολλών 99 υπερβάλω 500 ΰπερώ, στόματος, ύπερφα, άνώγαια 2
ΰπερεχώρησαν % ύπεσίς \^ ύπεστόρηται 21 έφ' Ισης 82 ΰπήλλαζεν
{ΰπέχαζενί) 41 νπηντουν 54 νπίχνίον (οί. Οβίΐ. Οίβη. 97) 61
μανδραγόρας 68 ύποβάσιμον, ύπόβαΘρον ΗΕ8. 500 ύπερω (α 362 Π
184)* άνώγαια 1 ύπερφα (%\. ίη Ρβαίαι.)* στόματος 8 ύπερώϊον (Β
514)* υπερφον, άνώγαιον οϊχημα 7 ύπεσενεχίζετο γέα (Β 784)'
ύπεχάμπτετο, έχινεΐτο 9 ύπέρβιος* ύπέωρος 11 υπέστη (Ι 515)*
ύπέσχετο 12 ύπέ^ τρέχον (Β 426)* υπεράνω τοΰ πυρός είχον 13
ύπέστανον (Β 286) ' υπέστησαν, Ιπηγγεί^ λαντο 14 ύπεστειλάμην
(Α€ΐ. Αρ. XX 20)* παρχ^τησάμψί 16 υπέχεσΘαί' -υπερβάλω λ/εσΘαι
(\. ύποσχέσΘαι* ύποβαλέσ&αι) 21 ύπ* εύ&είας' ίπ Ισης 22
υπεύθυνος (Α0β€Κ• ΡΓΟίη. 324) ' Ινοχος. ύποχείμενος Αά 27
ύπέμεινεν (ιά ύπειχεν) 28 ύπηδόμενοι* ύφορώμ»»οι (ύπιδ^) 30
ύπι]λυξ^εν (Η 215)* ύπέδυ, ύπεισήλθεν 31 ύπηλήφαμην ένομίσαμεν
84 υπ -ή ε ι (1. ύποΙσει)' υπομένει, υποφέρει 40 ύπήνημος- σχέπι^
42 ύηηοΐη {ρ 25)* υπό τόν άρθρον, προς της εω 45 ύπηρέτης'
δούλος 51 ύπήω (Ηοη•) * . ι)ιτο τόν άρθρον 52 ύπήραλα (Ηοιη.)*
ι^^^ την θάλασσαν Αά 58 χυρίως (λΛ •'ΐί(«0.Ο?' 68 ύποαχταΐνοντο
(Ψ 3)* ίτρεμον 67 υποβάλλει (βοΗοΙ. Τ 80)• ύποχρούει ^
The text on this page is estimated to be only 16.59%
accurate

1499 νποβ^βαύΛ'ίν — νηοβ'ημωρ 15Μ νκοβιβαα^έν

ή^υχοβίβ^υχμέναν. νχοΛΕίίτοχός ΠΑ. 75] νηοβολίμαΐον (ΡΙ•Ι. Οίτ.
ΥΙΙ ρ. 637 Ε)* ον γνησίον^ αλλά νάΒον^ νηοβαΧλομΐνον^ ώς άπό
τών χαμαιριφών ηαώίων^ αηερ έανταΐς ύΛοβάλλουίην αΐ γυναίκες
ύποβορβόρίον ή τρνξ ύηόβρυχα (€319)* νκοβρνχια, ύηό τό νδωρ,
ύηό χάτω των κυμάτων βυ&ισ&έντΒς [79-81] 10 νκογΒγραμμένη
(ΑπβΙ. Γγ. 00Ι.ΧΧ1Ι) * έγιαχρψένη ύκόγειον ύηό τήν γην
ύηογενΒΐάζων (ΑμοΜπ. ρ. 9, 20)* Λιτάνίύων. άηό του γενείου
άπτόμΛνος νηογλωττίς (ΡΙ•Ι. οοιη. ρ. 632)* «Ιβο; στεφάνου, χαΐ
ηά&ος τι κατά τήν γλωτταν (ΗίρροΰΓ. 471, 22). χαΐ μέρος ένστόμιον
Ιββ] ΰηόγνυθα* το χα^σ&αι τάς χείρας ίχοντα 20 νηό γνάΒον [88]
νηογράμματα (Ατίι!ορΙι. ρ. 1078)* στιμίσματα των οφθαλμών
ύχογραμμός' τύηος, μίμημα νηογράφειν τυποΰσΒαί νχογραφ'ζναΐ'
είσακουσθήναί '^ύ/ΐογραψίον των ίηϊ τφ σώματι δεδανείομένΦΡ
ύηόγυον (ΗΙρρθ€Γ. ρ. 1225 0)* κροσδόκιμον. έγγύς^ ^^ όμοϋ, χαϊ
τό ηρό ολίγου γε- 30 γονός^ χαΐ τό ίτοιμον, ηρόαφατον [95]
υποδέγμενος {ν 310)• υποδεχόμενος υποδεέστερος (ΗβΓοά. 1 134)
* ταπεινότερο» ύηοδεής' ένδεης^ καταδεής. ύπόφοβος
ύηοδενδρυάζειν τό έξ άφανονς κσΐ αιφνιδίως έπιφαίνεσΒαί ύηοδεξίη
(173)• υποδοχή , ή ή χορηγία προς ύποδοχήν ύποδέραια'
ύποτραχήλια ύκοδέραιον ύκοδείρυον χαϊ πε^ιτραχηλιη ύποδερίς
(ΑΗβίΦρΙι. ρ. 1079)* όρμίακ^ς. ίνιοι πλοκίον τι περιτρα2[ήλιαρ χαΧ
μέρ^ς η ύχοδέσματα' Μχυρα ύχοδέσμιος' [8(1 605] ύβεοτβΒεΙς
^ύηό δ' έτεινε (ΕυΓ. Ογ. 907)- υπέβαλλα ύποδήσαΐ' ένεχυραθήνιιι,
Ίταλιώται [8] υποδιδάσκαλος (Ρ1&(.Ιοη. ρ. 636 Α)* χοροδιδάσκαλος
υπόδικος (ΑββοΙι. Εοη. 260)* υπεύθυνος, χρεώστης, ένοχος δίκης
ύποδμως (ό 386)* ϋποτεταγμενος ^ δούλος, Βεράπων νπόδρα
(Ηοιη.)' ύποβλειράμ^νος ^ βλαπτικός ύχοδράξ (Νιο. ΤΗ. 457
ΟβΠΐιιι.)• όμύίως νποδρακείρ' ύποπτευσας ( — αι) [15] ύποδραμών
(Αγ. Ες ς. 657. 682) • ύφερπύσας ύποδρασίας' τάς έχΒρας
ύποδρασίη' υποψία (τ. ύπαι — > [Μ] ίύπό δρόμον (Εοτ. ΡΙιοβιι.
1406)* νπο τροχααμόν, υπό κακοήθεια» ύποδρόμους• στόμια
ύχοδύεσ&αι* όειλιαν ύποδϋναΐ' ύπεκδΰναι [24] ύποδύς' ύποβάς,
ύχεισελΒών [26—28] ύποέστης' χιτών ύποεχμένη' ύπείκουσα.
^ε(Ηζπ€νονσα (β. ύχοατ — ) ύποξάκοροΐ' νεωκόροι ύποζατηΒείς*
ύποκατασχων ύποζνγια' κτήνη τά υπό τον ζνγόν, χαϊ [βά 33] πάντα
τά έξευγμένα [94] ύποΒέσεις' καταβολαί, πράγματα, αιτίαι,
προφάσεις [36] ύπόΘευτον "Ρόδιοι έπϊ Βυσίας ύποΒήκη- παραίνεσις,
διδασκαλία, ή ίνέχνρον. ή συμβουλή ύποΒημοσύνη (Ο 412)* τά αντά
ύποΒήμων ύποΘέσΒίς καταγράφουν (41] €0Ρ. 85 ύπογλωττός 89
στημίοματα 94 ολίγον 95 ύποδαΐον 97 τάπανώτερος 98 επίφοβος
600 ύποδέξειν, ύποδοχεΐν 1 ύποδέρεα 2 ΰποδέρεον^ ΰποδίριον 8
ύποοερές 6 ύποδέτινε 11 ύπόδμος 13 ύπόδραξ 16 νφαρπάσας 20
ύποδρόμον, νποτρ. ύποκ. 81 ύπεξακόροι (32 €ί. ζαγωσαι) 40
κακογοάφα^ν ΗΕδ. 74 ύποβλεπόμενος (Ι δβιη. XVIII 9)• ύηονοων,
έχ&ραίνων 75 ύποβλήδην 2)• υποβάλλων τον λόγον πρ\ν οιωπήσαι
τόν λέγοντα, άλλοι ύπολαμβάνων 79 ύποεσωτέρου Ιματιον £•
υποεικεν {/ι 'Ζ\)ί)' ανεχωρει Ζβ υποειξομαι [Ψ ΌυΖ)* νποχω' ρήσω
Αά 38 τα ύπόξωμα (Ρΐ3ΐ. ΰίν. Χ ρ. 616 €) 34 ύποΒέσΒαι {Α 787)*
ξηϊφΒονλεϋααι 36ύπόθ£θ(ο 309)* ϋχό9ου, συμβούλευσαν 41
ύχοΒήαομαι {α ΤΑ)* ^βϊ$άξΐβ χα\ ύηόΒου ομοίως ' .. .
The text on this page is estimated to be only 19.55%
accurate

β\ 1501 νηο&υμίς — ύτζό^ηαρτί Χί9ψ 1502 νπο&νμίς (Αίο.

8&ρρΙι• ΑηβοΓ.)* στέφανος ύποτράχηλος -^ύηοίατι^Βίς'
νποστραην^ίίς ύκοΙζΒα&αί' νηονοέίν ύκοιίίονρίΐ' άντϊ τον συνέστη χαΐ
γ^γά^ μηται [46. 47] ύποι(σ)τά' φορητά^ βασταχτά ν Λ ο ία ο '
νηενέγχω^ ύπομενό^ ηαϊ τά ομοία νποχα&ησ&αΐ' ίνεδρενείν
υΛΟχάλνχα' νηό την χλεΐδα τον ή^ηνρός 10 («1 ϋποχείσεται,'
νΛοβλη&ησεται Ύϋηοχεντά' νηομονητιχά νποχέοιτο• νηοχείαεται νηό
χεν^εα* νηό χοΐλα [67] νηοχόληιον τοΰ χοροϋ' της ατάσ^ως χωραί
αΐ άτψοί νηοχομ^ρίας' τό χομφόν νηοφαΐνων ύηοχορίξεσ&αΐ'
νηοχοριατοίοΧς Χόγοις χρή^ σ&αί^ ήτοι χολαχεύειν 20
νηοχορίζόμενος' ομοίως [62] νηοχρέχειν* ίηϊ των ϊηηων^ ηορείας τις
τρόηος, βήμα ^^^ νηό χράτεσφιν* νηό τή χεφαλίβ νηοχρι&ήναΐ'
άηοχρι^ναι νηοχρίναιτο (ΑροΙΙ. Ιβχ. 160, 1)* νηοχρίσει τι ηοιων
νηοχρίνοιτο' άηοχρίνοιτο. ίνθενχάίνηο^ χριτής^ ο άηοχρινόμενος
ηρός τόν χορόν νηόχρισις• εΙρωνεΙα, ύηονλότης, δόλος 30
νηοχριτής• μάντης, χαϊ ό έν τ§ οχηνζ άηοχρινόμενος νηοχρονει*
αντιλέγει νποχροννιδία• &νσία τις ηαρά Ενιδίοις νηοχρονσταλις• είδος
τον λίνον σηέρ" ματος νηοχνδές (Οίηβη^Ι-» ΕορΙιοπο) [74. 75]
ϋηόχνχλον {δ 131) ' νπότροχον, ή χάτω&εν σηεΐραν έχοντα
(ύηοχνλίς') ύποφρύδΐον νηοχυσ{ϋ)αμένη (λ 263 Ζ 261)* ίγχνος
γενομϋτη^ έγχύμων νηολαβών νηονοήσας^ νομίσας, άηοχρι^είς
ύηολαΐς (Αγ. ΗΑ. ΤΙ 7 ΤΙιβορΙΐΓ. 0. Ρ. II 17, 9)* όρνις τις τ»ρ
αχωληχοφάγων νηολαλεϊ' "φι^ρίξει ί νηολάμβανε' νόμιζε, άντιτΙΒει
ΎηοΧάμητειρα' 'Εχάτη έν Μιλήτφ νηολαηάξας' νποχενώσας [84. 65]
νηοληΐς' είδος όρνιθος, ή ... λα ι ς (679) νηοληχάν νηοχρούειν [88.
69] νηολείηεί' έχΧείηει ύηόλινον τό δρμινον (ς. ▼.) [92]
ύηόλι(σ)φον' όλισ9ηρόν [94. 96] νηομάζιον θηλάζον ηαιδίον
νηομαλανδριώδες (ΕρίοΙιβπη.)* εΙδός τι ταρίχου '^νηομέλα&ρα'
Αρτέμιδος Ιήί^ετον^ ως ό Μννδιος ύηομειδιώντί' γελωντι [^00]
ύηομηλαφήσαΐ' ιρηλαφήσαι ύηομονή' χαρτερία νηομνηματιστής' ό
νηόμνημα λέγων ύηονέμεσ&αι (ΕρίΰΙιβΓπι.)* έξαηατάν ύηό νηΐω (γ
81)* τόηος δένδρον ^χον^ Ιν οίς έδέαμενον τάς νανς νηονοεΐ'
ύηοητεύει νηονο^ενσαι• νηοφ^εΐραι (€ί. ιίιτβν— ) ύηόνοια'
νηερηφανία^ Βρα§9( νηονομαΐ' χλοηαί. οχετοί νηονοστήσας-
έηανελΒων^ ίχοατρέφας νηοννσσεται* χαταηονεΐται (€ψΛΛΒ) [12]
νηοπα^ών ήρεμα ηα&ων νποηεράτωσις* τελείωσις (15]
ύηοηερχόξονσι (η 126)* μεταβάλλονσιν έχ τον όμφαχος χαϊ
νηομελαίνονται ^ηό ηαντϊ λέ&φ (ΡΓ•χί11. δορίι. Γγ. 34) [•ά 17] [18]
€00. ^Ζ ύηο&νμιος (€{.έηιΒνμίς) 41^ ύηηχονρεΐ (ϋ ύηομενετάΐ) Μ
ύηοχεν&εα^ ϋηοχοίλια 66 9ορηαι τις 64 ύηοχρατέσφιν 67 άποχριτής
77 νηοφρνδιον ροβΐ 73 79 νπαλάϊς 82 ύπολαμητήρα 86 ροβΐ 87:
ύπολιαπάξας 98 νπολιφόν 97 ΑΙΗ. III 121 Β. 716 χαταβί
ύπομελαΐνεται ΙΙΕ8. 46 νηοιχονρονσα' εΙς βά&ος (ΒββΙΗαβ) οίχονσα
47 ύηοΐαει (^\. Ργ•τ. 8&Ιοιη.)' ^φ^ίί^ί'ΐ βαστάσει 52 ύηό χόρασιν (Κ
152)* ύηό ταΐς χεφαλαΐς 57 ύηοχνσααμένη (λ 253)* έγχνοΰσα 62
ύηόχρασιν (Κ 152)- ύηό ταΐς χεφαλαΐς 74 ύηοχνχλα {Σ 375)* τους
άστραγάλονς τους ύποτιΒεμένονς τφ ηνΒμένι των τριπόδων 75
ύηοχνησα'^ μένη (λ 253)* ύηό γαοτρός Ιχοναα έγχοέλιον 84
ύηοληητέον (ΡΙβΙ. €ίτ. Χ 613 Α)* ν^. μιστέον 85 ύηόληιρις'
υπόνοια^ χαϊ τά όμοια 88 ύηολίζοντες {Σ 519)* μεγίφ§ι έλάααντες^
όλιγώτεροι 89 ύηολιμαΐος' ό μο (§16) γνήσιος (ύιίοβολ — ) 92
ΰπολιπα£οϊσί (Ηοπι.)* σνν(εν)τραφέσι 94 ύηολαιόν -[ύποδαιστόν
(ύηό λαιόν πόδαΐ) 95 ύπούέας (^ί451)' έχχλίνας 700 ύπό μηνί&μων
ύπό τήν όργήν 12 ύποοργός• νπονργός ηΌ9θη8ξία' ταηείνωσις (728)
Αά 17 παροιμία τό ^ύπό «αντϊ λΙΒφ σχορηίος εΰδίΐ^ χ Λ9
ύποηιάξομεν (Οτ9^. Νη. Ι ρ. 533)* ταπεινονμεν, μαραίνομεν.
Ύποπιασμός γάρ τα. ΜΗ9ω0ί$ έ0η σάαατος (Ογο;. Ν•ι. Ογ. ΧΥΙ ρ.
240 0) • .>•■■
The text on this page is estimated to be only 14.24%
accurate

1503 νηοηΙύαΦ ^ νηοψωνηϋαί 1501 νηοηϊααΐ' ύκοηοχίσαι

[20] νηόηλαως (ΙΙβΓΟίΙ. ΥΙΙ 47)* μίστός^ Ιμηλ^ως νηοποΐίΐταΐ'
ηροσΛΟΐεΐται [23] νπόητερος (Ευπ. Γγ. 424) * χοΰφος, χαϊ
νηόπτερος ό ταχύς (Ιοιι. Γγ. 14) [&(1 25] ύΛΟΛτίρον ταχείας ν Λ ο Λ
τ ί ι ' € ι • ν,Ίυνοεΐ, ν:τολαμβάνει ΰχοΛτυς εχ\>ρός (Λοβεΐι. Α^.
1637) ύπόπτως (ΤΙηΐΰ. VIII 66)* ίχ^ροειδώς νπόπτωσις' κατάπτωσις
10 ν/ίόίζτωτον ύιιοΛίπτον νπόρ(ε)ία• τά ύπό τά όηη νΛοηίνους' τους
ν. ιό (ηρϊ φ^εγγομενονς [38—35] ύηορράητει,ς λύγους (ΕϋΓ. ΑΙο.
664)* αυντί9ης ύποσαχίζαν ύπη&(1ν τω σάχχφ, χαϊ τυ προσχό.Ίταν
Ιύηοσχελίσεί' απατ7/σε4, χλευάσει ύπόαχοπον χέρα' Αισχύλος (Γγ.
330). ωσ- 20 περ οΐ άτιοσχοηοΰντες ^ οντω χελεύεί σχηηατίσαι τήν
χείρα ^ χαΒάπερ τους Πάνας ηοιοΰαι, σχήμα δέ Ιστιν όρχηστιχΰν ό
σχοπός [40] νηοσμος' όσφραινόμενος ύποσμύχεί' θλίβει, ανί(χ,
χαταπονεΐ, ίχ με^ ταφοράς των τραυμάτων ύποσμνχΐται* ύηοχαίεται
[44] ύηόσκονδος (Η«Γθά. VI 103)* οηονδάς αΙ^σας 30 {}
ηοο(α)είοναι (ι 385)* χάτο&εν ίλχουσιν ύίϊόστα' υπόμενε υποστάθμη
(Ρΐ3ΐ. ΡΙιαοάΓ. 109 Β)• τρυγία, τρνξ [49. 50] ύ Λοσταχύοιτο {ν 212)•
ύπαύξοιτο από του στάχυος νποστειλάμενος (ΡΙαΙ. Αροΐ. 24 Α)*
ύ.ιοχρυψάμενος. φοβη&ιί; νηοστέλλεσ^αί' άναδνεσ&αι. δολιενεα^ι,
υποχρίνεσ&αι. ύποστέλλεταΐ' φοβείται, χαΐ τά όμοια ύπόστερνον
υηογάατριον [Μ] υΆοσττίσαΐ' όταν τις έγχάθετον ση/σ|^ έ» τω (όνΊ}
σασ&αί τι [58. 59] ύποστολή' δειλία, φυγή [81] ύΛοστροφον
άφιγμένον^ ύποστρεφαντΛ [63.61] ύηοσχεΐν ύχοβαλεΐν, δοϋναι
ίίηοαχεσεις• έκαγγελίαι 67—68^] ύηοτίτροφεν υηέτρ•\οφεν ( —
άφηί) [70] ύηοτιμήσεως' ηροφάσεως [Π] ^^ηοτον^ορύξεί' γογγύζει,
ύηοτοπάσαΐ' ύηολαβεΐν^ ύπονοεΐν ύποτοηήαομεν ύπονοήσομεν
νποτρέχοντες' υπεισ ερχόμενοι, αιεενδοττί; ύπότριμμα (ΑπβΙ. Γγ.
XVII 1000)* ^χ φοίνιχος χαϊ μέλιτος χαϊ χυμένον χαϊ άλ/Λψ τινών
άρτυμάτων έργον ύποτρύζεΐ' υποβάλλει, ύποφιΒνριζει, χοΓ>'^ζ^''
(70. 80] ύπουλος (ΗίρροοΓ.21, 32)• ΰηοπτος, δόλιος, ύποχριτής,
όλέ&ριος, άσυμφανής. Ύπο^ν]λα δε λέγεται τά μι) φανερά των
όφ^βλμών ελχη ύπουργεΐ' υπηρετεί ΰπουρα' υπό τά όρη ύποφαίνεΐ'
φανεροί, 0£4χνι;(£ '^-ΰποφαίσεις' εις θεωρίας υποφέρει* υπομένει
νποφέρονταΐ' υποβάλλονται νποφί}ταΐ' μάντεις, προφήται^ Ιερείς,
δααμηνευταί, χρησμολόγοι (ϋ 235) νποφητορες' νποτεταγμένοι (οΓ.
νπαφ—) νποφ^άς (Η 144)* προφΟάσας [91 1 νπόφορος' νπό τέλος
^ [βά 92] νπεν^υτος νποφωνήααΐ' νποδεϊξαι €0ί). 24 καϊ νπύπτοης
3β συντιθείς 37 νπω^εΐν 38 [τ; σε ι 39 νποσχεπύνχέρα 42 ύποσμύγει
51 τής 53 υποστέλειΟΛ^αι 78 υποβάλει 79 ύποστ] ΗΕδ. 20
ύποπλαχω (Ζ 396)* υπό τω Πλαν.εΐ όρει Κιλιχίας 23 υπό πραιτίδωτ
(Λ^412)' υπό των φηενών Αά 25 [ύποπέτρου] 33 ύποργη\>εΐσα'
νηοχριο&εΐσα 34 υπό ροπής (β• 192)* υπό τής όραής 35 ύπορρόφιοι
(Ι 640)* υπόστεγοι 40 ύπό σχήπτρφ (Ζ 159)• νπό τή βασιλείς^ 44
ύποσμύχουσα' ένδον (βοοΙ. 8€Γ.) ερε^ίζουσα ^Ι^ ύποσταίη (/ 445)•
ύπόσχοιτο 50 ύπόστασις (ΤΙΐ6θάθΓΡ(.)• πρόσωπον 56 υπόστήμα (Ι
δηιη. XIII 23)* πλήθος 58 ύποστήσεται (?». 0ΧΧ1Χ 3)• {^πομενεΐ 59
υποστήτω {Ι 160)• ύποταγιμω, εΐξάτω, παραχωρησάτω 61
νποστρέσαι (Η2ΐ7)• άηοφυγείν διά δέος 63 υπόστρωμα* περίστρωμα
(Μθ6Γ. ΑΙΙ. ρ. 374) 64 ύπόσχετο (ί!ί5ΐ4)' ύπόαχού, Ιπαγγέλου 67
υπόσχομαι (Χ 114)* υποβάλλομαι, επαγγέλλομαι 68 -ύΜοαχύν (Ε
269)• τά αυτά 68ί» [ύποτάβλων ύπεξουσίαν] 10 υποτίθεται (1 Τΐιη. Ι
Υ 6)• σι;^!βουλευει 72 νποτίτθια (Ηθ!ί686 XIV 2)* θηλάζοντα,
γαλουχουμενα παιδία 79 4τΜΟτρθ' πον (Ζ 501)• 4τπεστροφότα ,
έπανελΘόντα έχ δευτέρου 80 υπότροπος (Ζ 367)• ι?^ ύπΟ" στροφής
91 'ΰποφ9'αμένη (ο 171)• προφΟ'άσασα Α<1 92 [ύπό χΐνσον] ί/
The text on this page is estimated to be only 5.88%
accurate

1505 Ύττοχαλχίς — ύφαΐς Ύΐίοχαίχίί (ΗβοιίΒΜβ)* 4 ^"^

Όμήραν ΧαΧκΙς 6ιά τά χΐϊΜίκ ν»^ ιι Ορο( ύτιάχια (Αγ. νβ»ρ. 138«)•
τά ύπά τούί όφβαίμούς οί&'Ίματα. άπο μίρον; 6ΐ ολιμ• •η)ν όφιν
6ηλοΙ (Μ 463). χαΐ τά χελιύματα (ΤΙΐϊορΙΐΓ. ΗΡΙ.. Χ 20, 3) οκίβιιίί' ι)
θαφία ν«αίρ(ΐ)[α- τύ χάτα> μίρος τον άρον; (1" 318) ύιια>ρόφιον•
νκάστΐ}'ον {Ζυτ. Ογ. 117?) (99. ΜΜ] ύράξ• μΙ]ΐ&-ην, άναμίξ
νρΐίγαΐέον διιρρίΟΐΊΐί [ί] νριατόμος• ό τά ιτηρΐα τίμνιαν τών
μιλιανριγγα• χτύον. Σαλαμίνιοι νρίαιδα• αηνρίδίον, οτιυρί; ύριαος
(Αγ. Γγ. Ι 5 ρ. 1ΙΤ5)- φορμύ; Ύρμίνη- ηάλις. (μάχη ΕΙιί) νρον σμήνοι.
Κρήτΐί (804). ί/ουχον ΎρράύίΟ!" άαύ τινο; τάΒ προγΟΒίοΐ', άδοξοι, ι}
(Ιχαΐα;. Ύρρα παιδίον (ΑίοΙ.) ^νρραχα- ■ίπρίαχν ■^ύρρώψΆαι.•
ψληναψβν ύρχαχόζ• όατρίον ύρτάνα- -^ άπομάχυτρας ύρτήρ•
Άλυνΐύς ■ύρχα! (Γοιη. V ρ. 66)' άμφατοιι χιράμιον, ;(α1 βιχιϋ^! τΑ
ιϊδοι ύρχη- ίφ' ής »« φορτία φέρονοιρ ηί ναΰται ιΙγ' χοίρος, ή οϋι. καΐ
ίχ9ϋς (ΑΓοΙιββίΓΒΐ.) ι!;• ■^άλΐίφαβσϋί• οΐ γάρ Σχνΰαι άί.ΐίμ(^μ)ατι
χρ£ρται ύιίιρ καΙ μοαχ{ί)Ιψ ατέατι ϋσας- βρέξα; ναγινορ- βάμ(μ}α Τ.
νιι6οι (3ιιρρΙιο)' όζοι, χλάδοι ύααί (ΗΐΓοι]. II 33)- βρέξαι να(ιμι- ΪΧΗ
βαϋςω (ΰς ιϊμι) ιϊ( ίχώμαοα- παροιμία ίπΐ τάν άχύαμως ■^ύα&λόί•
σσλόί, φλύαρος ναχλοί (ΒΐΓΠΐίρρ. (γ. VI ρ. 412)- άγχνλαι, βρόχοι, οδ;
ι}μίϊί ϋαιιΧονς τάα υποδημάτων χαΐ χ&ί λ4}•ναί των ίματίβιν
'.ύσχν^ά• ύόί άφόδενμα Ιύαχίνιοι- ναχάνιοι ϋαμή&ες- οιίβία» {»νσ~)
[31. 82] ■\ύοόν τό δαοτ. βοάς σύν άρότρψ αυνανα(α)τροφή
ναηληξ• βαλβίς. μύαφ, δ πΧήααων τούί βόας. χαΐ «αγίς λύχων 10
υιτΛλϊΐ^β' τδ ^όπτρον [χΑ 3ΰ| ναηΧτίγξ (ΡΙίΙ. ΡΙιββ^γ. 254 Ε)-
άφιαι;, άφιτη(ΐΙα. ηάγη [ιΛ 36] ναααχο; (Αγ. £.}•β. 1001)- {ιαταχός
ναταξ• κάαααλος χιράτινος 'Υσαέλκνον το νΰν '^ροχιια :ορ ΰροί ίν
"Αργίί χαλούμηον νσία)ωαο{• βοτά»^ αμήχουαα ύπτάδα• -ή δααιϊα
άμπελος ύστακητιΖ- φιναχί^ίι [441 ύητάς' πλαοτάς άμπίλαιν |4β. 47)
ϋοτίρα.• μήτρα 14». 60) ϋατΕράποχ,ς (Αγ. Ι,^β. 326)χάμινος
ύατερόαοτμος- ψ ξάΐ'ΐι ό τ άφοί ως Τ£»Βί(κοιι ^έϊονιν. άλλοι τον ί
δίύτίρον γάμον ύατιαχχός (ΗΙιίηΙΙιο)- ίίοτι'ιριον ηοιάν. Ίταύατρία-
χαίλ^ύς ϋαιριξ {Οβ\\. ϋίβη. 96) [»Λ ύστριχίϊ (Ρΐίΐ. γοπι. ρ. 624)-
μάστιξ ιτί πλί}ΐμίνη έξ ύίΐων ιριχώΐ! νατρος- γαστήρ ν; ύπά (/ύπαλον
δραμίΐται- παροιμία Ιπϊ τύν έαντούς «^ όλΐβρον ίμβαλ{λ)όνταρ
ΰααπίς- ι) σάμφυχος ύτ»όν γ4 Λνρίιφ»ον |6Ι. 62] ύφαίαρ (ΤΙιεορΗΓ.
ΟΡ. [Ι 17, 1)• το ίπιφνάμΐνον ταϊς πΐύκαΐί χαΐ Ιλάταις ύφαίρΐοα•
μιίοαις, ατέρηοις [β5] ύφαΐς• ή ώα, λύμα. -^φν^αχή 000. »4|χΕί ΜΙ
ύρΒίγάλίον (ίύρίδα•.... ύρίς• αη. σΐί.) 1 νρίαοο; 8 μάχη ΤΙΐίοκηαιΙ. 23,
21 1π νρχας, άμφω τών χιραμίαν — τι 17 ύρχι} 19 ύώ χαΐ 21 ϋοιίίνόν
22 ύαδοί 2& έχομααα 27 λαγνάς Μ άφιοτι'ιριον τϋ γ•^ 52 τάφος ψ
60 πνρέφβιον (63 ίΐζ. νφέαρ ; ΐΐ, ατελί;) (*Β αάμα ΗΕ3. »9 ΰιάς-
άρτίβ,ς (ύγιάς) 800 «ρεί- φοβείται (τριΐ) 3 Ύρία (Β 496)• ΐίόλις
Βοιωτίας 31 ϊ>αμηνας ιχτ-) 4β νατατα (Α 232)Ιαχατα ίϊ νβτατον (Ε
703)- έαχάτιον, τιλενταΐου Α9 ύοτΐροβονΧία (Ρτοϊ. XXXI !)■
μετάνοια, μετάμελοί, ι) έσχατη βονλή 50 ΰατιρον {Α ΤΙ)• -^αοον,
ηχτον, ΐοχατον Μ Μ ζάο9 άατραχύδιρμο», Ινάλιον, βράαιμον 61
νφαίι)μο9 (Οπΐ. ϋίχ. ίβιπΙ). XXI 94)- αίμβτάδες β> ιίφ«ΧρΕΐ (ο &16)-
χατασχινάζει 66 νφαγα>ρή {β Θ5)- μεγαληγόραις {
The text on this page is estimated to be only 3.11%
accurate

ιιφαιρίτιιια• μαία ύφάλοίί' ΐοΐί ύιισχάτα ΐήΐ Βαλάαατ]; ύφαλος

φάη[• ή ιιρύφα νφαιρύ• μίιά ΰφααμα• ίοτύί ίΐί (72— ϊ*] ίύφΐΐμίνοί'
ίνίΐ6ομίνοί(%Μ}, κΐχαλασμΐνοί, ήΐατταμένοι ύφαΐρίΐ- ί/υτρήσαι.
ύφάται. Άμιρίας Αφιίτο (Ειιι-.ΡΙιο'η.31)- ύηΐβάλλΐτο (—ίτ) ΰφιΧίον ά
λίβης ύφίλκιται (ΐφ— )" «ροτρίηΐται ύφ4ν' ^"β, ομού. καΐ αόΟος
π^αφδιάν [β1. 8Ζ| ύφβζαίρα»" ύφαιρεΖν, /ηαίριι,ν ύφβξαιρομίναν
ίηαιρομένον ύφέξΐΐ' καρααυ'ιαίί ύφίξιλι- Ιααρυν νφέξα (ΕιΐΓ. Ηβο-
1ΐ43)- δάααι ύφέαιι• ύΛοκατοβάαΐί ΰφΐοι;" νΛϊιιύοαίί, ταπίΐναιοις ,
ίλάτΐασι;, -{-ύφίσιιο !>;' σνμποδιημούς νφίοτάναί- ιΐναι, ύιτάρχαν
\ύφίαηά!• όχιτόί ύψίοτιόί• ίΐυπόαχατοί. ϊιηοχΐίμ^νοί ΰφετιβιι (ΟγεΙ.)-
ύπσμονηιόν νφννη'^ί• ίί'ίίτ)'"ί (9β) !ίιρΐ7»•οι• χατα«Χΐνάααι [98]
ύψιέμίνσν Ιν&ι&ομίνον (875; [β<1 99] νφιζάνιι• ίΚατίοί'ΐαι,
ύαοχάθτιται, νψίιται ύφιζάνορτι• ύιιΟχαΒημένψ ύφΐηαιν ΰΛοχαλά,
ίίαττοί, μΐΐοΐ ύφιοτάί• ΰΛΟΤίβίΙς ρι« - Γω Ι51β .•'ψίσιαται- ύαομέρΐί
[9•*-Τ1 {-φύλμιαν ιΑΓίβΙ. ίΤ. XII ρ. 963>' /«(μ; η τυν ανλοΰ αρό; τψ
οτόματι, ή αΐ γίνττ^ ύε;, χαΐ ύηοΟιμά *( ύφύρ(μιαιι)• χρναβν»
κοαμάρι,ον |Ι0- ΙΙ| νφυίιρον (ΰί. Τίιοο. IV 26)" ύααβρύχΜ ■ύφ' ι•ύ
(τί. ΕυΓ. Ηκ. 305)• ηαρ' ο^ ύφ• ύν νπό την (16-»] Ι 10 ι)φαγόρη (ρ
4Β6)• μΐγαληίΐάρΐ ύφαύχ£\•ι;' }•αϋροι. -ή νΛίρήφαΡίκ ν«!αύχην
<8ορΙι. (γ. Θ9Θ) ' μΐ]ταΧανχην -{■ϋψιϊίοι• τραπΐζΐται ιΙρ}•νρίον (Μ]
νιρηγορία• ύκίρηφανία (ΐβ- Π) ύ^ιβά μονός- Ιν ΰφιι βαίνοντο{
ύφΐζυγοί (Δ 166)' νίρηλήν 1χα>ν Η]ν **1)ίί(>Βΐ' (11| ύφικίραννος• ή
ύιάιτυρος κλ-ηγή 20 ν^ί-χόίαιρον• ίραχΐϊαν. ΰίΐ^-ηΧήν [β] ϊ-^ιμέΆιπν
(Ηιιΐοί. ΤΙι. 529 ΒβεεΙι;Ι.>- ιΊ ΐίίίΐ βααΛιύων ΰι/τιον μιΐζοΒ. μετίίπροΒ
ϋιριηίΐηλο» (Λ'437)- ύψηλάν, μαχρόν («] χΊιΐΊ.τόρον!• όι' νψον;
τρέχορτα; (41— 44| ■|-ιίνιτιλί'((' ΐαχιτάνις. ζτ' νφίοιον (8ορ1ι. Τγ.
1191>- νφηΐότη*• 30 (4Β| ύιίιφοϊτης• ύψτιλοιιάρσς [Μ—Μ] ύφον
δι^ττα• ίί; ΰφο! όρμ^ ν ω- βρίχφ ' (δϊ) εΟΟ. 69 ύφαλοαφα 88
ύφέξ€ΐ, »3 \οτά! ΖΟ \ρΊ, μι^ταληγοριΖ 2 βόμοί 35 νφινόΛον ά
φαναί- ϊμπρηαιίί Άμ. 86 Ιΐΐι ίλαϊΐίΐο, μ(Ηΐ» 1ΐ .ί,,ώίρβο ΐΗ 8ίε *υΙ
ύφηττιοινία ^Ι ίρη 32) 5» ίΐΒίΓίί » 11ατ\ ΐβ Γθ[Ιι 911 —ΐμένον »02 |ι
Γϋίροι 22 Ιουχίϊν ίίκ 3β νϊ^Ι (ίί. Ρίηιΐ, Γγ. 2 ΗΕδ. 12 ύφαι))!))!--
μί}'ολαύζΐ)υ 73 ιΐιριεί; (Ειιγ. Μβ<1.211)' ύηίνίούς 74 ι]φ[()ί{νταΐ'
«αρομαλογοϋοιν Θ1 ύφίντίΐ (ιί 434)' 2''^'''""'"ΐ' ύφίλύντι; 83 ύφΐ(λ•(α
(ΙοΙ>. XXI 1» ϊΙ.)' Ιπ^ριν, έχούφησιν 96 ύφήμΐνοι- αοΟήμινοί (Βΐΐ{.
Νβχ. υ>πη. 1. ίΙ4>. τοίΐίίΐ'ΐίί (βιΙ νφαμένος) 98 ύίρηνίοχοι (Ζ 19)• ^ι-
ίοχο! Αά 99 ητα)Τ(ιναιμ/»ον (ΐ^ιίΐίμον) 905 ύφιμένηί• ένδι&υμίηπς 6
ύφορρ* φοβιίται 7 ι!9'<>Ρ'ο>'' ναοβιστ 10 ΰφοριπμεΐΌ; (Μβΰο, 11
7, !4)' ύποβλιηύμετσς , φοβούμινο;, ύηονοων II ιΐφναηιαΕ (η 10δ)'
ύφαίΓουβιν ΙΑ ΰφοραβ(£ι;ν- α)α^ΐ|!ίΐί);>• 17 ύφοραα&αι•
όιανοιία9β( 18 ιΙφαρίΒ.ιίΕνον' τά αυτά 19 ΰχιοί- ηίί 24 ύφηβριαίτια (^
354)• -ηρΐφέ! (δ ίη) ■ εβ ύφί( ϊί» όροφοι 'ϊ»"! '( ύι[τίλι1ιί ϋοοφιίΐί. ίξ
ύύ τί μέγα χβΐ ΟψηλΰΜ 6ηΚοΐ Π νψηΚόν (Υ 14Θ)• μίγα ϊ» ι5_ιίι•ίΖ£ίΓ
ΓηΛΟί |£ 772)- ιίΛο ναν ΐίΐ ιΤΐΐοΐ Ιχειν τους τραχήλονς, οίον
ύ^ραύχίνίς, >| μΐ}αλόφιανοι ΧΑ ύφ)}μ£^
The text on this page is estimated to be only 6.03%
accurate

ύίπδία (λΙΙι. ρ. 96 ε^Φά (Α«οΙ.)' ΐΐ'ί, Ί>> φαν λ(}ΐιιν (139;

φάαν) (>— Μ φάβα• μέγας φόβο; (ΐΓ. βάβαν). καϊ τύ σννη&ίί.
όσπριο» (ΑΜ£ϋ. ίι. 206. 252). χαΐ πίριατιρά; άγρίαί αιΐΐρμαφάϊον
φαβοτύπος (ίι. ΠΑ. VIII 3)• (ϋο! Ι^αακοί φαβοχτόνοί- Ιιρακσκτόνοί
Φαβρίς• νηαϋιΟΒ αρύ τη; '^τ^ιχ■ήί φαγανΆράηιπν• άχα&άρτων
φάγαίρα (Αοΐϋ}!. Γγ. 219 Ειιγ. Γγ. 790)• φαγέ&αινα νόαοί φομα
ίΧχάδΐξ νιμομινον ψαγϊαΒ,ρου (€οιη Γγ. ΟΟΙ,ΧΧΧΙΙ)• ιιολυφά}ον
ψά)Ίί.οί• άμνο! ■^φαγΧαός• χείμαρροί ψαγόνες' αιαγάνις, ϊνάΆοι
φάγνΧοΐ' -^ μαατοί. μάραιπηοι φάγ-(αρος (Οοιη. V ρ. 1161)• ίχ8ί;
αοίός φαδάσαι- γι-άψαι [19] φαέβίΐ' χαία, ί^μπίΐ, φαίνει φαέθοντα
(δορίι. Αί. 930)- ίπιφανί}, λάμφαέΟοντα• τοχον επιφανή χαϊ
χαταχληχτιχόν Τ]} ίΐροοοίίΐ φαί&αν (5ορΙι.Ε1. 826 «Ι.) ' φαίνων,
λάμπων φαίΐνή (Κ76)' λαμπρά, φαιδρά ψάιν {ξ 602)- ίκέτΐα^ν [86]
φαιινάν [ιΛΖΙ] φαώρόν, άραϊο» (ψαινν—) -{ψαέαααΟαι• ϋιΐν, μαβεϊν
(ψραο^} φαεαϊμβροτοί (Ο 785) ' ν ιό ψώς τοις άνϋριόπαις
παρΐχθμί»ν• ""^ ή^•-θ; [30. 31] φαζάλη• πά^ος ααματίχύν, δ
γίνεται ιοϊ; ίρνθράν βάλααααν πλέοναιν ^ψάηχί;• οφθαλμοί φά&ι
(ΡΙϊΙ, Οίϊ. ρ. 434)- ιίηέ Φαίαχα- ί3ι•0ί Φοιάχω»• τά αυτά ίβνη ^
φαίδίΐ' όφιι Φαί&ιιιαί• όνομα χνριον. ή λαμπρός, χατά ιΙιυχί)ν
Ισχυρός, έπίοημος. οίΐονδαϊο! (β 617 /] 605) φαιδρός (Αγ. Ε^η.
530)- χαβ-αρός. }Κ}η}9ά!. φανερός φαιδρνντήί (Εΐιϊ 3ρ. Ρπυβ. V 14,
5)• ότΰ εύος τον ϋίοΰ βιροΛίνιαν φαιδροπάν (ΕιΐΓ. Ογ. 892) ■ χιίηιίν -
ίψάντ,σαν Αι) 27 λαμαρόν (Ι' 247) 30 ψαεαψόρος {ϋτι•-%. Νβϊ. II ρ.
41, 617)' γναιαί ψατίξαν, χαϊ ό το φας παρέχαν 31 φαξαχ•ηνΙαις•
δειλίαις (φνζαχιναϊςδιιΧαϊς) 35 φαΐ- δήμος (ψαίδιμοςί) Αιΐ 43 [ψαίειν
άν,] 44 φαΙ(ΐ) α 217)- ιΕ(πα(] 45 φαΙ(ην ζ 285)* ίίπαιμι 49 ψαίχελον
ψορτίον (φάχελον) 63 φαιλάνης- ιϊλιιιά• ριον μίμβράίΙν)ον. ή
γλφοιίόκομον 54 ψαΐμεν (Η βΠ' εϊχοιμιν. ϋπολάβοιμεν Ά φαίναχίξΐί-
ηλαν^, αηατρ, χλιυάξιι 56 φαίϋαχιαβίΐί * άηατηθείς 5? φαιναχιομιΐΐ'
το ο/ιοια (φενα — !«■) 58 φαιπΐΐ (ιτ73)• λάμπει, φαντάξει 59 φοίτίτοι
(ΰ456)' δοχεϊ. χαΐ άμοια 04 φαίνα,ν
The text on this page is estimated to be only 15.61%
accurate

1511 φαΜέΙους — φαμάξα$ 151! φακέλους (ΤΙίΒε• II 77)*

φόρτους φάηελοι (Ηατοά. IV 67)• όμοΙως φ αχό ς* βρύον τό Ιρ τβ
λίμνη* καΐ μέλασμά τι έν τ§ δψα, χαΐ μέρος τον χαλινού, χαϊ ή λεητή
της μεταλλικής λΐ&ου. χαϊ ίατριχόν σχεΰος (Ηίρρθ€Γ. 676, 44)
φάχταΐ' ληνοί, σιηύαι, πύελοι [75. 76] φάλαγγες- πολεμιχαϊ τάξεις,
άχό του ηέλας αλλήλων είναι {Β 558). χαϊ τά των δαχτύΦαληρεύς'
ηολίτης Φαληριχαί• ^όφανοι αί άίΐό της Αττατϋ φαληριόωντα (Α^
799) * λ^Όχαν^ίξοντα,^ λευχαινόμενα φαληρίς' όρνις λιμναίος (Αγ.
Αν. 565. 87ίι. χαϊ τό (φυτόν) Φάλης' δερμάτινον χαϊ άνδρεΐον φαλίξεί'
^έλει φαλιχρόν άχρατον λων άρθρα (Αγ. ΗΑ. 1 15). χαϊ νέων ύηερ-
10 φαλιόν (Οβίΐίιη.)* ί«ί 7] ΡΙ είσματα φαλάγγια• στρογγυλά ξύλα χαϊ
σύμμετρα, '^τηχοί δΐ χόραχας [79] φάλα(γ)ξ (ΡΙαΙ. ΰοιη. ρ. 620)*
ζωον ηαραπλήαιον άράχνχι, δ δή χαϊ αυτό ύφαίνΒΐν δοχεΐ
φαλάγγωμα' πομπή τις ίν τοΙς Αιονυσίοις φαλαγγώσα' τεΒηριωμένη,
•ήρε&ίύμένη φάλαγξ' πολεμιστών ηαράταξις φάλαΐ' δρα, σχόπει
(παμφάλαΐ) 1 φαλαγγοστορύναΐ' [όργανα πολεμικά {(αΙα€)
Φαλάκραΐ' τόπος τής^Ιδης (ΤΙιβορΗΓ. ΗΡ. 111 17, 6), χαϊ νύμφαι
{Φαλαχραΐαι) Φαλάχρας' άκρας της Εύβοιας (118) Φάλακρον
άχρωτήριον'Ίδης [89] φαλάν^η* ίριουργός φάλαν^ον Μολιόν, χαϊ ή
Νέστορις κάρα, οί δέ φαλαχρόν ΙφιΕλα' ή μαιρά χάρα φάλαρα (Π
106)* άστραγαλίσχος ό έπϊ της περικεφαλαίας^ χαϊ παραγναθίδες ,
χαλινοί, ή Ιπποκόσμια [94. 95] φαλαρόν λευχόν. ?.ευχοχέφαλον
φαλαρός (ΤΙιοοοΓ. V 104 VIII 27)• φαλιο,-, φαλαχρύς ,
λενχεμέτω:ϊος '\•φαλεριαώ' πέφριχα (123) φάληρα (ΛΊε. Τ1ι. 462)*
λευκά, αφρίζοντα, φρίσσοντα 20 30 φαλιόπουν λευχόπουν, Φαλιοϊ
ταϋρ•: (08ΐΙίιη. Γγ. ΟΙ,ΧΧνί)* λευχομέτωποι φαλίπτεΐ' μωραίνει
φαλίσσεταΐ' λευχαίνεται, αφρίζει φάλκη' ό της κόμης αύχμός. ι/
ννχτερίς φάλ{λ)αΐ' φάλ(λ)αιναι [14-ϋ] φάλ(λ)αινα (Αγ. ΗΑ. Ι 6)- ι^
^ρ «^ χιψε• λη &ρίξ» χαϊ ΙχΒΰς κητώδης [18] φάλλι; (ΒΙιο«ϋί?)' ή
πεταμένη φνχη φαλλικά (ΑπβΙ. ΡοβΙ. ε. 4)' φδ•ή πεχοιψ μένη εις τον
άιόνυσον, τον φαλ{λ)ον α^ομένου φαλλικό ν (Αγ. ΑοΗ. 261) *
όρχημά τι, οί Ι^ μέλος, αλλοι φδήν αύτοσχέδιον έπϊ τό φαλλω
{ΐδομένην φαλός' λευκός, ή βόλος, χαϊ φαλόν τβτ εμμανή (110) [2ί]
φαλόν τό στερεόν κύκλωμα τοΰ στίηνον. οί όέ τόν μωρόν φάλος' ό
λόφος της περιχεφαλαίας. αοΐ τ ρυφάλεια ή τρεΐς κεφάλας ίχονϋα:
ίνιοι λευκός ήλος. άλλοι ^ελλός,άλλοί χβφός (φαλός) •^φαλύγματα'
ύγράσματα φαλννεΐ' λαμπρύνει (198) φαλύσσεταΐ' χαταρρήσαει,
περιέρχεται φαλω&είς' παρατραπείς [30] •^φαμόξαί' φάσεις [32 —
36] €00. 12 φακέλφί Ί^ σηπύαι (φαχωταί
The text on this page is estimated to be only 18.82%
accurate

1513 φαμμη — φααγανβτα$ 1514 φόμμη- άλφιτα (τ.

ψάμμτιν) φαμμάστρια' τά "ψαιστά. χάί εορτή τις φαν (Αβοΐ.)' [>Α
89] λέγειν (2) φάναι (ΗβΓοά. 1 39)* εΙπΒΪν Φαναΐος• 'Απόλλων,
Αχαιός Όμφάλχί (Γγ• 33). ηαρά Χίοις οΰτω λέγεται φ αν αν 9'έλΗν
[48] φάνας (ΕυΓ. ΒΙιμ. 943) * [•ι1 44] τάς έχλάμ^ΡΒΐς φαϊβόν τό
φαινόμενον^ φωτεινόν χαΐ λαμ- 10 ίίρόν, Ιάττιχοϊ δέ λνχνονχον
έχάλονν^ δ ήμΒίς νΰν φανάν [46] φαντάζομαι (βεΐιοΐ. Αη ΑεΙι. 823)*
σνχο^ φαντοϋμαι Ιφαντάζον δόμων (ΕαΓ. ΑηάΓ. 876) * φαΐνου
φαντάσας* δβίξας φαντασία• τό μή δν άλη^ές^ αλλά σχήματι
(φανταο^έν) φάντι (ΑΗίοί)* είπόντι 20 φαντίξοιτο' φαίνοιτο φάντος
(ΑϋίοΙ) * εϋιόντος / φανοτάτη' φωτεινότατη, [ή ηλάτανος
ψφ^ίνωτάτη^ περιφανής^ λαμπρά "'' φαορχίς' τρυγίς (173) [56. 57]
Φάπην τήν Παφίην ή^φαραγγαΐον της φαρέτρας τό χάλνμμα
φάραγξ' τάφρος^ κοίλωμα φάραγξΐ' χοιλάσι φάραΐ' ύφαΐνειν^
ηλέχειν 30 φαραιόάχη' μυρίχη φάργμα (Αϋί€ί)* φραγμός φαρέτρα'
τοξόται (οΐ, ηολλή φ,) φαρετρεών (ΗβΓοά. 1 216)* βελο&ήχη φάρη
(8ορ1ι. Τγ. 916)* Ιμάτια, νεφέλαι φα ρ IX ό ν φάρμοΜον σύνθετον
&ανάσιμον φάριον τό{ν) ίρβονν [70] φαρχάζεΐ' χλέχτει {Φαρχηδών
[Τΐιβοροιηρ.] * ηόλις) φαρχιδούμενοι' στνγνάζοντες 40 φαρχίς
(8ορ1ι. ίη 1000)* ρντϊς ή ίχ τοϋ γηρους γινομένη, ί) ^ίζα^ ηρός
^υτίδας ηοΐ' οϋσα. [ή στολίς φαρχιδων ^υτίδων ή^φάρχΒς' ν^οσαοί
φάρχτον φυλαχήν αχεύαξε φάρμαχα' βοτάναι. χρώματα• χαϊ ηάσα
αόα φαρμαχενεται• σx^υάζεται^ άρτνεται φαρμαχίτης (Οοιη.
ΟΟΟΧΧ)* άδ[δ]ηφάγος φαρμαχίς (Αγ. ΝυΙ>. 749 Οβιη. 793, 27)• 4λϊ
γυναικός φαρμαχίδος. χαϊ είδος φαρμάκου» ή άχρίς φαρμαχοι
(Ηίρροη&εΙ. 1τ. 7)* καθαρτήριοι• ηεριχαΒαΙροντες τάς ηόλεις^ ανήρ
χαϊ γυνή -^φαρμαχή (ΒίρροηβεΙ. Γγ. 36 Βπη1()* ή χύ^ τρα, ήν
ήτοίμαξον τοις χα&αίρουοι τάς ηόλεις φάρμαχον ή υποστάτη
(ΤΙιβορΙίΓΜί. ηβΙβΐΐ.)• άλλοι σύν^εσις |^ Ί* χηδίύουοι τά ΐ€ρά των
ζώων φαρμάκωνες (8ορΙι. ίτ. 1001)* τά βαφεία^ διά τό τά βάμματα
φάρμακα χαλεισ&αι φαρμάξαι• όξΰναι, βά'^αι φαρμάξασα'
άπατήσαοα φαρμάασει• [αά87] Θεραηεύει, φαρμαχεύει φαρμάσσων
(4 393)* βάπτων, ατόμων^ στομοκοιών, φαρμακεύων
φαρματτόμενος' κολακευόμενος. άλειφόμένος Φάρος (β 97)*
Ιμάτιον^ χερφόλαιον. άχρωτήριον χαϊ νηαος έν ΑΙγύπτφ ? φάρος
στέλλων (£υΓ. Ημ. 1061)* τό περιβόλαιον στέλλουν ^ ή τό Αρμκνον
φαροϋν (08ΐ1ίιη8€ΐι.) * άροτρ^άν φάρα ο ς (Νίο. ΤΙι. 664)* τρύφος^
κλάσμα. ητερύγιον (ΡοΙΙ. VII 121) [β4 9>] φαρύγε&ρον
(ΗίρροοΓβΙ.) * ό κατά τά ιταρία(&)μια τόπος φαρυγίνδην (Οοιη. βη.
εΟΧΧΧΥΙΙ)* άντϊ τον (κατά) γαστριμαργίαν φάρυγξ (ι 373)* λάρνγξ,
βρό{γ)χος, στόμα φαρυαός' τολμηρός^ Βρασύς ή^φαρβό' ομοίως
φαρύνει• λαμπρύνει (127. 433) φαρωσαΐ' άρόσαι^ νεώσαι,
λαμπρϋν19ήν]αι [200] φάσακες• συκοφάνται (φαν — ) [2]
φασγάνεται• ξίφει αναιρείται ΟΟϋ. 44 ίλλάμ'φεις 45 λνχνοϋκον ^
δομώ Μ ι; .... λαμπρά ρο•Ιί63 (Μ φορκίς Αοοίββ ?) 65 φ. βελοΒηκη
66 φ. τοξότης β^ φάριχον (69 ΡοΗ. ΥΙΕ ρ. 290 ΒΙίΙι;.) 72Ι> €ί. 174
74 \άάα ή πόλις (Φαρχηδών) 81 φάοαακοι 87 φαρμάσσοι 90•
σν•λων — ατέλων 96 φαρύγαΒρον 94 φαρυγγιοα ΗΕ8. λάμποντα ή
αυγή (Φάρος) άνελεΐν
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade

Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.

Let us accompany you on the journey of exploring knowledge and

personal growth!

ebookname.com