Relevant bibliographies by topics / Visibility graph

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Visibility graph'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Visibility graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Visibility graph"

1

LIN, YAW-LING, and STEVEN S. SKIENA. "COMPLEXITY ASPECTS OF VISIBILITY GRAPHS." International Journal of Computational Geometry & Applications 05, no. 03 (1995): 289–312. http://dx.doi.org/10.1142/s0218195995000179.

Full text
Abstract:
In this paper, we consider two distinct problems related to complexity aspects of the visibility graphs of simple polygons. Recognizing visibility graphs is a long-standing open problem. It is not even known whether visibility graph recognition is in NP. That visibility graph recognition is in NP would be established if we could demonstrate that any n vertex visibility graph is realized by a polygon which can be drawn on an exponentially-sized grid. This motivates a study of the area requirements for realizing visibility graphs. In this paper, we prove: • Θ(n3) area is necessary and sufficient
APA, Harvard, Vancouver, ISO, and other styles
2

Roy, Bodhayan. "Point Visibility Graph Recognition is NP-Hard." International Journal of Computational Geometry & Applications 26, no. 01 (2016): 1–32. http://dx.doi.org/10.1142/s0218195916500011.

Full text
Abstract:
Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point visibility graphs is NP-hard.
APA, Harvard, Vancouver, ISO, and other styles
3

Du, Congju, and Bin Tang. "Novel Unconventional-Active-Jamming Recognition Method for Wideband Radars Based on Visibility Graphs." Sensors 19, no. 10 (2019): 2344. http://dx.doi.org/10.3390/s19102344.

Full text
Abstract:
Radar unconventional active jamming, including unconventional deceptive jamming and barrage jamming, poses a serious threat to wideband radars. This paper proposes an unconventional-active-jamming recognition method for wideband radar. In this method, the visibility algorithm of converting the radar time series into graphs, called visibility graphs, is first given. Then, the visibility graph of the linear-frequency-modulation (LFM) signal is proved to be a regular graph, and the rationality of extracting features on visibility graphs is theoretically explained. Therefore, four features on visi
APA, Harvard, Vancouver, ISO, and other styles
4

COULLARD, COLLETTE, and ANNA LUBIW. "DISTANCE VISIBILITY GRAPHS." International Journal of Computational Geometry & Applications 02, no. 04 (1992): 349–62. http://dx.doi.org/10.1142/s0218195992000202.

Full text
Abstract:
A new necessary condition for a graph G to be the visibility graph of a simple polygon is given: each 3-connected component of G must have a vertex ordering in which every vertex is adjacent to a previous 3-clique. This property is used to give an algorithm for the distance visibility graph problem: given an edge-weighted graph G, is it the visibility graph of a simple polygon with the given weights as Euclidean distances?
APA, Harvard, Vancouver, ISO, and other styles
5

Oh, Shunhao, and Hon Wai Leong. "Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths." Proceedings of the International Symposium on Combinatorial Search 8, no. 1 (2021): 64–72. http://dx.doi.org/10.1609/socs.v8i1.18427.

Full text
Abstract:
In the Any-Angle Pathfinding problem, the goal is to find the shortest path between a pair of vertices on a uniform square grid, that is not constrained to any fixed number of possible directions over the grid. Visibility Graphs are a known optimal algorithm for solving the problem with the use of pre-processing. However, Visibility Graphs are known to perform poorly in terms of running time, especially on large, complex maps. In this paper, we introduce two improvements over the Visibility Graph Algorithm to compute optimal paths. Sparse Visibility Graphs (SVGs) are constructed by pruning unn
APA, Harvard, Vancouver, ISO, and other styles
6

Muñoz, Víctor, and N. Elizabeth Garcés. "Analysis of pulsating variable stars using the visibility graph algorithm." PLOS ONE 16, no. 11 (2021): e0259735. http://dx.doi.org/10.1371/journal.pone.0259735.

Full text
Abstract:
We study the light curves of pulsating variable stars using a complex network approach to build visibility graphs. We consider various types of variables stars (e.g., Cepheids, δ Scuti, RR Lyrae), build two types of graphs (the normal visibility graph (VG) and the horizontal visibility graph (HVG)), and calculate various metrics for the resulting networks. We find that all networks have a power-law degree distribution for the VG and an exponential distribution for the HVG, suggesting that it is a universal feature, regardless of the pulsation features. Metrics such as the average degree, the c
APA, Harvard, Vancouver, ISO, and other styles
7

