IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i20p2597-d657377.html
   My bibliography  Save this article

Resolvable Networks—A Graphical Tool for Representing and Solving SAT

Author

Listed:
  • Gábor Kusper

    (Faculty of Informatics, Eszterházy Károly Catholic University, 3300 Eger, Hungary)

  • Csaba Biró

    (Faculty of Informatics, Eszterházy Károly Catholic University, 3300 Eger, Hungary
    Faculty of Informatics, Eötvös Lóránd University, 1117 Budapest, Hungary)

  • Benedek Nagy

    (Department of Mathematics, Faculty of Arts and Sciences, Eastern Mediterranean University, North Cyprus, Mersin-10, Famagusta 99450, Turkey)

Abstract

In this paper, we introduce the notion of resolvable networks. A resolvable network is a digraph of subnetworks, where subnetworks may overlap, and the inner structure of subnetworks are not interesting from the viewpoint of the network. There are two special subnetworks, Source and Sink, with the following properties: there is no incoming edge to Source, and there is no outgoing edge from Sink. Any resolvable network can be represented by a satisfiability problem in Boolean logic (shortly, SAT problem), and any SAT problem can be represented by a resolvable network. Because of that, the resolution operation is valid also for resolvable networks. We can use resolution to find out or refine the inner structure of subnetworks. We give also a pessimistic and an optimistic interpretation of subnetworks. In the pessimistic case, we assume that inside a subnetwork, all communication possibilities are represented as part of the resolvable network. In the optimistic case, we assume that each subnetwork is strongly connected. We show that any SAT problem can be visualized using the pessimistic interpretation. We show that transitivity is very limited in the pessimistic interpretation, and in this case, transitivity corresponds to resolution of clauses. In the optimistic interpretation of subnetworks, we have transitivity without any further condition, but not all SAT problems can be represented in this case; however, any such network can be represented as a SAT problem. The newly introduced graphical concept allows to use terminology and tools from directed graphs in the field of SAT and also to give graphical representations of various concepts of satisfiability problems. A resolvable network is also a suitable data structure to study, for example, wireless sensor networks. The visualization power of resolvable networks is demonstrated on some pigeon hole SAT problems. Another important application field could be modeling the communication network of an information bank. Here, a subnetwork represents a dataset of a user which is secured by a proxy. Any communication should be done through the proxy, and this constraint can be checked using our model.

Suggested Citation

  • Gábor Kusper & Csaba Biró & Benedek Nagy, 2021. "Resolvable Networks—A Graphical Tool for Representing and Solving SAT," Mathematics, MDPI, vol. 9(20), pages 1-21, October.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:20:p:2597-:d:657377
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/20/2597/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/20/2597/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 2000. "Scale-free characteristics of random networks: the topology of the world-wide web," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 281(1), pages 69-77.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ruiz Vargas, E. & Mitchell, D.G.V. & Greening, S.G. & Wahl, L.M., 2014. "Topology of whole-brain functional MRI networks: Improving the truncated scale-free model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 151-158.
    2. Giacomello, Giampiero & Picci, Lucio, 2003. "My scale or your meter? Evaluating methods of measuring the Internet," Information Economics and Policy, Elsevier, vol. 15(3), pages 363-383, September.
    3. Ormerod, Paul & Roach, Andrew P, 2004. "The Medieval inquisition: scale-free networks and the suppression of heresy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 339(3), pages 645-652.
    4. Castagna, Alina & Chentouf, Leila & Ernst, Ekkehard, 2017. "Economic vulnerabilities in Italy: A network analysis using similarities in sectoral employment," GLO Discussion Paper Series 50, Global Labor Organization (GLO).
    5. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2011. "Resources Flows Asymmetries in Strict Nash Networks with Partner Heterogeneity," Working Papers 1108, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
    6. Zio, Enrico, 2016. "Challenges in the vulnerability and risk analysis of critical infrastructures," Reliability Engineering and System Safety, Elsevier, vol. 152(C), pages 137-150.
    7. Tamás Sebestyén & Dóra Longauer, 2018. "Network structure, equilibrium and dynamics in a monopolistically competitive economy," Netnomics, Springer, vol. 19(3), pages 131-157, December.
    8. Wang, Huan & Xu, Chuan-Yun & Hu, Jing-Bo & Cao, Ke-Fei, 2014. "A complex network analysis of hypertension-related genes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 394(C), pages 166-176.
    9. Elisa Letizia & Fabrizio Lillo, 2017. "Corporate payments networks and credit risk rating," Papers 1711.07677, arXiv.org, revised Sep 2018.
    10. Dunia López-Pintado, 2006. "Contagion and coordination in random networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(3), pages 371-381, October.
    11. Li, Jianyu & Zhou, Jie, 2007. "Chinese character structure analysis based on complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 380(C), pages 629-638.
    12. Laureti, Paolo & Moret, Lionel & Zhang, Yi-Cheng, 2005. "Aggregating partial, local evaluations to achieve global ranking," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 345(3), pages 705-712.
    13. Jean-Marc Luck & Anita Mehta, 2023. "Evolution of grammatical forms: some quantitative approaches," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 96(2), pages 1-15, February.
    14. Seyed Soheil Hosseini & Nick Wormald & Tianhai Tian, 2019. "A Weight-based Information Filtration Algorithm for Stock-Correlation Networks," Papers 1904.06007, arXiv.org.
    15. Wang, Yanhui & Bi, Lifeng & Lin, Shuai & Li, Man & Shi, Hao, 2017. "A complex network-based importance measure for mechatronics systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 180-198.
    16. Chan, N.H. & Cheung, Simon K.C. & Wong, Samuel P.S., 2020. "Inference for the degree distributions of preferential attachment networks with zero-degree nodes," Journal of Econometrics, Elsevier, vol. 216(1), pages 220-234.
    17. Kang, Moon Jung & Park, Jihyoun, 2013. "Analysis of the partnership network in the clean development mechanism," Energy Policy, Elsevier, vol. 52(C), pages 543-553.
    18. Fetta, A.G. & Harper, P.R. & Knight, V.A. & Vieira, I.T. & Williams, J.E., 2012. "On the Peter Principle: An agent based investigation into the consequential effects of social networks and behavioural factors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(9), pages 2898-2910.
    19. Cerqueti, Roy & Ferraro, Giovanna & Iovanella, Antonio, 2019. "Measuring network resilience through connection patterns," Reliability Engineering and System Safety, Elsevier, vol. 188(C), pages 320-329.
    20. Benedetto Lepori & Isidro F. Aguillo & Marco Seeber, 2014. "Size of web domains and interlinking behavior of higher education institutions in Europe," Scientometrics, Springer;Akadémiai Kiadó, vol. 100(2), pages 497-518, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:20:p:2597-:d:657377. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.