Journal of
Systemics, Cybernetics and Informatics

ISSN: 1690-4524 (Online)

Peer Reviewed Journal via three different mandatory reviewing processes, since 2006, and, from September 2020, a fourth mandatory peer-editing has been added.

Indexed by
DOAJ (Directory of Open Access Journals)Benefits of supplying DOAJ with metadata:
  • DOAJ's statistics show more than 900 000 page views and 300 000 unique visitors a month to DOAJ from all over the world.
  • Many aggregators, databases, libraries, publishers and search portals collect our free metadata and include it in their products. Examples are Scopus, Serial Solutions and EBSCO.
  • DOAJ is OAI compliant and once an article is in DOAJ, it is automatically harvestable.
  • DOAJ is OpenURL compliant and once an article is in DOAJ, it is automatically linkable.
  • Over 95% of the DOAJ Publisher community said that DOAJ is important for increasing their journal's visibility.
  • DOAJ is often cited as a source of quality, open access journals in research and scholarly publishing circles.
JSCI Supplies DOAJ with Meta Data
, Academic Journals Database, and Google Scholar

Listed in
Cabell Directory of Publishing Opportunities and in Ulrich’s Periodical Directory

Published by
The International Institute of Informatics and Cybernetics

Re-Published in
(A Community of about 40.000.000 Academics)

Honorary Editorial Advisory Board's Chair
William Lesso (1931-2015)

Nagib C. Callaos

Sponsored by
The International Institute of
Informatics and Systemics

Editorial Advisory Board

Quality Assurance


Journal's Reviewers
Call for Special Articles

Description and Aims

Submission of Articles

Areas and Subareas

Information to Contributors

Editorial Peer Review Methodology

Integrating Reviewing Processes

Editorial Introduction – Sustainable, Smart and Systemic Design Post-Anthropocene: Through a Transdisciplinary Lens
Marie Davidová, Susu Nousala, Thomas J. Marlowe
(pages: 1-10)

Systems Changes Learning: Recasting and Reifying Rhythmic Shifts for Doing, Alongside Thinking and Making
David Ing
(pages: 11-73)

Evaluating the Impact of Preconditions for Systemic Human and Non-human Communities
Susu Nousala
(pages: 74-91)

Post-Anthropocene_2.0: Alternative Scenarios through Nature/Computing Coalition Applicable in Architecture
Yannis Zavoleas
(pages: 92-120)

Applying a Systemic Approach for Sustainable Urban Hillside Landscape Design and Planning: The Case Study City of Chongqing in China
Xiao Hu, Magda Sibley, Marie Davidová
(pages: 121-153)

Rethinking Sustainability: Mapping Microclimatic Conditions on Buildings as a Regenerative Design Strategy
Ana Zimbarg
(pages: 154-172)




Volume 20 - Number 2 - Year 2022

Graph Sampling Through Graph Decomposition and Reconstruction Based on Kronecker Graphs
Shen Lu, Les Piegl, Richard S. Segall
Journal of Systemics, Cybernetics and Informatics, 20(2), 23-32 (2022);

Authors Information | Citation | Full Text |
The connectedness of the social network gives rise to a new challenge of how to efficiently sample the network and keep the graph properties and topology properties as well. Inspired by R-MAT and Kronecker graph generators, based on the observation of different graph topology types, we proposed to use Kronecker graph as the prime graph to conduct Kronecker graph double cover through periphery subgraphs. First of all, the connectedness of the graph remains during graph merging. Secondly, only redundant vertices and edges are merged so that the characteristics of the graphs are kept. Also, graph merging only works on periphery subgraphs from low degrees to higher up so those topology properties are kept. Finally, although some edges are merged, since the similarity groups generated based on Kronecker graph similarity is independent of the degree distribution, Kronecker double cover operation does not affect the graph degree centrality measure. We theoretically prove the feasibility of the Kronecker double-cover operation and also compare the quality of the sample set with Snowball sampling and Es-i sampling sets. Experimental results show us that, when the separation of the core and periphery subgraphs is between mean (the average of the degrees) and mean+std (standard deviation of the degrees), the topology types and graph properties can be preserved. This conclusion confirms the existence of the topology types, and also proves the topology types of the real-world graphs are not random.
Full Text