Ren, Weikai, and Zhijun Jin. "Phase space visibility graph." Chaos, Solitons & Fractals 176 (November 2023): 114170. http://dx.doi.org/10.1016/j.chaos.2023.114170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

NUÑEZ, ANGEL, LUCAS LACASA, EUSEBIO VALERO, JOSE PATRICIO GÓMEZ, and BARTOLO LUQUE. "DETECTING SERIES PERIODICITY WITH HORIZONTAL VISIBILITY GRAPHS." International Journal of Bifurcation and Chaos 22, no. 07 (2012): 1250160. http://dx.doi.org/10.1142/s021812741250160x.

Full text
Abstract:
The horizontal visibility algorithm was recently introduced as a mapping between time series and networks. The challenge lies in characterizing the structure of time series (and the processes that generated those series) using the powerful tools of graph theory. Recent works have shown that the visibility graphs inherit several degrees of correlations from their associated series, and therefore such graph theoretical characterization is in principle possible. However, both the mathematical grounding of this promising theory and its applications are in its infancy. Following this line, here we
APA, Harvard, Vancouver, ISO, and other styles
9

Lu, Yi, Zhonghua Gou, Yu Ye, and Qiang Sheng. "Three-dimensional visibility graph analysis and its application." Environment and Planning B: Urban Analytics and City Science 46, no. 5 (2017): 948–62. http://dx.doi.org/10.1177/2399808317739893.

Full text
Abstract:
Graph-based visibility analysis, developed from space syntax and social network theory, embraces mutual visibility between locations in a spatial system. It helps designers and researchers to decode spatial cognition and behavior, but methodological constraints limit its application to two-dimensional floor plans. In this study, we propose a new visibility graph analysis that can be used in three-dimensional built environments, such as multilevel atrium buildings or urban environments with canopies or overpass bridges. Furthermore, we draw a distinction between a generic visibility graph and a
APA, Harvard, Vancouver, ISO, and other styles
10

Bhagavathi, D., H. Gurla, S. Olariu, J. L. Schwing, and J. Zhang. "Time- and Cost-Optimal Parallel Algorithms for the Dominance and Visibility Graphs." VLSI Design 4, no. 1 (1996): 33–40. http://dx.doi.org/10.1155/1996/40175.

Full text
Abstract:
The compaction step of integrated circuit design motivates associating several kinds of graphs with a collection of non-overlapping rectangles in the plane. These graphs are intended to capture various visibility relations amongst the rectangles in the collection. The contribution of this paper is to propose time- and cost-optimal algorithms to construct two such graphs, namely, the dominance graph (DG, for short) and the visibility graph (VG, for short). Specifically, we show that with a collection of n non-overlapping rectangles as input, both these structures can be constructed in θ(log n)
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Visibility graph"

1

Dey, Sanjoy. "Structural properties of visibility and weak visibility graphs." Virtual Press, 1997. http://liblink.bsu.edu/uhtbin/catkey/1048394.

Full text
Abstract:
Given a finite set S of n nonintersecting line segments with no three end points collinear, the segment end point visibility graph is defined as the graph whose vertices are the end points of the line segments in S and two vertices are adjacent if the straight line segment joining two end points does not intersect any element of S, or if they are end points of the same segment. Segment end point visibility graphs have a wide variety of applications in VLSI circuit design, study of art gallery problems, and other areas of computational geometry. This thesis contains a survey of the important re
APA, Harvard, Vancouver, ISO, and other styles
2

Jackson, LillAnne Elaine, and University of Lethbridge Faculty of Arts and Science. "Polygon reconstruction from visibility information." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 1996, 1996. http://hdl.handle.net/10133/41.

Full text
Abstract:
Reconstruction results attempt to rebuild polygons from visibility information. Reconstruction of a general polygon from its visibility graph is still open and only known to be in PSPACE; thus additional information, such as the ordering of the edges around nodes that corresponds to the order of the visibilities around vertices is frequently added. The first section of this thesis extracts, in o(E) time, the Hamiltonian cycle that corresponds to the boundary of the polygon from the polygon's ordered visibility graph. Also, it converts an unordered visibility graph and Hamiltonian cycle to the
APA, Harvard, Vancouver, ISO, and other styles
3

