Search

Your search keyword '"SIMON, LEVENTE"' showing total 14 results
Start Over Author "SIMON, LEVENTE" Publication Year Range Last 10 years
14 results on '"SIMON, LEVENTE"'

4. Development and Scale-Up of a Novel Photochemical C–N Oxidative Coupling

Author

Robinson, Alan, primary, Dieckmann, Michael, additional, Krieger, Jean-Philippe, additional, Vent-Schmidt, Thomas, additional, Marantelli, Dominique, additional, Kohlbrenner, Ralf, additional, Gribkov, Denis, additional, Simon, Levente L., additional, Austrup, David, additional, Rod, Alexandre, additional, and Bochet, Christian G., additional

Published
2021
Full Text
View/download PDF

9. Fixed Point Theorem on High Dimensional Apollonian Networks

Author

Soos Anna and Simon Levente

Subjects
0301 basic medicine, Discrete mathematics, Sequence, Fixed-point theorem, Fixed point, Base (topology), Planar graph, Combinatorics, 03 medical and health sciences, Metric space, symbols.namesake, 030104 developmental biology, Apollonian network, symbols, Mathematics::Metric Geometry, Limit (mathematics), Mathematics
Abstract

This paper highlights a fixed point theorem on the subset constructed by growing d-dimensional Apollonian graph sequence, for any d from N\{0, 1}. We base our paper on a weighted graph edit distance constructing a metric space on the set of high dimensional Apollonian networks. The main result of this paper shows that we can select a subset of a growing graph sequence on the set of d-dimensional Apollonian graphs such that it's limit is an unique fixed point. The sequence is constructed using an IFS, which gives a growing Apollonian graph sequence. As examples, we highlight the fixed point limit of the two and three dimensional cases filling the inner of the regular triangle and the regular tetrahedron, respectively.

Published
2017

13. Assessment of Recent Process Analytical Technology (PAT) Trends: A Multiauthor Review

Author

Simon, Levente L., primary, Pataki, Hajnalka, additional, Marosi, György, additional, Meemken, Fabian, additional, Hungerbühler, Konrad, additional, Baiker, Alfons, additional, Tummala, Srinivas, additional, Glennon, Brian, additional, Kuentz, Martin, additional, Steele, Gerry, additional, Kramer, Herman J. M., additional, Rydzak, James W., additional, Chen, Zengping, additional, Morris, Julian, additional, Kjell, Francois, additional, Singh, Ravendra, additional, Gani, Rafiqul, additional, Gernaey, Krist V., additional, Louhi-Kultanen, Marjatta, additional, O’Reilly, John, additional, Sandler, Niklas, additional, Antikainen, Osmo, additional, Yliruusi, Jouko, additional, Frohberg, Patrick, additional, Ulrich, Joachim, additional, Braatz, Richard D., additional, Leyssens, Tom, additional, von Stosch, Moritz, additional, Oliveira, Rui, additional, Tan, Reginald B. H., additional, Wu, Huiquan, additional, Khan, Mansoor, additional, O’Grady, Des, additional, Pandey, Anjan, additional, Westra, Remko, additional, Delle-Case, Emmanuel, additional, Pape, Detlef, additional, Angelosante, Daniele, additional, Maret, Yannick, additional, Steiger, Olivier, additional, Lenner, Miklós, additional, Abbou-Oucherif, Kaoutar, additional, Nagy, Zoltan K., additional, Litster, James D., additional, Kamaraju, Vamsi Krishna, additional, and Chiu, Min-Sen, additional

Published
2015
Full Text
View/download PDF

14. LIMIT SETS OF GRAPH-DRIVEN ITERATED (MULTI)FUNCTION SYSTEMS.

Author

Simon, Levente and Soós, Anna

Subjects
FRACTAL dimensions, INTEGERS, CONTRACTIONS (Topology), FIXED point theory, HOMOMORPHISMS
Abstract

Our paper focuses on a new approach to the construction of graph sequences driven using iterated function systems (briey IFSs) and iterated multifunction systems (briey IMSs). We build self-similar graphs sequences generated initally based on an arbitrary graph. We analyze the graphs sequences gotten within the iterations of IFSs and IMSs. We specially analyze the density properties between those graphs which are in the same sequence and we also focus on graph sequences driven by Erdős{ Rényi graphs. The main aim of our paper is to analyze the limit sets of the graph-driven IFSs and IMSs. We characterize them using the Sierpinski carpet and the [0; 1]2 set which we interpret as limits of the constructed graph sequences. [ABSTRACT FROM AUTHOR]

Published
2016

Catalog

Books, media, physical & digital resources
See catalog results