◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

E. J. Infeld

7 papers hereh-index 219 citations9 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author4
  • first author2
  • middle author1

Across the 7 of 7 papers where every author was matched, so the position is known.

fields
  • math.CO4
  • cs.CR2
  • math.PR1

identity via Semantic Scholar / OpenAlex

activity
20142026
collaborators
Showing math.COShow all

4 papers · 1 filter

math.CO2026

k-Anonymity by Partitions Maximizes Perfect Matchings

Ewa J. Infeld

The number of perfect matchings in a user-behavior bipartite graph is a natural measure of anonymity: more matchings mean greater uncertainty for an attacker. A fundamental questio…

math.CO2017

Common adversaries form alliances: modelling complex networks via anti-transitivity

Anthony Bonato, Ewa Infeld, Hari Pokhrel +1

Anti-transitivity captures the notion that enemies of enemies are friends, and arises naturally in the study of adversaries in social networks and in the study of conflicting natio…

math.CO2016

The Total Acquisition Number of Random Geometric Graphs

Ewa Infeld, Dieter Mitsche, Pawel Pralat

Let G be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex u to a neighbouring vertex v can be moved, provided that the weight on $v…

math.CO2015

Counting Restricted Dyck Paths Through Random Walks

Ewa J. Infeld

We show connection between Dyck paths with peaks of bounded height and random walks. The correspondence between a certain class of random walks and such Dyck paths allows us to dev…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.