Sumi, Gregory. "On the visibility graph of disjoint and congruent discs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ37984.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alanazi, Zeyad M. "A study and implementation of some visibility graph algorithms." Virtual Press, 1994. http://liblink.bsu.edu/uhtbin/catkey/917045.

Full text
Abstract:
In recent years extensive research has been done on visibility graphs. In this thesis, we study some of the visibility graph algorithms, and implement these algorithms in the graph editor - GraphPerfect - which is a part of a project headed by Dr. Jay S. Bagga of the Department of computer science at Ball State University. One of the goals of this project is to design and build a software tool to learn and work with graphs and graph algorithms.In this thesis, some properties of visibility graphs are studied in detail and implementation of some graph algorithms is given.<br>Department of Comput
APA, Harvard, Vancouver, ISO, and other styles
5

Farrag, Lamis M. "Applications of graph partitioning algorithms to terrain visibility and shortest path problems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ32386.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Diamantopoulos, Anastasios. "A reduced visibility graph approach for motion planning of autonomously guided vehicles." Thesis, University of South Wales, 2001. https://pure.southwales.ac.uk/en/studentthesis/a-reduced-visibility-graph-approach-for-motion-planning-of-autonomously-guided-vehicles(3f368020-0a83-42e5-ba83-b4a4a6257bc2).html.

Full text
Abstract:
This thesis is concerned with the robots' motion planning problem. In particular it is focused on the path planning and motion planning for Autonomously Guided Vehicles (AGVs) in well-structured, two-dimensional static and dynamic environments. Two algorithms are proposed for solving the aforementioned problems. The first algorithm establishes the shortest collision-semi-free path for an AGV from its start point to its goal point, in a two-dimensional static environment populated by simple polygonal obstacles. This algorithm constructs and searches a reduced visibility graph, within the AGV's
APA, Harvard, Vancouver, ISO, and other styles
7

Heinsohn, Niklas [Verfasser], and Michael [Akademischer Betreuer] Kaufmann. "Ply and Bar Visibility - Some Advanced Concepts in Graph Drawing / Niklas Heinsohn ; Betreuer: Michael Kaufmann." Tübingen : Universitätsbibliothek Tübingen, 2020. http://d-nb.info/1210484250/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wooden, David T. "Graph-based Path Planning for Mobile Robots." Diss., Available online, Georgia Institute of Technology, 2006, 2006. http://etd.gatech.edu/theses/available/etd-11092006-180958/.

