857 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Hungarian Academy of SciencesHU402 papers
- Eötvös Loránd UniversityHU156 papers
- Budapest University of Technology and EconomicsHU58 papers
- Central European UniversityAT42 papers
- École Polytechnique Fédérale de LausanneCH31 papers
- Central European University - Budapest Campus24 papers
- University of PannoniaHU23 papers
- Centre National de la Recherche ScientifiqueFR21 papers
- University College LondonGB20 papers
- University of SzegedHU20 papers
- University of Illinois Urbana-ChampaignUS18 papers
- Charles UniversityCZ15 papers
54 papers · 1 filter
Complexity in the interdefinability of timelike, lightlike and spacelike relatedness of Minkowski spacetime
Hajnal Andréka, Judit X. Madarász, István Németi +1
Interdefinability of timelike, lightlike and spacelike relatedness of Minkowski spacetime is investigated in detail in the paper, with the aim of finding the simplest definitions.…
A rigidity property of complete systems of mutually unbiased bases
Máté Matolcsi, Mihály Weiner
Suppose that for some unit vectors in we have that for any is either orthogonal to or (i.e.…
A Variant of the VC-dimension with Applications to Depth-3 Circuits
Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard
We introduce the following variant of the VC-dimension. Given and a positive integer , we define to be the size of the largest subset…
Degree-preserving graph dynamics -- a versatile process to construct random networks
Péter L. Erdős, Shubha R. Kharel, Tamás R. Mezei +1
Real-world networks evolve over time via additions or removals of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently int…
Max-norm Ramsey Theory
Nóra Frankl, Andrey Kupavskii, Arsenii Sagdeev
Given a metric space that contains at least two points, the chromatic number is defined as the minimum number of c…
Generic Hölder level sets and fractal conductivity
Zoltán Buczolich, Balázs Maga, Gáspár Vértesy
Hausdorff dimensions of level sets of generic continuous functions defined on fractals can give information about the "thickness/narrow cross-sections'' of a "network" correspondin…
Intermediate dimensions of Bedford-McMullen carpets with applications to Lipschitz equivalence
Amlan Banaji, István Kolossváry
Intermediate dimensions were recently introduced to provide a spectrum of dimensions interpolating between Hausdorff and box-counting dimensions for fractals where these differ. In…
Algorithms for Interference Minimization in Future Wireless Network Decomposition
Péter L. Erdős, Tamás Róbert Mezei, Yiding Yu +3
We propose a simple and fast method for providing a high quality solution for the sum-interference minimization problem. As future networks are deployed in high density urban areas…
Similarity and Matching of Neural Network Representations
Adrián Csiszárik, Péter Kőrösi-Szabó, Ákos K. Matszangosz +2
We employ a toolset -- dubbed Dr. Frankenstein -- to analyse the similarity of representations in deep neural networks. With this toolset, we aim to match the activations on given…
A Riemann-von Mangoldt-type formula for the distribution of Beurling primes
Szilárd Gy. Révész
In this paper we work out a Riemann-von Mangoldt type formula for the summatory function , where is an arithmetical semigroup (a Beurlin…
Socioeconomic biases in urban mixing patterns of US metropolitan areas
Rafiazka Millanida Hilman, Gerardo Iñiguez, Márton Karsai
Urban areas serve as melting pots of people with diverse socioeconomic backgrounds, who may not only be segregated but have characteristic mobility patterns in the city. While mobi…
Concordance of decompositions given by defining sequences
Boldizsar Kalmar
We study the concordance and bordism of decompositions associated with defining sequences and we relate them to some invariants of toroidal decompositions and to the cobordism of h…
Saturated -planar drawings with few edges
János Barát, Géza Tóth
A drawing of a graph is -plane if every edge contains at most crossings. A -plane drawing is saturated if we cannot add any edge so that the drawing remains -plane. It…
Directed Percolation in Random Temporal Network Models with Heterogeneities
Arash Badie-Modiri, Abbas K. Rizi, Márton Karsai +1
The event graph representation of temporal networks suggests that the connectivity of temporal structures can be mapped to a directed percolation problem. However, similar to perco…
Nonstandard -distances based on certain geometric constructions
Gergely Kiss, Jean-Luc Marichal
The concept of -distance was recently introduced to generalize the classical definition of distance to functions of arguments. In this paper we investigate this concept thro…
On positive hypergraphs
Alexander Sidorenko
Camarena, Csóka, Hubai, Lippner, and Lovász introduced the notion of positive graphs. This notion naturally extends to -uniform hypergraphs. In the case when is odd, we prov…
Generic Hölder level sets on Fractals
Zoltán Buczolich, Balázs Maga, Gáspár Vértesy
Hausdorff dimensions of level sets of generic continuous functions defined on fractals were considered in two papers by R. Balka, Z. Buczolich and M. Elekes. In those papers the to…
Large Monochromatic Components of Small Diameter
Erik Carlson, Ryan R. Martin, Bo Peng +1
Gyárfás conjectured in 2011 that every -edge-colored contains a monochromatic component of bounded ("perhaps three") diameter on at least vertices. Letzter prove…
Ramsey simplicity of random graphs
Simona Boyadzhiyska, Dennis Clemens, Shagnik Das +1
A graph is -Ramsey for another graph if in any -edge-colouring of there is a monochromatic copy of , and the classic Ramsey problem asks for the minimum number…
The Lovász-Cherkassky theorem for locally finite graphs with ends
Raphael W. Jacobs, Attila Joó, Paul Knappe +2
Lovász and Cherkassky discovered independently that, if is a finite graph and such that the degree is even for every vertex , t…
Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case
Srinivasan Arunachalam, Joao F. Doriguello
We prove a hypercontractive inequality for matrix-valued functions defined over large alphabets. In order to do so, we prove a generalization of the powerful -uniform convexity…
Extremal problems of double stars
Ervin Győri, Runze Wang, Spencer Woolfson
In a generalized Turán problem, two graphs and are given and the question is the maximum number of copies of in an -free graph of order . In this paper, we study…
Monopoles, twisted integral homology, and Hirsch algebras
Francesco Lin, Mike Miller Eismeier
We provide an explicit computation over the integers of the bar version of the monopole Floer homology of a three-manifold in terms of a new invariant associated…
Singularities of mappings on ICIS and applications to Whitney equisingularity
R. Giménez Conejero, J. J. Nuño-Ballesteros
We study germs of analytic maps , when is an ICIS of dimension . We define an image Milnor number, generalizing Mond's definition, $μ_I…