Konstantin M. Zuev

Konstantin M. Zuev

Auto-generated profile, based on publicly available information

Konstantin M. Zuev

California Institute of Technology

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2012 in Computers & Structures
Verified
Journal Article
Closed access
KZKonstantin M. Zuev
Konstantin M. Zuev
JBJames L. Beck
James L. Beck
SASiu-Kui Au
Siu-Kui Au
LKLambros S. Katafygiotis
Lambros S. Katafygiotis

1 April 2008 in Probabilistic Engineering Mechanics
Verified
Journal Article
Closed access
LKL.S. Katafygiotis
L.S. Katafygiotis
KZK.M. Zuev
K.M. Zuev

29 April 2015 in Scientific Reports
Verified
Journal Article
Open access
PDF file
KZKonstantin Zuev
Konstantin Zuev
MBMarián Boguñá
Marián Boguñá
Ginestra BianconiGinestra Bianconi
Ginestra Bianconi
DKDmitri Krioukov
Dmitri Krioukov
All real networks are different, but many have some structural properties in common. There seems to be no consensus on what the most common properties are, but scale-free degree distributions, strong clustering and community structure are frequently mentioned without question. Surprisingly, there exists no simple generative mechanism explaining all the three properties at once in growing networks. Here we show how latent network geometry coupled with preferential attachment of nodes to this geometry fills this gap. We call this mechanism geometric preferential attachment (GPA) and validate it against the Internet. GPA gives rise to soft communities that provide a different perspective on the community structure in networks. The connections between GPA and cosmological models, including inflation, are also discussed.

1 July 2011 in Probabilistic Engineering Mechanics
Verified
Journal Article
Closed access
KZK.M. Zuev
K.M. Zuev
LKL.S. Katafygiotis
L.S. Katafygiotis

26 October 2015 in Journal of Physics A: Mathematical and Theoretical
Verified
Journal Article
Closed access
PDF file
KZKonstantin Zuev
Konstantin Zuev
OEOr Eisenberg
Or Eisenberg
DKDmitri Krioukov
Dmitri Krioukov
Exponential random graph models have attracted significant research attention over the past decades. These models are maximum-entropy ensembles subject to the constraints that the expected values of a set of graph observables are equal to given values. Here we extend these maximum-entropy ensembles to random simplicial complexes, which are more adequate and versatile constructions to model complex systems in many applications. We show that many random simplicial complex models considered in the literature can be casted as maximum-entropy ensembles under certain constraints. We introduce and analyze the most general random simplicial complex ensemble with statistically independent simplices. Our analysis is simplified by the observation that any distribution on any collection of objects including graphs and simplicial complexes, is maximum-entropy subject to the constraint that the expected value of is equal to the entropy of the distribution. With the help of this observation, we prove that ensemble is maximum-entropy subject to the two types of constraints which fix the expected numbers of simplices and their boundaries.

1 April 2015 in Probabilistic Engineering Mechanics
Verified
Journal Article
Closed access
KZKonstantin M. Zuev
Konstantin M. Zuev
SWStephen Wu
Stephen Wu
JBJames L. Beck
James L. Beck