Full text
Abstract:
Thesis (Ph. D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2007.<br>Magnus Egerstedt, Committee Chair ; Patricio Vela, Committee Member ; Ayanna Howard, Committee Member ; Tucker Balch, Committee Member ; Wayne Book, Committee Member.
APA, Harvard, Vancouver, ISO, and other styles
9

Lombardi, Alessandro. "Multiple time series forecasting with Graph Neural Networks." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/24729/.

Full text
Abstract:
Time series forecasting aims to predict future values to support organizations making strategic decisions. This problem has been studied for decades due to its relevance in almost all industries and areas, ranging from financial data to product demand. Recently, modern solutions based on deep learning have gained popularity among academia and industry, mainly due to the necessity to automatize the forecasting of multiple time series and exploit external explanatory variables. Considering the recent successes of Graph Neural Networks (GNNs) in modelling graph data, this study extends previous w
APA, Harvard, Vancouver, ISO, and other styles
10

Chelly, Magda Lilia. "Propagation d'une position dans les réseaux connectés." Phd thesis, Institut National des Télécommunications, 2011. http://tel.archives-ouvertes.fr/tel-00843587.

Full text
Abstract:
Les systèmes de positionnement ont connu un progrès indéniable. Actuellement, la précision atteint quelques centimètres sous certaines conditions : espace ouvert, ciel dégagé, technique très spécifique, etc. Néanmoins, le problème du positionnement dans un environnement intérieur demeure persistant : les trajets multiples qui compliquent les modèles de propagation, l'atténuation, etc. Différents systèmes ont vu le jour, utilisant des technologies telles que l'UWB, le WiFi ou l'Infrarouge. Ces systèmes apportent des résultats de positionnement intéressants, atteignant l'ordre du mètre. Cette pr
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Visibility graph"

1

Everett, Hazel Jane Margaret *. Visibility graph recognition. 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jones, Charles Harold. Triangle intersection graphs and visibility graphs. 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ocloo, Valentina. Rectangle-Visibility Representation of Products of Graphs. GRIN Verlag GmbH, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bianconi, Ginestra. Synchronization, Non-linear Dynamics and Control. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198753919.003.0015.

Full text
Abstract:
This chapter is entirely devoted to characterizing non-linear dynamics on multilayer networks. Special attention is given to recent results on the stability of synchronization that extend the Master Stability Function approach to the multilayer networks scenario. Discontinous synchronization transitions on multiplex networks recently reported in the literature are also discussed, and their application discussed in the context of brain networks. This chapter also presents an overview of the major results regarding pattern formation in multilayer networks, and the proposed characterization of mu
APA, Harvard, Vancouver, ISO, and other styles
5

Joseph, O'Rourke. Art gallery theorems and algorithms. Oxford University Press, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fernández, Pedro Trapero. The Application of GIS Technologies in the Roman Period. Bloomsbury Publishing Plc, 2025. http://dx.doi.org/10.5040/9781350433731.

Full text
Abstract:
Using a selection of archaeological cases studies from the Roman period in the Mediterranean region, Pedro Trapero Fernández shows how GIS technologies can be employed in the creation of spatial models to reproduce historical realities.An increasing number of researchers use this digital humanities tool as a means to model both territory and landscape. This book compiles different spatial models under a unified methodology described in separated chapters, such as mobility and visibility models, and discusses their limitations and potential for implementation in archaeological contexts. The res
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Visibility graph"

1

Bose, Prosenjit, Alice Dean, Joan Hutchinson, and Thomas Shermer. "On rectangle visibility graphs." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Babilon, Robert, Helena Nyklová, Ondřej Pangrác, and Jan Vondrák. "Visibility Representations of Complete Graphs." In Graph Drawing. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46648-7_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Fößmeier, Ulrich, Goos Kant, and Michael Kaufmann. "2-Visibility drawings of planar graphs." In Graph Drawing. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62495-3_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Felsner, Stefan, and Mareike Massow. "Thickness of Bar 1-Visibility Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-70904-6_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hutchinson, Joan P. "On Polar Visibility Representations of Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45848-4_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Štola, Jan. "3D Visibility Representations of Complete Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24595-7_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Štola, Jan. "3D Visibility Representations by Regular Polygons." In Graph Drawing. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11805-0_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cobos, F. J., J. C. Dana, F. Hurtado, A. Márquez, and F. Mateos. "On a visibility representation of graphs." In Graph Drawing. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0021799.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hutchinson, Joan P. "On Polar Visibility Representations of Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44541-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dean, Alice M., and Joan P. Hutchinson. "Rectangle-visibility representations of bipartite graphs." In Graph Drawing. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-58950-3_367.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Visibility graph"

1

Alikaşifoğlu, Tuna, Arda Aras, and Aykut Koc. "VISPool: Enhancing Transformer Encoders with Vector Visibility Graph Neural Networks." In Findings of the Association for Computational Linguistics ACL 2024. Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.findings-acl.149.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wen, Tao, and Yu-Wang Chen. "Forecasting Time Series through Motif Structure Analysis within Visibility Graph." In 2024 29th International Conference on Automation and Computing (ICAC). IEEE, 2024. http://dx.doi.org/10.1109/icac61394.2024.10718817.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sun, Guohan, Ying Li, Peng Ba, Xiaoying Ma, and Huiling Zhang. "Fault diagnosis method for reciprocating compressors based on visibility graph." In International Conference on Mechatronic Engineering and Artificial Intelligence (MEAI 2024), edited by Liang Hu. SPIE, 2025. https://doi.org/10.1117/12.3064980.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kim, Ji-Hyeon, Soon-Young Kwon, and Hyoung-Nam Kim. "Performance Analysis of Radar Scan Pattern Classification using Visibility Graph." In 2025 International Conference on Information Networking (ICOIN). IEEE, 2025. https://doi.org/10.1109/icoin63865.2025.10993171.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

YuLan, Liu, and Xiao Qin. "Wind speed prediction based on weighted visibility graph and attention mechanism." In 2024 9th International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS). IEEE, 2024. https://doi.org/10.1109/iciibms62405.2024.10792742.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mohammadpoory, Zeynab, and Reza Kharghanian. "Epileptic Seizures Detection Using Visibility Graph Method and U-Net Architecture." In 2024 10th International Conference on Signal Processing and Intelligent Systems (ICSPIS). IEEE, 2024. https://doi.org/10.1109/icspis65223.2024.10931086.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Vargas, Juan M., Mohamed M. Boularas, Mohamed A. Bahloul, Slah Aridhi, and Meriem Laleg-Kirati. "Pulse Wave Velocity Estimation Using Photoplethysmogram-Based Limited Penetrable Weighted Visibility Graph Features." In 2024 46th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC). IEEE, 2024. https://doi.org/10.1109/embc53108.2024.10782510.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wan, Chaofan, Zhuoran Li, Ziwei Yan, Pengkun Hao, Liang Han, and Xiaoduo Li. "A Layered Essential Visibility Graph Approach for Energy-Efficient UAV 3D Path Planning." In 2024 China Automation Congress (CAC). IEEE, 2024. https://doi.org/10.1109/cac63892.2024.10865227.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Luo, Guilan, Zijie Chen, Yongwang Zeng, Long Wang, Shuzhen Wen, and Mei Zhang. "Multi-Task Scheduling Optimization Method Integrating Visibility Graph, Simulated Annealing, and A* Algorithm." In 2025 2nd International Conference on Algorithms, Software Engineering and Network Security (ASENS). IEEE, 2025. https://doi.org/10.1109/asens64990.2025.11011007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Barb-Ciorbea, Mihaela-Alexandra, Marius Kloetzer, and Cristian Mahulea. "Planning strategy based on visibility graph and traveling salesman problem with time window constraints." In 2024 28th International Conference on System Theory, Control and Computing (ICSTCC). IEEE, 2024. http://dx.doi.org/10.1109/icstcc62912.2024.10744736.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Visibility graph"

1

Соловйов, В. М., та В. В. Соловйова. Моделювання мультиплексних мереж. Видавець Ткачук О.В., 2016. http://dx.doi.org/10.31812/0564/1253.

Full text
Abstract:
From the standpoint of interdisciplinary self-organization theories and synergetics analyzes current approaches to modeling socio-economic systems. It is shown that the complex network paradigm is the foundation on which to build predictive models of complex systems. We consider two algorithms to transform time series or a set of time series to the network: recurrent and graph visibility. For the received network designed dynamic spectral, topological and multiplex measures of complexity. For example, the daily values the stock indices show that most of the complexity measures behaving in a ch
APA, Harvard, Vancouver, ISO, and other styles
2

Soloviev, Vladimir, Victoria Solovieva, Anna Tuliakova, Alexey Hostryk, and Lukáš Pichl. Complex networks theory and precursors of financial crashes. [б. в.], 2020. http://dx.doi.org/10.31812/123456789/4119.

Full text
Abstract:
Based on the network paradigm of complexity in the work, a systematic analysis of the dynamics of the largest stock markets in the world and cryptocurrency market has been carried out. According to the algorithms of the visibility graph and recurrence plot, the daily values of stock and crypto indices are converted into a networks and multiplex networks, the spectral and topological properties of which are sensitive to the critical and crisis phenomena of the studied complex systems. This work is the first to investigate the network properties of the crypto index CCI30 and the multiplex networ
APA, Harvard, Vancouver, ISO, and other styles
3

Loecker, Florian, Amanah Ramadiah, Kimmo Soramäki, and Will Towning. Building Robust Anti-Fraud & Scam Capabilities at the National Level. FNA, 2023. http://dx.doi.org/10.69701/ektb6000.

Full text
Abstract:
The introduction of instant payment systems around the world has accelerated in recent years. There are now over 80 instant payment systems globally, with more than 35 being launched in the last five years and eight currently being built. These systems bring unprecedented speed and efficiency to payments markets, with greater convenience for consumers. However, faster payments also means faster fraud. For example, in Hong Kong, the volume of fraud cases more than doubled in the four years following the introduction of the Faster Payment Service in 2018. Authorized Push Payments (APP) fraud los
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Visibility graph' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography